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_Taipan+AI_EQ_imprecise.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 17:03:42,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:03:42,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:03:43,006 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:03:43,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:03:43,008 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:03:43,008 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:03:43,010 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:03:43,011 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:03:43,012 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:03:43,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:03:43,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:03:43,014 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:03:43,015 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:03:43,016 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:03:43,019 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:03:43,021 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:03:43,023 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:03:43,024 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:03:43,025 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:03:43,027 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:03:43,028 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:03:43,028 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:03:43,029 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:03:43,030 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:03:43,031 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:03:43,031 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:03:43,032 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:03:43,032 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:03:43,032 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:03:43,033 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:03:43,033 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:03:43,043 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:03:43,043 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:03:43,044 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:03:43,044 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:03:43,044 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:03:43,044 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:03:43,044 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:03:43,045 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:03:43,045 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:03:43,045 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:03:43,046 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:03:43,046 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:03:43,046 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:03:43,046 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:03:43,046 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:03:43,047 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:03:43,047 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:03:43,047 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:03:43,047 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:03:43,047 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:03:43,047 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:03:43,048 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:03:43,048 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:03:43,048 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:03:43,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:03:43,049 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:03:43,049 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:03:43,049 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:03:43,049 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:03:43,049 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:03:43,049 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:03:43,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:03:43,050 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:03:43,050 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:03:43,051 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:03:43,051 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:03:43,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:03:43,099 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:03:43,103 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:03:43,105 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:03:43,105 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:03:43,106 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 17:03:43,275 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:03:43,279 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:03:43,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:03:43,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:03:43,285 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:03:43,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:03:43" (1/1) ... [2018-01-24 17:03:43,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eaa2765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:43, skipping insertion in model container [2018-01-24 17:03:43,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:03:43" (1/1) ... [2018-01-24 17:03:43,303 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:03:43,341 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:03:43,462 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:03:43,480 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:03:43,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:43 WrapperNode [2018-01-24 17:03:43,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:03:43,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:03:43,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:03:43,490 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:03:43,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:43" (1/1) ... [2018-01-24 17:03:43,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:43" (1/1) ... [2018-01-24 17:03:43,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:43" (1/1) ... [2018-01-24 17:03:43,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:43" (1/1) ... [2018-01-24 17:03:43,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:43" (1/1) ... [2018-01-24 17:03:43,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:43" (1/1) ... [2018-01-24 17:03:43,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:43" (1/1) ... [2018-01-24 17:03:43,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:03:43,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:03:43,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:03:43,535 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:03:43,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:43" (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 17:03:43,581 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:03:43,581 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:03:43,581 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:03:43,581 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:03:43,581 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:03:43,582 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:03:43,582 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:03:43,582 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:03:43,582 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:03:43,582 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:03:43,582 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:03:43,583 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:03:43,583 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:03:43,583 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:03:44,046 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:03:44,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:03:44 BoogieIcfgContainer [2018-01-24 17:03:44,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:03:44,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:03:44,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:03:44,051 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:03:44,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:03:43" (1/3) ... [2018-01-24 17:03:44,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f1aa57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:03:44, skipping insertion in model container [2018-01-24 17:03:44,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:03:43" (2/3) ... [2018-01-24 17:03:44,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f1aa57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:03:44, skipping insertion in model container [2018-01-24 17:03:44,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:03:44" (3/3) ... [2018-01-24 17:03:44,054 INFO L105 eAbstractionObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-01-24 17:03:44,061 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:03:44,069 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-24 17:03:44,121 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:03:44,121 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:03:44,122 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:03:44,122 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:03:44,122 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:03:44,122 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:03:44,122 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:03:44,123 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:03:44,123 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:03:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-24 17:03:44,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 17:03:44,154 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:44,155 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:03:44,155 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 17:03:44,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1341839433, now seen corresponding path program 1 times [2018-01-24 17:03:44,164 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:44,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:44,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:44,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:44,217 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:44,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:44,343 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 17:03:44,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:44,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:03:44,345 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:44,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:03:44,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:03:44,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:03:44,361 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 4 states. [2018-01-24 17:03:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:44,700 INFO L93 Difference]: Finished difference Result 293 states and 335 transitions. [2018-01-24 17:03:44,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:03:44,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 17:03:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:44,712 INFO L225 Difference]: With dead ends: 293 [2018-01-24 17:03:44,712 INFO L226 Difference]: Without dead ends: 170 [2018-01-24 17:03:44,716 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 17:03:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-24 17:03:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 125. [2018-01-24 17:03:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-24 17:03:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-01-24 17:03:44,758 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 8 [2018-01-24 17:03:44,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:44,758 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-01-24 17:03:44,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:03:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-01-24 17:03:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 17:03:44,759 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:44,759 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:03:44,759 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 17:03:44,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1341839434, now seen corresponding path program 1 times [2018-01-24 17:03:44,760 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:44,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:44,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:44,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:44,761 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:44,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:44,861 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 17:03:44,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:44,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:03:44,862 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:44,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:03:44,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:03:44,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:03:44,864 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 4 states. [2018-01-24 17:03:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:45,056 INFO L93 Difference]: Finished difference Result 167 states and 185 transitions. [2018-01-24 17:03:45,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:03:45,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 17:03:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:45,061 INFO L225 Difference]: With dead ends: 167 [2018-01-24 17:03:45,061 INFO L226 Difference]: Without dead ends: 165 [2018-01-24 17:03:45,062 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 17:03:45,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-24 17:03:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 123. [2018-01-24 17:03:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 17:03:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2018-01-24 17:03:45,075 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 8 [2018-01-24 17:03:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:45,076 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2018-01-24 17:03:45,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:03:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-01-24 17:03:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 17:03:45,077 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:45,077 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:03:45,077 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 17:03:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash 557054198, now seen corresponding path program 1 times [2018-01-24 17:03:45,078 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:45,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:45,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:45,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:45,079 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:45,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:45,131 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 17:03:45,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:45,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:03:45,131 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:45,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:03:45,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:03:45,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:03:45,133 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 4 states. [2018-01-24 17:03:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:45,300 INFO L93 Difference]: Finished difference Result 172 states and 196 transitions. [2018-01-24 17:03:45,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:03:45,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 17:03:45,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:45,302 INFO L225 Difference]: With dead ends: 172 [2018-01-24 17:03:45,302 INFO L226 Difference]: Without dead ends: 154 [2018-01-24 17:03:45,303 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 17:03:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-24 17:03:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 113. [2018-01-24 17:03:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 17:03:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2018-01-24 17:03:45,316 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 14 [2018-01-24 17:03:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:45,317 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2018-01-24 17:03:45,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:03:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2018-01-24 17:03:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 17:03:45,318 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:45,318 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:03:45,318 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 17:03:45,319 INFO L82 PathProgramCache]: Analyzing trace with hash 557054199, now seen corresponding path program 1 times [2018-01-24 17:03:45,319 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:45,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:45,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:45,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:45,320 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:45,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:45,406 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 17:03:45,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:45,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:03:45,407 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:45,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:03:45,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:03:45,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:03:45,408 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 5 states. [2018-01-24 17:03:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:45,756 INFO L93 Difference]: Finished difference Result 251 states and 285 transitions. [2018-01-24 17:03:45,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:03:45,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 17:03:45,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:45,759 INFO L225 Difference]: With dead ends: 251 [2018-01-24 17:03:45,759 INFO L226 Difference]: Without dead ends: 233 [2018-01-24 17:03:45,760 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 17:03:45,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-24 17:03:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 182. [2018-01-24 17:03:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-24 17:03:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 240 transitions. [2018-01-24 17:03:45,778 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 240 transitions. Word has length 14 [2018-01-24 17:03:45,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:45,779 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 240 transitions. [2018-01-24 17:03:45,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:03:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 240 transitions. [2018-01-24 17:03:45,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:03:45,779 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:45,779 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 17:03:45,780 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 17:03:45,780 INFO L82 PathProgramCache]: Analyzing trace with hash -505191267, now seen corresponding path program 1 times [2018-01-24 17:03:45,780 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:45,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:45,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:45,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:45,781 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:45,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:45,818 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 17:03:45,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:45,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:03:45,818 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:45,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:03:45,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:03:45,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:03:45,819 INFO L87 Difference]: Start difference. First operand 182 states and 240 transitions. Second operand 4 states. [2018-01-24 17:03:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:45,839 INFO L93 Difference]: Finished difference Result 198 states and 242 transitions. [2018-01-24 17:03:45,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:03:45,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-24 17:03:45,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:45,841 INFO L225 Difference]: With dead ends: 198 [2018-01-24 17:03:45,841 INFO L226 Difference]: Without dead ends: 195 [2018-01-24 17:03:45,841 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 17:03:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-24 17:03:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2018-01-24 17:03:45,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-24 17:03:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 238 transitions. [2018-01-24 17:03:45,855 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 238 transitions. Word has length 17 [2018-01-24 17:03:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:45,856 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 238 transitions. [2018-01-24 17:03:45,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:03:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2018-01-24 17:03:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 17:03:45,857 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:45,857 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 17:03:45,858 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 17:03:45,858 INFO L82 PathProgramCache]: Analyzing trace with hash -605576120, now seen corresponding path program 1 times [2018-01-24 17:03:45,858 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:45,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:45,859 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:45,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:45,860 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:45,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:45,896 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 17:03:45,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:45,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:03:45,897 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:45,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:03:45,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:03:45,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:03:45,898 INFO L87 Difference]: Start difference. First operand 182 states and 238 transitions. Second operand 3 states. [2018-01-24 17:03:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:45,911 INFO L93 Difference]: Finished difference Result 261 states and 355 transitions. [2018-01-24 17:03:45,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:03:45,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-24 17:03:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:45,913 INFO L225 Difference]: With dead ends: 261 [2018-01-24 17:03:45,913 INFO L226 Difference]: Without dead ends: 185 [2018-01-24 17:03:45,914 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 17:03:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-24 17:03:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-01-24 17:03:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-24 17:03:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 241 transitions. [2018-01-24 17:03:45,923 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 241 transitions. Word has length 22 [2018-01-24 17:03:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:45,924 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 241 transitions. [2018-01-24 17:03:45,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:03:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2018-01-24 17:03:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 17:03:45,925 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:45,925 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 17:03:45,925 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 17:03:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash 927704743, now seen corresponding path program 1 times [2018-01-24 17:03:45,925 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:45,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:45,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:45,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:45,926 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:45,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:45,973 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 17:03:45,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:45,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:03:45,974 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:45,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:03:45,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:03:45,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:03:45,975 INFO L87 Difference]: Start difference. First operand 185 states and 241 transitions. Second operand 3 states. [2018-01-24 17:03:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:45,992 INFO L93 Difference]: Finished difference Result 363 states and 477 transitions. [2018-01-24 17:03:45,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:03:45,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-24 17:03:45,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:45,994 INFO L225 Difference]: With dead ends: 363 [2018-01-24 17:03:45,994 INFO L226 Difference]: Without dead ends: 187 [2018-01-24 17:03:45,995 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 17:03:45,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-24 17:03:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-01-24 17:03:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-24 17:03:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 243 transitions. [2018-01-24 17:03:46,007 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 243 transitions. Word has length 22 [2018-01-24 17:03:46,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:46,008 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 243 transitions. [2018-01-24 17:03:46,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:03:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 243 transitions. [2018-01-24 17:03:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 17:03:46,009 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:46,009 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 17:03:46,009 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 17:03:46,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2088156413, now seen corresponding path program 1 times [2018-01-24 17:03:46,009 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:46,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:46,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:46,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:46,011 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:46,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:46,064 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 17:03:46,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:46,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:03:46,065 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:46,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:03:46,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:03:46,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:03:46,066 INFO L87 Difference]: Start difference. First operand 187 states and 243 transitions. Second operand 3 states. [2018-01-24 17:03:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:46,095 INFO L93 Difference]: Finished difference Result 280 states and 367 transitions. [2018-01-24 17:03:46,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:03:46,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-24 17:03:46,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:46,096 INFO L225 Difference]: With dead ends: 280 [2018-01-24 17:03:46,096 INFO L226 Difference]: Without dead ends: 201 [2018-01-24 17:03:46,097 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 17:03:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-01-24 17:03:46,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2018-01-24 17:03:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-24 17:03:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 243 transitions. [2018-01-24 17:03:46,106 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 243 transitions. Word has length 24 [2018-01-24 17:03:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:46,106 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 243 transitions. [2018-01-24 17:03:46,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:03:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 243 transitions. [2018-01-24 17:03:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 17:03:46,107 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:46,108 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 17:03:46,108 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 17:03:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1439697764, now seen corresponding path program 1 times [2018-01-24 17:03:46,108 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:46,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:46,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:46,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:46,109 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:46,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:46,264 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 17:03:46,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:46,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:03:46,264 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:46,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:03:46,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:03:46,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:03:46,265 INFO L87 Difference]: Start difference. First operand 190 states and 243 transitions. Second operand 6 states. [2018-01-24 17:03:46,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:46,596 INFO L93 Difference]: Finished difference Result 471 states and 593 transitions. [2018-01-24 17:03:46,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:03:46,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 17:03:46,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:46,599 INFO L225 Difference]: With dead ends: 471 [2018-01-24 17:03:46,599 INFO L226 Difference]: Without dead ends: 290 [2018-01-24 17:03:46,601 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 17:03:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-01-24 17:03:46,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 206. [2018-01-24 17:03:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-24 17:03:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 264 transitions. [2018-01-24 17:03:46,612 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 264 transitions. Word has length 24 [2018-01-24 17:03:46,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:46,613 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 264 transitions. [2018-01-24 17:03:46,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:03:46,613 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 264 transitions. [2018-01-24 17:03:46,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 17:03:46,614 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:46,614 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 17:03:46,614 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 17:03:46,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1566782653, now seen corresponding path program 1 times [2018-01-24 17:03:46,614 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:46,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:46,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:46,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:46,616 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:46,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:46,684 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 17:03:46,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:46,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:03:46,685 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:46,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:03:46,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:03:46,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:03:46,685 INFO L87 Difference]: Start difference. First operand 206 states and 264 transitions. Second operand 5 states. [2018-01-24 17:03:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:46,965 INFO L93 Difference]: Finished difference Result 330 states and 414 transitions. [2018-01-24 17:03:46,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:03:46,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 17:03:46,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:46,967 INFO L225 Difference]: With dead ends: 330 [2018-01-24 17:03:46,967 INFO L226 Difference]: Without dead ends: 329 [2018-01-24 17:03:46,968 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 17:03:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-01-24 17:03:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 205. [2018-01-24 17:03:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-01-24 17:03:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 262 transitions. [2018-01-24 17:03:46,983 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 262 transitions. Word has length 25 [2018-01-24 17:03:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:46,983 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 262 transitions. [2018-01-24 17:03:46,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:03:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 262 transitions. [2018-01-24 17:03:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 17:03:46,984 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:46,984 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 17:03:46,984 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 17:03:46,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1566782654, now seen corresponding path program 1 times [2018-01-24 17:03:46,985 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:46,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:46,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:46,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:46,986 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:46,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:47,067 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 17:03:47,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:47,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:03:47,068 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:47,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:03:47,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:03:47,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:03:47,068 INFO L87 Difference]: Start difference. First operand 205 states and 262 transitions. Second operand 5 states. [2018-01-24 17:03:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:47,591 INFO L93 Difference]: Finished difference Result 365 states and 471 transitions. [2018-01-24 17:03:47,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:03:47,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 17:03:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:47,593 INFO L225 Difference]: With dead ends: 365 [2018-01-24 17:03:47,593 INFO L226 Difference]: Without dead ends: 364 [2018-01-24 17:03:47,593 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 17:03:47,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-01-24 17:03:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 204. [2018-01-24 17:03:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-24 17:03:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 260 transitions. [2018-01-24 17:03:47,603 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 260 transitions. Word has length 25 [2018-01-24 17:03:47,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:47,604 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 260 transitions. [2018-01-24 17:03:47,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:03:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 260 transitions. [2018-01-24 17:03:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 17:03:47,605 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:47,605 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 17:03:47,605 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 17:03:47,605 INFO L82 PathProgramCache]: Analyzing trace with hash -554334541, now seen corresponding path program 1 times [2018-01-24 17:03:47,605 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:47,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:47,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:47,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:47,607 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:47,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:47,692 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 17:03:47,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:47,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:03:47,692 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:47,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:03:47,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:03:47,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:03:47,693 INFO L87 Difference]: Start difference. First operand 204 states and 260 transitions. Second operand 6 states. [2018-01-24 17:03:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:47,887 INFO L93 Difference]: Finished difference Result 369 states and 467 transitions. [2018-01-24 17:03:47,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:03:47,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 17:03:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:47,889 INFO L225 Difference]: With dead ends: 369 [2018-01-24 17:03:47,889 INFO L226 Difference]: Without dead ends: 287 [2018-01-24 17:03:47,890 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 17:03:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-24 17:03:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 242. [2018-01-24 17:03:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-01-24 17:03:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 319 transitions. [2018-01-24 17:03:47,909 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 319 transitions. Word has length 26 [2018-01-24 17:03:47,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:47,909 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 319 transitions. [2018-01-24 17:03:47,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:03:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 319 transitions. [2018-01-24 17:03:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:03:47,911 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:47,911 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 17:03:47,911 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 17:03:47,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1703794537, now seen corresponding path program 1 times [2018-01-24 17:03:47,911 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:47,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:47,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:47,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:47,913 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:47,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:48,010 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 17:03:48,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:03:48,010 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:03:48,012 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 17:03:48,014 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [10], [16], [18], [21], [136], [140], [144], [146], [150], [152], [155], [160], [161], [164], [168], [210], [212], [218], [220], [221], [222], [223] [2018-01-24 17:03:48,083 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:03:48,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:03:48,344 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:03:48,346 INFO L268 AbstractInterpreter]: Visited 27 different actions 30 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-01-24 17:03:48,360 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:03:48,360 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:03:48,360 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 17:03:48,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:48,376 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:03:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:48,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:03:48,649 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 17:03:48,660 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 17:03:48,660 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:03:48,965 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 17:03:48,970 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 17:03:48,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:03:48,993 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 17:03:48,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:48,998 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:03:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:49,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:03:49,061 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 17:03:49,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:03:49,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:03:49,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:03:49,283 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 17:03:49,283 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:03:49,301 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 17:03:49,319 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 17:03:49,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:03:49,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7, 7, 6] total 21 [2018-01-24 17:03:49,321 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:03:49,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:03:49,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:03:49,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=281, Unknown=7, NotChecked=108, Total=462 [2018-01-24 17:03:49,322 INFO L87 Difference]: Start difference. First operand 242 states and 319 transitions. Second operand 11 states. [2018-01-24 17:03:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:49,879 INFO L93 Difference]: Finished difference Result 342 states and 437 transitions. [2018-01-24 17:03:49,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:03:49,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-01-24 17:03:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:49,881 INFO L225 Difference]: With dead ends: 342 [2018-01-24 17:03:49,881 INFO L226 Difference]: Without dead ends: 339 [2018-01-24 17:03:49,882 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=526, Unknown=7, NotChecked=150, Total=812 [2018-01-24 17:03:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-01-24 17:03:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 251. [2018-01-24 17:03:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-01-24 17:03:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 329 transitions. [2018-01-24 17:03:49,904 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 329 transitions. Word has length 28 [2018-01-24 17:03:49,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:49,905 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 329 transitions. [2018-01-24 17:03:49,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:03:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 329 transitions. [2018-01-24 17:03:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:03:49,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:49,906 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 17:03:49,906 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 17:03:49,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1703794284, now seen corresponding path program 1 times [2018-01-24 17:03:49,906 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:49,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:49,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:49,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:49,908 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:49,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:49,977 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 17:03:49,977 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:49,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:03:49,977 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:49,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:03:49,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:03:49,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:03:49,979 INFO L87 Difference]: Start difference. First operand 251 states and 329 transitions. Second operand 3 states. [2018-01-24 17:03:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:50,001 INFO L93 Difference]: Finished difference Result 271 states and 336 transitions. [2018-01-24 17:03:50,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:03:50,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 17:03:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:50,003 INFO L225 Difference]: With dead ends: 271 [2018-01-24 17:03:50,004 INFO L226 Difference]: Without dead ends: 221 [2018-01-24 17:03:50,004 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 17:03:50,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-24 17:03:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2018-01-24 17:03:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-24 17:03:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 274 transitions. [2018-01-24 17:03:50,021 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 274 transitions. Word has length 28 [2018-01-24 17:03:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:50,021 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 274 transitions. [2018-01-24 17:03:50,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:03:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 274 transitions. [2018-01-24 17:03:50,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:03:50,022 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:50,022 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 17:03:50,022 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 17:03:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1964814354, now seen corresponding path program 1 times [2018-01-24 17:03:50,022 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:50,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:50,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:50,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:50,024 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:50,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:50,095 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 17:03:50,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:50,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:03:50,095 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:50,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:03:50,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:03:50,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:03:50,096 INFO L87 Difference]: Start difference. First operand 220 states and 274 transitions. Second operand 6 states. [2018-01-24 17:03:50,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:50,348 INFO L93 Difference]: Finished difference Result 320 states and 409 transitions. [2018-01-24 17:03:50,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:03:50,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 17:03:50,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:50,350 INFO L225 Difference]: With dead ends: 320 [2018-01-24 17:03:50,350 INFO L226 Difference]: Without dead ends: 232 [2018-01-24 17:03:50,350 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:03:50,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-24 17:03:50,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 225. [2018-01-24 17:03:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-24 17:03:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 280 transitions. [2018-01-24 17:03:50,362 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 280 transitions. Word has length 28 [2018-01-24 17:03:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:50,363 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 280 transitions. [2018-01-24 17:03:50,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:03:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2018-01-24 17:03:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:03:50,363 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:50,363 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 17:03:50,363 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 17:03:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1959088716, now seen corresponding path program 1 times [2018-01-24 17:03:50,364 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:50,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:50,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:50,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:50,365 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:50,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:50,752 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 17:03:50,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:50,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:03:50,753 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:50,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:03:50,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:03:50,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:03:50,754 INFO L87 Difference]: Start difference. First operand 225 states and 280 transitions. Second operand 8 states. [2018-01-24 17:03:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:51,258 INFO L93 Difference]: Finished difference Result 426 states and 516 transitions. [2018-01-24 17:03:51,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:03:51,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-24 17:03:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:51,262 INFO L225 Difference]: With dead ends: 426 [2018-01-24 17:03:51,262 INFO L226 Difference]: Without dead ends: 322 [2018-01-24 17:03:51,263 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:03:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-01-24 17:03:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 273. [2018-01-24 17:03:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-01-24 17:03:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 352 transitions. [2018-01-24 17:03:51,283 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 352 transitions. Word has length 28 [2018-01-24 17:03:51,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:51,283 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 352 transitions. [2018-01-24 17:03:51,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:03:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 352 transitions. [2018-01-24 17:03:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:03:51,284 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:51,284 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 17:03:51,284 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 17:03:51,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1682499776, now seen corresponding path program 1 times [2018-01-24 17:03:51,285 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:51,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:51,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:51,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:51,286 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:51,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:51,406 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 17:03:51,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:51,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:03:51,407 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:51,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:03:51,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:03:51,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:03:51,407 INFO L87 Difference]: Start difference. First operand 273 states and 352 transitions. Second operand 9 states. [2018-01-24 17:03:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:51,800 INFO L93 Difference]: Finished difference Result 398 states and 517 transitions. [2018-01-24 17:03:51,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:03:51,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-24 17:03:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:51,801 INFO L225 Difference]: With dead ends: 398 [2018-01-24 17:03:51,801 INFO L226 Difference]: Without dead ends: 397 [2018-01-24 17:03:51,802 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 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 17:03:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-01-24 17:03:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 272. [2018-01-24 17:03:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-24 17:03:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 349 transitions. [2018-01-24 17:03:51,814 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 349 transitions. Word has length 28 [2018-01-24 17:03:51,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:51,814 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 349 transitions. [2018-01-24 17:03:51,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:03:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 349 transitions. [2018-01-24 17:03:51,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:03:51,815 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:51,815 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 17:03:51,815 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 17:03:51,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1682499775, now seen corresponding path program 1 times [2018-01-24 17:03:51,816 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:51,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:51,817 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:51,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:51,817 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:51,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:52,162 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 17:03:52,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:52,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:03:52,163 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:52,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:03:52,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:03:52,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:03:52,164 INFO L87 Difference]: Start difference. First operand 272 states and 349 transitions. Second operand 9 states. [2018-01-24 17:03:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:52,883 INFO L93 Difference]: Finished difference Result 397 states and 514 transitions. [2018-01-24 17:03:52,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:03:52,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-24 17:03:52,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:52,885 INFO L225 Difference]: With dead ends: 397 [2018-01-24 17:03:52,885 INFO L226 Difference]: Without dead ends: 396 [2018-01-24 17:03:52,886 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-24 17:03:52,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-01-24 17:03:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 271. [2018-01-24 17:03:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-24 17:03:52,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 346 transitions. [2018-01-24 17:03:52,904 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 346 transitions. Word has length 28 [2018-01-24 17:03:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:52,904 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 346 transitions. [2018-01-24 17:03:52,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:03:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 346 transitions. [2018-01-24 17:03:52,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:03:52,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:52,905 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 17:03:52,905 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 17:03:52,905 INFO L82 PathProgramCache]: Analyzing trace with hash -546988646, now seen corresponding path program 1 times [2018-01-24 17:03:52,906 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:52,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:52,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:52,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:52,907 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:52,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:52,979 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 17:03:52,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:52,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:03:52,980 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:52,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:03:52,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:03:52,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:03:52,981 INFO L87 Difference]: Start difference. First operand 271 states and 346 transitions. Second operand 5 states. [2018-01-24 17:03:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:53,208 INFO L93 Difference]: Finished difference Result 397 states and 497 transitions. [2018-01-24 17:03:53,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:03:53,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 17:03:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:53,211 INFO L225 Difference]: With dead ends: 397 [2018-01-24 17:03:53,211 INFO L226 Difference]: Without dead ends: 396 [2018-01-24 17:03:53,211 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 17:03:53,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-01-24 17:03:53,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 270. [2018-01-24 17:03:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-01-24 17:03:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 344 transitions. [2018-01-24 17:03:53,228 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 344 transitions. Word has length 29 [2018-01-24 17:03:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:53,228 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 344 transitions. [2018-01-24 17:03:53,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:03:53,229 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 344 transitions. [2018-01-24 17:03:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:03:53,229 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:53,229 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 17:03:53,229 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 17:03:53,230 INFO L82 PathProgramCache]: Analyzing trace with hash -546988645, now seen corresponding path program 1 times [2018-01-24 17:03:53,230 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:53,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:53,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:53,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:53,231 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:53,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:53,347 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 17:03:53,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:53,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:03:53,347 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:53,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:03:53,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:03:53,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:03:53,348 INFO L87 Difference]: Start difference. First operand 270 states and 344 transitions. Second operand 5 states. [2018-01-24 17:03:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:53,520 INFO L93 Difference]: Finished difference Result 405 states and 504 transitions. [2018-01-24 17:03:53,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:03:53,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 17:03:53,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:53,521 INFO L225 Difference]: With dead ends: 405 [2018-01-24 17:03:53,521 INFO L226 Difference]: Without dead ends: 404 [2018-01-24 17:03:53,522 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 17:03:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-01-24 17:03:53,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 269. [2018-01-24 17:03:53,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-01-24 17:03:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 342 transitions. [2018-01-24 17:03:53,532 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 342 transitions. Word has length 29 [2018-01-24 17:03:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:53,532 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 342 transitions. [2018-01-24 17:03:53,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:03:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 342 transitions. [2018-01-24 17:03:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 17:03:53,533 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:53,533 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 17:03:53,533 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 17:03:53,533 INFO L82 PathProgramCache]: Analyzing trace with hash -232740570, now seen corresponding path program 1 times [2018-01-24 17:03:53,533 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:53,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:53,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:53,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:53,534 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:53,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:53,666 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 17:03:53,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:53,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:03:53,666 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:53,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:03:53,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:03:53,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:03:53,667 INFO L87 Difference]: Start difference. First operand 269 states and 342 transitions. Second operand 9 states. [2018-01-24 17:03:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:54,037 INFO L93 Difference]: Finished difference Result 356 states and 460 transitions. [2018-01-24 17:03:54,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:03:54,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-24 17:03:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:54,039 INFO L225 Difference]: With dead ends: 356 [2018-01-24 17:03:54,039 INFO L226 Difference]: Without dead ends: 355 [2018-01-24 17:03:54,039 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 17:03:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-24 17:03:54,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 268. [2018-01-24 17:03:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-01-24 17:03:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 341 transitions. [2018-01-24 17:03:54,050 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 341 transitions. Word has length 32 [2018-01-24 17:03:54,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:54,050 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 341 transitions. [2018-01-24 17:03:54,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:03:54,051 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 341 transitions. [2018-01-24 17:03:54,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 17:03:54,051 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:54,051 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 17:03:54,051 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 17:03:54,051 INFO L82 PathProgramCache]: Analyzing trace with hash -232740571, now seen corresponding path program 1 times [2018-01-24 17:03:54,051 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:54,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:54,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:54,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:54,052 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:54,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:54,162 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 17:03:54,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:03:54,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:03:54,163 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:03:54,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:03:54,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:03:54,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:03:54,164 INFO L87 Difference]: Start difference. First operand 268 states and 341 transitions. Second operand 9 states. [2018-01-24 17:03:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:03:54,496 INFO L93 Difference]: Finished difference Result 355 states and 459 transitions. [2018-01-24 17:03:54,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:03:54,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-24 17:03:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:03:54,498 INFO L225 Difference]: With dead ends: 355 [2018-01-24 17:03:54,499 INFO L226 Difference]: Without dead ends: 354 [2018-01-24 17:03:54,499 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 17:03:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-01-24 17:03:54,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 267. [2018-01-24 17:03:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-01-24 17:03:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 340 transitions. [2018-01-24 17:03:54,510 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 340 transitions. Word has length 32 [2018-01-24 17:03:54,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:03:54,510 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 340 transitions. [2018-01-24 17:03:54,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:03:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 340 transitions. [2018-01-24 17:03:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 17:03:54,511 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:03:54,511 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 17:03:54,511 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 17:03:54,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1058981609, now seen corresponding path program 1 times [2018-01-24 17:03:54,511 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:03:54,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:54,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:54,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:03:54,512 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:03:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:54,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:03:54,913 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 17:03:54,913 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:03:54,913 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:03:54,913 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-01-24 17:03:54,913 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [10], [16], [18], [23], [27], [29], [30], [32], [35], [36], [39], [41], [45], [47], [50], [51], [54], [65], [68], [71], [97], [99], [102], [105], [111], [112], [113], [116], [119], [122], [123], [126], [129], [221], [222], [223] [2018-01-24 17:03:54,915 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:03:54,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:03:55,651 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:03:55,651 INFO L268 AbstractInterpreter]: Visited 41 different actions 126 times. Merged at 32 different actions 76 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 41 variables. [2018-01-24 17:03:55,658 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:03:55,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:03:55,658 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 17:03:55,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:03:55,668 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:03:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:03:55,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:03:55,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:03:55,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:03:55,816 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 17:03:55,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:03:55,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:03:55,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-01-24 17:03:55,877 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 17:03:55,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:03:55,881 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 17:03:55,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:03:55,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:03:55,913 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 17:03:55,916 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:03:55,917 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 17:03:55,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:03:55,922 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:03:55,934 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 17:03:55,934 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:56 [2018-01-24 17:03:56,001 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 75 treesize of output 79 [2018-01-24 17:03:56,007 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 17:03:56,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:03:56,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:03:56,037 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 17:03:56,040 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 17:03:56,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:03:56,051 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:03:56,065 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 17:03:56,065 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:82 [2018-01-24 17:03:56,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 91 [2018-01-24 17:03:56,166 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 17:03:56,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:03:56,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:03:56,196 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 17:03:56,199 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 17:03:56,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:03:56,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:03:56,219 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 17:03:56,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:106 [2018-01-24 17:04:02,366 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 17:04:02,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:02,369 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 17:04:02,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:02,379 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 17:04:02,379 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:02,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:02,389 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 17:04:02,390 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:94, output treesize:59 [2018-01-24 17:04:02,464 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 17:04:02,464 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:04:03,033 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 17:04:03,035 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 17:04:03,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,042 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 17:04:03,043 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 17:04:03,050 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 17:04:03,057 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 17:04:03,061 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 44 treesize of output 40 [2018-01-24 17:04:03,062 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:03,094 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 40 treesize of output 34 [2018-01-24 17:04:03,094 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,128 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 17:04:03,129 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 17:04:03,147 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:04:03,192 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 17:04:03,194 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 17:04:03,194 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,201 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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 17:04:03,209 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 17:04:03,209 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,214 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,216 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 17:04:03,220 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 17:04:03,221 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,228 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,285 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 17:04:03,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 17:04:03,288 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,308 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 17:04:03,308 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:03,331 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 17:04:03,332 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 17:04:03,358 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 17:04:03,360 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 17:04:03,362 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 17:04:03,362 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,369 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 17:04:03,370 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:03,376 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:04:03,438 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 17:04:03,440 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 17:04:03,440 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,448 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 17:04:03,449 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,454 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,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 17:04:03,463 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 17:04:03,464 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,485 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 17:04:03,486 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,502 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 17:04:03,502 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,512 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,514 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 17:04:03,515 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 17:04:03,516 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 17:04:03,521 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,525 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,530 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 17:04:03,532 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 17:04:03,532 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,548 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 17:04:03,549 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,563 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 17:04:03,563 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,575 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:04:03,624 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 17:04:03,624 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 6 variables, input treesize:125, output treesize:184 [2018-01-24 17:04:03,734 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 17:04:03,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:04:03,756 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 17:04:03,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:04:03,762 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:04:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:04:03,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:04:03,829 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 17:04:03,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 17:04:03,907 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 17:04:03,915 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 17:04:03,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:03,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-24 17:04:04,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:04,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:04,138 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 17:04:04,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:04,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:04,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:37 [2018-01-24 17:04:04,191 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 17:04:04,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:04,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:04,195 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:04:04,197 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 17:04:04,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:04,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:04,215 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 17:04:04,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:04:04,219 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 17:04:04,219 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:04,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:04,232 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 17:04:04,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:34 [2018-01-24 17:04:04,309 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 17:04:04,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 17:04:04,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:04,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:04,331 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 54 treesize of output 58 [2018-01-24 17:04:04,333 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 17:04:04,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:04,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:04,350 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 17:04:04,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2018-01-24 17:04:04,453 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 94 treesize of output 80 [2018-01-24 17:04:04,457 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 17:04:04,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:04,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:04,483 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 17:04:04,486 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 17:04:04,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:04,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:04,503 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 17:04:04,503 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:84 [2018-01-24 17:04:09,701 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 17:04:09,704 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 17:04:09,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:09,712 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 17:04:09,713 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 17:04:09,717 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 17:04:09,725 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 17:04:09,726 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 17:04:09,727 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:09,731 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 17:04:09,731 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:09,732 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:09,736 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 17:04:09,736 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:7 [2018-01-24 17:04:09,806 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 17:04:09,806 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:04:10,305 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 17:04:10,308 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 17:04:10,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,349 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 17:04:10,352 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 17:04:10,352 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,368 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 17:04:10,369 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,383 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 17:04:10,383 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:04:10,397 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 17:04:10,399 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 17:04:10,400 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,407 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 17:04:10,408 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,412 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,413 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 17:04:10,415 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 17:04:10,415 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,421 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:04:10,446 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 17:04:10,446 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:81, output treesize:95 [2018-01-24 17:04:10,531 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 17:04:10,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:04:10,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 13, 18, 11] total 67 [2018-01-24 17:04:10,533 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:04:10,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-24 17:04:10,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-24 17:04:10,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=3843, Unknown=6, NotChecked=0, Total=4422 [2018-01-24 17:04:10,535 INFO L87 Difference]: Start difference. First operand 267 states and 340 transitions. Second operand 33 states. Received shutdown request... [2018-01-24 17:04:48,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 17:04:48,368 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 17:04:48,372 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 17:04:48,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:04:48 BoogieIcfgContainer [2018-01-24 17:04:48,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:04:48,373 INFO L168 Benchmark]: Toolchain (without parser) took 65097.45 ms. Allocated memory was 303.6 MB in the beginning and 648.5 MB in the end (delta: 345.0 MB). Free memory was 263.6 MB in the beginning and 455.1 MB in the end (delta: -191.5 MB). Peak memory consumption was 153.5 MB. Max. memory is 5.3 GB. [2018-01-24 17:04:48,373 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:04:48,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.26 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 251.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:04:48,374 INFO L168 Benchmark]: Boogie Preprocessor took 44.82 ms. Allocated memory is still 303.6 MB. Free memory was 251.7 MB in the beginning and 249.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:04:48,374 INFO L168 Benchmark]: RCFGBuilder took 513.01 ms. Allocated memory is still 303.6 MB. Free memory was 249.7 MB in the beginning and 216.0 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:04:48,374 INFO L168 Benchmark]: TraceAbstraction took 64323.82 ms. Allocated memory was 303.6 MB in the beginning and 648.5 MB in the end (delta: 345.0 MB). Free memory was 216.0 MB in the beginning and 455.1 MB in the end (delta: -239.1 MB). Peak memory consumption was 105.9 MB. Max. memory is 5.3 GB. [2018-01-24 17:04:48,376 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.24 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.26 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 251.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.82 ms. Allocated memory is still 303.6 MB. Free memory was 251.7 MB in the beginning and 249.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 513.01 ms. Allocated memory is still 303.6 MB. Free memory was 249.7 MB in the beginning and 216.0 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64323.82 ms. Allocated memory was 303.6 MB in the beginning and 648.5 MB in the end (delta: 345.0 MB). Free memory was 216.0 MB in the beginning and 455.1 MB in the end (delta: -239.1 MB). Peak memory consumption was 105.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 358 LocStat_NO_SUPPORTING_DISEQUALITIES : 86 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 79 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 39 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.842780 RENAME_VARIABLES(MILLISECONDS) : 0.435899 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.794547 PROJECTAWAY(MILLISECONDS) : 0.105093 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001689 DISJOIN(MILLISECONDS) : 1.227218 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.473608 ADD_EQUALITY(MILLISECONDS) : 0.027683 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016969 #CONJOIN_DISJUNCTIVE : 58 #RENAME_VARIABLES : 91 #UNFREEZE : 0 #CONJOIN : 138 #PROJECTAWAY : 76 #ADD_WEAK_EQUALITY : 12 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 81 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 38 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 456 LocStat_NO_SUPPORTING_DISEQUALITIES : 115 LocStat_NO_DISJUNCTIONS : -76 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 45 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 103 TransStat_NO_SUPPORTING_DISEQUALITIES : 21 TransStat_NO_DISJUNCTIONS : 55 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.728342 RENAME_VARIABLES(MILLISECONDS) : 0.759736 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.689024 PROJECTAWAY(MILLISECONDS) : 0.612294 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001098 DISJOIN(MILLISECONDS) : 0.933240 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.800447 ADD_EQUALITY(MILLISECONDS) : 0.025269 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012339 #CONJOIN_DISJUNCTIVE : 220 #RENAME_VARIABLES : 425 #UNFREEZE : 0 #CONJOIN : 361 #PROJECTAWAY : 260 #ADD_WEAK_EQUALITY : 25 #DISJOIN : 37 #RENAME_VARIABLES_DISJUNCTIVE : 371 #ADD_EQUALITY : 107 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 15 * 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 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 20 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 80 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 55 error locations. TIMEOUT Result, 64.2s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 43.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2348 SDtfs, 4459 SDslu, 4993 SDs, 0 SdLazy, 4995 SolverSat, 294 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 518 GetRequests, 268 SyntacticMatches, 12 SemanticMatches, 237 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2598 ImplicationChecksByTransitivity, 43.5s 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, 1.0s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 1446 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 719 NumberOfCodeBlocks, 719 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 840 ConstructedInterpolants, 59 QuantifiedInterpolants, 400603 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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-04-48-386.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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-04-48-386.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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-04-48-386.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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-04-48-386.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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-04-48-386.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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-04-48-386.csv Completed graceful shutdown