java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b2fde6a [2018-09-28 09:55:36,447 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 09:55:36,449 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 09:55:36,464 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 09:55:36,464 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 09:55:36,466 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 09:55:36,467 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 09:55:36,476 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 09:55:36,478 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 09:55:36,479 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 09:55:36,480 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 09:55:36,481 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 09:55:36,482 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 09:55:36,483 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 09:55:36,484 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 09:55:36,485 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 09:55:36,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 09:55:36,487 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 09:55:36,489 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 09:55:36,491 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 09:55:36,492 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 09:55:36,493 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 09:55:36,496 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 09:55:36,496 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 09:55:36,496 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 09:55:36,497 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 09:55:36,498 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 09:55:36,499 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 09:55:36,500 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 09:55:36,501 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 09:55:36,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 09:55:36,502 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 09:55:36,503 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 09:55:36,503 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 09:55:36,504 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 09:55:36,505 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 09:55:36,505 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-28 09:55:36,521 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 09:55:36,521 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 09:55:36,522 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 09:55:36,523 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 09:55:36,523 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 09:55:36,523 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 09:55:36,524 INFO L133 SettingsManager]: * Use SBE=true [2018-09-28 09:55:36,524 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 09:55:36,524 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 09:55:36,524 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 09:55:36,524 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 09:55:36,525 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 09:55:36,525 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 09:55:36,525 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 09:55:36,525 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 09:55:36,525 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 09:55:36,526 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 09:55:36,526 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 09:55:36,526 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 09:55:36,526 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-28 09:55:36,526 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 09:55:36,526 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-28 09:55:36,527 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 09:55:36,527 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 09:55:36,527 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 09:55:36,527 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 09:55:36,528 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-28 09:55:36,528 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 09:55:36,528 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 09:55:36,528 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 09:55:36,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 09:55:36,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 09:55:36,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 09:55:36,601 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 09:55:36,602 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 09:55:36,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-09-28 09:55:36,603 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-09-28 09:55:36,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 09:55:36,709 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 09:55:36,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 09:55:36,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 09:55:36,710 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 09:55:36,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:36" (1/1) ... [2018-09-28 09:55:36,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:36" (1/1) ... [2018-09-28 09:55:36,764 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-28 09:55:36,765 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-28 09:55:36,765 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-28 09:55:36,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 09:55:36,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 09:55:36,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 09:55:36,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 09:55:36,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:36" (1/1) ... [2018-09-28 09:55:36,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:36" (1/1) ... [2018-09-28 09:55:36,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:36" (1/1) ... [2018-09-28 09:55:36,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:36" (1/1) ... [2018-09-28 09:55:36,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:36" (1/1) ... [2018-09-28 09:55:36,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:36" (1/1) ... [2018-09-28 09:55:36,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:36" (1/1) ... [2018-09-28 09:55:36,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 09:55:36,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 09:55:36,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 09:55:36,836 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 09:55:36,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:36" (1/1) ... No working directory specified, using /storage/repos/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-09-28 09:55:36,926 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-28 09:55:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-28 09:55:36,927 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-28 09:55:37,760 INFO L350 CfgBuilder]: Using library mode [2018-09-28 09:55:37,761 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 09:55:37 BoogieIcfgContainer [2018-09-28 09:55:37,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 09:55:37,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-28 09:55:37,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-28 09:55:37,766 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-28 09:55:37,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:36" (1/2) ... [2018-09-28 09:55:37,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2742618b and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.09 09:55:37, skipping insertion in model container [2018-09-28 09:55:37,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 09:55:37" (2/2) ... [2018-09-28 09:55:37,769 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-09-28 09:55:37,779 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-28 09:55:37,788 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-28 09:55:37,842 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-28 09:55:37,843 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-28 09:55:37,843 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-28 09:55:37,843 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-28 09:55:37,843 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-28 09:55:37,843 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-28 09:55:37,844 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-28 09:55:37,844 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-28 09:55:37,844 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-28 09:55:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-28 09:55:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-28 09:55:37,880 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:37,881 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:37,884 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:37,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:37,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-28 09:55:37,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:37,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:37,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:37,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:37,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:38,121 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:38,123 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 09:55:38,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-28 09:55:38,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-28 09:55:38,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-28 09:55:38,148 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-28 09:55:40,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:40,086 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-28 09:55:40,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-28 09:55:40,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-28 09:55:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:40,106 INFO L225 Difference]: With dead ends: 163 [2018-09-28 09:55:40,106 INFO L226 Difference]: Without dead ends: 158 [2018-09-28 09:55:40,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:55:40,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-28 09:55:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-28 09:55:40,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-28 09:55:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-28 09:55:40,181 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-28 09:55:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:40,182 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-28 09:55:40,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-28 09:55:40,183 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-28 09:55:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-28 09:55:40,184 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:40,184 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:40,185 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:40,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:40,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-28 09:55:40,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:40,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:40,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:40,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:40,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:40,290 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:40,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 09:55:40,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-28 09:55:40,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-28 09:55:40,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-28 09:55:40,293 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-28 09:55:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:41,265 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-28 09:55:41,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-28 09:55:41,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-28 09:55:41,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:41,271 INFO L225 Difference]: With dead ends: 188 [2018-09-28 09:55:41,272 INFO L226 Difference]: Without dead ends: 183 [2018-09-28 09:55:41,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:55:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-28 09:55:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-28 09:55:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-28 09:55:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-28 09:55:41,306 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-28 09:55:41,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:41,307 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-28 09:55:41,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-28 09:55:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-28 09:55:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-28 09:55:41,308 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:41,308 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:41,309 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:41,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:41,310 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-28 09:55:41,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:41,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:41,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:41,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:41,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:41,414 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:41,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-28 09:55:41,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-28 09:55:41,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-28 09:55:41,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-28 09:55:41,416 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-28 09:55:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:43,121 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-09-28 09:55:43,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-28 09:55:43,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-28 09:55:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:43,127 INFO L225 Difference]: With dead ends: 361 [2018-09-28 09:55:43,127 INFO L226 Difference]: Without dead ends: 349 [2018-09-28 09:55:43,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-28 09:55:43,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-28 09:55:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-09-28 09:55:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-28 09:55:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-09-28 09:55:43,167 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-09-28 09:55:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:43,167 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-09-28 09:55:43,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-28 09:55:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-09-28 09:55:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-28 09:55:43,169 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:43,169 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:43,170 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:43,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-28 09:55:43,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:43,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:43,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:43,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:43,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:43,276 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:43,276 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-28 09:55:43,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-28 09:55:43,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-28 09:55:43,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-28 09:55:43,277 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-09-28 09:55:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:44,503 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-09-28 09:55:44,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-28 09:55:44,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-28 09:55:44,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:44,510 INFO L225 Difference]: With dead ends: 307 [2018-09-28 09:55:44,510 INFO L226 Difference]: Without dead ends: 302 [2018-09-28 09:55:44,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-09-28 09:55:44,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-28 09:55:44,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-09-28 09:55:44,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-28 09:55:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-28 09:55:44,551 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-28 09:55:44,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:44,552 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-28 09:55:44,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-28 09:55:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-28 09:55:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:55:44,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:44,554 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:44,555 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:44,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:44,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-28 09:55:44,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:44,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:44,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:44,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:44,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:44,911 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:44,912 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:55:44,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:55:44,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:55:44,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:55:44,913 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-09-28 09:55:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:49,998 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-09-28 09:55:49,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-28 09:55:49,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:55:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:50,005 INFO L225 Difference]: With dead ends: 741 [2018-09-28 09:55:50,005 INFO L226 Difference]: Without dead ends: 733 [2018-09-28 09:55:50,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-09-28 09:55:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-09-28 09:55:50,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-09-28 09:55:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-28 09:55:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-09-28 09:55:50,059 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-09-28 09:55:50,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:50,060 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-09-28 09:55:50,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:55:50,060 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-09-28 09:55:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:55:50,062 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:50,062 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:50,063 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:50,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:50,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-28 09:55:50,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:50,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:50,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:50,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:50,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:50,296 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:50,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:55:50,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:55:50,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:55:50,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:55:50,297 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-09-28 09:55:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:55,114 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-09-28 09:55:55,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-28 09:55:55,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:55:55,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:55,123 INFO L225 Difference]: With dead ends: 797 [2018-09-28 09:55:55,123 INFO L226 Difference]: Without dead ends: 789 [2018-09-28 09:55:55,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-09-28 09:55:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-28 09:55:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-09-28 09:55:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-28 09:55:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-09-28 09:55:55,205 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-09-28 09:55:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:55,205 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-09-28 09:55:55,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:55:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-09-28 09:55:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:55:55,207 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:55,207 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:55,208 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:55,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:55,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-28 09:55:55,208 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:55,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:55,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:55,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:55,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:55,411 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:55,411 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:55:55,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:55:55,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:55:55,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:55:55,412 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-09-28 09:55:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:57,346 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-09-28 09:55:57,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-28 09:55:57,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:55:57,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:57,352 INFO L225 Difference]: With dead ends: 684 [2018-09-28 09:55:57,352 INFO L226 Difference]: Without dead ends: 676 [2018-09-28 09:55:57,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-09-28 09:55:57,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-09-28 09:55:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-09-28 09:55:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-09-28 09:55:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-09-28 09:55:57,415 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-09-28 09:55:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:57,416 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-09-28 09:55:57,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:55:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-09-28 09:55:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:55:57,417 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:57,417 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:57,418 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:57,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:57,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-28 09:55:57,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:57,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:57,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:57,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:57,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:57,512 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:57,512 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:55:57,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:55:57,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:55:57,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:55:57,513 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-09-28 09:55:58,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:58,870 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-09-28 09:55:58,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-28 09:55:58,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:55:58,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:58,876 INFO L225 Difference]: With dead ends: 605 [2018-09-28 09:55:58,876 INFO L226 Difference]: Without dead ends: 597 [2018-09-28 09:55:58,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-28 09:55:58,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-09-28 09:55:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-09-28 09:55:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-28 09:55:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-09-28 09:55:58,943 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-09-28 09:55:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:58,943 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-09-28 09:55:58,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:55:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-09-28 09:55:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:55:58,944 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:58,944 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:58,945 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:58,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:58,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-09-28 09:55:58,946 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:58,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:58,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:58,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:58,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:59,182 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:59,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:55:59,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:55:59,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:55:59,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:55:59,183 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-09-28 09:56:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:01,366 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-09-28 09:56:01,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-28 09:56:01,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:01,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:01,372 INFO L225 Difference]: With dead ends: 935 [2018-09-28 09:56:01,373 INFO L226 Difference]: Without dead ends: 927 [2018-09-28 09:56:01,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-09-28 09:56:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-09-28 09:56:01,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-09-28 09:56:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-28 09:56:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-09-28 09:56:01,463 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-09-28 09:56:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:01,463 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-09-28 09:56:01,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-09-28 09:56:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:01,464 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:01,465 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:01,465 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:01,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:01,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-09-28 09:56:01,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:01,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:01,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:01,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:01,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:01,544 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:01,544 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:01,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:01,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:01,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:01,545 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-09-28 09:56:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:03,687 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-09-28 09:56:03,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-28 09:56:03,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:03,694 INFO L225 Difference]: With dead ends: 923 [2018-09-28 09:56:03,694 INFO L226 Difference]: Without dead ends: 915 [2018-09-28 09:56:03,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-09-28 09:56:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-28 09:56:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-09-28 09:56:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-28 09:56:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-09-28 09:56:03,796 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-09-28 09:56:03,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:03,796 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-09-28 09:56:03,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:03,797 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-09-28 09:56:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:03,798 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:03,798 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:03,798 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:03,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:03,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-09-28 09:56:03,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:03,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:03,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:03,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:03,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:04,010 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:04,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:04,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:04,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:04,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:04,012 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-09-28 09:56:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:05,771 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-09-28 09:56:05,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-28 09:56:05,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:05,777 INFO L225 Difference]: With dead ends: 837 [2018-09-28 09:56:05,777 INFO L226 Difference]: Without dead ends: 829 [2018-09-28 09:56:05,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-28 09:56:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-09-28 09:56:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-09-28 09:56:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-28 09:56:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-09-28 09:56:05,886 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-09-28 09:56:05,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:05,887 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-09-28 09:56:05,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-09-28 09:56:05,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:05,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:05,888 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:05,889 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:05,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:05,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-09-28 09:56:05,889 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:05,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:05,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:05,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:05,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:06,179 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:06,180 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:06,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:06,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:06,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:06,180 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-09-28 09:56:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:08,461 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-09-28 09:56:08,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-28 09:56:08,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:08,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:08,467 INFO L225 Difference]: With dead ends: 996 [2018-09-28 09:56:08,467 INFO L226 Difference]: Without dead ends: 988 [2018-09-28 09:56:08,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-09-28 09:56:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-09-28 09:56:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-09-28 09:56:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-28 09:56:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-28 09:56:08,578 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-28 09:56:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:08,579 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-28 09:56:08,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-28 09:56:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:08,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:08,580 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:08,581 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:08,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:08,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-09-28 09:56:08,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:08,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:08,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:08,664 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:08,664 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:08,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:08,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:08,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:08,665 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-28 09:56:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:10,600 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-09-28 09:56:10,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-28 09:56:10,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:10,605 INFO L225 Difference]: With dead ends: 913 [2018-09-28 09:56:10,605 INFO L226 Difference]: Without dead ends: 905 [2018-09-28 09:56:10,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-09-28 09:56:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-09-28 09:56:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-09-28 09:56:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-28 09:56:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-09-28 09:56:10,730 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-09-28 09:56:10,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:10,731 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-09-28 09:56:10,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-09-28 09:56:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:10,732 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:10,732 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:10,733 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:10,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-09-28 09:56:10,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:10,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:10,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:10,855 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:10,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:10,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:10,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:10,856 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-09-28 09:56:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:12,574 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-09-28 09:56:12,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-28 09:56:12,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:12,578 INFO L225 Difference]: With dead ends: 886 [2018-09-28 09:56:12,578 INFO L226 Difference]: Without dead ends: 878 [2018-09-28 09:56:12,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-09-28 09:56:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-09-28 09:56:12,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-09-28 09:56:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-09-28 09:56:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-09-28 09:56:12,692 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-09-28 09:56:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:12,693 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-09-28 09:56:12,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-09-28 09:56:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:12,694 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:12,694 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:12,694 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:12,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:12,695 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-28 09:56:12,695 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:12,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:12,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:12,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:12,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:12,788 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:12,788 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:12,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:12,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:12,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:12,789 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-09-28 09:56:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:14,796 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-09-28 09:56:14,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-28 09:56:14,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:14,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:14,800 INFO L225 Difference]: With dead ends: 801 [2018-09-28 09:56:14,800 INFO L226 Difference]: Without dead ends: 793 [2018-09-28 09:56:14,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-09-28 09:56:14,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-09-28 09:56:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-09-28 09:56:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-28 09:56:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-09-28 09:56:14,978 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-09-28 09:56:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:14,978 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-09-28 09:56:14,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-09-28 09:56:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:14,979 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:14,979 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:14,980 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:14,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-09-28 09:56:14,980 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:14,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:14,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:14,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:14,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:15,075 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:15,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:15,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:15,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:15,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:15,076 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-09-28 09:56:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:17,613 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-09-28 09:56:17,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-28 09:56:17,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:17,618 INFO L225 Difference]: With dead ends: 962 [2018-09-28 09:56:17,618 INFO L226 Difference]: Without dead ends: 954 [2018-09-28 09:56:17,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-28 09:56:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-28 09:56:17,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-09-28 09:56:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-28 09:56:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-09-28 09:56:17,772 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-09-28 09:56:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:17,773 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-09-28 09:56:17,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-09-28 09:56:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:17,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:17,774 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:17,774 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:17,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:17,774 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-28 09:56:17,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:17,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:17,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:17,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:17,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:17,863 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:17,863 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:17,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:17,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:17,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:17,864 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-09-28 09:56:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:20,290 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-09-28 09:56:20,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-28 09:56:20,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:20,296 INFO L225 Difference]: With dead ends: 1000 [2018-09-28 09:56:20,296 INFO L226 Difference]: Without dead ends: 992 [2018-09-28 09:56:20,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-28 09:56:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-09-28 09:56:20,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-09-28 09:56:20,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-09-28 09:56:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-09-28 09:56:20,495 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-09-28 09:56:20,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:20,495 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-09-28 09:56:20,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:20,495 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-09-28 09:56:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:20,496 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:20,496 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:20,497 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:20,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:20,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-09-28 09:56:20,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:20,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:20,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:20,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:20,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:20,596 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:20,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:20,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:20,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:20,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:20,597 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-09-28 09:56:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:23,459 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-09-28 09:56:23,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-28 09:56:23,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:23,465 INFO L225 Difference]: With dead ends: 1065 [2018-09-28 09:56:23,465 INFO L226 Difference]: Without dead ends: 1057 [2018-09-28 09:56:23,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-28 09:56:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-09-28 09:56:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-09-28 09:56:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-09-28 09:56:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-09-28 09:56:23,680 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-09-28 09:56:23,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:23,681 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-09-28 09:56:23,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:23,681 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-09-28 09:56:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:23,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:23,682 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:23,683 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:23,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-09-28 09:56:23,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:23,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:23,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:23,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:23,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:23,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:23,763 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:23,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:23,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:23,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:23,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:23,764 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-09-28 09:56:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:27,042 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-09-28 09:56:27,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-28 09:56:27,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:27,049 INFO L225 Difference]: With dead ends: 1227 [2018-09-28 09:56:27,049 INFO L226 Difference]: Without dead ends: 1219 [2018-09-28 09:56:27,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-09-28 09:56:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-09-28 09:56:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-09-28 09:56:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-09-28 09:56:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-09-28 09:56:27,244 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-09-28 09:56:27,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:27,244 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-09-28 09:56:27,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-09-28 09:56:27,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:27,244 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:27,245 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:27,245 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:27,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:27,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-28 09:56:27,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:27,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:27,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:27,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:27,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:27,329 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:27,329 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:27,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:27,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:27,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:27,330 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-09-28 09:56:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:30,176 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-09-28 09:56:30,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-28 09:56:30,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:30,181 INFO L225 Difference]: With dead ends: 1076 [2018-09-28 09:56:30,181 INFO L226 Difference]: Without dead ends: 1068 [2018-09-28 09:56:30,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-28 09:56:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-09-28 09:56:30,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-09-28 09:56:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-28 09:56:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-09-28 09:56:30,433 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-09-28 09:56:30,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:30,433 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-09-28 09:56:30,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:30,433 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-09-28 09:56:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:30,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:30,434 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:30,434 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:30,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-09-28 09:56:30,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:30,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:30,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:30,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:30,532 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:30,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:30,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:30,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:30,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:30,533 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-09-28 09:56:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:33,180 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-09-28 09:56:33,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-28 09:56:33,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:33,189 INFO L225 Difference]: With dead ends: 1111 [2018-09-28 09:56:33,190 INFO L226 Difference]: Without dead ends: 1103 [2018-09-28 09:56:33,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-09-28 09:56:33,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-09-28 09:56:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-09-28 09:56:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-28 09:56:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-09-28 09:56:33,509 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-09-28 09:56:33,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:33,509 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-09-28 09:56:33,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-09-28 09:56:33,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:33,510 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:33,510 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:33,510 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:33,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:33,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-09-28 09:56:33,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:33,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:33,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:33,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:33,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:33,611 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:33,611 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:33,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:33,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:33,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:33,612 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-09-28 09:56:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:37,115 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-09-28 09:56:37,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-28 09:56:37,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:37,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:37,123 INFO L225 Difference]: With dead ends: 1304 [2018-09-28 09:56:37,123 INFO L226 Difference]: Without dead ends: 1296 [2018-09-28 09:56:37,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-09-28 09:56:37,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-28 09:56:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-09-28 09:56:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-28 09:56:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-09-28 09:56:37,441 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-09-28 09:56:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:37,441 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-09-28 09:56:37,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-09-28 09:56:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:37,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:37,442 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:37,442 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:37,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:37,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-09-28 09:56:37,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:37,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:37,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:37,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:37,525 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:37,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:37,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:37,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:37,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:37,526 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-09-28 09:56:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:41,293 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-09-28 09:56:41,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-28 09:56:41,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:41,301 INFO L225 Difference]: With dead ends: 1370 [2018-09-28 09:56:41,301 INFO L226 Difference]: Without dead ends: 1362 [2018-09-28 09:56:41,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-09-28 09:56:41,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-09-28 09:56:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-09-28 09:56:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-28 09:56:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-09-28 09:56:41,637 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-09-28 09:56:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:41,637 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-09-28 09:56:41,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-09-28 09:56:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:41,638 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:41,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:41,639 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:41,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:41,639 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-28 09:56:41,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:41,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:41,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:41,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:41,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:41,920 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:41,920 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:41,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:41,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:41,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:41,921 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-09-28 09:56:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:44,764 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-09-28 09:56:44,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-28 09:56:44,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:44,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:44,769 INFO L225 Difference]: With dead ends: 1298 [2018-09-28 09:56:44,769 INFO L226 Difference]: Without dead ends: 1290 [2018-09-28 09:56:44,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-09-28 09:56:44,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-09-28 09:56:45,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-09-28 09:56:45,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-28 09:56:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-28 09:56:45,274 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-28 09:56:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:45,274 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-28 09:56:45,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-28 09:56:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-28 09:56:45,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:45,275 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:45,275 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:45,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-09-28 09:56:45,276 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:45,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:45,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:45,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:45,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:45,325 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:45,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 09:56:45,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-28 09:56:45,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-28 09:56:45,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-28 09:56:45,327 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-28 09:56:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:46,251 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-09-28 09:56:46,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-28 09:56:46,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-28 09:56:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:46,254 INFO L225 Difference]: With dead ends: 1242 [2018-09-28 09:56:46,254 INFO L226 Difference]: Without dead ends: 673 [2018-09-28 09:56:46,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-28 09:56:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-09-28 09:56:46,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-09-28 09:56:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-09-28 09:56:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-09-28 09:56:46,698 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-09-28 09:56:46,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:46,698 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-09-28 09:56:46,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-28 09:56:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-09-28 09:56:46,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-28 09:56:46,699 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:46,699 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:46,700 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:46,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:46,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-09-28 09:56:46,700 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:46,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:46,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:46,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:46,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:46,841 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:46,841 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-09-28 09:56:46,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:46,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:48,128 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:48,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-28 09:56:48,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-28 09:56:48,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-28 09:56:48,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-28 09:56:48,129 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-09-28 09:56:52,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:52,407 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-09-28 09:56:52,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-28 09:56:52,407 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-28 09:56:52,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:52,410 INFO L225 Difference]: With dead ends: 854 [2018-09-28 09:56:52,410 INFO L226 Difference]: Without dead ends: 849 [2018-09-28 09:56:52,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-09-28 09:56:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-09-28 09:56:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-09-28 09:56:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-28 09:56:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-09-28 09:56:53,480 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-09-28 09:56:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:53,480 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-09-28 09:56:53,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-28 09:56:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-09-28 09:56:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-28 09:56:53,481 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:53,482 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:53,482 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:53,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-09-28 09:56:53,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:53,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:53,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:53,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:53,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:53,716 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:53,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 09:56:53,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-28 09:56:53,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-28 09:56:53,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-28 09:56:53,717 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-09-28 09:56:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:55,767 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-09-28 09:56:55,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-28 09:56:55,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-28 09:56:55,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:55,769 INFO L225 Difference]: With dead ends: 1308 [2018-09-28 09:56:55,769 INFO L226 Difference]: Without dead ends: 709 [2018-09-28 09:56:55,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-28 09:56:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-09-28 09:56:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-09-28 09:56:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-28 09:56:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-28 09:56:56,386 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-28 09:56:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:56,386 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-28 09:56:56,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-28 09:56:56,386 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-28 09:56:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:56:56,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:56,387 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:56,388 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:56,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:56,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-09-28 09:56:56,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:56,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:56,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:56,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:56,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:57,090 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:57,090 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:56:57,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:57,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:57,295 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:57,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-28 09:56:57,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-28 09:56:57,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-28 09:56:57,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:56:57,296 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-09-28 09:57:05,053 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-28 09:57:07,774 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-28 09:57:10,377 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-28 09:57:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:13,841 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-09-28 09:57:13,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-28 09:57:13,841 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-28 09:57:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:13,844 INFO L225 Difference]: With dead ends: 2011 [2018-09-28 09:57:13,845 INFO L226 Difference]: Without dead ends: 2003 [2018-09-28 09:57:13,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9561 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=3074, Invalid=22366, Unknown=0, NotChecked=0, Total=25440 [2018-09-28 09:57:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-09-28 09:57:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-09-28 09:57:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-09-28 09:57:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-09-28 09:57:15,145 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-09-28 09:57:15,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:15,145 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-09-28 09:57:15,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-28 09:57:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-09-28 09:57:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:15,146 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:15,146 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:15,147 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:15,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:15,147 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-09-28 09:57:15,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:15,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:15,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:15,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:15,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:15,260 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:15,260 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-09-28 09:57:15,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:15,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:15,471 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:15,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-28 09:57:15,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-28 09:57:15,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-28 09:57:15,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:57:15,473 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states. [2018-09-28 09:57:28,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:28,623 INFO L93 Difference]: Finished difference Result 2797 states and 6168 transitions. [2018-09-28 09:57:28,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-28 09:57:28,624 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-28 09:57:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:28,630 INFO L225 Difference]: With dead ends: 2797 [2018-09-28 09:57:28,631 INFO L226 Difference]: Without dead ends: 2789 [2018-09-28 09:57:28,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6171 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2430, Invalid=14862, Unknown=0, NotChecked=0, Total=17292 [2018-09-28 09:57:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2018-09-28 09:57:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1186. [2018-09-28 09:57:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-09-28 09:57:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2705 transitions. [2018-09-28 09:57:29,926 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2705 transitions. Word has length 16 [2018-09-28 09:57:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:29,926 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 2705 transitions. [2018-09-28 09:57:29,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-28 09:57:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2705 transitions. [2018-09-28 09:57:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:29,927 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:29,927 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:29,928 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:29,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:29,928 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-09-28 09:57:29,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:29,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:29,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:29,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:29,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:30,145 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:30,145 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:57:30,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:30,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:30,431 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:30,431 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-28 09:57:30,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-28 09:57:30,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-28 09:57:30,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:57:30,432 INFO L87 Difference]: Start difference. First operand 1186 states and 2705 transitions. Second operand 17 states. [2018-09-28 09:57:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:42,277 INFO L93 Difference]: Finished difference Result 2492 states and 5544 transitions. [2018-09-28 09:57:42,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-28 09:57:42,278 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-28 09:57:42,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:42,284 INFO L225 Difference]: With dead ends: 2492 [2018-09-28 09:57:42,284 INFO L226 Difference]: Without dead ends: 2484 [2018-09-28 09:57:42,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4610 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1718, Invalid=11392, Unknown=0, NotChecked=0, Total=13110 [2018-09-28 09:57:42,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2018-09-28 09:57:43,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1219. [2018-09-28 09:57:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-09-28 09:57:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2792 transitions. [2018-09-28 09:57:43,856 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2792 transitions. Word has length 16 [2018-09-28 09:57:43,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:43,856 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2792 transitions. [2018-09-28 09:57:43,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-28 09:57:43,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2792 transitions. [2018-09-28 09:57:43,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:43,857 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:43,857 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:43,858 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:43,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:43,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-09-28 09:57:43,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:43,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:43,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:43,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:43,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:43,937 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:43,938 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:57:43,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:43,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:44,135 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-28 09:57:44,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-09-28 09:57:44,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-28 09:57:44,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-28 09:57:44,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:57:44,136 INFO L87 Difference]: Start difference. First operand 1219 states and 2792 transitions. Second operand 17 states. [2018-09-28 09:58:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:00,881 INFO L93 Difference]: Finished difference Result 3178 states and 7226 transitions. [2018-09-28 09:58:00,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-28 09:58:00,882 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-28 09:58:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:00,890 INFO L225 Difference]: With dead ends: 3178 [2018-09-28 09:58:00,890 INFO L226 Difference]: Without dead ends: 3170 [2018-09-28 09:58:00,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9560 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2932, Invalid=21248, Unknown=0, NotChecked=0, Total=24180 [2018-09-28 09:58:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2018-09-28 09:58:02,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 1242. [2018-09-28 09:58:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2018-09-28 09:58:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2857 transitions. [2018-09-28 09:58:02,384 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 2857 transitions. Word has length 16 [2018-09-28 09:58:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:02,384 INFO L480 AbstractCegarLoop]: Abstraction has 1242 states and 2857 transitions. [2018-09-28 09:58:02,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-28 09:58:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2857 transitions. [2018-09-28 09:58:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:58:02,385 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:02,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:58:02,386 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:02,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:02,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-09-28 09:58:02,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:02,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:02,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:02,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:02,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:02,520 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:58:02,520 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:58:02,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:02,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:58:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:02,734 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-28 09:58:02,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-09-28 09:58:02,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-28 09:58:02,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-28 09:58:02,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:58:02,735 INFO L87 Difference]: Start difference. First operand 1242 states and 2857 transitions. Second operand 17 states. [2018-09-28 09:58:16,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:16,291 INFO L93 Difference]: Finished difference Result 2638 states and 5927 transitions. [2018-09-28 09:58:16,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-28 09:58:16,291 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-28 09:58:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:16,299 INFO L225 Difference]: With dead ends: 2638 [2018-09-28 09:58:16,299 INFO L226 Difference]: Without dead ends: 2630 [2018-09-28 09:58:16,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5685 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1807, Invalid=13199, Unknown=0, NotChecked=0, Total=15006 [2018-09-28 09:58:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2018-09-28 09:58:18,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1469. [2018-09-28 09:58:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-09-28 09:58:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3433 transitions. [2018-09-28 09:58:18,133 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3433 transitions. Word has length 16 [2018-09-28 09:58:18,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:18,133 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 3433 transitions. [2018-09-28 09:58:18,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-28 09:58:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3433 transitions. [2018-09-28 09:58:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:58:18,134 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:18,134 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:58:18,134 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:18,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:18,135 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-09-28 09:58:18,135 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:18,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:18,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:18,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:18,245 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:58:18,246 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:58:18,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:18,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:58:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:18,427 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:58:18,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-28 09:58:18,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-28 09:58:18,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-28 09:58:18,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:58:18,428 INFO L87 Difference]: Start difference. First operand 1469 states and 3433 transitions. Second operand 17 states. [2018-09-28 09:58:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:32,154 INFO L93 Difference]: Finished difference Result 2854 states and 6510 transitions. [2018-09-28 09:58:32,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-28 09:58:32,154 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-28 09:58:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:32,157 INFO L225 Difference]: With dead ends: 2854 [2018-09-28 09:58:32,158 INFO L226 Difference]: Without dead ends: 2846 [2018-09-28 09:58:32,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1456, Invalid=7664, Unknown=0, NotChecked=0, Total=9120 [2018-09-28 09:58:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2018-09-28 09:58:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 1479. [2018-09-28 09:58:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1479 states. [2018-09-28 09:58:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3457 transitions. [2018-09-28 09:58:33,844 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3457 transitions. Word has length 16 [2018-09-28 09:58:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:33,844 INFO L480 AbstractCegarLoop]: Abstraction has 1479 states and 3457 transitions. [2018-09-28 09:58:33,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-28 09:58:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3457 transitions. [2018-09-28 09:58:33,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:58:33,845 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:33,845 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:58:33,845 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:33,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:33,846 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-09-28 09:58:33,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:33,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:33,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:33,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:33,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:34,283 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:58:34,283 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:58:34,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:34,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:58:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:34,519 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:58:34,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-28 09:58:34,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-28 09:58:34,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-28 09:58:34,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:58:34,520 INFO L87 Difference]: Start difference. First operand 1479 states and 3457 transitions. Second operand 17 states. [2018-09-28 09:58:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:49,969 INFO L93 Difference]: Finished difference Result 3363 states and 7697 transitions. [2018-09-28 09:58:49,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-28 09:58:49,969 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-28 09:58:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:49,973 INFO L225 Difference]: With dead ends: 3363 [2018-09-28 09:58:49,973 INFO L226 Difference]: Without dead ends: 3355 [2018-09-28 09:58:49,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3712 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1635, Invalid=9495, Unknown=0, NotChecked=0, Total=11130 [2018-09-28 09:58:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2018-09-28 09:58:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 1535. [2018-09-28 09:58:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-09-28 09:58:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 3580 transitions. [2018-09-28 09:58:51,785 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 3580 transitions. Word has length 16 [2018-09-28 09:58:51,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:51,785 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 3580 transitions. [2018-09-28 09:58:51,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-28 09:58:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 3580 transitions. [2018-09-28 09:58:51,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:58:51,786 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:51,786 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:58:51,787 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:51,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:51,787 INFO L82 PathProgramCache]: Analyzing trace with hash 723989304, now seen corresponding path program 1 times [2018-09-28 09:58:51,787 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:51,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:51,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:51,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:51,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:51,971 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:58:51,971 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:58:51,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:51,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:58:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:52,151 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:58:52,151 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-09-28 09:58:52,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-28 09:58:52,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-28 09:58:52,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-09-28 09:58:52,152 INFO L87 Difference]: Start difference. First operand 1535 states and 3580 transitions. Second operand 18 states. [2018-09-28 09:59:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:08,903 INFO L93 Difference]: Finished difference Result 2910 states and 6684 transitions. [2018-09-28 09:59:08,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-28 09:59:08,903 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-09-28 09:59:08,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:08,906 INFO L225 Difference]: With dead ends: 2910 [2018-09-28 09:59:08,906 INFO L226 Difference]: Without dead ends: 2902 [2018-09-28 09:59:08,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3369 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1407, Invalid=8693, Unknown=0, NotChecked=0, Total=10100 [2018-09-28 09:59:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2018-09-28 09:59:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1226. [2018-09-28 09:59:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-09-28 09:59:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 2816 transitions. [2018-09-28 09:59:10,516 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 2816 transitions. Word has length 16 [2018-09-28 09:59:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:10,516 INFO L480 AbstractCegarLoop]: Abstraction has 1226 states and 2816 transitions. [2018-09-28 09:59:10,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-28 09:59:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 2816 transitions. [2018-09-28 09:59:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:59:10,517 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:10,517 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:59:10,517 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:10,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times [2018-09-28 09:59:10,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:10,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:10,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:10,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:10,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:59:10,591 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:59:10,591 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:59:10,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:10,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:59:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:59:10,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:59:10,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-28 09:59:10,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-28 09:59:10,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-28 09:59:10,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:59:10,859 INFO L87 Difference]: Start difference. First operand 1226 states and 2816 transitions. Second operand 17 states. [2018-09-28 09:59:24,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:24,817 INFO L93 Difference]: Finished difference Result 2474 states and 5593 transitions. [2018-09-28 09:59:24,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-28 09:59:24,819 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-28 09:59:24,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:24,822 INFO L225 Difference]: With dead ends: 2474 [2018-09-28 09:59:24,822 INFO L226 Difference]: Without dead ends: 2466 [2018-09-28 09:59:24,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2722 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1240, Invalid=6950, Unknown=0, NotChecked=0, Total=8190 [2018-09-28 09:59:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2018-09-28 09:59:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1069. [2018-09-28 09:59:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-09-28 09:59:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2444 transitions. [2018-09-28 09:59:26,228 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2444 transitions. Word has length 16 [2018-09-28 09:59:26,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:26,228 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 2444 transitions. [2018-09-28 09:59:26,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-28 09:59:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2444 transitions. [2018-09-28 09:59:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:59:26,228 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:26,229 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:59:26,229 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:26,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:26,230 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-09-28 09:59:26,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:26,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:26,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:26,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:26,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:26,314 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:59:26,314 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:59:26,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:26,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:59:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:26,354 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:59:26,355 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-28 09:59:26,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:59:26,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:59:26,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:59:26,355 INFO L87 Difference]: Start difference. First operand 1069 states and 2444 transitions. Second operand 8 states. [2018-09-28 09:59:29,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:29,967 INFO L93 Difference]: Finished difference Result 1522 states and 3375 transitions. [2018-09-28 09:59:29,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-28 09:59:29,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-28 09:59:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:29,970 INFO L225 Difference]: With dead ends: 1522 [2018-09-28 09:59:29,970 INFO L226 Difference]: Without dead ends: 1514 [2018-09-28 09:59:29,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-28 09:59:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-09-28 09:59:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1225. [2018-09-28 09:59:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-09-28 09:59:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2809 transitions. [2018-09-28 09:59:31,571 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2809 transitions. Word has length 16 [2018-09-28 09:59:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:31,571 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 2809 transitions. [2018-09-28 09:59:31,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:59:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2809 transitions. [2018-09-28 09:59:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:59:31,572 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:31,572 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:59:31,573 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:31,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:31,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-09-28 09:59:31,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:31,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:31,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:31,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:31,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:31,678 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:59:31,678 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:59:31,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:31,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:59:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:31,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:59:31,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-28 09:59:31,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:59:31,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:59:31,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:59:31,745 INFO L87 Difference]: Start difference. First operand 1225 states and 2809 transitions. Second operand 8 states. [2018-09-28 09:59:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:35,827 INFO L93 Difference]: Finished difference Result 1661 states and 3674 transitions. [2018-09-28 09:59:35,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-28 09:59:35,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-28 09:59:35,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:35,830 INFO L225 Difference]: With dead ends: 1661 [2018-09-28 09:59:35,830 INFO L226 Difference]: Without dead ends: 1653 [2018-09-28 09:59:35,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-09-28 09:59:35,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-09-28 09:59:37,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1237. [2018-09-28 09:59:37,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2018-09-28 09:59:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2833 transitions. [2018-09-28 09:59:37,392 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2833 transitions. Word has length 16 [2018-09-28 09:59:37,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:37,393 INFO L480 AbstractCegarLoop]: Abstraction has 1237 states and 2833 transitions. [2018-09-28 09:59:37,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:59:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2833 transitions. [2018-09-28 09:59:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:59:37,393 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:37,393 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:59:37,394 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:37,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:37,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-09-28 09:59:37,394 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:37,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:37,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:37,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:37,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:37,461 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:59:37,461 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:59:37,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:37,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:59:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:37,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:59:37,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-28 09:59:37,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:59:37,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:59:37,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:59:37,503 INFO L87 Difference]: Start difference. First operand 1237 states and 2833 transitions. Second operand 8 states. [2018-09-28 09:59:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:42,292 INFO L93 Difference]: Finished difference Result 1772 states and 3936 transitions. [2018-09-28 09:59:42,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-28 09:59:42,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-28 09:59:42,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:42,294 INFO L225 Difference]: With dead ends: 1772 [2018-09-28 09:59:42,294 INFO L226 Difference]: Without dead ends: 1764 [2018-09-28 09:59:42,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-28 09:59:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-09-28 09:59:44,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1318. [2018-09-28 09:59:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2018-09-28 09:59:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 3019 transitions. [2018-09-28 09:59:44,104 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 3019 transitions. Word has length 16 [2018-09-28 09:59:44,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:44,104 INFO L480 AbstractCegarLoop]: Abstraction has 1318 states and 3019 transitions. [2018-09-28 09:59:44,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:59:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 3019 transitions. [2018-09-28 09:59:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:59:44,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:44,105 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:59:44,105 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:44,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:44,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-09-28 09:59:44,105 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:44,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:44,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:44,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:44,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:44,188 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:59:44,188 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:59:44,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:44,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:59:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:44,225 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:59:44,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-28 09:59:44,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:59:44,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:59:44,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:59:44,226 INFO L87 Difference]: Start difference. First operand 1318 states and 3019 transitions. Second operand 8 states. [2018-09-28 09:59:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:48,333 INFO L93 Difference]: Finished difference Result 1789 states and 3956 transitions. [2018-09-28 09:59:48,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-28 09:59:48,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-28 09:59:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:48,336 INFO L225 Difference]: With dead ends: 1789 [2018-09-28 09:59:48,336 INFO L226 Difference]: Without dead ends: 1781 [2018-09-28 09:59:48,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-28 09:59:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. Received shutdown request... [2018-09-28 09:59:50,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1345. [2018-09-28 09:59:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-09-28 09:59:50,164 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-28 09:59:50,170 WARN L206 ceAbstractionStarter]: Timeout [2018-09-28 09:59:50,171 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.09 09:59:50 BoogieIcfgContainer [2018-09-28 09:59:50,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-28 09:59:50,172 INFO L168 Benchmark]: Toolchain (without parser) took 253466.18 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 351.8 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 396.2 MB). Peak memory consumption was 994.6 MB. Max. memory is 7.1 GB. [2018-09-28 09:59:50,173 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 09:59:50,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 09:59:50,174 INFO L168 Benchmark]: Boogie Preprocessor took 60.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 09:59:50,174 INFO L168 Benchmark]: RCFGBuilder took 925.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-28 09:59:50,175 INFO L168 Benchmark]: TraceAbstraction took 252408.45 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 351.8 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 364.5 MB). Peak memory consumption was 962.9 MB. Max. memory is 7.1 GB. [2018-09-28 09:59:50,178 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 925.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252408.45 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 351.8 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 364.5 MB). Peak memory consumption was 962.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 252.3s OverallTime, 40 OverallIterations, 2 TraceHistogramMax, 215.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12034 SDtfs, 40593 SDslu, 48373 SDs, 0 SdLazy, 117762 SolverSat, 8793 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 107.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2001 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 1701 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 51475 ImplicationChecksByTransitivity, 40.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1535occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 26.6s AutomataMinimizationTime, 40 MinimizatonAttempts, 26099 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 740 NumberOfCodeBlocks, 740 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 686 ConstructedInterpolants, 78 QuantifiedInterpolants, 45030 SizeOfPredicates, 84 NumberOfNonLiveVariables, 555 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 54 InterpolantComputations, 28 PerfectInterpolantSequences, 38/79 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-28_09-59-50-190.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-28_09-59-50-190.csv Completed graceful shutdown