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/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:38:25,545 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:38:25,547 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:38:25,562 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:38:25,562 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:38:25,563 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:38:25,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:38:25,566 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:38:25,567 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:38:25,568 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:38:25,568 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:38:25,569 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:38:25,570 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:38:25,571 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:38:25,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:38:25,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:38:25,577 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:38:25,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:38:25,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:38:25,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:38:25,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:38:25,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:38:25,583 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:38:25,584 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:38:25,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:38:25,586 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:38:25,586 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:38:25,587 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:38:25,587 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:38:25,587 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:38:25,588 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:38:25,588 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 00:38:25,598 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:38:25,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:38:25,599 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:38:25,600 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:38:25,600 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:38:25,600 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:38:25,600 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:38:25,600 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:38:25,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:38:25,601 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:38:25,601 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:38:25,602 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:38:25,602 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:38:25,602 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:38:25,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:38:25,602 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:38:25,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:38:25,603 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:38:25,603 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:38:25,603 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:38:25,603 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:38:25,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:38:25,604 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:38:25,604 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:38:25,604 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:38:25,604 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:38:25,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:38:25,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:38:25,605 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:38:25,605 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:38:25,606 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:38:25,606 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:38:25,606 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:38:25,606 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:38:25,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:38:25,606 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:38:25,607 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:38:25,608 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:38:25,608 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:38:25,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:38:25,656 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:38:25,660 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:38:25,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:38:25,662 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:38:25,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-01-21 00:38:25,841 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:38:25,846 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:38:25,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:38:25,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:38:25,852 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:38:25,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:38:25" (1/1) ... [2018-01-21 00:38:25,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157b506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:25, skipping insertion in model container [2018-01-21 00:38:25,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:38:25" (1/1) ... [2018-01-21 00:38:25,876 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:38:25,915 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:38:26,026 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:38:26,042 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:38:26,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:26 WrapperNode [2018-01-21 00:38:26,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:38:26,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:38:26,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:38:26,052 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:38:26,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:26" (1/1) ... [2018-01-21 00:38:26,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:26" (1/1) ... [2018-01-21 00:38:26,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:26" (1/1) ... [2018-01-21 00:38:26,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:26" (1/1) ... [2018-01-21 00:38:26,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:26" (1/1) ... [2018-01-21 00:38:26,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:26" (1/1) ... [2018-01-21 00:38:26,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:26" (1/1) ... [2018-01-21 00:38:26,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:38:26,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:38:26,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:38:26,087 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:38:26,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:26" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:38:26,136 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:38:26,137 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:38:26,137 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:38:26,137 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:38:26,137 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:38:26,137 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:38:26,137 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:38:26,137 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:38:26,138 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:38:26,138 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:38:26,138 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:38:26,138 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:38:26,138 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:38:26,138 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:38:26,318 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:38:26,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:38:26 BoogieIcfgContainer [2018-01-21 00:38:26,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:38:26,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:38:26,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:38:26,320 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:38:26,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:38:25" (1/3) ... [2018-01-21 00:38:26,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7889acd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:38:26, skipping insertion in model container [2018-01-21 00:38:26,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:26" (2/3) ... [2018-01-21 00:38:26,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7889acd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:38:26, skipping insertion in model container [2018-01-21 00:38:26,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:38:26" (3/3) ... [2018-01-21 00:38:26,323 INFO L105 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-01-21 00:38:26,331 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:38:26,336 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 00:38:26,382 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:38:26,382 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:38:26,382 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:38:26,382 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:38:26,383 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:38:26,383 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:38:26,383 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:38:26,383 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:38:26,384 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:38:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-21 00:38:26,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:38:26,409 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:26,410 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:38:26,410 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:38:26,414 INFO L82 PathProgramCache]: Analyzing trace with hash 98024, now seen corresponding path program 1 times [2018-01-21 00:38:26,416 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:26,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:26,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:26,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:26,456 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:26,507 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:38:26,515 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:26,521 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:38:26,522 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:38:26,522 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:38:26,522 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:38:26,522 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:38:26,522 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:38:26,522 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:38:26,522 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:38:26,522 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:38:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-21 00:38:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 00:38:26,525 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:26,525 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:26,525 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:38:26,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1566967016, now seen corresponding path program 1 times [2018-01-21 00:38:26,525 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:26,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:26,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:26,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:26,527 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:26,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:26,595 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 00:38:26,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:26,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:38:26,596 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:26,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:38:26,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:38:26,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:38:26,615 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-01-21 00:38:26,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:26,718 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-21 00:38:26,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:38:26,719 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-21 00:38:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:26,730 INFO L225 Difference]: With dead ends: 60 [2018-01-21 00:38:26,730 INFO L226 Difference]: Without dead ends: 40 [2018-01-21 00:38:26,732 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 00:38:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-21 00:38:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-21 00:38:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-21 00:38:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-21 00:38:26,759 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 18 [2018-01-21 00:38:26,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:26,759 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-21 00:38:26,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:38:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-21 00:38:26,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 00:38:26,761 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:26,761 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 00:38:26,761 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:38:26,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2022925235, now seen corresponding path program 1 times [2018-01-21 00:38:26,761 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:26,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:26,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:26,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:26,763 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:26,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:26,849 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 00:38:26,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:26,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:38:26,849 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:26,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:38:26,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:38:26,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:38:26,851 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-01-21 00:38:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:27,027 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-01-21 00:38:27,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 00:38:27,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-21 00:38:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:27,032 INFO L225 Difference]: With dead ends: 73 [2018-01-21 00:38:27,032 INFO L226 Difference]: Without dead ends: 68 [2018-01-21 00:38:27,033 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:38:27,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-21 00:38:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 45. [2018-01-21 00:38:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-21 00:38:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-21 00:38:27,041 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 21 [2018-01-21 00:38:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:27,042 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-21 00:38:27,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:38:27,042 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-21 00:38:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 00:38:27,043 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:27,043 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:27,043 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:38:27,044 INFO L82 PathProgramCache]: Analyzing trace with hash 745482112, now seen corresponding path program 1 times [2018-01-21 00:38:27,044 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:27,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:27,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:27,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:27,045 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:27,095 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:38:27,101 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:27,106 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:27,106 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:27,118 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:38:27,118 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:38:27,118 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:38:27,118 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:38:27,119 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:38:27,119 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:38:27,119 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:38:27,119 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:38:27,119 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:38:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-21 00:38:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-21 00:38:27,122 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:27,122 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:27,122 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:27,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1567082781, now seen corresponding path program 1 times [2018-01-21 00:38:27,122 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:27,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:27,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:27,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:27,123 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:27,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:27,150 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 00:38:27,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:27,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:38:27,150 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:27,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:38:27,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:38:27,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:38:27,151 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-01-21 00:38:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:27,155 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-21 00:38:27,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:38:27,156 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-21 00:38:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:27,157 INFO L225 Difference]: With dead ends: 60 [2018-01-21 00:38:27,157 INFO L226 Difference]: Without dead ends: 38 [2018-01-21 00:38:27,157 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 00:38:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-21 00:38:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-21 00:38:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-21 00:38:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-21 00:38:27,162 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 16 [2018-01-21 00:38:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:27,163 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-21 00:38:27,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:38:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-21 00:38:27,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 00:38:27,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:27,164 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 00:38:27,164 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:27,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1749589112, now seen corresponding path program 1 times [2018-01-21 00:38:27,164 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:27,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:27,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:27,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:27,165 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:27,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:27,219 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 00:38:27,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:27,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:38:27,220 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:27,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:38:27,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:38:27,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:38:27,221 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2018-01-21 00:38:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:27,312 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-01-21 00:38:27,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 00:38:27,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-21 00:38:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:27,314 INFO L225 Difference]: With dead ends: 69 [2018-01-21 00:38:27,314 INFO L226 Difference]: Without dead ends: 66 [2018-01-21 00:38:27,314 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:38:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-21 00:38:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-01-21 00:38:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 00:38:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-21 00:38:27,320 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-01-21 00:38:27,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:27,320 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-21 00:38:27,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:38:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-21 00:38:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 00:38:27,321 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:27,322 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:27,322 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1944907653, now seen corresponding path program 1 times [2018-01-21 00:38:27,322 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:27,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:27,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:27,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:27,323 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:27,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:27,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:27,505 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:38:27,506 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-21 00:38:27,509 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [10], [11], [12], [13], [17], [19], [22], [45], [49], [51], [52], [53], [54], [62], [64], [68], [70], [71], [72], [73] [2018-01-21 00:38:27,566 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:38:27,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:38:27,923 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:38:27,924 INFO L268 AbstractInterpreter]: Visited 25 different actions 44 times. Merged at 10 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-21 00:38:27,947 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:38:27,948 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:27,948 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 00:38:27,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:27,959 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:38:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:27,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:38:28,130 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~y~4.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~y~4.base 0)) (= 0 (select |c_old(#valid)| main_~y~4.base)) (not (= main_~y~4.base 0)))) is different from true [2018-01-21 00:38:28,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-21 00:38:28,142 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:38:28,286 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_3| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_3|))) (= 0 |v_main_#t~malloc0.base_3|) (= (store |c_#valid| |v_main_#t~malloc0.base_3| 0) |c_old(#valid)|))) is different from false [2018-01-21 00:38:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:28,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:28,346 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 00:38:28,353 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:28,353 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:38:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:28,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:38:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:28,654 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:38:28,690 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_4| Int)) (or (= (store |c_#valid| |v_main_#t~malloc0.base_4| 0) |c_old(#valid)|) (= 0 |v_main_#t~malloc0.base_4|) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_4|))))) is different from false [2018-01-21 00:38:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:28,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:38:28,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7, 8, 6] total 23 [2018-01-21 00:38:28,712 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:38:28,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 00:38:28,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 00:38:28,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=348, Unknown=7, NotChecked=120, Total=552 [2018-01-21 00:38:28,713 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-01-21 00:38:29,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:29,016 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-01-21 00:38:29,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 00:38:29,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-21 00:38:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:29,059 INFO L225 Difference]: With dead ends: 63 [2018-01-21 00:38:29,059 INFO L226 Difference]: Without dead ends: 60 [2018-01-21 00:38:29,060 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=532, Unknown=7, NotChecked=150, Total=812 [2018-01-21 00:38:29,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-21 00:38:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2018-01-21 00:38:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-21 00:38:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-21 00:38:29,065 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 26 [2018-01-21 00:38:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:29,065 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-21 00:38:29,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-21 00:38:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-21 00:38:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 00:38:29,066 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:29,066 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:29,066 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:29,066 INFO L82 PathProgramCache]: Analyzing trace with hash 66158503, now seen corresponding path program 1 times [2018-01-21 00:38:29,066 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:29,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:29,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:29,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:29,067 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:29,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:29,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:29,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 00:38:29,289 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:29,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 00:38:29,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 00:38:29,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-21 00:38:29,290 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 7 states. [2018-01-21 00:38:29,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:29,467 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-21 00:38:29,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:38:29,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-21 00:38:29,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:29,468 INFO L225 Difference]: With dead ends: 71 [2018-01-21 00:38:29,468 INFO L226 Difference]: Without dead ends: 58 [2018-01-21 00:38:29,469 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-01-21 00:38:29,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-21 00:38:29,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-01-21 00:38:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-21 00:38:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-21 00:38:29,474 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 29 [2018-01-21 00:38:29,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:29,474 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-21 00:38:29,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 00:38:29,475 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-21 00:38:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 00:38:29,476 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:29,476 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] [2018-01-21 00:38:29,476 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:29,476 INFO L82 PathProgramCache]: Analyzing trace with hash 304338011, now seen corresponding path program 1 times [2018-01-21 00:38:29,476 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:29,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:29,477 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:29,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:29,478 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:29,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:29,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:29,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:38:29,530 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:29,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:38:29,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:38:29,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:38:29,531 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-01-21 00:38:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:29,623 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-01-21 00:38:29,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:38:29,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-21 00:38:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:29,624 INFO L225 Difference]: With dead ends: 91 [2018-01-21 00:38:29,625 INFO L226 Difference]: Without dead ends: 88 [2018-01-21 00:38:29,625 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 00:38:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-21 00:38:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 50. [2018-01-21 00:38:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-21 00:38:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-21 00:38:29,631 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 30 [2018-01-21 00:38:29,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:29,631 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-21 00:38:29,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:38:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-21 00:38:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 00:38:29,632 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:29,633 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:29,633 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:29,633 INFO L82 PathProgramCache]: Analyzing trace with hash 264537048, now seen corresponding path program 2 times [2018-01-21 00:38:29,633 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:29,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:29,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:29,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:29,634 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:29,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:29,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:29,748 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:38:29,748 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 00:38:29,748 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 00:38:29,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:29,748 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 00:38:29,753 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:38:29,753 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:38:29,765 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:38:29,772 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:38:29,774 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 00:38:29,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:38:29,821 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 00:38:29,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index 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 00:38:29,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:29,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:29,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:29,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 00:38:29,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 00:38:29,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:29,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-21 00:38:29,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:29,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:29,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:29,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 00:38:29,886 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 30 treesize of output 23 [2018-01-21 00:38:29,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:29,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:29,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:29,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-21 00:38:29,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:29,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:29,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:29,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 00:38:29,949 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 29 treesize of output 21 [2018-01-21 00:38:29,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-01-21 00:38:29,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:29,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:29,954 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 00:38:29,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-01-21 00:38:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:29,988 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:38:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:30,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:30,060 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 00:38:30,067 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:38:30,067 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:38:30,080 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:38:30,094 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:38:30,109 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 00:38:30,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:38:30,124 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 00:38:30,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 00:38:30,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:30,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:30,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:30,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 00:38:30,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 21 treesize of output 16 [2018-01-21 00:38:30,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:30,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-21 00:38:30,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:30,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:30,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:30,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 00:38:30,169 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 30 treesize of output 23 [2018-01-21 00:38:30,172 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:30,172 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:30,173 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:30,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-21 00:38:30,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:30,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:30,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:30,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 00:38:30,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-01-21 00:38:30,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-01-21 00:38:30,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:30,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:30,204 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 00:38:30,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-01-21 00:38:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:30,209 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:38:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:30,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:38:30,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 7, 11, 7] total 18 [2018-01-21 00:38:30,268 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:38:30,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-21 00:38:30,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-21 00:38:30,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-01-21 00:38:30,269 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 15 states. [2018-01-21 00:38:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:30,543 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-01-21 00:38:30,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 00:38:30,543 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-01-21 00:38:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:30,544 INFO L225 Difference]: With dead ends: 68 [2018-01-21 00:38:30,544 INFO L226 Difference]: Without dead ends: 46 [2018-01-21 00:38:30,544 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 117 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2018-01-21 00:38:30,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-21 00:38:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-21 00:38:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 00:38:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-21 00:38:30,549 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 33 [2018-01-21 00:38:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:30,549 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-21 00:38:30,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-21 00:38:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-21 00:38:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:38:30,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:30,550 INFO L322 BasicCegarLoop]: trace histogram [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 00:38:30,551 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:30,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1962892734, now seen corresponding path program 1 times [2018-01-21 00:38:30,551 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:30,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:30,552 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 00:38:30,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:30,552 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:30,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:30,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:30,738 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:38:30,738 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-21 00:38:30,738 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [10], [11], [12], [13], [17], [19], [22], [24], [25], [26], [27], [28], [29], [36], [37], [39], [45], [49], [51], [52], [53], [54], [62], [64], [68], [70], [71], [72], [73] [2018-01-21 00:38:30,740 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:38:30,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:38:31,055 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:38:31,056 INFO L268 AbstractInterpreter]: Visited 34 different actions 96 times. Merged at 22 different actions 59 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 27 variables. [2018-01-21 00:38:31,057 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:38:31,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:31,057 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:38:31,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:31,063 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:38:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:31,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:38:31,088 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 6 treesize of output 5 [2018-01-21 00:38:31,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-21 00:38:31,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:31,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:31,124 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 00:38:31,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-01-21 00:38:31,167 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 00:38:31,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 00:38:31,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-21 00:38:31,204 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 38 treesize of output 34 [2018-01-21 00:38:31,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 00:38:31,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,216 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 00:38:31,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-01-21 00:38:31,256 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 41 treesize of output 35 [2018-01-21 00:38:31,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2018-01-21 00:38:31,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,267 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 00:38:31,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-01-21 00:38:31,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-01-21 00:38:31,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-21 00:38:31,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-01-21 00:38:31,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-01-21 00:38:31,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 00:38:31,470 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-01-21 00:38:31,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-01-21 00:38:31,482 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-21 00:38:31,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-21 00:38:31,492 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,497 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:31,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-21 00:38:31,512 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:97, output treesize:32 [2018-01-21 00:38:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:31,550 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:38:31,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 14 [2018-01-21 00:38:31,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 14 treesize of output 18 [2018-01-21 00:38:31,656 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-21 00:38:31,656 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 14 [2018-01-21 00:38:31,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-21 00:38:31,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:31,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:31,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:31,682 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:20, output treesize:26 [2018-01-21 00:38:31,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:31,844 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:31,844 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 00:38:31,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:31,847 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:38:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:31,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:38:31,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index 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 00:38:31,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-21 00:38:31,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:31,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:31,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 00:38:31,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-01-21 00:38:31,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 00:38:31,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 00:38:31,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-21 00:38:31,932 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 38 treesize of output 34 [2018-01-21 00:38:31,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-21 00:38:31,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,951 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 00:38:31,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-01-21 00:38:31,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-01-21 00:38:31,963 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:31,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-01-21 00:38:31,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:31,975 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 00:38:31,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-01-21 00:38:32,050 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 44 treesize of output 30 [2018-01-21 00:38:32,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-21 00:38:32,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:32,060 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 23 treesize of output 9 [2018-01-21 00:38:32,061 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:32,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:32,068 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 00:38:32,068 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:4 [2018-01-21 00:38:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:32,082 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:38:32,240 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 39 treesize of output 33 [2018-01-21 00:38:32,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 00:38:32,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:32,258 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 32 treesize of output 50 [2018-01-21 00:38:32,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-01-21 00:38:32,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:32,285 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 35 treesize of output 36 [2018-01-21 00:38:32,285 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:32,305 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 35 treesize of output 35 [2018-01-21 00:38:32,321 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 21 treesize of output 15 [2018-01-21 00:38:32,322 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-21 00:38:32,335 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 4 [2018-01-21 00:38:32,335 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:32,339 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:32,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:32,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:32,346 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 00:38:32,346 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:39, output treesize:4 [2018-01-21 00:38:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:32,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:38:32,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 14, 13, 10] total 36 [2018-01-21 00:38:32,440 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:38:32,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-21 00:38:32,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-21 00:38:32,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1120, Unknown=0, NotChecked=0, Total=1260 [2018-01-21 00:38:32,441 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 21 states. [2018-01-21 00:38:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:33,371 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-01-21 00:38:33,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-21 00:38:33,372 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2018-01-21 00:38:33,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:33,372 INFO L225 Difference]: With dead ends: 104 [2018-01-21 00:38:33,373 INFO L226 Difference]: Without dead ends: 101 [2018-01-21 00:38:33,374 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 113 SyntacticMatches, 12 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=475, Invalid=2717, Unknown=0, NotChecked=0, Total=3192 [2018-01-21 00:38:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-21 00:38:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 66. [2018-01-21 00:38:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-21 00:38:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-21 00:38:33,382 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 37 [2018-01-21 00:38:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:33,382 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-21 00:38:33,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-21 00:38:33,383 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-21 00:38:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-21 00:38:33,384 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:33,384 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] [2018-01-21 00:38:33,384 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:33,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1346194821, now seen corresponding path program 2 times [2018-01-21 00:38:33,385 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:33,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:33,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:33,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:33,386 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:33,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:33,913 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:33,913 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:38:33,913 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 00:38:33,914 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 00:38:33,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:33,914 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:38:33,919 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:38:33,919 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:38:33,931 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:38:33,942 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:38:33,945 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 00:38:33,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:38:34,061 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 00:38:34,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index 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 00:38:34,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:34,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:34,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:34,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-01-21 00:38:34,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:34,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-01-21 00:38:34,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 00:38:34,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:34,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:34,118 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 00:38:34,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-01-21 00:38:34,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:34,161 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 59 treesize of output 57 [2018-01-21 00:38:34,164 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 54 treesize of output 63 [2018-01-21 00:38:34,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:34,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:34,179 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 00:38:34,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:55 [2018-01-21 00:38:34,314 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:34,315 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-01-21 00:38:34,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-21 00:38:34,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:34,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:34,371 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 43 [2018-01-21 00:38:34,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 00:38:34,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 00:38:34,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:34,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-01-21 00:38:34,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-21 00:38:34,476 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:34,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:34,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2018-01-21 00:38:34,493 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-21 00:38:34,515 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-21 00:38:34,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-01-21 00:38:34,577 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:133, output treesize:162 [2018-01-21 00:38:35,209 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~y~4.base Int) (v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| main_~y~4.base 1))) (and (not (= v_subst_1 0)) (= 0 (select |c_old(#valid)| main_~y~4.base)) (not (= main_~y~4.base 0)) (= (select .cse0 v_subst_1) 0) (= |c_#valid| (store (store .cse0 v_subst_1 0) main_~y~4.base 0))))) is different from true [2018-01-21 00:38:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-01-21 00:38:35,228 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:38:35,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-21 00:38:35,328 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 14 [2018-01-21 00:38:35,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:35,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:35,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:35,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-01-21 00:38:35,630 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 60 [2018-01-21 00:38:35,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-21 00:38:35,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:35,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 67 [2018-01-21 00:38:35,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-01-21 00:38:35,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:35,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-01-21 00:38:35,703 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:35,751 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 52 treesize of output 50 [2018-01-21 00:38:35,798 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 1 case distinctions, treesize of input 31 treesize of output 29 [2018-01-21 00:38:35,799 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 00:38:35,801 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 00:38:35,801 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:35,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-01-21 00:38:35,809 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 00:38:35,882 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 46 [2018-01-21 00:38:35,884 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-01-21 00:38:35,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 00:38:35,891 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-01-21 00:38:35,965 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-01-21 00:38:36,067 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-01-21 00:38:36,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2018-01-21 00:38:36,092 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 00:38:36,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 6 [2018-01-21 00:38:36,094 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:36,110 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 00:38:36,214 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 52 treesize of output 44 [2018-01-21 00:38:36,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-21 00:38:36,240 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:36,257 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 6 [2018-01-21 00:38:36,257 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:36,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-01-21 00:38:36,264 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 00:38:36,278 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-01-21 00:38:36,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 7 dim-0 vars, and 10 xjuncts. [2018-01-21 00:38:36,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 10 xjuncts. [2018-01-21 00:38:36,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 10 xjuncts. [2018-01-21 00:38:36,638 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 2 variables, input treesize:86, output treesize:235 [2018-01-21 00:38:36,862 WARN L1007 $PredicateComparison]: unable to prove that (or (= c_main_~y~4.base 0) (forall ((|v_main_#t~malloc5.base_7| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc5.base_7|))) (= (store (store |c_#valid| |v_main_#t~malloc5.base_7| 0) c_main_~y~4.base 0) |c_old(#valid)|) (= 0 |v_main_#t~malloc5.base_7|)))) is different from false [2018-01-21 00:38:36,866 WARN L1007 $PredicateComparison]: unable to prove that (or (= |c_main_#t~malloc0.base| 0) (forall ((|v_main_#t~malloc5.base_7| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc5.base_7|))) (= 0 |v_main_#t~malloc5.base_7|) (= (store (store |c_#valid| |v_main_#t~malloc5.base_7| 0) |c_main_#t~malloc0.base| 0) |c_old(#valid)|)))) is different from false [2018-01-21 00:38:36,894 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc5.base_7| Int) (|v_main_#t~malloc0.base_7| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_7| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc5.base_7|))) (= 0 |v_main_#t~malloc0.base_7|) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_7|))) (= 0 |v_main_#t~malloc5.base_7|) (= (store (store .cse0 |v_main_#t~malloc5.base_7| 0) |v_main_#t~malloc0.base_7| 0) |c_old(#valid)|)))) is different from false [2018-01-21 00:38:36,910 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc5.base_7| Int) (|v_main_#t~malloc0.base_7| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_7| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc5.base_7|))) (= |c_#valid| (store (store .cse0 |v_main_#t~malloc5.base_7| 0) |v_main_#t~malloc0.base_7| 0)) (= 0 |v_main_#t~malloc0.base_7|) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_7|))) (= 0 |v_main_#t~malloc5.base_7|)))) is different from false [2018-01-21 00:38:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:36,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:36,958 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 00:38:36,961 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:38:36,961 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:38:36,976 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:38:36,996 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:38:37,018 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 00:38:37,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:38:37,448 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 00:38:37,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 00:38:37,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:37,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:37,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:37,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-01-21 00:38:37,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:37,518 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 56 treesize of output 60 [2018-01-21 00:38:37,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 00:38:37,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:37,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:37,535 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 00:38:37,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:60 [2018-01-21 00:38:37,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:37,607 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 61 treesize of output 59 [2018-01-21 00:38:37,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:37,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 71 [2018-01-21 00:38:37,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:37,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:37,630 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 00:38:37,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-01-21 00:38:37,912 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:37,914 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 62 treesize of output 52 [2018-01-21 00:38:37,918 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 45 treesize of output 27 [2018-01-21 00:38:37,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:37,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-21 00:38:37,927 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:37,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:37,938 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 00:38:37,938 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:71, output treesize:32 [2018-01-21 00:38:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:38,735 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:38:38,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-21 00:38:38,807 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 14 [2018-01-21 00:38:38,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:38,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:38,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:38,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-01-21 00:38:39,406 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 73 treesize of output 50 [2018-01-21 00:38:39,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-21 00:38:39,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:39,470 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 29 treesize of output 23 [2018-01-21 00:38:39,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-01-21 00:38:39,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:39,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:39,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:39,498 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 38 treesize of output 31 [2018-01-21 00:38:39,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, 1 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 00:38:39,512 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:39,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 8 treesize of output 6 [2018-01-21 00:38:39,517 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 6 treesize of output 1 [2018-01-21 00:38:39,518 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:39,518 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:39,521 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:39,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:39,527 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:112, output treesize:22 [2018-01-21 00:38:39,707 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_8| Int) (|v_main_#t~malloc5.base_7| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_8| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_8|))) (= 0 |v_main_#t~malloc0.base_8|) (not (= 0 (select .cse0 |v_main_#t~malloc5.base_7|))) (= 0 |v_main_#t~malloc5.base_7|) (= (store (store .cse0 |v_main_#t~malloc5.base_7| 0) |v_main_#t~malloc0.base_8| 0) |c_old(#valid)|)))) is different from false [2018-01-21 00:38:39,712 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_8| Int) (|v_main_#t~malloc5.base_7| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_8| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_8|))) (= 0 |v_main_#t~malloc0.base_8|) (not (= 0 (select .cse0 |v_main_#t~malloc5.base_7|))) (= |c_#valid| (store (store .cse0 |v_main_#t~malloc5.base_7| 0) |v_main_#t~malloc0.base_8| 0)) (= 0 |v_main_#t~malloc5.base_7|)))) is different from false [2018-01-21 00:38:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:39,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:38:39,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17, 19, 16] total 72 [2018-01-21 00:38:39,734 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:38:39,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-21 00:38:39,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-21 00:38:39,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=4198, Unknown=102, NotChecked=680, Total=5256 [2018-01-21 00:38:39,736 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 30 states. [2018-01-21 00:38:41,258 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 123 DAG size of output 44 [2018-01-21 00:38:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:42,105 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-01-21 00:38:42,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-21 00:38:42,106 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2018-01-21 00:38:42,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:42,107 INFO L225 Difference]: With dead ends: 101 [2018-01-21 00:38:42,107 INFO L226 Difference]: Without dead ends: 98 [2018-01-21 00:38:42,108 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 108 SyntacticMatches, 14 SemanticMatches, 85 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1821 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=501, Invalid=6052, Unknown=109, NotChecked=820, Total=7482 [2018-01-21 00:38:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-21 00:38:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2018-01-21 00:38:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-21 00:38:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-01-21 00:38:42,116 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 44 [2018-01-21 00:38:42,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:42,116 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-01-21 00:38:42,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-21 00:38:42,116 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-01-21 00:38:42,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-21 00:38:42,117 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:42,117 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] [2018-01-21 00:38:42,117 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:42,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2126030707, now seen corresponding path program 1 times [2018-01-21 00:38:42,118 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:42,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:42,119 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 00:38:42,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:42,119 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:42,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 00:38:42,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:42,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-21 00:38:42,294 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:42,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-21 00:38:42,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-21 00:38:42,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-21 00:38:42,295 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 10 states. [2018-01-21 00:38:42,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:42,599 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2018-01-21 00:38:42,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-21 00:38:42,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-21 00:38:42,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:42,602 INFO L225 Difference]: With dead ends: 143 [2018-01-21 00:38:42,602 INFO L226 Difference]: Without dead ends: 127 [2018-01-21 00:38:42,603 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2018-01-21 00:38:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-21 00:38:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 93. [2018-01-21 00:38:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-21 00:38:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-01-21 00:38:42,612 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 45 [2018-01-21 00:38:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:42,612 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-01-21 00:38:42,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-21 00:38:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-01-21 00:38:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-21 00:38:42,615 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:42,615 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:42,615 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:42,616 INFO L82 PathProgramCache]: Analyzing trace with hash 886772723, now seen corresponding path program 1 times [2018-01-21 00:38:42,616 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:42,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:42,617 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:42,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:42,617 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:42,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:43,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:43,336 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:38:43,336 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-01-21 00:38:43,336 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [10], [11], [12], [13], [17], [19], [22], [24], [25], [26], [27], [28], [29], [36], [37], [39], [45], [49], [51], [52], [53], [54], [57], [58], [59], [60], [62], [64], [68], [70], [71], [72], [73] [2018-01-21 00:38:43,337 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:38:43,338 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:38:43,744 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:38:43,744 INFO L268 AbstractInterpreter]: Visited 38 different actions 119 times. Merged at 26 different actions 73 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 8 different actions. Largest state had 29 variables. [2018-01-21 00:38:43,749 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:38:43,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:43,749 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 00:38:43,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:43,776 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:38:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:43,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:38:43,843 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 00:38:43,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index 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 00:38:43,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:43,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:43,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:43,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-21 00:38:43,894 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 21 treesize of output 17 [2018-01-21 00:38:43,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:43,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-21 00:38:43,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:43,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:43,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 17 [2018-01-21 00:38:43,904 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 13 treesize of output 10 [2018-01-21 00:38:43,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-21 00:38:43,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:43,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:43,919 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:43, output treesize:15 [2018-01-21 00:38:43,939 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 11 treesize of output 10 [2018-01-21 00:38:43,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:43,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:43,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-21 00:38:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 00:38:43,965 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:38:44,011 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 00:38:44,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:44,020 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-01-21 00:38:44,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:44,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:44,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:18 [2018-01-21 00:38:44,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 12 treesize of output 10 [2018-01-21 00:38:44,141 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 5 treesize of output 3 [2018-01-21 00:38:44,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:44,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:44,173 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 00:38:44,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:3 [2018-01-21 00:38:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 00:38:44,211 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:38:44,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [19] total 32 [2018-01-21 00:38:44,211 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:44,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-21 00:38:44,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-21 00:38:44,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2018-01-21 00:38:44,212 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 9 states. [2018-01-21 00:38:44,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:44,485 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2018-01-21 00:38:44,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-21 00:38:44,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-01-21 00:38:44,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:44,486 INFO L225 Difference]: With dead ends: 132 [2018-01-21 00:38:44,486 INFO L226 Difference]: Without dead ends: 109 [2018-01-21 00:38:44,487 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=204, Invalid=1518, Unknown=0, NotChecked=0, Total=1722 [2018-01-21 00:38:44,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-21 00:38:44,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2018-01-21 00:38:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-21 00:38:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-01-21 00:38:44,495 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 47 [2018-01-21 00:38:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:44,495 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-01-21 00:38:44,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-21 00:38:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-01-21 00:38:44,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-21 00:38:44,496 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:44,496 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:44,496 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:44,496 INFO L82 PathProgramCache]: Analyzing trace with hash 345788657, now seen corresponding path program 2 times [2018-01-21 00:38:44,496 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:44,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:44,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:44,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:44,497 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:44,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:45,252 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:45,252 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:38:45,252 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 00:38:45,252 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 00:38:45,252 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:45,252 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:38:45,265 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:38:45,265 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:38:45,275 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:38:45,284 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:38:45,287 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 00:38:45,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:38:45,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-21 00:38:45,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-21 00:38:45,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-21 00:38:45,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-21 00:38:45,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 00:38:45,385 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:45,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:45,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-21 00:38:45,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-01-21 00:38:45,436 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 00:38:45,438 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 8 treesize of output 7 [2018-01-21 00:38:45,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,450 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 19 treesize of output 24 [2018-01-21 00:38:45,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index 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 00:38:45,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,462 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2018-01-21 00:38:45,498 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 70 treesize of output 66 [2018-01-21 00:38:45,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-21 00:38:45,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,519 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 61 treesize of output 56 [2018-01-21 00:38:45,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:45,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:45,523 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 24 treesize of output 51 [2018-01-21 00:38:45,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,540 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:64 [2018-01-21 00:38:45,578 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 65 treesize of output 57 [2018-01-21 00:38:45,581 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 54 treesize of output 61 [2018-01-21 00:38:45,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,602 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 64 treesize of output 63 [2018-01-21 00:38:45,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:45,605 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 44 treesize of output 57 [2018-01-21 00:38:45,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,621 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-01-21 00:38:45,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2018-01-21 00:38:45,736 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 1 [2018-01-21 00:38:45,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:45,753 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2018-01-21 00:38:45,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 00:38:45,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 00:38:45,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-21 00:38:45,803 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:82, output treesize:134 [2018-01-21 00:38:46,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-01-21 00:38:46,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:46,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:46,125 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 22 treesize of output 33 [2018-01-21 00:38:46,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-21 00:38:46,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:46,151 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-21 00:38:46,151 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:46,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:46,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-01-21 00:38:46,154 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:46,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:38:46,157 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 20 treesize of output 17 [2018-01-21 00:38:46,157 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:46,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:46,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:46,166 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:48, output treesize:10 [2018-01-21 00:38:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:46,237 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:38:46,628 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 107 treesize of output 101 [2018-01-21 00:38:46,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-21 00:38:46,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:46,655 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 100 treesize of output 118 [2018-01-21 00:38:46,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 103 [2018-01-21 00:38:46,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:46,692 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 103 treesize of output 104 [2018-01-21 00:38:46,693 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:46,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-01-21 00:38:46,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2018-01-21 00:38:46,744 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:46,747 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:38:46,754 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 91 [2018-01-21 00:38:46,755 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 00:38:46,773 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 00:38:46,825 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 103 treesize of output 103 [2018-01-21 00:38:46,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 89 [2018-01-21 00:38:46,864 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 00:38:46,866 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 57 treesize of output 51 [2018-01-21 00:38:46,866 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:46,915 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 62 treesize of output 58 [2018-01-21 00:38:46,916 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-21 00:38:46,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 106 [2018-01-21 00:38:46,935 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-01-21 00:38:47,003 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-01-21 00:38:47,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 97 [2018-01-21 00:38:47,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 86 [2018-01-21 00:38:47,115 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 00:38:47,116 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 54 treesize of output 48 [2018-01-21 00:38:47,117 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:47,140 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 8 treesize of output 1 [2018-01-21 00:38:47,140 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:47,159 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-21 00:38:47,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-01-21 00:38:47,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-01-21 00:38:47,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-01-21 00:38:47,409 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 1 variables, input treesize:107, output treesize:613 [2018-01-21 00:38:47,964 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 164 treesize of output 82 [2018-01-21 00:38:47,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-21 00:38:47,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:47,972 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:38:47,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 81 treesize of output 61 [2018-01-21 00:38:47,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 9 treesize of output 8 [2018-01-21 00:38:47,978 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:47,985 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:38:47,988 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 57 treesize of output 49 [2018-01-21 00:38:48,005 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:38:48,006 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 30 [2018-01-21 00:38:48,007 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:48,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-01-21 00:38:48,019 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:38:48,019 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:38:48,022 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 0 case distinctions, treesize of input 25 treesize of output 13 [2018-01-21 00:38:48,022 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:48,028 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 6 treesize of output 1 [2018-01-21 00:38:48,028 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:48,029 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:48,032 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:48,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:48,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:38:48,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:38:48,042 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:174, output treesize:15 [2018-01-21 00:38:48,161 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 00:38:48,183 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:48,183 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 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 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 00:38:48,188 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:38:48,188 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:38:48,202 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:38:48,221 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:39:00,228 INFO L239 tOrderPrioritization]: Conjunction of SSA is unknown [2018-01-21 00:39:00,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-01-21 00:39:00,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 52 [2018-01-21 00:39:00,277 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:39:00,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-21 00:39:00,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-21 00:39:00,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2478, Unknown=0, NotChecked=0, Total=2652 [2018-01-21 00:39:00,279 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 36 states. [2018-01-21 00:39:01,358 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 151 DAG size of output 72 [2018-01-21 00:39:01,594 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 111 DAG size of output 96 [2018-01-21 00:39:02,137 WARN L146 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 167 DAG size of output 123 [2018-01-21 00:39:02,588 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 140 DAG size of output 76 [2018-01-21 00:39:03,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:39:03,155 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2018-01-21 00:39:03,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-21 00:39:03,156 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2018-01-21 00:39:03,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:39:03,156 INFO L225 Difference]: With dead ends: 134 [2018-01-21 00:39:03,156 INFO L226 Difference]: Without dead ends: 117 [2018-01-21 00:39:03,158 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=536, Invalid=4720, Unknown=0, NotChecked=0, Total=5256 [2018-01-21 00:39:03,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-21 00:39:03,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2018-01-21 00:39:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-21 00:39:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-01-21 00:39:03,162 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 47 [2018-01-21 00:39:03,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:39:03,163 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-01-21 00:39:03,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-21 00:39:03,163 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-01-21 00:39:03,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 00:39:03,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:39:03,163 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:39:03,163 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-21 00:39:03,164 INFO L82 PathProgramCache]: Analyzing trace with hash 273996961, now seen corresponding path program 1 times [2018-01-21 00:39:03,164 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:39:03,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:39:03,164 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 00:39:03,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:39:03,164 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:39:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:39:03,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:39:03,897 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 43 DAG size of output 21 [2018-01-21 00:39:04,262 WARN L146 SmtUtils]: Spent 310ms on a formula simplification. DAG size of input: 55 DAG size of output 22 [2018-01-21 00:39:04,581 WARN L146 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 72 DAG size of output 37 [2018-01-21 00:39:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:39:05,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:39:05,559 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:39:05,559 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-01-21 00:39:05,559 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [10], [11], [12], [13], [17], [19], [22], [24], [25], [26], [27], [28], [29], [32], [33], [34], [39], [45], [49], [51], [52], [53], [54], [57], [58], [59], [60], [62], [64], [68], [70], [71], [72], [73] [2018-01-21 00:39:05,561 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:39:05,561 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:39:05,998 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:39:05,998 INFO L268 AbstractInterpreter]: Visited 39 different actions 119 times. Merged at 27 different actions 72 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 8 different actions. Largest state had 31 variables. [2018-01-21 00:39:06,013 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:39:06,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:39:06,013 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:39:06,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:39:06,022 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:39:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:39:06,056 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:39:06,240 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 00:39:06,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index 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 00:39:06,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:06,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:39:06,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:39:06,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-01-21 00:39:06,296 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:39:06,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-01-21 00:39:06,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-21 00:39:06,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:06,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:39:06,318 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 00:39:06,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-01-21 00:39:06,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:39:06,415 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 77 treesize of output 73 [2018-01-21 00:39:06,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:39:06,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 89 [2018-01-21 00:39:06,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:06,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:39:06,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:39:06,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-01-21 00:39:06,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:39:06,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2018-01-21 00:39:06,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-21 00:39:06,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:06,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:39:06,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:39:06,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:39:06,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 79 [2018-01-21 00:39:06,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-21 00:39:06,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-21 00:39:07,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:39:07,068 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2018-01-21 00:39:07,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-21 00:39:07,070 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:07,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:39:07,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:39:07,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 87 [2018-01-21 00:39:07,115 INFO L267 ElimStorePlain]: Start of recursive call 7: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-01-21 00:39:07,492 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-01-21 00:39:08,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 12 xjuncts. [2018-01-21 00:39:08,236 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:205, output treesize:673 [2018-01-21 00:39:08,705 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 178 DAG size of output 81 [2018-01-21 00:39:09,048 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 130 DAG size of output 95 [2018-01-21 00:39:09,525 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~y~4.base Int) (v_prenex_55 Int) (v_subst_4 Int)) (let ((.cse1 (store |c_old(#valid)| main_~y~4.base 1))) (let ((.cse0 (store .cse1 v_subst_4 1))) (and (= (select .cse0 v_prenex_55) 0) (= (store (store (store .cse0 v_prenex_55 0) v_subst_4 0) main_~y~4.base 0) |c_#valid|) (= 0 (select .cse1 v_subst_4)) (= 0 (select |c_old(#valid)| main_~y~4.base)) (not (= main_~y~4.base 0)) (not (= v_subst_4 0)) (not (= v_prenex_55 0)))))) is different from true [2018-01-21 00:39:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-01-21 00:39:09,542 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:39:09,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-21 00:39:09,633 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 14 [2018-01-21 00:39:09,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:09,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:39:09,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:39:09,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-01-21 00:39:09,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-01-21 00:39:09,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-01-21 00:39:09,710 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 22 [2018-01-21 00:39:09,711 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:09,712 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:39:09,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:39:09,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 00:39:09,728 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:70, output treesize:45 [2018-01-21 00:39:10,351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 67 [2018-01-21 00:39:10,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 00:39:10,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:10,373 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 62 [2018-01-21 00:39:10,376 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 48 treesize of output 47 [2018-01-21 00:39:10,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:10,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-01-21 00:39:10,399 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:10,420 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 47 treesize of output 39 [2018-01-21 00:39:10,437 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 8 treesize of output 1 [2018-01-21 00:39:10,437 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:10,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 18 [2018-01-21 00:39:10,453 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-21 00:39:10,454 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,455 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 22 treesize of output 13 [2018-01-21 00:39:10,455 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:10,465 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:39:10,492 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 47 treesize of output 45 [2018-01-21 00:39:10,519 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-21 00:39:10,519 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:10,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 24 [2018-01-21 00:39:10,524 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-21 00:39:10,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 26 [2018-01-21 00:39:10,530 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-01-21 00:39:10,531 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-01-21 00:39:10,532 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:10,567 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,568 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,568 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2018-01-21 00:39:10,572 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-01-21 00:39:10,574 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,577 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 46 [2018-01-21 00:39:10,591 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. [2018-01-21 00:39:10,616 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 00:39:10,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 00:39:10,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 00:39:10,687 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 97 [2018-01-21 00:39:10,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 00:39:10,689 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:10,714 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 82 [2018-01-21 00:39:10,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-01-21 00:39:10,717 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:10,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-01-21 00:39:10,748 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:10,777 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 67 treesize of output 57 [2018-01-21 00:39:10,834 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 8 treesize of output 1 [2018-01-21 00:39:10,834 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:10,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2018-01-21 00:39:10,864 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-21 00:39:10,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 52 [2018-01-21 00:39:10,876 INFO L267 ElimStorePlain]: Start of recursive call 26: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-21 00:39:10,888 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 62 [2018-01-21 00:39:10,890 INFO L267 ElimStorePlain]: Start of recursive call 27: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-21 00:39:10,892 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,892 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-01-21 00:39:10,896 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 00:39:10,897 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,898 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2018-01-21 00:39:10,902 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 00:39:10,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2018-01-21 00:39:10,910 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-21 00:39:10,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-21 00:39:10,912 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:10,913 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-21 00:39:10,916 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 00:39:10,917 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-21 00:39:10,917 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:10,919 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-21 00:39:10,921 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:39:10,923 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,924 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 33 treesize of output 28 [2018-01-21 00:39:10,924 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:39:10,926 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,926 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:10,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-01-21 00:39:10,930 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 00:39:13,078 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: 24 dim-0 vars, and 18 xjuncts. [2018-01-21 00:39:16,403 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 67 treesize of output 63 [2018-01-21 00:39:16,515 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 78 DAG size of output 71 [2018-01-21 00:39:16,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2018-01-21 00:39:16,524 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-21 00:39:16,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-01-21 00:39:16,526 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-01-21 00:39:16,538 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 68 [2018-01-21 00:39:16,540 INFO L267 ElimStorePlain]: Start of recursive call 40: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-21 00:39:16,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 55 [2018-01-21 00:39:16,553 INFO L267 ElimStorePlain]: Start of recursive call 41: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-21 00:39:16,555 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:16,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-01-21 00:39:16,556 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:39:16,559 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-01-21 00:39:16,560 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:39:16,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2018-01-21 00:39:16,568 INFO L267 ElimStorePlain]: Start of recursive call 44: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-21 00:39:17,470 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:39:17,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2018-01-21 00:39:17,481 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-01-21 00:39:17,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 68 [2018-01-21 00:39:17,507 INFO L267 ElimStorePlain]: Start of recursive call 46: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 16 xjuncts. [2018-01-21 00:39:17,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2018-01-21 00:39:17,516 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. Received shutdown request... [2018-01-21 00:39:18,525 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-21 00:39:18,525 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 00:39:18,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:39:18 BoogieIcfgContainer [2018-01-21 00:39:18,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:39:18,528 INFO L168 Benchmark]: Toolchain (without parser) took 52686.01 ms. Allocated memory was 303.0 MB in the beginning and 737.1 MB in the end (delta: 434.1 MB). Free memory was 260.2 MB in the beginning and 325.0 MB in the end (delta: -64.8 MB). Peak memory consumption was 369.3 MB. Max. memory is 5.3 GB. [2018-01-21 00:39:18,528 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 303.0 MB. Free memory is still 266.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:39:18,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.95 ms. Allocated memory is still 303.0 MB. Free memory was 260.2 MB in the beginning and 250.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:39:18,529 INFO L168 Benchmark]: Boogie Preprocessor took 35.02 ms. Allocated memory is still 303.0 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:39:18,529 INFO L168 Benchmark]: RCFGBuilder took 231.72 ms. Allocated memory is still 303.0 MB. Free memory was 248.3 MB in the beginning and 229.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. [2018-01-21 00:39:18,529 INFO L168 Benchmark]: TraceAbstraction took 52208.20 ms. Allocated memory was 303.0 MB in the beginning and 737.1 MB in the end (delta: 434.1 MB). Free memory was 229.3 MB in the beginning and 325.0 MB in the end (delta: -95.7 MB). Peak memory consumption was 338.4 MB. Max. memory is 5.3 GB. [2018-01-21 00:39:18,531 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.23 ms. Allocated memory is still 303.0 MB. Free memory is still 266.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.95 ms. Allocated memory is still 303.0 MB. Free memory was 260.2 MB in the beginning and 250.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.02 ms. Allocated memory is still 303.0 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 231.72 ms. Allocated memory is still 303.0 MB. Free memory was 248.3 MB in the beginning and 229.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52208.20 ms. Allocated memory was 303.0 MB in the beginning and 737.1 MB in the end (delta: 434.1 MB). Free memory was 229.3 MB in the beginning and 325.0 MB in the end (delta: -95.7 MB). Peak memory consumption was 338.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 244 LocStat_NO_SUPPORTING_DISEQUALITIES : 53 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 66 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.051593 RENAME_VARIABLES(MILLISECONDS) : 0.567148 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.003174 PROJECTAWAY(MILLISECONDS) : 0.089902 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001031 DISJOIN(MILLISECONDS) : 1.064611 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.618022 ADD_EQUALITY(MILLISECONDS) : 0.066956 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019767 #CONJOIN_DISJUNCTIVE : 77 #RENAME_VARIABLES : 138 #UNFREEZE : 0 #CONJOIN : 146 #PROJECTAWAY : 100 #ADD_WEAK_EQUALITY : 16 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 62 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 32 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 324 LocStat_NO_SUPPORTING_DISEQUALITIES : 87 LocStat_NO_DISJUNCTIONS : -64 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 38 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 81 TransStat_NO_SUPPORTING_DISEQUALITIES : 14 TransStat_NO_DISJUNCTIONS : 42 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.257645 RENAME_VARIABLES(MILLISECONDS) : 0.231107 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.232615 PROJECTAWAY(MILLISECONDS) : 0.192292 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001246 DISJOIN(MILLISECONDS) : 0.389830 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.250750 ADD_EQUALITY(MILLISECONDS) : 0.032373 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013245 #CONJOIN_DISJUNCTIVE : 167 #RENAME_VARIABLES : 316 #UNFREEZE : 0 #CONJOIN : 257 #PROJECTAWAY : 204 #ADD_WEAK_EQUALITY : 30 #DISJOIN : 23 #RENAME_VARIABLES_DISJUNCTIVE : 287 #ADD_EQUALITY : 83 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 35 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 338 LocStat_NO_SUPPORTING_DISEQUALITIES : 90 LocStat_NO_DISJUNCTIONS : -70 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 42 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 97 TransStat_NO_SUPPORTING_DISEQUALITIES : 18 TransStat_NO_DISJUNCTIONS : 50 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.395066 RENAME_VARIABLES(MILLISECONDS) : 0.386992 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.359091 PROJECTAWAY(MILLISECONDS) : 0.166521 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001436 DISJOIN(MILLISECONDS) : 0.381186 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.422291 ADD_EQUALITY(MILLISECONDS) : 0.073587 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013691 #CONJOIN_DISJUNCTIVE : 211 #RENAME_VARIABLES : 445 #UNFREEZE : 0 #CONJOIN : 369 #PROJECTAWAY : 288 #ADD_WEAK_EQUALITY : 31 #DISJOIN : 46 #RENAME_VARIABLES_DISJUNCTIVE : 371 #ADD_EQUALITY : 91 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 36 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 343 LocStat_NO_SUPPORTING_DISEQUALITIES : 95 LocStat_NO_DISJUNCTIONS : -72 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 43 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 100 TransStat_NO_SUPPORTING_DISEQUALITIES : 22 TransStat_NO_DISJUNCTIONS : 51 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.356567 RENAME_VARIABLES(MILLISECONDS) : 0.264221 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.319572 PROJECTAWAY(MILLISECONDS) : 0.193939 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001014 DISJOIN(MILLISECONDS) : 0.485261 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.297753 ADD_EQUALITY(MILLISECONDS) : 0.015034 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014309 #CONJOIN_DISJUNCTIVE : 217 #RENAME_VARIABLES : 452 #UNFREEZE : 0 #CONJOIN : 375 #PROJECTAWAY : 291 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 49 #RENAME_VARIABLES_DISJUNCTIVE : 381 #ADD_EQUALITY : 94 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 * 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, 43 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=43occurred 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: [L633] Node* list = ((void *)0); [L634] Node* y = ((void *)0); VAL [list={0:0}, y={0:0}] [L635] EXPR, FCALL malloc(sizeof(*y)) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={0:0}] [L635] y = malloc(sizeof(*y)) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L636] FCALL y->next = ((void *)0) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L637] FCALL y->prev = ((void *)0) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L638] FCALL y->pData = &y->data VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L639] list = y VAL [list={15:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L640] COND FALSE !(__VERIFIER_nondet_int()) [L655] COND TRUE ((void *)0) != list [L657] y = list VAL [list={15:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L658] EXPR, FCALL list->next VAL [list={15:0}, list->next={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L658] list = list->next [L659] EXPR, FCALL y->pData VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}, y->pData={15:12}] [L659] COND FALSE !(&y->data != y->pData) [L663] FCALL free(y) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L655] COND FALSE !(((void *)0) != list) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L665] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 43 locations, 3 error locations. UNSAFE Result, 0.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 96 SDslu, 58 SDs, 0 SdLazy, 44 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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, 23 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 1289 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: 631]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 3, 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 206. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 43 locations, 3 error locations. TIMEOUT Result, 51.4s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 388 SDtfs, 1131 SDslu, 2057 SDs, 0 SdLazy, 3456 SolverSat, 318 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 978 GetRequests, 585 SyntacticMatches, 48 SemanticMatches, 345 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 4139 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.6s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 194 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 12.4s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 794 NumberOfCodeBlocks, 794 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1090 ConstructedInterpolants, 145 QuantifiedInterpolants, 723672 SizeOfPredicates, 142 NumberOfNonLiveVariables, 1330 ConjunctsInSsa, 294 ConjunctsInUnsatCore, 31 InterpolantComputations, 7 PerfectInterpolantSequences, 81/263 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_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-39-18-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_00-39-18-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_00-39-18-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_00-39-18-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_00-39-18-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-21_00-39-18-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-21_00-39-18-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-21_00-39-18-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-21_00-39-18-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-39-18-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-39-18-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-39-18-544.csv Completed graceful shutdown