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_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:42:03,240 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:42:03,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:42:03,255 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:42:03,256 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:42:03,257 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:42:03,258 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:42:03,260 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:42:03,261 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:42:03,262 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:42:03,263 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:42:03,263 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:42:03,264 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:42:03,265 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:42:03,266 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:42:03,267 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:42:03,268 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:42:03,270 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:42:03,272 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:42:03,273 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:42:03,274 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:42:03,275 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:42:03,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:42:03,278 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:42:03,278 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:42:03,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:42:03,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:42:03,281 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:42:03,282 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:42:03,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:42:03,283 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:42:03,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:42:03,284 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:42:03,285 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:42:03,286 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:42:03,286 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:42:03,287 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:42:03,317 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:42:03,317 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:42:03,318 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:42:03,318 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:42:03,319 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:42:03,319 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:42:03,319 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:42:03,319 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:42:03,320 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:42:03,320 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:42:03,320 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:42:03,320 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:42:03,320 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:42:03,320 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:42:03,322 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:42:03,322 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:42:03,322 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:42:03,322 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:42:03,322 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:42:03,323 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:42:03,324 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:42:03,324 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:42:03,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:42:03,324 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:42:03,324 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:42:03,325 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:42:03,325 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:42:03,325 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:42:03,325 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:42:03,325 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:42:03,326 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:42:03,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:42:03,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:42:03,404 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:42:03,406 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:42:03,407 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:42:03,408 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl [2018-10-04 12:42:03,408 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-10-04 12:42:03,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:42:03,485 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:42:03,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:42:03,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:42:03,487 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:42:03,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:03" (1/1) ... [2018-10-04 12:42:03,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:03" (1/1) ... [2018-10-04 12:42:03,527 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:42:03,527 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:42:03,527 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:42:03,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:42:03,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:42:03,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:42:03,531 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:42:03,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:03" (1/1) ... [2018-10-04 12:42:03,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:03" (1/1) ... [2018-10-04 12:42:03,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:03" (1/1) ... [2018-10-04 12:42:03,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:03" (1/1) ... [2018-10-04 12:42:03,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:03" (1/1) ... [2018-10-04 12:42:03,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:03" (1/1) ... [2018-10-04 12:42:03,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:03" (1/1) ... [2018-10-04 12:42:03,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:42:03,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:42:03,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:42:03,564 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:42:03,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:03" (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-10-04 12:42:03,643 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 12:42:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 12:42:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 12:42:04,598 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:42:04,599 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:42:04 BoogieIcfgContainer [2018-10-04 12:42:04,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:42:04,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:42:04,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:42:04,604 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:42:04,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:03" (1/2) ... [2018-10-04 12:42:04,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec80d6b and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:42:04, skipping insertion in model container [2018-10-04 12:42:04,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:42:04" (2/2) ... [2018-10-04 12:42:04,607 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-10-04 12:42:04,618 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:42:04,627 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-10-04 12:42:04,681 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:42:04,682 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:42:04,682 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:42:04,682 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:42:04,682 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:42:04,682 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:42:04,683 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:42:04,683 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:42:04,683 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:42:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-10-04 12:42:04,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:42:04,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:04,711 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:04,713 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:04,720 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:04,720 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-10-04 12:42:04,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:04,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:04,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:04,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:05,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:05,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:42:05,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:42:05,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:42:05,156 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:05,158 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-10-04 12:42:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:07,024 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-10-04 12:42:07,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:42:07,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 12:42:07,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:07,044 INFO L225 Difference]: With dead ends: 163 [2018-10-04 12:42:07,044 INFO L226 Difference]: Without dead ends: 158 [2018-10-04 12:42:07,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 7 [2018-10-04 12:42:07,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-04 12:42:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-10-04 12:42:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-04 12:42:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-10-04 12:42:07,125 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-10-04 12:42:07,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:07,126 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-10-04 12:42:07,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:42:07,126 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-10-04 12:42:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:42:07,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:07,128 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:07,131 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:07,131 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:07,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-10-04 12:42:07,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:07,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:07,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:07,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:07,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:07,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:42:07,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:42:07,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:42:07,331 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:07,332 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-10-04 12:42:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:08,253 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-10-04 12:42:08,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:42:08,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 12:42:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:08,257 INFO L225 Difference]: With dead ends: 188 [2018-10-04 12:42:08,257 INFO L226 Difference]: Without dead ends: 183 [2018-10-04 12:42:08,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 12:42:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-04 12:42:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-10-04 12:42:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-04 12:42:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-10-04 12:42:08,284 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-10-04 12:42:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:08,284 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-10-04 12:42:08,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:42:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-10-04 12:42:08,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:42:08,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:08,286 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:08,287 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:08,287 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:08,288 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-10-04 12:42:08,288 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:08,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:08,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:08,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:08,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:08,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:08,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:42:08,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:08,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:08,396 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:08,396 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-10-04 12:42:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:10,006 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-10-04 12:42:10,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:42:10,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-04 12:42:10,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:10,011 INFO L225 Difference]: With dead ends: 283 [2018-10-04 12:42:10,011 INFO L226 Difference]: Without dead ends: 278 [2018-10-04 12:42:10,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 12 [2018-10-04 12:42:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-04 12:42:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-10-04 12:42:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-04 12:42:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-10-04 12:42:10,044 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-10-04 12:42:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:10,045 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-10-04 12:42:10,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-10-04 12:42:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:42:10,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:10,047 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:10,047 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:10,048 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:10,048 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-10-04 12:42:10,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:10,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:10,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:10,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:10,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:10,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:42:10,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:10,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:10,152 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:10,152 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-10-04 12:42:12,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:12,516 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-10-04 12:42:12,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:42:12,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-04 12:42:12,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:12,521 INFO L225 Difference]: With dead ends: 387 [2018-10-04 12:42:12,522 INFO L226 Difference]: Without dead ends: 375 [2018-10-04 12:42:12,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 13 [2018-10-04 12:42:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-04 12:42:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-10-04 12:42:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-04 12:42:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-10-04 12:42:12,571 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-10-04 12:42:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:12,571 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-10-04 12:42:12,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-10-04 12:42:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:12,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:12,574 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:12,575 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:12,575 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:12,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-10-04 12:42:12,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:12,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:12,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:12,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:12,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:12,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:12,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:12,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:12,690 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:12,690 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-10-04 12:42:13,515 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:16,473 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-10-04 12:42:16,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:42:16,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:16,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:16,480 INFO L225 Difference]: With dead ends: 725 [2018-10-04 12:42:16,481 INFO L226 Difference]: Without dead ends: 717 [2018-10-04 12:42:16,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 6 [2018-10-04 12:42:16,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-04 12:42:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-10-04 12:42:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-04 12:42:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-10-04 12:42:16,544 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-10-04 12:42:16,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:16,544 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-10-04 12:42:16,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-10-04 12:42:16,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:16,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:16,546 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:16,547 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:16,547 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:16,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-10-04 12:42:16,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:16,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:16,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:16,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:16,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:16,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:16,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:16,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:16,696 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:16,696 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-10-04 12:42:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:20,706 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-10-04 12:42:20,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:42:20,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:20,714 INFO L225 Difference]: With dead ends: 1008 [2018-10-04 12:42:20,714 INFO L226 Difference]: Without dead ends: 1000 [2018-10-04 12:42:20,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 18 [2018-10-04 12:42:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-10-04 12:42:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-10-04 12:42:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-04 12:42:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-10-04 12:42:20,795 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-10-04 12:42:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:20,795 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-10-04 12:42:20,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-10-04 12:42:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:20,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:20,797 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:20,798 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:20,798 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:20,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-10-04 12:42:20,798 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:20,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:20,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:20,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:20,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:20,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:20,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:20,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:20,941 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:20,942 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-10-04 12:42:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:23,488 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-10-04 12:42:23,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:42:23,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:23,495 INFO L225 Difference]: With dead ends: 924 [2018-10-04 12:42:23,496 INFO L226 Difference]: Without dead ends: 916 [2018-10-04 12:42:23,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 18 [2018-10-04 12:42:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-10-04 12:42:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-10-04 12:42:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-04 12:42:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-10-04 12:42:23,583 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-10-04 12:42:23,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:23,584 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-10-04 12:42:23,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-10-04 12:42:23,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:23,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:23,585 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:23,586 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:23,586 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:23,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-10-04 12:42:23,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:23,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:23,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:23,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:23,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:23,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:23,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:23,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:23,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:23,694 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:23,694 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-10-04 12:42:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:25,656 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-10-04 12:42:25,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:42:25,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:25,663 INFO L225 Difference]: With dead ends: 791 [2018-10-04 12:42:25,663 INFO L226 Difference]: Without dead ends: 783 [2018-10-04 12:42:25,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 17 [2018-10-04 12:42:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-10-04 12:42:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-10-04 12:42:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-04 12:42:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-10-04 12:42:25,778 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-10-04 12:42:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:25,778 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-10-04 12:42:25,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-10-04 12:42:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:25,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:25,779 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:25,780 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:25,780 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-10-04 12:42:25,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:25,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:25,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:25,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:25,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:26,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:26,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:26,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:26,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:26,317 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:26,318 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-10-04 12:42:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:28,506 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-10-04 12:42:28,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:42:28,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:28,514 INFO L225 Difference]: With dead ends: 1040 [2018-10-04 12:42:28,514 INFO L226 Difference]: Without dead ends: 1032 [2018-10-04 12:42:28,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 18 [2018-10-04 12:42:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-10-04 12:42:28,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-10-04 12:42:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-04 12:42:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-10-04 12:42:28,643 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-10-04 12:42:28,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:28,644 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-10-04 12:42:28,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-10-04 12:42:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:28,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:28,645 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:28,645 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:28,646 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:28,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-10-04 12:42:28,646 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:28,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:28,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:28,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:28,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:28,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:28,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:28,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:28,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:28,804 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:28,805 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-10-04 12:42:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:31,614 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-10-04 12:42:31,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:42:31,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:31,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:31,621 INFO L225 Difference]: With dead ends: 1166 [2018-10-04 12:42:31,622 INFO L226 Difference]: Without dead ends: 1158 [2018-10-04 12:42:31,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 19 [2018-10-04 12:42:31,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-10-04 12:42:31,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-10-04 12:42:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-04 12:42:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-10-04 12:42:31,759 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-10-04 12:42:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:31,759 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-10-04 12:42:31,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-10-04 12:42:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:31,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:31,761 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:31,761 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:31,761 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-10-04 12:42:31,762 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:31,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:31,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:31,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:31,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:31,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:31,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:31,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:31,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:31,912 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:31,912 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-10-04 12:42:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:34,391 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-10-04 12:42:34,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:42:34,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:34,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:34,397 INFO L225 Difference]: With dead ends: 1127 [2018-10-04 12:42:34,398 INFO L226 Difference]: Without dead ends: 1119 [2018-10-04 12:42:34,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 18 [2018-10-04 12:42:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-10-04 12:42:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-10-04 12:42:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-04 12:42:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-10-04 12:42:34,583 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-10-04 12:42:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:34,584 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-10-04 12:42:34,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-10-04 12:42:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:34,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:34,585 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:34,585 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:34,585 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:34,586 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-10-04 12:42:34,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:34,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:34,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:34,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:34,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:34,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:34,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:34,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:34,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:34,825 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:34,826 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-10-04 12:42:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:37,302 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-10-04 12:42:37,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:42:37,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:37,308 INFO L225 Difference]: With dead ends: 975 [2018-10-04 12:42:37,309 INFO L226 Difference]: Without dead ends: 967 [2018-10-04 12:42:37,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 18 [2018-10-04 12:42:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-10-04 12:42:37,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-10-04 12:42:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-04 12:42:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-10-04 12:42:37,481 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-10-04 12:42:37,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:37,482 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-10-04 12:42:37,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-10-04 12:42:37,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:37,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:37,483 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:37,484 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:37,484 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:37,484 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-10-04 12:42:37,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:37,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:37,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:37,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:37,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:37,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:37,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:37,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:37,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:37,590 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:37,590 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-10-04 12:42:40,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:40,264 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-10-04 12:42:40,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:42:40,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:40,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:40,269 INFO L225 Difference]: With dead ends: 1011 [2018-10-04 12:42:40,270 INFO L226 Difference]: Without dead ends: 1003 [2018-10-04 12:42:40,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 18 [2018-10-04 12:42:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-10-04 12:42:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-10-04 12:42:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-04 12:42:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-10-04 12:42:40,471 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-10-04 12:42:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:40,471 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-10-04 12:42:40,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-10-04 12:42:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:40,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:40,473 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:40,473 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:40,473 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:40,474 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-10-04 12:42:40,474 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:40,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:40,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:40,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:40,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:40,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:40,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:40,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:40,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:40,581 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:40,581 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-10-04 12:42:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:42,676 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-10-04 12:42:42,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:42:42,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:42,681 INFO L225 Difference]: With dead ends: 859 [2018-10-04 12:42:42,681 INFO L226 Difference]: Without dead ends: 851 [2018-10-04 12:42:42,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 17 [2018-10-04 12:42:42,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-10-04 12:42:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-10-04 12:42:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-04 12:42:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-10-04 12:42:42,875 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-10-04 12:42:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:42,876 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-10-04 12:42:42,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-10-04 12:42:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:42,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:42,876 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:42,877 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:42,877 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-10-04 12:42:42,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:42,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:42,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:42,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:42,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:42,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:42,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:42,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:42,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:42,961 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:42,961 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-10-04 12:42:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:45,432 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-10-04 12:42:45,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:42:45,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:45,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:45,437 INFO L225 Difference]: With dead ends: 962 [2018-10-04 12:42:45,438 INFO L226 Difference]: Without dead ends: 954 [2018-10-04 12:42:45,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 12:42:45,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-10-04 12:42:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-10-04 12:42:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-10-04 12:42:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-10-04 12:42:45,671 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-10-04 12:42:45,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:45,671 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-10-04 12:42:45,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-10-04 12:42:45,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:45,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:45,672 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:45,673 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:45,673 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:45,673 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-10-04 12:42:45,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:45,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:45,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:45,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:45,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:45,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:45,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:45,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:45,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:45,761 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:45,761 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-10-04 12:42:48,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:48,381 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-10-04 12:42:48,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:42:48,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:48,387 INFO L225 Difference]: With dead ends: 1064 [2018-10-04 12:42:48,387 INFO L226 Difference]: Without dead ends: 1056 [2018-10-04 12:42:48,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-04 12:42:48,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-10-04 12:42:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-10-04 12:42:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-10-04 12:42:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-10-04 12:42:48,694 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-10-04 12:42:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:48,694 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-10-04 12:42:48,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:48,695 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-10-04 12:42:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:48,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:48,695 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:48,696 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:48,696 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:48,696 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-10-04 12:42:48,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:48,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:48,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:48,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:48,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:48,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:48,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:48,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:48,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:48,797 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:48,797 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-10-04 12:42:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:52,161 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-10-04 12:42:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:42:52,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:52,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:52,167 INFO L225 Difference]: With dead ends: 1241 [2018-10-04 12:42:52,167 INFO L226 Difference]: Without dead ends: 1233 [2018-10-04 12:42:52,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 14 [2018-10-04 12:42:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-10-04 12:42:52,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-10-04 12:42:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-04 12:42:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-10-04 12:42:52,479 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-10-04 12:42:52,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:52,480 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-10-04 12:42:52,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-10-04 12:42:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:52,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:52,481 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:52,481 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:52,482 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:52,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-10-04 12:42:52,482 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:52,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:52,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:52,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:52,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:52,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:52,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:52,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:52,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:52,563 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:52,563 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-10-04 12:42:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:54,924 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-10-04 12:42:54,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:42:54,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:54,931 INFO L225 Difference]: With dead ends: 1139 [2018-10-04 12:42:54,931 INFO L226 Difference]: Without dead ends: 1131 [2018-10-04 12:42:54,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 15 [2018-10-04 12:42:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-10-04 12:42:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-10-04 12:42:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-10-04 12:42:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-10-04 12:42:55,233 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-10-04 12:42:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:55,233 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-10-04 12:42:55,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-10-04 12:42:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:55,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:55,234 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:55,235 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:55,235 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:55,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-10-04 12:42:55,235 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:55,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:55,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:55,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:55,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:55,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-10-04 12:42:55,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:55,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:55,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:55,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:55,331 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:55,331 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-10-04 12:42:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:58,465 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-10-04 12:42:58,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:42:58,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:58,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:58,471 INFO L225 Difference]: With dead ends: 1325 [2018-10-04 12:42:58,471 INFO L226 Difference]: Without dead ends: 1317 [2018-10-04 12:42:58,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 16 [2018-10-04 12:42:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-10-04 12:42:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-10-04 12:42:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-10-04 12:42:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-10-04 12:42:58,778 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-10-04 12:42:58,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:58,778 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-10-04 12:42:58,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-10-04 12:42:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:58,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:58,779 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:58,779 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:58,779 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:58,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-10-04 12:42:58,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:58,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:58,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:58,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:58,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:58,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:58,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:58,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:58,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:58,852 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:58,852 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-10-04 12:43:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:02,248 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-10-04 12:43:02,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:43:02,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:43:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:02,254 INFO L225 Difference]: With dead ends: 1334 [2018-10-04 12:43:02,254 INFO L226 Difference]: Without dead ends: 1326 [2018-10-04 12:43:02,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 14 [2018-10-04 12:43:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-10-04 12:43:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-10-04 12:43:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-10-04 12:43:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-10-04 12:43:02,607 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-10-04 12:43:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:02,608 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-10-04 12:43:02,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-10-04 12:43:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:43:02,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:02,609 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:02,609 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:02,609 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:02,609 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-10-04 12:43:02,609 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:02,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:02,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:02,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:02,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:02,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:02,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:43:02,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:02,697 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:02,697 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-10-04 12:43:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:04,701 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-10-04 12:43:04,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:43:04,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:43:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:04,706 INFO L225 Difference]: With dead ends: 919 [2018-10-04 12:43:04,706 INFO L226 Difference]: Without dead ends: 911 [2018-10-04 12:43:04,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 15 [2018-10-04 12:43:04,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-10-04 12:43:05,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-10-04 12:43:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-04 12:43:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-10-04 12:43:05,060 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-10-04 12:43:05,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:05,060 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-10-04 12:43:05,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:05,060 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-10-04 12:43:05,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:43:05,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:05,061 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:05,061 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:05,061 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:05,062 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-10-04 12:43:05,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:05,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:05,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:05,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:05,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:05,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:05,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:43:05,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:05,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:05,150 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:05,150 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-10-04 12:43:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:07,889 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-10-04 12:43:07,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:43:07,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:43:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:07,896 INFO L225 Difference]: With dead ends: 1095 [2018-10-04 12:43:07,897 INFO L226 Difference]: Without dead ends: 1087 [2018-10-04 12:43:07,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 16 [2018-10-04 12:43:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-10-04 12:43:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-10-04 12:43:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-04 12:43:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-10-04 12:43:08,274 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-10-04 12:43:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:08,274 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-10-04 12:43:08,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-10-04 12:43:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:43:08,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:08,275 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:08,275 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:08,275 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-10-04 12:43:08,276 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:08,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:08,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:08,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:08,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:08,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:08,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:43:08,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:08,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:08,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:08,362 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-10-04 12:43:12,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:12,308 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-10-04 12:43:12,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:43:12,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:43:12,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:12,311 INFO L225 Difference]: With dead ends: 1304 [2018-10-04 12:43:12,312 INFO L226 Difference]: Without dead ends: 1296 [2018-10-04 12:43:12,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 16 [2018-10-04 12:43:12,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-10-04 12:43:12,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-10-04 12:43:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-10-04 12:43:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-10-04 12:43:12,707 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-10-04 12:43:12,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:12,708 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-10-04 12:43:12,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:12,708 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-10-04 12:43:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:43:12,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:12,709 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:12,709 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:12,710 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:12,710 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-10-04 12:43:12,710 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:12,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:12,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:12,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:12,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:43:12,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:12,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:12,793 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:12,793 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-10-04 12:43:13,907 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 12:43:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:16,113 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-10-04 12:43:16,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:43:16,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:43:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:16,117 INFO L225 Difference]: With dead ends: 1192 [2018-10-04 12:43:16,117 INFO L226 Difference]: Without dead ends: 1184 [2018-10-04 12:43:16,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 12:43:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-10-04 12:43:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-10-04 12:43:16,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-04 12:43:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-10-04 12:43:16,584 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-10-04 12:43:16,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:16,584 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-10-04 12:43:16,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-10-04 12:43:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:43:16,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:16,585 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:16,586 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:16,586 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:16,586 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-10-04 12:43:16,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:16,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:16,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:16,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:16,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:16,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:16,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:43:16,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:43:16,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:43:16,627 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:16,627 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-10-04 12:43:17,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:17,414 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-10-04 12:43:17,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:43:17,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-04 12:43:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:17,416 INFO L225 Difference]: With dead ends: 1139 [2018-10-04 12:43:17,416 INFO L226 Difference]: Without dead ends: 625 [2018-10-04 12:43:17,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 12:43:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-10-04 12:43:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-10-04 12:43:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-04 12:43:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-10-04 12:43:17,871 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-10-04 12:43:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:17,871 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-10-04 12:43:17,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:43:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-10-04 12:43:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:43:17,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:17,872 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:17,872 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:17,872 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:17,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-10-04 12:43:17,873 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:17,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:17,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:17,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:18,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:43:18,001 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-10-04 12:43:18,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:18,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:43:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:18,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:43:18,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-04 12:43:18,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:43:18,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:43:18,630 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:18,630 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-10-04 12:43:22,349 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:43:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:22,984 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-10-04 12:43:22,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:43:22,984 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-10-04 12:43:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:22,986 INFO L225 Difference]: With dead ends: 794 [2018-10-04 12:43:22,986 INFO L226 Difference]: Without dead ends: 789 [2018-10-04 12:43:22,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 6 [2018-10-04 12:43:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-04 12:43:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-10-04 12:43:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-10-04 12:43:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-10-04 12:43:23,615 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-10-04 12:43:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:23,615 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-10-04 12:43:23,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:43:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-10-04 12:43:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:43:23,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:23,616 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:23,616 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:23,616 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:23,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-10-04 12:43:23,617 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:23,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:23,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:23,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:23,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:23,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:23,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:43:23,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:43:23,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:43:23,659 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:23,659 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-10-04 12:43:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:25,071 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-10-04 12:43:25,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:43:25,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-04 12:43:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:25,072 INFO L225 Difference]: With dead ends: 1317 [2018-10-04 12:43:25,072 INFO L226 Difference]: Without dead ends: 729 [2018-10-04 12:43:25,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 12:43:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-04 12:43:25,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-10-04 12:43:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-04 12:43:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-10-04 12:43:25,677 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-10-04 12:43:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:25,677 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-10-04 12:43:25,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:43:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-10-04 12:43:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:43:25,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:25,678 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:25,678 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:25,678 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-10-04 12:43:25,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:25,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:25,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:25,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:25,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:25,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:25,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:43:25,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:25,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:25,755 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:25,755 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-10-04 12:43:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:29,182 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-10-04 12:43:29,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:43:29,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 12:43:29,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:29,185 INFO L225 Difference]: With dead ends: 1435 [2018-10-04 12:43:29,186 INFO L226 Difference]: Without dead ends: 1427 [2018-10-04 12:43:29,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 12:43:29,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-10-04 12:43:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-10-04 12:43:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-04 12:43:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-10-04 12:43:30,100 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-10-04 12:43:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:30,100 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-10-04 12:43:30,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-10-04 12:43:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:43:30,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:30,101 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:30,102 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:30,102 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:30,102 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-10-04 12:43:30,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:30,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:30,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:30,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:30,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:30,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:30,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:43:30,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:30,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:30,371 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:30,371 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-10-04 12:43:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:34,057 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-10-04 12:43:34,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:43:34,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 12:43:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:34,063 INFO L225 Difference]: With dead ends: 1599 [2018-10-04 12:43:34,063 INFO L226 Difference]: Without dead ends: 1591 [2018-10-04 12:43:34,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 13 [2018-10-04 12:43:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-04 12:43:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-10-04 12:43:34,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-04 12:43:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-10-04 12:43:34,841 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-10-04 12:43:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:34,841 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-10-04 12:43:34,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-10-04 12:43:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:43:34,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:34,842 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:34,843 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:34,843 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:34,843 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-10-04 12:43:34,843 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:34,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:34,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:34,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:34,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:34,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:34,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:43:34,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:34,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:34,928 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:34,929 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-10-04 12:43:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:38,151 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-10-04 12:43:38,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:43:38,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 12:43:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:38,155 INFO L225 Difference]: With dead ends: 1411 [2018-10-04 12:43:38,155 INFO L226 Difference]: Without dead ends: 1403 [2018-10-04 12:43:38,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 13 [2018-10-04 12:43:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-10-04 12:43:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-10-04 12:43:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-10-04 12:43:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-10-04 12:43:39,053 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-10-04 12:43:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:39,053 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-10-04 12:43:39,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-10-04 12:43:39,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:43:39,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:39,054 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:39,054 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:39,054 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-10-04 12:43:39,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:39,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:39,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:39,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:39,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:39,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:39,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:43:39,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:39,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:39,143 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:39,143 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-10-04 12:43:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:42,577 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-10-04 12:43:42,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:43:42,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 12:43:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:42,579 INFO L225 Difference]: With dead ends: 1490 [2018-10-04 12:43:42,579 INFO L226 Difference]: Without dead ends: 1482 [2018-10-04 12:43:42,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 12:43:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-10-04 12:43:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-10-04 12:43:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-10-04 12:43:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-10-04 12:43:43,415 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-10-04 12:43:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:43,416 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-10-04 12:43:43,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:43,416 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-10-04 12:43:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:43:43,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:43,416 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:43,417 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:43,417 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:43,417 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-10-04 12:43:43,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:43,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:43,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:43,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:43,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:43,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:43,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:43:43,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:43,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:43,616 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:43,616 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-10-04 12:43:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:46,899 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-10-04 12:43:46,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:43:46,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 12:43:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:46,901 INFO L225 Difference]: With dead ends: 1427 [2018-10-04 12:43:46,901 INFO L226 Difference]: Without dead ends: 1419 [2018-10-04 12:43:46,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.2s impTime 14 [2018-10-04 12:43:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-10-04 12:43:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-10-04 12:43:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-04 12:43:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-10-04 12:43:47,810 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-10-04 12:43:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:47,810 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-10-04 12:43:47,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-10-04 12:43:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:43:47,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:47,811 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:47,812 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:47,812 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:47,812 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-10-04 12:43:47,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:47,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:47,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:47,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:47,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:47,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:47,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:43:47,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:47,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:47,936 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:47,936 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-10-04 12:43:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:51,066 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-10-04 12:43:51,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:43:51,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 12:43:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:51,067 INFO L225 Difference]: With dead ends: 1306 [2018-10-04 12:43:51,068 INFO L226 Difference]: Without dead ends: 1298 [2018-10-04 12:43:51,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 12:43:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-10-04 12:43:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-10-04 12:43:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-04 12:43:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-10-04 12:43:52,079 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-10-04 12:43:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:52,080 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-10-04 12:43:52,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-10-04 12:43:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:43:52,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:52,080 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:52,081 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:52,081 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:52,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-10-04 12:43:52,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:52,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:52,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:52,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:52,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:43:52,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:43:52,182 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-10-04 12:43:52,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:52,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:43:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:43:52,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:43:52,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:43:52,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:52,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:52,252 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:52,252 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-10-04 12:43:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:55,118 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-10-04 12:43:55,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:43:55,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 12:43:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:55,120 INFO L225 Difference]: With dead ends: 1285 [2018-10-04 12:43:55,120 INFO L226 Difference]: Without dead ends: 1277 [2018-10-04 12:43:55,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 18 [2018-10-04 12:43:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-10-04 12:43:56,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-10-04 12:43:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-04 12:43:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-10-04 12:43:56,189 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-10-04 12:43:56,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:56,189 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-10-04 12:43:56,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:43:56,189 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-10-04 12:43:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:43:56,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:56,190 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:56,190 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:56,190 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:56,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-10-04 12:43:56,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:56,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:56,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:56,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:56,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:43:56,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:43:56,299 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-10-04 12:43:56,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:56,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:43:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:43:56,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:43:56,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:43:56,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:43:56,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:43:56,382 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:56,382 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-10-04 12:44:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:00,146 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-10-04 12:44:00,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:44:00,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 12:44:00,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:00,148 INFO L225 Difference]: With dead ends: 1518 [2018-10-04 12:44:00,148 INFO L226 Difference]: Without dead ends: 1510 [2018-10-04 12:44:00,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 18 [2018-10-04 12:44:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-04 12:44:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-10-04 12:44:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-10-04 12:44:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-10-04 12:44:01,166 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-10-04 12:44:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:01,167 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-10-04 12:44:01,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:44:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-10-04 12:44:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:44:01,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:01,167 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:01,168 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:01,168 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:01,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-10-04 12:44:01,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:01,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:01,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:44:01,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:44:01,825 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-10-04 12:44:01,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:01,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:44:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:44:01,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:44:01,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:44:01,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:44:01,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:44:01,904 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:01,905 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-10-04 12:44:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:05,512 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-10-04 12:44:05,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:44:05,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 12:44:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:05,514 INFO L225 Difference]: With dead ends: 1448 [2018-10-04 12:44:05,514 INFO L226 Difference]: Without dead ends: 1440 [2018-10-04 12:44:05,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 15 [2018-10-04 12:44:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-10-04 12:44:06,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-10-04 12:44:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-10-04 12:44:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-10-04 12:44:06,565 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-10-04 12:44:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:06,565 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-10-04 12:44:06,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:44:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-10-04 12:44:06,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:44:06,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:06,566 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:06,567 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:06,567 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:06,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-10-04 12:44:06,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:06,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:06,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:06,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:06,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:44:06,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:44:06,650 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-10-04 12:44:06,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:06,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:44:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:44:06,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:44:06,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:44:06,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:44:06,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:44:06,721 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:06,721 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-10-04 12:44:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:09,795 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-10-04 12:44:09,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:44:09,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 12:44:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:09,797 INFO L225 Difference]: With dead ends: 1254 [2018-10-04 12:44:09,797 INFO L226 Difference]: Without dead ends: 1246 [2018-10-04 12:44:09,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 13 [2018-10-04 12:44:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-10-04 12:44:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-10-04 12:44:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-10-04 12:44:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-10-04 12:44:10,746 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-10-04 12:44:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:10,746 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-10-04 12:44:10,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:44:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-10-04 12:44:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:44:10,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:10,747 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:10,747 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:10,748 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:10,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-10-04 12:44:10,748 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:10,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:10,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:10,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:10,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:10,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:10,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:44:10,827 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-10-04 12:44:10,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:10,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:44:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:11,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:44:11,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 12:44:11,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:44:11,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:44:11,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:11,845 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-10-04 12:44:12,701 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:44:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:17,339 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-10-04 12:44:17,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 12:44:17,339 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 12:44:17,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:17,341 INFO L225 Difference]: With dead ends: 1278 [2018-10-04 12:44:17,341 INFO L226 Difference]: Without dead ends: 1270 [2018-10-04 12:44:17,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime 15 [2018-10-04 12:44:17,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-10-04 12:44:18,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-10-04 12:44:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-10-04 12:44:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-10-04 12:44:18,340 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-10-04 12:44:18,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:18,341 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-10-04 12:44:18,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:44:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-10-04 12:44:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:44:18,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:18,341 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:18,342 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:18,342 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:18,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-10-04 12:44:18,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:18,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:18,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:18,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:18,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:18,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:44:18,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 12:44:18,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:44:18,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:44:18,517 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:18,517 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-10-04 12:44:21,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:21,839 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-10-04 12:44:21,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:44:21,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 12:44:21,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:21,841 INFO L225 Difference]: With dead ends: 1180 [2018-10-04 12:44:21,841 INFO L226 Difference]: Without dead ends: 1172 [2018-10-04 12:44:21,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 16 [2018-10-04 12:44:21,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-10-04 12:44:22,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-10-04 12:44:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-10-04 12:44:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-10-04 12:44:22,905 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-10-04 12:44:22,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:22,905 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-10-04 12:44:22,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:44:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-10-04 12:44:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:44:22,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:22,906 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:22,906 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:22,906 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:22,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-10-04 12:44:22,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:22,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:22,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:22,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:22,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:23,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:44:23,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 12:44:23,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:44:23,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:44:23,426 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:23,426 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-10-04 12:44:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:27,058 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-10-04 12:44:27,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:44:27,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 12:44:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:27,060 INFO L225 Difference]: With dead ends: 1233 [2018-10-04 12:44:27,060 INFO L226 Difference]: Without dead ends: 1225 [2018-10-04 12:44:27,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 16 [2018-10-04 12:44:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-10-04 12:44:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-10-04 12:44:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-10-04 12:44:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-10-04 12:44:28,099 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-10-04 12:44:28,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:28,099 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-10-04 12:44:28,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:44:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-10-04 12:44:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:44:28,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:28,100 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:28,101 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:28,101 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:28,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-10-04 12:44:28,101 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:28,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:28,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:28,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:28,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:28,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:44:28,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 12:44:28,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:44:28,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:44:28,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:28,178 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-10-04 12:44:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:32,576 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-10-04 12:44:32,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:44:32,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 12:44:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:32,578 INFO L225 Difference]: With dead ends: 1537 [2018-10-04 12:44:32,578 INFO L226 Difference]: Without dead ends: 1529 [2018-10-04 12:44:32,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 17 [2018-10-04 12:44:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-10-04 12:44:33,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-10-04 12:44:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-10-04 12:44:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-10-04 12:44:33,766 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-10-04 12:44:33,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:33,766 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-10-04 12:44:33,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:44:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-10-04 12:44:33,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:44:33,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:33,767 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:33,767 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:33,768 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:33,768 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-10-04 12:44:33,768 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:33,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:33,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:33,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:33,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:44:33,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 12:44:33,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:44:33,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:44:33,936 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:33,936 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-10-04 12:44:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:38,785 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-10-04 12:44:38,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:44:38,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 12:44:38,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:38,787 INFO L225 Difference]: With dead ends: 1590 [2018-10-04 12:44:38,787 INFO L226 Difference]: Without dead ends: 1582 [2018-10-04 12:44:38,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 16 [2018-10-04 12:44:38,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-10-04 12:44:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-10-04 12:44:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-10-04 12:44:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-10-04 12:44:39,915 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-10-04 12:44:39,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:39,915 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-10-04 12:44:39,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:44:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-10-04 12:44:39,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:44:39,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:39,915 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:39,916 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:39,916 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:39,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-10-04 12:44:39,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:39,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:39,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:39,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:39,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:39,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:44:39,993 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-10-04 12:44:40,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:40,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:44:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:40,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:44:40,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 12:44:40,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:44:40,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:44:40,160 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:40,161 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-10-04 12:44:40,466 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:44:45,765 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 8 [2018-10-04 12:44:50,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:50,213 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-10-04 12:44:50,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-04 12:44:50,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 12:44:50,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:50,216 INFO L225 Difference]: With dead ends: 1949 [2018-10-04 12:44:50,216 INFO L226 Difference]: Without dead ends: 1941 [2018-10-04 12:44:50,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.4s impTime 12 [2018-10-04 12:44:50,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-10-04 12:44:51,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-10-04 12:44:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-10-04 12:44:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-10-04 12:44:51,708 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-10-04 12:44:51,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:51,708 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-10-04 12:44:51,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:44:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-10-04 12:44:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:44:51,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:51,709 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:51,709 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:51,709 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:51,710 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-10-04 12:44:51,710 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:51,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:51,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:51,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:51,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:52,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:44:52,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 12:44:52,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:44:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:44:52,303 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:52,303 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-10-04 12:44:56,444 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 12:44:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:56,587 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-10-04 12:44:56,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:44:56,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 12:44:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:56,589 INFO L225 Difference]: With dead ends: 1420 [2018-10-04 12:44:56,590 INFO L226 Difference]: Without dead ends: 1412 [2018-10-04 12:44:56,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 7 [2018-10-04 12:44:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-10-04 12:44:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-10-04 12:44:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-10-04 12:44:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-10-04 12:44:57,743 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-10-04 12:44:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:57,743 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-10-04 12:44:57,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:44:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-10-04 12:44:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:44:57,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:57,744 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:57,744 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:57,744 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:57,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-10-04 12:44:57,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:57,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:57,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:57,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:57,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:57,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:44:57,817 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-10-04 12:44:57,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:57,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:44:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:57,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:44:57,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 12:44:57,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:44:57,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:44:57,972 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:57,972 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-10-04 12:44:58,351 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:45:06,756 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:45:12,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:45:12,256 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-10-04 12:45:12,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-04 12:45:12,256 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 12:45:12,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:45:12,259 INFO L225 Difference]: With dead ends: 2767 [2018-10-04 12:45:12,259 INFO L226 Difference]: Without dead ends: 2759 [2018-10-04 12:45:12,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.3s impTime 13 [2018-10-04 12:45:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-10-04 12:45:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-10-04 12:45:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-10-04 12:45:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-10-04 12:45:13,792 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-10-04 12:45:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:45:13,792 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-10-04 12:45:13,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:45:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-10-04 12:45:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:45:13,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:45:13,793 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:45:13,793 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:45:13,793 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:45:13,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-10-04 12:45:13,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:45:13,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:45:13,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:13,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:45:13,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:45:13,939 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-10-04 12:45:13,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:13,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:45:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:45:14,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:45:14,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 12:45:14,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:45:14,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:45:14,135 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:45:14,135 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-10-04 12:45:14,237 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 8 [2018-10-04 12:45:15,227 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 24 new depth: 8 [2018-10-04 12:45:19,293 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 26 new depth: 9 [2018-10-04 12:45:23,210 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 26 new depth: 11 [2018-10-04 12:45:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:45:28,220 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-10-04 12:45:28,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-04 12:45:28,221 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 12:45:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:45:28,223 INFO L225 Difference]: With dead ends: 2361 [2018-10-04 12:45:28,223 INFO L226 Difference]: Without dead ends: 2353 [2018-10-04 12:45:28,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s Time 3.2s impTime 19 [2018-10-04 12:45:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-10-04 12:45:29,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-10-04 12:45:29,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-10-04 12:45:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-10-04 12:45:29,761 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-10-04 12:45:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:45:29,762 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-10-04 12:45:29,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:45:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-10-04 12:45:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:45:29,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:45:29,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:45:29,763 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:45:29,763 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:45:29,763 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-10-04 12:45:29,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:45:29,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:45:29,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:29,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:29,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:45:29,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:45:29,838 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-10-04 12:45:29,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:29,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:45:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:45:29,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:45:29,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-04 12:45:29,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:45:29,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:45:29,959 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:45:29,959 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-10-04 12:45:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:45:32,995 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-10-04 12:45:32,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:45:32,996 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-10-04 12:45:32,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:45:32,997 INFO L225 Difference]: With dead ends: 1507 [2018-10-04 12:45:32,997 INFO L226 Difference]: Without dead ends: 1502 [2018-10-04 12:45:32,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 14 [2018-10-04 12:45:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-10-04 12:45:34,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-10-04 12:45:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-10-04 12:45:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-10-04 12:45:34,975 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-10-04 12:45:34,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:45:34,975 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-10-04 12:45:34,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:45:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-10-04 12:45:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:45:34,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:45:34,976 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:45:34,977 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:45:34,977 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:45:34,977 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-10-04 12:45:34,977 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:45:34,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:45:34,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:34,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:34,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:45:35,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:45:35,135 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-10-04 12:45:35,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:35,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:45:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:45:35,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:45:35,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-10-04 12:45:35,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:45:35,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:45:35,287 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:45:35,287 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-10-04 12:45:35,683 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 12:45:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:45:45,679 INFO L93 Difference]: Finished difference Result 3662 states and 8082 transitions. [2018-10-04 12:45:45,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 12:45:45,679 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-10-04 12:45:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:45:45,683 INFO L225 Difference]: With dead ends: 3662 [2018-10-04 12:45:45,683 INFO L226 Difference]: Without dead ends: 3654 [2018-10-04 12:45:45,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 20 [2018-10-04 12:45:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2018-10-04 12:45:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 2136. [2018-10-04 12:45:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-10-04 12:45:48,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-10-04 12:45:48,627 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-10-04 12:45:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:45:48,627 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-10-04 12:45:48,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:45:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-10-04 12:45:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:45:48,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:45:48,628 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:45:48,629 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:45:48,629 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:45:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-10-04 12:45:48,629 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:45:48,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:45:48,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:48,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:48,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:45:48,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:45:48,730 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-10-04 12:45:48,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:48,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:45:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:45:48,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:45:48,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 12:45:48,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:45:48,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:45:48,824 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:45:48,824 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-10-04 12:45:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:45:54,441 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-10-04 12:45:54,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:45:54,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 12:45:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:45:54,445 INFO L225 Difference]: With dead ends: 2767 [2018-10-04 12:45:54,445 INFO L226 Difference]: Without dead ends: 2759 [2018-10-04 12:45:54,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 18 [2018-10-04 12:45:54,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-10-04 12:45:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-10-04 12:45:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-10-04 12:45:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-10-04 12:45:57,465 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-10-04 12:45:57,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:45:57,465 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-10-04 12:45:57,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:45:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-10-04 12:45:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:45:57,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:45:57,466 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:45:57,467 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:45:57,467 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:45:57,467 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-10-04 12:45:57,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:45:57,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:45:57,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:57,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:57,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:45:57,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:45:57,549 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-10-04 12:45:57,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:57,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:45:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:45:57,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:45:57,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 12:45:57,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:45:57,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:45:57,662 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:45:57,662 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-10-04 12:46:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:03,954 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-10-04 12:46:03,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:46:03,954 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 12:46:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:03,958 INFO L225 Difference]: With dead ends: 3146 [2018-10-04 12:46:03,958 INFO L226 Difference]: Without dead ends: 3138 [2018-10-04 12:46:03,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 18 [2018-10-04 12:46:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-10-04 12:46:06,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-10-04 12:46:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-10-04 12:46:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-10-04 12:46:06,930 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-10-04 12:46:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:06,931 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-10-04 12:46:06,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:46:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-10-04 12:46:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:46:06,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:06,932 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:06,932 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:06,932 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:06,932 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-10-04 12:46:06,932 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:06,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:06,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:06,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:06,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:46:07,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:46:07,043 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-10-04 12:46:07,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:07,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:46:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:46:07,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:46:07,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 12:46:07,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:46:07,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:46:07,155 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:07,156 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-10-04 12:46:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:13,814 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-10-04 12:46:13,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:46:13,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 12:46:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:13,819 INFO L225 Difference]: With dead ends: 3089 [2018-10-04 12:46:13,819 INFO L226 Difference]: Without dead ends: 3081 [2018-10-04 12:46:13,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 18 [2018-10-04 12:46:13,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-10-04 12:46:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-10-04 12:46:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-10-04 12:46:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-10-04 12:46:16,850 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-10-04 12:46:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:16,850 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-10-04 12:46:16,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:46:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-10-04 12:46:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:46:16,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:16,852 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:16,852 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:16,852 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:16,852 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-10-04 12:46:16,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:16,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:16,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:16,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:16,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:16,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:46:16,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:46:16,943 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:46:16,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:16,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:46:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:46:17,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:46:17,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 12:46:17,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:46:17,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:46:17,028 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:17,028 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. Received shutdown request... [2018-10-04 12:46:23,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:46:23,006 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:46:23,012 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:46:23,013 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:46:23 BoogieIcfgContainer [2018-10-04 12:46:23,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:46:23,014 INFO L168 Benchmark]: Toolchain (without parser) took 259529.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -267.7 MB). Peak memory consumption was 490.9 MB. Max. memory is 7.1 GB. [2018-10-04 12:46:23,016 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:46:23,016 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:46:23,017 INFO L168 Benchmark]: Boogie Preprocessor took 32.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:46:23,017 INFO L168 Benchmark]: RCFGBuilder took 1035.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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-10-04 12:46:23,018 INFO L168 Benchmark]: TraceAbstraction took 258412.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -299.4 MB). Peak memory consumption was 459.2 MB. Max. memory is 7.1 GB. [2018-10-04 12:46:23,022 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1035.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 258412.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -299.4 MB). Peak memory consumption was 459.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2497 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2497 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2497 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2497 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2497 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2497 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2497 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2497 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2497 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2497 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2497 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2497 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2497 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2497 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 258.3s OverallTime, 52 OverallIterations, 2 TraceHistogramMax, 205.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13607 SDtfs, 44007 SDslu, 48458 SDs, 0 SdLazy, 100100 SolverSat, 9484 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 92.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1735 GetRequests, 221 SyntacticMatches, 4 SemanticMatches, 1510 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2248occurred in iteration=50, 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: 41.1s AutomataMinimizationTime, 51 MinimizatonAttempts, 27184 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 917 ConstructedInterpolants, 0 QuantifiedInterpolants, 48028 SizeOfPredicates, 77 NumberOfNonLiveVariables, 645 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 67 InterpolantComputations, 37 PerfectInterpolantSequences, 43/111 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_Reals.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-46-23-035.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-46-23-035.csv Completed graceful shutdown