java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:14:57,103 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:14:57,105 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:14:57,117 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:14:57,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:14:57,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:14:57,120 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:14:57,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:14:57,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:14:57,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:14:57,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:14:57,124 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:14:57,125 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:14:57,126 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:14:57,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:14:57,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:14:57,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:14:57,133 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:14:57,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:14:57,136 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:14:57,138 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:14:57,138 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:14:57,139 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:14:57,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:14:57,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:14:57,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:14:57,142 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:14:57,142 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:14:57,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:14:57,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:14:57,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:14:57,144 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:14:57,153 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:14:57,154 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:14:57,154 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:14:57,155 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:14:57,155 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:14:57,155 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:14:57,155 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:14:57,156 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:14:57,156 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:14:57,156 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:14:57,157 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:14:57,157 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:14:57,157 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:14:57,157 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:14:57,157 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:14:57,158 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:14:57,158 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:14:57,158 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:14:57,158 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:14:57,158 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:14:57,159 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:14:57,159 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:14:57,159 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:14:57,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:14:57,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:14:57,160 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:14:57,160 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:14:57,160 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:14:57,160 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:14:57,160 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:14:57,161 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:14:57,161 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:14:57,162 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:14:57,162 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:14:57,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:14:57,209 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:14:57,213 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:14:57,215 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:14:57,215 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:14:57,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-01-24 13:14:57,389 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:14:57,395 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:14:57,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:14:57,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:14:57,401 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:14:57,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:14:57" (1/1) ... [2018-01-24 13:14:57,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4430c394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:57, skipping insertion in model container [2018-01-24 13:14:57,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:14:57" (1/1) ... [2018-01-24 13:14:57,423 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:14:57,463 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:14:57,582 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:14:57,598 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:14:57,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:57 WrapperNode [2018-01-24 13:14:57,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:14:57,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:14:57,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:14:57,605 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:14:57,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:57" (1/1) ... [2018-01-24 13:14:57,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:57" (1/1) ... [2018-01-24 13:14:57,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:57" (1/1) ... [2018-01-24 13:14:57,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:57" (1/1) ... [2018-01-24 13:14:57,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:57" (1/1) ... [2018-01-24 13:14:57,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:57" (1/1) ... [2018-01-24 13:14:57,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:57" (1/1) ... [2018-01-24 13:14:57,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:14:57,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:14:57,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:14:57,641 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:14:57,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:57" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:14:57,687 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:14:57,687 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:14:57,687 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 13:14:57,687 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:14:57,687 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:14:57,687 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:14:57,687 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:14:57,688 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:14:57,688 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:14:57,688 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:14:57,688 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:14:57,688 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:14:57,688 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 13:14:57,689 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:14:57,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:14:57,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:14:58,075 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:14:58,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:14:58 BoogieIcfgContainer [2018-01-24 13:14:58,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:14:58,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:14:58,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:14:58,079 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:14:58,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:14:57" (1/3) ... [2018-01-24 13:14:58,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2501e1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:14:58, skipping insertion in model container [2018-01-24 13:14:58,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:57" (2/3) ... [2018-01-24 13:14:58,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2501e1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:14:58, skipping insertion in model container [2018-01-24 13:14:58,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:14:58" (3/3) ... [2018-01-24 13:14:58,082 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-01-24 13:14:58,091 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:14:58,098 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-24 13:14:58,142 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:14:58,142 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:14:58,142 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:14:58,142 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:14:58,142 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:14:58,143 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:14:58,143 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:14:58,143 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:14:58,143 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:14:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-01-24 13:14:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 13:14:58,165 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:58,166 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:58,166 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:14:58,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068532, now seen corresponding path program 1 times [2018-01-24 13:14:58,172 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:58,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:58,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:58,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:58,215 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:58,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:58,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:58,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:14:58,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:14:58,326 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:14:58,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:14:58,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:14:58,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:14:58,346 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2018-01-24 13:14:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:14:58,627 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2018-01-24 13:14:58,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:14:58,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 13:14:58,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:14:58,638 INFO L225 Difference]: With dead ends: 169 [2018-01-24 13:14:58,638 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 13:14:58,641 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:14:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 13:14:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2018-01-24 13:14:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-24 13:14:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-01-24 13:14:58,677 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2018-01-24 13:14:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:14:58,677 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-01-24 13:14:58,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:14:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-01-24 13:14:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 13:14:58,678 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:58,678 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:58,678 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:14:58,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068531, now seen corresponding path program 1 times [2018-01-24 13:14:58,679 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:58,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:58,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:58,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:58,680 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:58,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:58,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:14:58,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:14:58,761 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:14:58,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:14:58,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:14:58,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:14:58,763 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 3 states. [2018-01-24 13:14:58,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:14:58,867 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-01-24 13:14:58,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:14:58,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 13:14:58,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:14:58,869 INFO L225 Difference]: With dead ends: 104 [2018-01-24 13:14:58,870 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 13:14:58,870 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:14:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 13:14:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-01-24 13:14:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-24 13:14:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-01-24 13:14:58,878 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 7 [2018-01-24 13:14:58,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:14:58,878 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-01-24 13:14:58,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:14:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-01-24 13:14:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:14:58,879 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:58,879 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:58,879 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:14:58,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515713, now seen corresponding path program 1 times [2018-01-24 13:14:58,879 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:58,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:58,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:58,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:58,881 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:58,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:58,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:14:58,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:14:58,975 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:14:58,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:14:58,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:14:58,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:14:58,976 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 5 states. [2018-01-24 13:14:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:14:59,160 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-01-24 13:14:59,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:14:59,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 13:14:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:14:59,162 INFO L225 Difference]: With dead ends: 104 [2018-01-24 13:14:59,162 INFO L226 Difference]: Without dead ends: 99 [2018-01-24 13:14:59,163 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:14:59,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-24 13:14:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-01-24 13:14:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 13:14:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-24 13:14:59,171 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 14 [2018-01-24 13:14:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:14:59,171 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-24 13:14:59,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:14:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-24 13:14:59,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:14:59,172 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:59,172 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:59,172 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:14:59,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515714, now seen corresponding path program 1 times [2018-01-24 13:14:59,172 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:59,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:59,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:59,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:59,174 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:59,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:59,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:14:59,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:14:59,269 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:14:59,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:14:59,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:14:59,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:14:59,270 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 7 states. [2018-01-24 13:14:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:14:59,454 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-01-24 13:14:59,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:14:59,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-24 13:14:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:14:59,456 INFO L225 Difference]: With dead ends: 95 [2018-01-24 13:14:59,456 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 13:14:59,457 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:14:59,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 13:14:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-24 13:14:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 13:14:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-01-24 13:14:59,462 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 14 [2018-01-24 13:14:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:14:59,463 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-01-24 13:14:59,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:14:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-01-24 13:14:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 13:14:59,463 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:59,463 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:59,463 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:14:59,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445036, now seen corresponding path program 1 times [2018-01-24 13:14:59,464 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:59,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:59,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:59,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:59,465 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:59,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:59,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:14:59,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:14:59,506 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:14:59,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:14:59,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:14:59,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:14:59,507 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 4 states. [2018-01-24 13:14:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:14:59,601 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-01-24 13:14:59,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:14:59,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 13:14:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:14:59,602 INFO L225 Difference]: With dead ends: 86 [2018-01-24 13:14:59,602 INFO L226 Difference]: Without dead ends: 82 [2018-01-24 13:14:59,603 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:14:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-24 13:14:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-24 13:14:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 13:14:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-01-24 13:14:59,609 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 15 [2018-01-24 13:14:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:14:59,610 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-01-24 13:14:59,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:14:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-01-24 13:14:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 13:14:59,611 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:59,611 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:59,611 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:14:59,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445037, now seen corresponding path program 1 times [2018-01-24 13:14:59,612 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:59,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:59,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:59,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:59,613 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:59,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:59,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:14:59,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:14:59,686 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:14:59,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:14:59,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:14:59,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:14:59,687 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 4 states. [2018-01-24 13:14:59,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:14:59,732 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-01-24 13:14:59,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:14:59,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 13:14:59,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:14:59,734 INFO L225 Difference]: With dead ends: 82 [2018-01-24 13:14:59,734 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 13:14:59,734 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:14:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 13:14:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-24 13:14:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 13:14:59,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-01-24 13:14:59,739 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 15 [2018-01-24 13:14:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:14:59,739 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-01-24 13:14:59,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:14:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-01-24 13:14:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 13:14:59,739 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:59,740 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:59,740 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:14:59,740 INFO L82 PathProgramCache]: Analyzing trace with hash 198602156, now seen corresponding path program 1 times [2018-01-24 13:14:59,740 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:59,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:59,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:59,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:59,741 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:59,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:59,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:14:59,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:14:59,838 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:14:59,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:14:59,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:14:59,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:14:59,840 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 8 states. [2018-01-24 13:15:00,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:00,071 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-01-24 13:15:00,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:15:00,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 13:15:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:00,079 INFO L225 Difference]: With dead ends: 163 [2018-01-24 13:15:00,079 INFO L226 Difference]: Without dead ends: 93 [2018-01-24 13:15:00,080 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:15:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-24 13:15:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2018-01-24 13:15:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 13:15:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-24 13:15:00,088 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 20 [2018-01-24 13:15:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:00,089 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-24 13:15:00,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:15:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-24 13:15:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 13:15:00,091 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:00,091 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:00,092 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:15:00,092 INFO L82 PathProgramCache]: Analyzing trace with hash -524715473, now seen corresponding path program 1 times [2018-01-24 13:15:00,092 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:00,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:00,093 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:00,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:00,093 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:00,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:00,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:00,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:15:00,182 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:00,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:15:00,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:15:00,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:15:00,183 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 7 states. [2018-01-24 13:15:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:00,325 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-01-24 13:15:00,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:15:00,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-01-24 13:15:00,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:00,326 INFO L225 Difference]: With dead ends: 109 [2018-01-24 13:15:00,326 INFO L226 Difference]: Without dead ends: 108 [2018-01-24 13:15:00,326 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:15:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-24 13:15:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2018-01-24 13:15:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-24 13:15:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-01-24 13:15:00,333 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 32 [2018-01-24 13:15:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:00,334 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-01-24 13:15:00,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:15:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-01-24 13:15:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 13:15:00,335 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:00,335 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:00,335 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:15:00,335 INFO L82 PathProgramCache]: Analyzing trace with hash -524715472, now seen corresponding path program 1 times [2018-01-24 13:15:00,335 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:00,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:00,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:00,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:00,336 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:00,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:00,534 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:00,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:15:00,535 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:00,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:15:00,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:15:00,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:15:00,535 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 9 states. [2018-01-24 13:15:00,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:00,717 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-24 13:15:00,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 13:15:00,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-24 13:15:00,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:00,719 INFO L225 Difference]: With dead ends: 106 [2018-01-24 13:15:00,719 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 13:15:00,719 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-01-24 13:15:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 13:15:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2018-01-24 13:15:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 13:15:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-24 13:15:00,726 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 32 [2018-01-24 13:15:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:00,727 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-24 13:15:00,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:15:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-24 13:15:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 13:15:00,728 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:00,728 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:00,728 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:15:00,729 INFO L82 PathProgramCache]: Analyzing trace with hash -524727421, now seen corresponding path program 1 times [2018-01-24 13:15:00,729 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:00,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:00,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:00,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:00,730 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:00,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:00,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:00,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:15:00,770 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:00,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:15:00,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:15:00,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:15:00,771 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 3 states. [2018-01-24 13:15:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:00,784 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-01-24 13:15:00,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:15:00,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-01-24 13:15:00,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:00,786 INFO L225 Difference]: With dead ends: 117 [2018-01-24 13:15:00,786 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 13:15:00,787 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:15:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 13:15:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-24 13:15:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 13:15:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-24 13:15:00,793 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 32 [2018-01-24 13:15:00,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:00,794 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-24 13:15:00,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:15:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-24 13:15:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 13:15:00,795 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:00,795 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:00,795 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:15:00,796 INFO L82 PathProgramCache]: Analyzing trace with hash 947709807, now seen corresponding path program 1 times [2018-01-24 13:15:00,796 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:00,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:00,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:00,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:00,797 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:00,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:00,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:00,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:15:00,831 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:00,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:15:00,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:15:00,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:15:00,832 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 3 states. [2018-01-24 13:15:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:00,845 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-01-24 13:15:00,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:15:00,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-01-24 13:15:00,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:00,846 INFO L225 Difference]: With dead ends: 99 [2018-01-24 13:15:00,846 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 13:15:00,847 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:15:00,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 13:15:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-01-24 13:15:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 13:15:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-01-24 13:15:00,852 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 33 [2018-01-24 13:15:00,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:00,852 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-01-24 13:15:00,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:15:00,853 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-01-24 13:15:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 13:15:00,854 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:00,854 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:00,854 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:15:00,854 INFO L82 PathProgramCache]: Analyzing trace with hash 214855819, now seen corresponding path program 1 times [2018-01-24 13:15:00,854 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:00,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:00,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:00,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:00,855 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:00,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:00,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:00,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:15:00,923 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:00,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:15:00,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:15:00,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:15:00,924 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 4 states. [2018-01-24 13:15:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:00,964 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-01-24 13:15:00,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:15:00,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-24 13:15:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:00,966 INFO L225 Difference]: With dead ends: 84 [2018-01-24 13:15:00,966 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 13:15:00,966 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:15:00,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 13:15:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-01-24 13:15:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 13:15:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-01-24 13:15:00,972 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 35 [2018-01-24 13:15:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:00,972 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-01-24 13:15:00,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:15:00,972 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-01-24 13:15:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 13:15:00,973 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:00,973 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:00,973 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:15:00,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322185, now seen corresponding path program 1 times [2018-01-24 13:15:00,974 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:00,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:00,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:00,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:00,975 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:00,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:01,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:01,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:15:01,100 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:01,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:15:01,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:15:01,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:15:01,101 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 8 states. [2018-01-24 13:15:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:01,309 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-24 13:15:01,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:15:01,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-24 13:15:01,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:01,310 INFO L225 Difference]: With dead ends: 76 [2018-01-24 13:15:01,311 INFO L226 Difference]: Without dead ends: 75 [2018-01-24 13:15:01,311 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:15:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-24 13:15:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-24 13:15:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 13:15:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-01-24 13:15:01,316 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 35 [2018-01-24 13:15:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:01,316 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-01-24 13:15:01,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:15:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-01-24 13:15:01,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 13:15:01,317 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:01,317 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:01,318 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:15:01,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322186, now seen corresponding path program 1 times [2018-01-24 13:15:01,318 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:01,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:01,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:01,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:01,319 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:01,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:01,374 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:01,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:15:01,374 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:01,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:15:01,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:15:01,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:15:01,375 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2018-01-24 13:15:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:01,450 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-01-24 13:15:01,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:15:01,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-01-24 13:15:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:01,451 INFO L225 Difference]: With dead ends: 75 [2018-01-24 13:15:01,451 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 13:15:01,451 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:15:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 13:15:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 13:15:01,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 13:15:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-01-24 13:15:01,455 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 35 [2018-01-24 13:15:01,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:01,455 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-01-24 13:15:01,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:15:01,455 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-01-24 13:15:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 13:15:01,456 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:01,456 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:01,456 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:15:01,456 INFO L82 PathProgramCache]: Analyzing trace with hash 730389066, now seen corresponding path program 1 times [2018-01-24 13:15:01,456 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:01,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:01,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:01,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:01,457 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:01,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:01,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:01,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 13:15:01,656 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:01,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 13:15:01,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 13:15:01,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:15:01,657 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 10 states. [2018-01-24 13:15:01,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:01,882 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-01-24 13:15:01,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:15:01,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-01-24 13:15:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:01,883 INFO L225 Difference]: With dead ends: 74 [2018-01-24 13:15:01,883 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 13:15:01,884 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:15:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 13:15:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 13:15:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 13:15:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-01-24 13:15:01,889 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 37 [2018-01-24 13:15:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:01,890 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-01-24 13:15:01,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 13:15:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-01-24 13:15:01,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 13:15:01,890 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:01,890 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:01,890 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:15:01,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2123324108, now seen corresponding path program 1 times [2018-01-24 13:15:01,891 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:01,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:01,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:01,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:01,891 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:01,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:02,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:02,177 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-24 13:15:02,184 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:02,184 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:15:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:02,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:02,370 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-24 13:15:02,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:15:02,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:02,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:02,384 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-24 13:15:02,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-24 13:15:02,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-24 13:15:02,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:02,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:02,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-24 13:15:02,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-24 13:15:02,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 13:15:02,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:02,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:02,672 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-24 13:15:02,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-01-24 13:15:02,747 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 28 treesize of output 28 [2018-01-24 13:15:02,753 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 20 treesize of output 5 [2018-01-24 13:15:02,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:02,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:02,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:02,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-01-24 13:15:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:02,782 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:02,910 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 9 treesize of output 7 [2018-01-24 13:15:02,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 13:15:02,912 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:02,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:02,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-24 13:15:02,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:44 [2018-01-24 13:15:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:03,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:03,024 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-24 13:15:03,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:03,028 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:15:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:03,110 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:03,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:15:03,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:03,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:03,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-24 13:15:03,152 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-24 13:15:03,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:15:03,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:03,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:03,157 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-24 13:15:03,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-24 13:15:03,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:03,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:03,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-01-24 13:15:03,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:03,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:03,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:26 [2018-01-24 13:15:03,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-01-24 13:15:03,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-24 13:15:03,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:03,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:03,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:03,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2018-01-24 13:15:03,401 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 36 treesize of output 34 [2018-01-24 13:15:03,405 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 30 treesize of output 23 [2018-01-24 13:15:03,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:03,425 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 14 [2018-01-24 13:15:03,426 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:03,453 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 26 treesize of output 10 [2018-01-24 13:15:03,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:03,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:03,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:03,473 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:15 [2018-01-24 13:15:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:03,523 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:03,705 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 12 treesize of output 10 [2018-01-24 13:15:03,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-01-24 13:15:03,712 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:03,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:03,769 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 4 xjuncts. [2018-01-24 13:15:03,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:83 [2018-01-24 13:15:04,071 WARN L146 SmtUtils]: Spent 246ms on a formula simplification. DAG size of input: 57 DAG size of output 45 [2018-01-24 13:15:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:04,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:15:04,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11, 13, 11] total 34 [2018-01-24 13:15:04,203 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:15:04,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 13:15:04,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 13:15:04,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 13:15:04,205 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 20 states. [2018-01-24 13:15:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:05,142 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-01-24 13:15:05,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 13:15:05,143 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-01-24 13:15:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:05,144 INFO L225 Difference]: With dead ends: 82 [2018-01-24 13:15:05,144 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 13:15:05,146 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 128 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=362, Invalid=1708, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 13:15:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 13:15:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-01-24 13:15:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 13:15:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-01-24 13:15:05,154 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 40 [2018-01-24 13:15:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:05,154 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-01-24 13:15:05,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 13:15:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-01-24 13:15:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 13:15:05,156 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:05,156 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:05,156 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:15:05,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2123324109, now seen corresponding path program 1 times [2018-01-24 13:15:05,157 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:05,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:05,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:05,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:05,158 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:05,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:05,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:05,568 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-24 13:15:05,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:05,573 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:15:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:05,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:05,667 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-24 13:15:05,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:15:05,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:05,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:05,677 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-24 13:15:05,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:15:05,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:05,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:05,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:05,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-01-24 13:15:05,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:05,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 13:15:05,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:05,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:05,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:05,775 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 15 treesize of output 8 [2018-01-24 13:15:05,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:05,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:05,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-01-24 13:15:05,912 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 3 case distinctions, treesize of input 33 treesize of output 41 [2018-01-24 13:15:05,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-24 13:15:05,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:05,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:05,979 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 3 case distinctions, treesize of input 23 treesize of output 33 [2018-01-24 13:15:05,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-01-24 13:15:05,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,010 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:06,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-01-24 13:15:06,049 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 36 treesize of output 34 [2018-01-24 13:15:06,052 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 26 treesize of output 10 [2018-01-24 13:15:06,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,073 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 26 treesize of output 26 [2018-01-24 13:15:06,076 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 22 treesize of output 15 [2018-01-24 13:15:06,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,084 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 8 [2018-01-24 13:15:06,085 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,093 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 18 treesize of output 3 [2018-01-24 13:15:06,093 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:06,100 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-01-24 13:15:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:06,124 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:06,503 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 28 treesize of output 26 [2018-01-24 13:15:06,505 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 16 treesize of output 14 [2018-01-24 13:15:06,506 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:06,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:06,512 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 28 treesize of output 26 [2018-01-24 13:15:06,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-24 13:15:06,513 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:06,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:06,520 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 35 treesize of output 33 [2018-01-24 13:15:06,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-24 13:15:06,522 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:06,527 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:06,567 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 31 treesize of output 29 [2018-01-24 13:15:06,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:15:06,570 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,573 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,574 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 24 treesize of output 22 [2018-01-24 13:15:06,576 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 12 treesize of output 10 [2018-01-24 13:15:06,576 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,579 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,580 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 24 treesize of output 22 [2018-01-24 13:15:06,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:15:06,582 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,585 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 13:15:06,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 13:15:06,613 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,616 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,617 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 19 treesize of output 17 [2018-01-24 13:15:06,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 13:15:06,620 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,622 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-01-24 13:15:06,643 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:66, output treesize:70 [2018-01-24 13:15:06,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-01-24 13:15:06,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,793 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:06,793 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:06,794 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 16 treesize of output 7 [2018-01-24 13:15:06,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-01-24 13:15:06,810 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,826 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:06,826 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:06,827 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 25 treesize of output 16 [2018-01-24 13:15:06,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,841 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 16 treesize of output 14 [2018-01-24 13:15:06,841 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,853 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:06,854 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:15:06,854 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 16 treesize of output 7 [2018-01-24 13:15:06,855 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:06,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:15:06,865 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 16 variables, input treesize:106, output treesize:12 [2018-01-24 13:15:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:06,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:15:06,970 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-24 13:15:06,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:06,973 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:15:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:07,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:15:07,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:15:07,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:15:07,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-01-24 13:15:07,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:07,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:07,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 13:15:07,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 13:15:07,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:07,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:34 [2018-01-24 13:15:07,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:15:07,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-24 13:15:07,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,342 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-24 13:15:07,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:15:07,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:07,356 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:44 [2018-01-24 13:15:07,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:07,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:07,559 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 21 treesize of output 40 [2018-01-24 13:15:07,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:07,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:07,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:15:07,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-24 13:15:07,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:07,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:50 [2018-01-24 13:15:07,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2018-01-24 13:15:07,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-01-24 13:15:07,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-01-24 13:15:07,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-01-24 13:15:07,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:07,791 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:77, output treesize:69 [2018-01-24 13:15:07,860 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 44 treesize of output 40 [2018-01-24 13:15:07,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-24 13:15:07,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,880 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 32 treesize of output 14 [2018-01-24 13:15:07,880 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,908 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 26 treesize of output 26 [2018-01-24 13:15:07,910 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 22 treesize of output 15 [2018-01-24 13:15:07,911 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,919 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 8 [2018-01-24 13:15:07,920 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,928 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 18 treesize of output 3 [2018-01-24 13:15:07,928 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,931 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:07,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:07,938 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:83, output treesize:31 [2018-01-24 13:15:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:07,980 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:15:08,202 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 28 treesize of output 26 [2018-01-24 13:15:08,204 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 16 treesize of output 14 [2018-01-24 13:15:08,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:08,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:08,211 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 28 treesize of output 26 [2018-01-24 13:15:08,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-24 13:15:08,213 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:08,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:08,219 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 35 treesize of output 33 [2018-01-24 13:15:08,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-24 13:15:08,222 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:08,227 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:15:08,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 13:15:08,269 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 7 treesize of output 5 [2018-01-24 13:15:08,269 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:08,272 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:08,273 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 19 treesize of output 17 [2018-01-24 13:15:08,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 13:15:08,274 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:08,276 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:08,309 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 31 treesize of output 29 [2018-01-24 13:15:08,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:15:08,311 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:08,313 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:08,314 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 24 treesize of output 22 [2018-01-24 13:15:08,316 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 12 treesize of output 10 [2018-01-24 13:15:08,316 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:08,318 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:08,319 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 24 treesize of output 22 [2018-01-24 13:15:08,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:15:08,321 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 13:15:08,324 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:15:08,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-01-24 13:15:08,344 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:66, output treesize:70 [2018-01-24 13:15:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:08,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:15:08,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 13, 14, 13] total 49 [2018-01-24 13:15:08,786 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:15:08,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 13:15:08,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 13:15:08,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2225, Unknown=1, NotChecked=0, Total=2450 [2018-01-24 13:15:08,787 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 26 states. [2018-01-24 13:15:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:09,926 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-01-24 13:15:09,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 13:15:09,926 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 40 [2018-01-24 13:15:09,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:09,927 INFO L225 Difference]: With dead ends: 84 [2018-01-24 13:15:09,927 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 13:15:09,928 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 13 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=577, Invalid=3582, Unknown=1, NotChecked=0, Total=4160 [2018-01-24 13:15:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 13:15:09,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2018-01-24 13:15:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 13:15:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-01-24 13:15:09,933 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 40 [2018-01-24 13:15:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:09,933 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-01-24 13:15:09,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 13:15:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-01-24 13:15:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 13:15:09,934 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:09,934 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:09,934 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:15:09,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1242227968, now seen corresponding path program 1 times [2018-01-24 13:15:09,935 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:09,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:09,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:09,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:09,936 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:15:09,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:15:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:15:10,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:15:10,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:15:10,021 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:15:10,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:15:10,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:15:10,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:15:10,021 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 5 states. [2018-01-24 13:15:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:15:10,102 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-01-24 13:15:10,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:15:10,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-24 13:15:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:15:10,103 INFO L225 Difference]: With dead ends: 116 [2018-01-24 13:15:10,103 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 13:15:10,103 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:15:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 13:15:10,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-01-24 13:15:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 13:15:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-01-24 13:15:10,107 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 42 [2018-01-24 13:15:10,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:15:10,107 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-01-24 13:15:10,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:15:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-01-24 13:15:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 13:15:10,107 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:15:10,108 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:15:10,108 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:15:10,108 INFO L82 PathProgramCache]: Analyzing trace with hash -221032996, now seen corresponding path program 1 times [2018-01-24 13:15:10,108 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:15:10,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:10,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:15:10,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:15:10,109 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:15:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 13:15:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 13:15:10,154 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 13:15:10,176 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 13:15:10,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:15:10 BoogieIcfgContainer [2018-01-24 13:15:10,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:15:10,199 INFO L168 Benchmark]: Toolchain (without parser) took 12809.45 ms. Allocated memory was 308.3 MB in the beginning and 591.4 MB in the end (delta: 283.1 MB). Free memory was 268.3 MB in the beginning and 421.1 MB in the end (delta: -152.8 MB). Peak memory consumption was 130.3 MB. Max. memory is 5.3 GB. [2018-01-24 13:15:10,200 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:15:10,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.63 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 256.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:15:10,201 INFO L168 Benchmark]: Boogie Preprocessor took 35.52 ms. Allocated memory is still 308.3 MB. Free memory was 256.3 MB in the beginning and 255.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 13:15:10,201 INFO L168 Benchmark]: RCFGBuilder took 435.41 ms. Allocated memory is still 308.3 MB. Free memory was 255.3 MB in the beginning and 227.4 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-01-24 13:15:10,201 INFO L168 Benchmark]: TraceAbstraction took 12122.12 ms. Allocated memory was 308.3 MB in the beginning and 591.4 MB in the end (delta: 283.1 MB). Free memory was 227.4 MB in the beginning and 421.1 MB in the end (delta: -193.7 MB). Peak memory consumption was 89.4 MB. Max. memory is 5.3 GB. [2018-01-24 13:15:10,203 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.63 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 256.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.52 ms. Allocated memory is still 308.3 MB. Free memory was 256.3 MB in the beginning and 255.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 435.41 ms. Allocated memory is still 308.3 MB. Free memory was 255.3 MB in the beginning and 227.4 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12122.12 ms. Allocated memory was 308.3 MB in the beginning and 591.4 MB in the end (delta: 283.1 MB). Free memory was 227.4 MB in the beginning and 421.1 MB in the end (delta: -193.7 MB). Peak memory consumption was 89.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=0, c=0] [L637] FCALL struct item *list = ((void *)0); VAL [\old(c)=0, c=0, list={9:0}] [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={9:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={9:0}] [L627] c++ VAL [\old(c)=0, c=1, plist={9:0}, plist={9:0}] [L628] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L629] EXPR, FCALL \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L629] FCALL item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L630] EXPR, FCALL item->next VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L632] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={12:0}, plist={9:0}, plist={9:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={12:0}, \old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={12:0}, plist={9:0}, plist={9:0}] [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={12:0}, \old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={12:0}, plist={9:0}, plist={9:0}] [L633] RET, FCALL *plist = item VAL [\old(c)=0, c=1, item={11:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={12:0}, plist={9:0}, plist={9:0}] [L640] append(&list) VAL [\old(c)=0, c=1, length=0, list={9:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={9:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={9:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={9:0}] [L647] EXPR, FCALL \read(*list) VAL [\old(c)=0, \read(*list)={11:0}, c=1, length=1, list={9:0}] [L647] EXPR, FCALL list->next VAL [\old(c)=0, \read(*list)={11:0}, c=1, length=1, list={9:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR, FCALL \read(*list) VAL [\old(c)=0, \read(*list)={11:0}, c=1, length=1, list={9:0}, next={0:0}] [L648] FCALL free(list) VAL [\old(c)=0, \read(*list)={11:0}, c=1, length=1, list={9:0}, next={0:0}] [L649] FCALL list = next VAL [\old(c)=0, c=1, length=1, list={9:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={9:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={9:0}, next={0:0}] [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, list={9:0}, next={0:0}] [L637] FCALL struct item *list = ((void *)0); VAL [\old(c)=0, \result=0, c=1, length=0, list={9:0}, next={0:0}] [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 43 error locations. UNSAFE Result, 12.0s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1145 SDtfs, 1018 SDslu, 2653 SDs, 0 SdLazy, 2177 SolverSat, 169 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 263 SyntacticMatches, 24 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred 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: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 64 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 779 ConstructedInterpolants, 88 QuantifiedInterpolants, 328127 SizeOfPredicates, 98 NumberOfNonLiveVariables, 856 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 30/100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-15-10-209.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-15-10-209.csv Received shutdown request...