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/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:07:39,591 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:07:39,593 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:07:39,607 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:07:39,607 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:07:39,608 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:07:39,610 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:07:39,612 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:07:39,614 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:07:39,614 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:07:39,615 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:07:39,616 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:07:39,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:07:39,618 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:07:39,619 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:07:39,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:07:39,624 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:07:39,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:07:39,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:07:39,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:07:39,630 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:07:39,630 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:07:39,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:07:39,632 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:07:39,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:07:39,634 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:07:39,634 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:07:39,635 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:07:39,635 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:07:39,635 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:07:39,636 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:07:39,636 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:07:39,646 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:07:39,646 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:07:39,647 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:07:39,647 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:07:39,647 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:07:39,647 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:07:39,648 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:07:39,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:07:39,648 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:07:39,649 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:07:39,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:07:39,649 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:07:39,649 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:07:39,649 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:07:39,650 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:07:39,650 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:07:39,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:07:39,650 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:07:39,650 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:07:39,651 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:07:39,651 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:07:39,651 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:07:39,651 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:07:39,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:07:39,652 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:07:39,652 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:07:39,652 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:07:39,652 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:07:39,652 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:07:39,653 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:07:39,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:07:39,653 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:07:39,654 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:07:39,654 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:07:39,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:07:39,701 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:07:39,705 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:07:39,707 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:07:39,707 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:07:39,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-01-24 13:07:39,878 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:07:39,884 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:07:39,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:07:39,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:07:39,890 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:07:39,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:07:39" (1/1) ... [2018-01-24 13:07:39,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc7c49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:39, skipping insertion in model container [2018-01-24 13:07:39,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:07:39" (1/1) ... [2018-01-24 13:07:39,911 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:07:39,953 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:07:40,076 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:07:40,095 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:07:40,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:40 WrapperNode [2018-01-24 13:07:40,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:07:40,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:07:40,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:07:40,103 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:07:40,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:40" (1/1) ... [2018-01-24 13:07:40,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:40" (1/1) ... [2018-01-24 13:07:40,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:40" (1/1) ... [2018-01-24 13:07:40,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:40" (1/1) ... [2018-01-24 13:07:40,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:40" (1/1) ... [2018-01-24 13:07:40,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:40" (1/1) ... [2018-01-24 13:07:40,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:40" (1/1) ... [2018-01-24 13:07:40,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:07:40,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:07:40,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:07:40,139 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:07:40,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:40" (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:07:40,185 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:07:40,185 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:07:40,186 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:07:40,186 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:07:40,186 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:07:40,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:07:40,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:07:40,186 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:07:40,186 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:07:40,187 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:07:40,187 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:07:40,187 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:07:40,187 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:07:40,187 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:07:40,654 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:07:40,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:07:40 BoogieIcfgContainer [2018-01-24 13:07:40,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:07:40,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:07:40,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:07:40,658 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:07:40,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:07:39" (1/3) ... [2018-01-24 13:07:40,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77492c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:07:40, skipping insertion in model container [2018-01-24 13:07:40,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:40" (2/3) ... [2018-01-24 13:07:40,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77492c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:07:40, skipping insertion in model container [2018-01-24 13:07:40,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:07:40" (3/3) ... [2018-01-24 13:07:40,662 INFO L105 eAbstractionObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-01-24 13:07:40,668 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:07:40,675 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-24 13:07:40,716 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:07:40,716 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:07:40,716 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:07:40,717 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:07:40,717 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:07:40,717 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:07:40,717 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:07:40,717 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:07:40,718 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:07:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-24 13:07:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 13:07:40,741 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:40,742 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:40,742 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:40,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1341839433, now seen corresponding path program 1 times [2018-01-24 13:07:40,748 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:40,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:40,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:40,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:40,789 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:40,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:40,892 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:07:40,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:40,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:07:40,894 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:40,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:07:40,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:07:40,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:07:40,911 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 4 states. [2018-01-24 13:07:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:41,346 INFO L93 Difference]: Finished difference Result 293 states and 335 transitions. [2018-01-24 13:07:41,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:07:41,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 13:07:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:41,361 INFO L225 Difference]: With dead ends: 293 [2018-01-24 13:07:41,361 INFO L226 Difference]: Without dead ends: 170 [2018-01-24 13:07:41,365 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:07:41,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-24 13:07:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 125. [2018-01-24 13:07:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-24 13:07:41,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-01-24 13:07:41,401 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 8 [2018-01-24 13:07:41,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:41,402 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-01-24 13:07:41,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:07:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-01-24 13:07:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 13:07:41,402 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:41,403 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:41,403 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1341839434, now seen corresponding path program 1 times [2018-01-24 13:07:41,403 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:41,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:41,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:41,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:41,404 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:41,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:41,503 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:07:41,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:41,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:07:41,504 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:41,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:07:41,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:07:41,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:07:41,506 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 4 states. [2018-01-24 13:07:41,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:41,681 INFO L93 Difference]: Finished difference Result 167 states and 185 transitions. [2018-01-24 13:07:41,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:07:41,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 13:07:41,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:41,685 INFO L225 Difference]: With dead ends: 167 [2018-01-24 13:07:41,685 INFO L226 Difference]: Without dead ends: 165 [2018-01-24 13:07:41,686 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:07:41,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-24 13:07:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 123. [2018-01-24 13:07:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 13:07:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2018-01-24 13:07:41,695 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 8 [2018-01-24 13:07:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:41,695 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2018-01-24 13:07:41,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:07:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-01-24 13:07:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:07:41,696 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:41,696 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:41,696 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:41,696 INFO L82 PathProgramCache]: Analyzing trace with hash 557054198, now seen corresponding path program 1 times [2018-01-24 13:07:41,696 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:41,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:41,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:41,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:41,697 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:41,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:41,746 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:07:41,747 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:41,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:07:41,747 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:41,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:07:41,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:07:41,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:07:41,748 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 4 states. [2018-01-24 13:07:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:41,972 INFO L93 Difference]: Finished difference Result 172 states and 196 transitions. [2018-01-24 13:07:41,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:07:41,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 13:07:41,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:41,974 INFO L225 Difference]: With dead ends: 172 [2018-01-24 13:07:41,975 INFO L226 Difference]: Without dead ends: 154 [2018-01-24 13:07:41,975 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:07:41,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-24 13:07:41,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 113. [2018-01-24 13:07:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 13:07:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2018-01-24 13:07:41,989 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 14 [2018-01-24 13:07:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:41,989 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2018-01-24 13:07:41,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:07:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2018-01-24 13:07:41,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:07:41,990 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:41,990 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:41,990 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:41,991 INFO L82 PathProgramCache]: Analyzing trace with hash 557054199, now seen corresponding path program 1 times [2018-01-24 13:07:41,991 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:41,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:41,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:41,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:41,993 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:42,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:42,095 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:07:42,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:42,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:07:42,095 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:42,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:07:42,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:07:42,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:07:42,096 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 5 states. [2018-01-24 13:07:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:42,376 INFO L93 Difference]: Finished difference Result 251 states and 285 transitions. [2018-01-24 13:07:42,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:07:42,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 13:07:42,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:42,378 INFO L225 Difference]: With dead ends: 251 [2018-01-24 13:07:42,379 INFO L226 Difference]: Without dead ends: 233 [2018-01-24 13:07:42,379 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:07:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-24 13:07:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 182. [2018-01-24 13:07:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-24 13:07:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 240 transitions. [2018-01-24 13:07:42,398 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 240 transitions. Word has length 14 [2018-01-24 13:07:42,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:42,398 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 240 transitions. [2018-01-24 13:07:42,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:07:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 240 transitions. [2018-01-24 13:07:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:07:42,399 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:42,399 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:42,399 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:42,400 INFO L82 PathProgramCache]: Analyzing trace with hash -505191267, now seen corresponding path program 1 times [2018-01-24 13:07:42,400 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:42,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:42,401 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:42,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:42,401 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:42,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:42,450 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:07:42,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:42,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:07:42,451 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:42,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:07:42,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:07:42,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:07:42,452 INFO L87 Difference]: Start difference. First operand 182 states and 240 transitions. Second operand 4 states. [2018-01-24 13:07:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:42,497 INFO L93 Difference]: Finished difference Result 198 states and 242 transitions. [2018-01-24 13:07:42,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:07:42,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-24 13:07:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:42,499 INFO L225 Difference]: With dead ends: 198 [2018-01-24 13:07:42,499 INFO L226 Difference]: Without dead ends: 195 [2018-01-24 13:07:42,500 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:07:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-24 13:07:42,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2018-01-24 13:07:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-24 13:07:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 238 transitions. [2018-01-24 13:07:42,515 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 238 transitions. Word has length 17 [2018-01-24 13:07:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:42,516 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 238 transitions. [2018-01-24 13:07:42,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:07:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2018-01-24 13:07:42,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 13:07:42,517 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:42,517 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] [2018-01-24 13:07:42,517 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:42,518 INFO L82 PathProgramCache]: Analyzing trace with hash -605576120, now seen corresponding path program 1 times [2018-01-24 13:07:42,518 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:42,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:42,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:42,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:42,519 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:42,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:42,565 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:07:42,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:42,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:07:42,565 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:42,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:07:42,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:07:42,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:07:42,566 INFO L87 Difference]: Start difference. First operand 182 states and 238 transitions. Second operand 3 states. [2018-01-24 13:07:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:42,576 INFO L93 Difference]: Finished difference Result 261 states and 355 transitions. [2018-01-24 13:07:42,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:07:42,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-24 13:07:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:42,578 INFO L225 Difference]: With dead ends: 261 [2018-01-24 13:07:42,578 INFO L226 Difference]: Without dead ends: 185 [2018-01-24 13:07:42,579 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:07:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-24 13:07:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-01-24 13:07:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-24 13:07:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 241 transitions. [2018-01-24 13:07:42,587 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 241 transitions. Word has length 22 [2018-01-24 13:07:42,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:42,587 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 241 transitions. [2018-01-24 13:07:42,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:07:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2018-01-24 13:07:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 13:07:42,588 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:42,588 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:42,589 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:42,589 INFO L82 PathProgramCache]: Analyzing trace with hash 927704743, now seen corresponding path program 1 times [2018-01-24 13:07:42,589 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:42,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:42,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:42,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:42,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:42,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:42,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:42,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:07:42,629 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:42,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:07:42,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:07:42,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:07:42,629 INFO L87 Difference]: Start difference. First operand 185 states and 241 transitions. Second operand 3 states. [2018-01-24 13:07:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:42,644 INFO L93 Difference]: Finished difference Result 363 states and 477 transitions. [2018-01-24 13:07:42,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:07:42,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-24 13:07:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:42,646 INFO L225 Difference]: With dead ends: 363 [2018-01-24 13:07:42,646 INFO L226 Difference]: Without dead ends: 187 [2018-01-24 13:07:42,648 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:07:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-24 13:07:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-01-24 13:07:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-24 13:07:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 243 transitions. [2018-01-24 13:07:42,659 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 243 transitions. Word has length 22 [2018-01-24 13:07:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:42,660 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 243 transitions. [2018-01-24 13:07:42,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:07:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 243 transitions. [2018-01-24 13:07:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 13:07:42,661 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:42,661 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:42,661 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:42,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2088156413, now seen corresponding path program 1 times [2018-01-24 13:07:42,662 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:42,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:42,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:42,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:42,663 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:42,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:42,709 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:07:42,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:42,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:07:42,709 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:42,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:07:42,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:07:42,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:07:42,710 INFO L87 Difference]: Start difference. First operand 187 states and 243 transitions. Second operand 3 states. [2018-01-24 13:07:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:42,749 INFO L93 Difference]: Finished difference Result 280 states and 367 transitions. [2018-01-24 13:07:42,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:07:42,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-24 13:07:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:42,751 INFO L225 Difference]: With dead ends: 280 [2018-01-24 13:07:42,751 INFO L226 Difference]: Without dead ends: 201 [2018-01-24 13:07:42,751 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:07:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-01-24 13:07:42,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2018-01-24 13:07:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-24 13:07:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 243 transitions. [2018-01-24 13:07:42,759 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 243 transitions. Word has length 24 [2018-01-24 13:07:42,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:42,759 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 243 transitions. [2018-01-24 13:07:42,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:07:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 243 transitions. [2018-01-24 13:07:42,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 13:07:42,761 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:42,761 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:42,761 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:42,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1439697764, now seen corresponding path program 1 times [2018-01-24 13:07:42,761 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:42,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:42,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:42,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:42,763 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:42,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:42,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:42,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:07:42,902 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:42,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:07:42,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:07:42,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:07:42,902 INFO L87 Difference]: Start difference. First operand 190 states and 243 transitions. Second operand 6 states. [2018-01-24 13:07:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:43,242 INFO L93 Difference]: Finished difference Result 471 states and 593 transitions. [2018-01-24 13:07:43,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:07:43,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 13:07:43,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:43,244 INFO L225 Difference]: With dead ends: 471 [2018-01-24 13:07:43,245 INFO L226 Difference]: Without dead ends: 290 [2018-01-24 13:07:43,246 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:07:43,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-01-24 13:07:43,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 206. [2018-01-24 13:07:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-24 13:07:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 264 transitions. [2018-01-24 13:07:43,255 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 264 transitions. Word has length 24 [2018-01-24 13:07:43,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:43,255 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 264 transitions. [2018-01-24 13:07:43,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:07:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 264 transitions. [2018-01-24 13:07:43,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 13:07:43,257 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:43,257 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] [2018-01-24 13:07:43,257 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:43,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1566782653, now seen corresponding path program 1 times [2018-01-24 13:07:43,257 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:43,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:43,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:43,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:43,259 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:43,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:43,348 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:07:43,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:43,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:07:43,349 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:43,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:07:43,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:07:43,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:07:43,350 INFO L87 Difference]: Start difference. First operand 206 states and 264 transitions. Second operand 5 states. [2018-01-24 13:07:43,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:43,667 INFO L93 Difference]: Finished difference Result 330 states and 414 transitions. [2018-01-24 13:07:43,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:07:43,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 13:07:43,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:43,670 INFO L225 Difference]: With dead ends: 330 [2018-01-24 13:07:43,670 INFO L226 Difference]: Without dead ends: 329 [2018-01-24 13:07:43,670 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:07:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-01-24 13:07:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 205. [2018-01-24 13:07:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-01-24 13:07:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 262 transitions. [2018-01-24 13:07:43,686 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 262 transitions. Word has length 25 [2018-01-24 13:07:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:43,686 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 262 transitions. [2018-01-24 13:07:43,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:07:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 262 transitions. [2018-01-24 13:07:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 13:07:43,687 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:43,687 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] [2018-01-24 13:07:43,687 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:43,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1566782654, now seen corresponding path program 1 times [2018-01-24 13:07:43,688 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:43,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:43,689 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:43,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:43,689 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:43,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:43,793 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:07:43,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:43,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:07:43,793 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:43,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:07:43,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:07:43,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:07:43,794 INFO L87 Difference]: Start difference. First operand 205 states and 262 transitions. Second operand 5 states. [2018-01-24 13:07:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:44,172 INFO L93 Difference]: Finished difference Result 365 states and 471 transitions. [2018-01-24 13:07:44,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:07:44,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 13:07:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:44,174 INFO L225 Difference]: With dead ends: 365 [2018-01-24 13:07:44,174 INFO L226 Difference]: Without dead ends: 364 [2018-01-24 13:07:44,175 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:07:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-01-24 13:07:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 204. [2018-01-24 13:07:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-24 13:07:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 260 transitions. [2018-01-24 13:07:44,190 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 260 transitions. Word has length 25 [2018-01-24 13:07:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:44,190 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 260 transitions. [2018-01-24 13:07:44,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:07:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 260 transitions. [2018-01-24 13:07:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 13:07:44,191 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:44,192 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:44,192 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:44,192 INFO L82 PathProgramCache]: Analyzing trace with hash -554334541, now seen corresponding path program 1 times [2018-01-24 13:07:44,192 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:44,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:44,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:44,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:44,193 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:44,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:44,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:44,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:07:44,276 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:44,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:07:44,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:07:44,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:07:44,277 INFO L87 Difference]: Start difference. First operand 204 states and 260 transitions. Second operand 6 states. [2018-01-24 13:07:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:44,503 INFO L93 Difference]: Finished difference Result 369 states and 467 transitions. [2018-01-24 13:07:44,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:07:44,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 13:07:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:44,505 INFO L225 Difference]: With dead ends: 369 [2018-01-24 13:07:44,506 INFO L226 Difference]: Without dead ends: 287 [2018-01-24 13:07:44,506 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:07:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-24 13:07:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 242. [2018-01-24 13:07:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-01-24 13:07:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 319 transitions. [2018-01-24 13:07:44,526 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 319 transitions. Word has length 26 [2018-01-24 13:07:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:44,527 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 319 transitions. [2018-01-24 13:07:44,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:07:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 319 transitions. [2018-01-24 13:07:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:07:44,528 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:44,528 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:44,528 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:44,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1703794537, now seen corresponding path program 1 times [2018-01-24 13:07:44,529 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:44,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:44,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:44,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:44,530 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:44,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:44,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:07:44,641 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:07:44,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:44,653 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:07:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:44,689 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:07:44,845 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~n~4.base Int)) (and (not (= 0 main_~n~4.base)) (= |c_#valid| (store |c_old(#valid)| main_~n~4.base 0)) (= 0 (select |c_old(#valid)| main_~n~4.base)))) is different from true [2018-01-24 13:07:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-24 13:07:44,858 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:07:45,050 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_3| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_3|))) (= 0 |v_main_#t~malloc0.base_3|) (= (store |c_#valid| |v_main_#t~malloc0.base_3| 0) |c_old(#valid)|))) is different from false [2018-01-24 13:07:45,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:45,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:07:45,105 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:07:45,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:45,117 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:07:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:45,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:07:45,182 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:07:45,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:45,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:45,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:07:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:45,414 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:07:45,442 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_4| Int)) (or (= (store |c_#valid| |v_main_#t~malloc0.base_4| 0) |c_old(#valid)|) (= 0 |v_main_#t~malloc0.base_4|) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_4|))))) is different from false [2018-01-24 13:07:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:45,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:07:45,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7, 7, 6] total 21 [2018-01-24 13:07:45,469 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:07:45,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:07:45,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:07:45,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=281, Unknown=7, NotChecked=108, Total=462 [2018-01-24 13:07:45,470 INFO L87 Difference]: Start difference. First operand 242 states and 319 transitions. Second operand 11 states. [2018-01-24 13:07:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:46,048 INFO L93 Difference]: Finished difference Result 342 states and 437 transitions. [2018-01-24 13:07:46,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:07:46,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-01-24 13:07:46,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:46,051 INFO L225 Difference]: With dead ends: 342 [2018-01-24 13:07:46,051 INFO L226 Difference]: Without dead ends: 339 [2018-01-24 13:07:46,052 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=526, Unknown=7, NotChecked=150, Total=812 [2018-01-24 13:07:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-01-24 13:07:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 251. [2018-01-24 13:07:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-01-24 13:07:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 329 transitions. [2018-01-24 13:07:46,068 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 329 transitions. Word has length 28 [2018-01-24 13:07:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:46,069 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 329 transitions. [2018-01-24 13:07:46,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:07:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 329 transitions. [2018-01-24 13:07:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:07:46,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:46,070 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:46,070 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:46,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1703794284, now seen corresponding path program 1 times [2018-01-24 13:07:46,070 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:46,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:46,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:46,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:46,072 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:46,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:46,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:46,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:07:46,117 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:46,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:07:46,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:07:46,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:07:46,118 INFO L87 Difference]: Start difference. First operand 251 states and 329 transitions. Second operand 3 states. [2018-01-24 13:07:46,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:46,146 INFO L93 Difference]: Finished difference Result 271 states and 336 transitions. [2018-01-24 13:07:46,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:07:46,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 13:07:46,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:46,148 INFO L225 Difference]: With dead ends: 271 [2018-01-24 13:07:46,148 INFO L226 Difference]: Without dead ends: 221 [2018-01-24 13:07:46,149 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:07:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-24 13:07:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2018-01-24 13:07:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-24 13:07:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 274 transitions. [2018-01-24 13:07:46,159 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 274 transitions. Word has length 28 [2018-01-24 13:07:46,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:46,159 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 274 transitions. [2018-01-24 13:07:46,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:07:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 274 transitions. [2018-01-24 13:07:46,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:07:46,160 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:46,160 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:46,160 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1964814354, now seen corresponding path program 1 times [2018-01-24 13:07:46,160 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:46,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:46,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:46,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:46,161 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:46,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:46,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:46,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:07:46,304 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:46,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:07:46,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:07:46,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:07:46,304 INFO L87 Difference]: Start difference. First operand 220 states and 274 transitions. Second operand 6 states. [2018-01-24 13:07:47,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:47,014 INFO L93 Difference]: Finished difference Result 320 states and 409 transitions. [2018-01-24 13:07:47,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:07:47,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 13:07:47,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:47,016 INFO L225 Difference]: With dead ends: 320 [2018-01-24 13:07:47,016 INFO L226 Difference]: Without dead ends: 232 [2018-01-24 13:07:47,016 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:07:47,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-24 13:07:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 225. [2018-01-24 13:07:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-24 13:07:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 280 transitions. [2018-01-24 13:07:47,027 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 280 transitions. Word has length 28 [2018-01-24 13:07:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:47,027 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 280 transitions. [2018-01-24 13:07:47,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:07:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2018-01-24 13:07:47,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:07:47,028 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:47,028 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:47,028 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:47,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1959088716, now seen corresponding path program 1 times [2018-01-24 13:07:47,028 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:47,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:47,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:47,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:47,029 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:47,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:47,420 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 24 DAG size of output 16 [2018-01-24 13:07:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:47,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:47,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:07:47,505 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:47,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:07:47,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:07:47,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:07:47,505 INFO L87 Difference]: Start difference. First operand 225 states and 280 transitions. Second operand 8 states. [2018-01-24 13:07:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:48,107 INFO L93 Difference]: Finished difference Result 426 states and 516 transitions. [2018-01-24 13:07:48,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:07:48,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-24 13:07:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:48,109 INFO L225 Difference]: With dead ends: 426 [2018-01-24 13:07:48,109 INFO L226 Difference]: Without dead ends: 322 [2018-01-24 13:07:48,110 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:07:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-01-24 13:07:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 273. [2018-01-24 13:07:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-01-24 13:07:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 352 transitions. [2018-01-24 13:07:48,122 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 352 transitions. Word has length 28 [2018-01-24 13:07:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:48,123 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 352 transitions. [2018-01-24 13:07:48,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:07:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 352 transitions. [2018-01-24 13:07:48,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:07:48,123 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:48,123 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:48,123 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:48,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1682499776, now seen corresponding path program 1 times [2018-01-24 13:07:48,123 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:48,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:48,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:48,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:48,125 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:48,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:48,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:48,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:07:48,290 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:48,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:07:48,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:07:48,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:07:48,291 INFO L87 Difference]: Start difference. First operand 273 states and 352 transitions. Second operand 9 states. [2018-01-24 13:07:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:49,072 INFO L93 Difference]: Finished difference Result 398 states and 517 transitions. [2018-01-24 13:07:49,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:07:49,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-24 13:07:49,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:49,074 INFO L225 Difference]: With dead ends: 398 [2018-01-24 13:07:49,074 INFO L226 Difference]: Without dead ends: 397 [2018-01-24 13:07:49,074 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:07:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-01-24 13:07:49,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 272. [2018-01-24 13:07:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-24 13:07:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 349 transitions. [2018-01-24 13:07:49,093 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 349 transitions. Word has length 28 [2018-01-24 13:07:49,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:49,094 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 349 transitions. [2018-01-24 13:07:49,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:07:49,094 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 349 transitions. [2018-01-24 13:07:49,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:07:49,094 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:49,095 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:49,095 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:49,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1682499775, now seen corresponding path program 1 times [2018-01-24 13:07:49,095 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:49,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:49,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:49,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:49,096 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:49,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:49,296 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:07:49,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:49,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:07:49,297 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:49,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:07:49,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:07:49,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:07:49,298 INFO L87 Difference]: Start difference. First operand 272 states and 349 transitions. Second operand 9 states. [2018-01-24 13:07:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:49,921 INFO L93 Difference]: Finished difference Result 397 states and 514 transitions. [2018-01-24 13:07:49,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:07:49,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-24 13:07:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:49,923 INFO L225 Difference]: With dead ends: 397 [2018-01-24 13:07:49,923 INFO L226 Difference]: Without dead ends: 396 [2018-01-24 13:07:49,923 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:07:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-01-24 13:07:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 271. [2018-01-24 13:07:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-24 13:07:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 346 transitions. [2018-01-24 13:07:49,935 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 346 transitions. Word has length 28 [2018-01-24 13:07:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:49,935 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 346 transitions. [2018-01-24 13:07:49,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:07:49,936 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 346 transitions. [2018-01-24 13:07:49,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:07:49,936 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:49,936 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] [2018-01-24 13:07:49,936 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:49,936 INFO L82 PathProgramCache]: Analyzing trace with hash -546988646, now seen corresponding path program 1 times [2018-01-24 13:07:49,936 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:49,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:49,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:49,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:49,937 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:49,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:49,981 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:07:49,982 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:49,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:07:49,982 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:49,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:07:49,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:07:49,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:07:49,983 INFO L87 Difference]: Start difference. First operand 271 states and 346 transitions. Second operand 5 states. [2018-01-24 13:07:50,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:50,136 INFO L93 Difference]: Finished difference Result 397 states and 497 transitions. [2018-01-24 13:07:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:07:50,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 13:07:50,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:50,138 INFO L225 Difference]: With dead ends: 397 [2018-01-24 13:07:50,138 INFO L226 Difference]: Without dead ends: 396 [2018-01-24 13:07:50,138 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:07:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-01-24 13:07:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 270. [2018-01-24 13:07:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-01-24 13:07:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 344 transitions. [2018-01-24 13:07:50,148 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 344 transitions. Word has length 29 [2018-01-24 13:07:50,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:50,149 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 344 transitions. [2018-01-24 13:07:50,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:07:50,149 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 344 transitions. [2018-01-24 13:07:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:07:50,149 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:50,149 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] [2018-01-24 13:07:50,149 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:50,149 INFO L82 PathProgramCache]: Analyzing trace with hash -546988645, now seen corresponding path program 1 times [2018-01-24 13:07:50,149 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:50,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:50,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:50,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:50,150 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:50,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:50,263 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:07:50,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:50,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:07:50,263 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:50,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:07:50,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:07:50,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:07:50,264 INFO L87 Difference]: Start difference. First operand 270 states and 344 transitions. Second operand 5 states. [2018-01-24 13:07:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:50,467 INFO L93 Difference]: Finished difference Result 405 states and 504 transitions. [2018-01-24 13:07:50,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:07:50,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 13:07:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:50,470 INFO L225 Difference]: With dead ends: 405 [2018-01-24 13:07:50,470 INFO L226 Difference]: Without dead ends: 404 [2018-01-24 13:07:50,470 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:07:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-01-24 13:07:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 269. [2018-01-24 13:07:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-01-24 13:07:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 342 transitions. [2018-01-24 13:07:50,488 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 342 transitions. Word has length 29 [2018-01-24 13:07:50,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:50,488 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 342 transitions. [2018-01-24 13:07:50,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:07:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 342 transitions. [2018-01-24 13:07:50,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 13:07:50,489 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:50,489 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:07:50,489 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:50,490 INFO L82 PathProgramCache]: Analyzing trace with hash -232740570, now seen corresponding path program 1 times [2018-01-24 13:07:50,490 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:50,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:50,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:50,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:50,491 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:50,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:50,655 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:07:50,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:50,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:07:50,655 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:50,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:07:50,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:07:50,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:07:50,656 INFO L87 Difference]: Start difference. First operand 269 states and 342 transitions. Second operand 9 states. [2018-01-24 13:07:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:50,984 INFO L93 Difference]: Finished difference Result 356 states and 460 transitions. [2018-01-24 13:07:50,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:07:50,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-24 13:07:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:50,986 INFO L225 Difference]: With dead ends: 356 [2018-01-24 13:07:50,986 INFO L226 Difference]: Without dead ends: 355 [2018-01-24 13:07:50,986 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:07:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-24 13:07:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 268. [2018-01-24 13:07:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-01-24 13:07:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 341 transitions. [2018-01-24 13:07:51,001 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 341 transitions. Word has length 32 [2018-01-24 13:07:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:51,001 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 341 transitions. [2018-01-24 13:07:51,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:07:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 341 transitions. [2018-01-24 13:07:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 13:07:51,002 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:51,002 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:07:51,002 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:51,002 INFO L82 PathProgramCache]: Analyzing trace with hash -232740571, now seen corresponding path program 1 times [2018-01-24 13:07:51,002 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:51,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:51,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:51,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:51,004 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:51,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:51,171 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:07:51,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:51,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:07:51,172 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:51,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:07:51,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:07:51,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:07:51,173 INFO L87 Difference]: Start difference. First operand 268 states and 341 transitions. Second operand 9 states. [2018-01-24 13:07:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:51,555 INFO L93 Difference]: Finished difference Result 355 states and 459 transitions. [2018-01-24 13:07:51,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:07:51,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-24 13:07:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:51,557 INFO L225 Difference]: With dead ends: 355 [2018-01-24 13:07:51,557 INFO L226 Difference]: Without dead ends: 354 [2018-01-24 13:07:51,557 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:07:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-01-24 13:07:51,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 267. [2018-01-24 13:07:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-01-24 13:07:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 340 transitions. [2018-01-24 13:07:51,568 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 340 transitions. Word has length 32 [2018-01-24 13:07:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:51,568 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 340 transitions. [2018-01-24 13:07:51,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:07:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 340 transitions. [2018-01-24 13:07:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 13:07:51,568 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:51,569 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:51,569 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:07:51,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1058981609, now seen corresponding path program 1 times [2018-01-24 13:07:51,569 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:51,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:51,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:51,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:51,570 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:51,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:51,974 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:07:51,974 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:07:51,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:51,979 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:07:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:52,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:07:52,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:52,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:52,128 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:07:52,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:52,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:52,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-01-24 13:07:52,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 13:07:52,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:52,171 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:07:52,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:52,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:52,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 13:07:52,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:52,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 13:07:52,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:52,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:52,208 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:07:52,208 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:56 [2018-01-24 13:07:52,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-01-24 13:07:52,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-24 13:07:52,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:52,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:52,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 69 [2018-01-24 13:07:52,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-24 13:07:52,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:52,316 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:52,329 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:07:52,330 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:82 [2018-01-24 13:07:52,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 91 [2018-01-24 13:07:52,425 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 22 treesize of output 29 [2018-01-24 13:07:52,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:52,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:52,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2018-01-24 13:07:52,460 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 22 treesize of output 29 [2018-01-24 13:07:52,460 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:52,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:52,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:07:52,480 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:106 [2018-01-24 13:07:58,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-01-24 13:07:58,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:58,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-24 13:07:58,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:58,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-24 13:07:58,617 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:58,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:58,629 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:07:58,630 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:94, output treesize:59 [2018-01-24 13:07:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:58,713 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:07:59,252 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 47 treesize of output 51 [2018-01-24 13:07:59,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2018-01-24 13:07:59,260 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:07:59,287 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 46 treesize of output 40 [2018-01-24 13:07:59,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-01-24 13:07:59,315 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:07:59,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 13:07:59,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-01-24 13:07:59,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 13:07:59,348 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,356 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:07:59,357 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:07:59,364 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:07:59,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-24 13:07:59,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 13:07:59,427 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,435 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 6 treesize of output 1 [2018-01-24 13:07:59,435 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,441 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-01-24 13:07:59,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 13:07:59,446 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 13:07:59,451 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,455 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,461 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 38 treesize of output 42 [2018-01-24 13:07:59,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-24 13:07:59,464 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 13:07:59,486 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-01-24 13:07:59,505 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,515 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2018-01-24 13:07:59,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-01-24 13:07:59,525 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,543 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 29 treesize of output 23 [2018-01-24 13:07:59,543 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-01-24 13:07:59,558 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,570 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:07:59,625 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 47 treesize of output 49 [2018-01-24 13:07:59,627 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 44 treesize of output 38 [2018-01-24 13:07:59,628 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-01-24 13:07:59,647 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:07:59,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-24 13:07:59,667 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:07:59,693 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 13:07:59,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-24 13:07:59,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 13:07:59,698 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,706 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 12 [2018-01-24 13:07:59,707 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:07:59,713 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:07:59,767 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 34 treesize of output 32 [2018-01-24 13:07:59,769 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 6 treesize of output 1 [2018-01-24 13:07:59,769 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,776 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,777 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 34 treesize of output 32 [2018-01-24 13:07:59,779 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 6 treesize of output 1 [2018-01-24 13:07:59,779 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,784 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,786 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 29 treesize of output 27 [2018-01-24 13:07:59,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 13:07:59,788 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,792 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:59,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2018-01-24 13:07:59,837 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 6 variables, input treesize:125, output treesize:184 [2018-01-24 13:08:00,623 WARN L146 SmtUtils]: Spent 727ms on a formula simplification. DAG size of input: 102 DAG size of output 46 [2018-01-24 13:08:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:08:00,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:08:00,664 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:08:00,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:08:00,669 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:08:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:08:00,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:08:00,736 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:08:00,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:00,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:00,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:08:00,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 13:08:00,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 13:08:00,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:00,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:00,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:00,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-24 13:08:01,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:08:01,021 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:08:01,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 13:08:01,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:37 [2018-01-24 13:08:01,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 13:08:01,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:08:01,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 13:08:01,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-01-24 13:08:01,099 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:08:01,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:08:01,100 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:08:01,102 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 23 treesize of output 36 [2018-01-24 13:08:01,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,117 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:34 [2018-01-24 13:08:01,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 68 [2018-01-24 13:08:01,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-24 13:08:01,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-01-24 13:08:01,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-24 13:08:01,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,231 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:08:01,231 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2018-01-24 13:08:01,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-01-24 13:08:01,341 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 22 treesize of output 29 [2018-01-24 13:08:01,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2018-01-24 13:08:01,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-24 13:08:01,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:01,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:08:01,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:84 [2018-01-24 13:08:07,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-01-24 13:08:07,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-24 13:08:07,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:07,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-01-24 13:08:07,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:08:07,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:08:07,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-24 13:08:07,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-24 13:08:07,566 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:07,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 13:08:07,570 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:07,571 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:07,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:07,574 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:7 [2018-01-24 13:08:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:08:07,641 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:08:08,168 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 36 treesize of output 34 [2018-01-24 13:08:08,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 13:08:08,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:08,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:08,193 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 33 treesize of output 37 [2018-01-24 13:08:08,198 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 32 treesize of output 30 [2018-01-24 13:08:08,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:08,215 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 27 treesize of output 21 [2018-01-24 13:08:08,216 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:08,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-01-24 13:08:08,232 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:08,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:08:08,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-01-24 13:08:08,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 13:08:08,252 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:08,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 13:08:08,258 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:08,262 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:08,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2018-01-24 13:08:08,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-01-24 13:08:08,306 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:08,338 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 34 treesize of output 28 [2018-01-24 13:08:08,338 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:08,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-24 13:08:08,354 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:08,367 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:08:08,402 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 40 treesize of output 38 [2018-01-24 13:08:08,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 13:08:08,404 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-24 13:08:08,409 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:08:08,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-24 13:08:08,434 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 5 variables, input treesize:81, output treesize:95 [2018-01-24 13:08:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:08:10,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:08:10,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 13, 18, 11] total 67 [2018-01-24 13:08:10,529 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:08:10,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-24 13:08:10,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-24 13:08:10,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=3842, Unknown=7, NotChecked=0, Total=4422 [2018-01-24 13:08:10,531 INFO L87 Difference]: Start difference. First operand 267 states and 340 transitions. Second operand 33 states. Received shutdown request... [2018-01-24 13:08:43,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 13:08:43,020 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 13:08:43,025 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 13:08:43,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:08:43 BoogieIcfgContainer [2018-01-24 13:08:43,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:08:43,027 INFO L168 Benchmark]: Toolchain (without parser) took 63148.22 ms. Allocated memory was 310.4 MB in the beginning and 590.3 MB in the end (delta: 280.0 MB). Free memory was 270.4 MB in the beginning and 347.7 MB in the end (delta: -77.3 MB). Peak memory consumption was 202.7 MB. Max. memory is 5.3 GB. [2018-01-24 13:08:43,027 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 310.4 MB. Free memory is still 276.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:08:43,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.44 ms. Allocated memory is still 310.4 MB. Free memory was 269.4 MB in the beginning and 258.5 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:08:43,028 INFO L168 Benchmark]: Boogie Preprocessor took 35.96 ms. Allocated memory is still 310.4 MB. Free memory was 258.5 MB in the beginning and 256.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:08:43,028 INFO L168 Benchmark]: RCFGBuilder took 516.77 ms. Allocated memory is still 310.4 MB. Free memory was 256.5 MB in the beginning and 222.9 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:08:43,028 INFO L168 Benchmark]: TraceAbstraction took 62369.38 ms. Allocated memory was 310.4 MB in the beginning and 590.3 MB in the end (delta: 280.0 MB). Free memory was 222.9 MB in the beginning and 347.7 MB in the end (delta: -124.9 MB). Peak memory consumption was 155.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:08:43,030 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.16 ms. Allocated memory is still 310.4 MB. Free memory is still 276.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.44 ms. Allocated memory is still 310.4 MB. Free memory was 269.4 MB in the beginning and 258.5 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.96 ms. Allocated memory is still 310.4 MB. Free memory was 258.5 MB in the beginning and 256.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 516.77 ms. Allocated memory is still 310.4 MB. Free memory was 256.5 MB in the beginning and 222.9 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 62369.38 ms. Allocated memory was 310.4 MB in the beginning and 590.3 MB in the end (delta: 280.0 MB). Free memory was 222.9 MB in the beginning and 347.7 MB in the end (delta: -124.9 MB). Peak memory consumption was 155.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 16 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 55 error locations. TIMEOUT Result, 62.3s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 39.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2346 SDtfs, 4422 SDslu, 4959 SDs, 0 SdLazy, 4968 SolverSat, 286 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 516 GetRequests, 268 SyntacticMatches, 12 SemanticMatches, 235 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 39.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred in iteration=16, 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.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 1446 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 21.7s InterpolantComputationTime, 719 NumberOfCodeBlocks, 719 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 840 ConstructedInterpolants, 59 QuantifiedInterpolants, 403235 SizeOfPredicates, 55 NumberOfNonLiveVariables, 604 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 31 InterpolantComputations, 21 PerfectInterpolantSequences, 38/84 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-08-43-038.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-08-43-038.csv Completed graceful shutdown