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-m [2018-10-04 14:19:52,337 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:19:52,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:19:52,356 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:19:52,356 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:19:52,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:19:52,359 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:19:52,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:19:52,366 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:19:52,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:19:52,374 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:19:52,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:19:52,375 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:19:52,376 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:19:52,379 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:19:52,380 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:19:52,381 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:19:52,383 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:19:52,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:19:52,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:19:52,386 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:19:52,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:19:52,389 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:19:52,390 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:19:52,390 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:19:52,391 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:19:52,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:19:52,392 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:19:52,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:19:52,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:19:52,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:19:52,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:19:52,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:19:52,395 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:19:52,396 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:19:52,396 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:19:52,397 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 14:19:52,411 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:19:52,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:19:52,412 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:19:52,412 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:19:52,413 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:19:52,413 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:19:52,413 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:19:52,413 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:19:52,413 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:19:52,414 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:19:52,414 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:19:52,414 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:19:52,414 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:19:52,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:19:52,415 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:19:52,415 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:19:52,415 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:19:52,415 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:19:52,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:19:52,416 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:19:52,416 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:19:52,416 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:19:52,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:19:52,416 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:19:52,417 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:19:52,417 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:19:52,417 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:19:52,417 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:19:52,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:19:52,417 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:19:52,418 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:19:52,460 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:19:52,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:19:52,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:19:52,476 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:19:52,477 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:19:52,478 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 14:19:52,478 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-10-04 14:19:52,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:19:52,552 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:19:52,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:52,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:19:52,553 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:19:52,574 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 02:19:52" (1/1) ... [2018-10-04 14:19:52,589 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 02:19:52" (1/1) ... [2018-10-04 14:19:52,594 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 14:19:52,594 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 14:19:52,595 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 14:19:52,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:52,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:19:52,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:19:52,598 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:19:52,609 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 02:19:52" (1/1) ... [2018-10-04 14:19:52,610 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 02:19:52" (1/1) ... [2018-10-04 14:19:52,612 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 02:19:52" (1/1) ... [2018-10-04 14:19:52,612 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 02:19:52" (1/1) ... [2018-10-04 14:19:52,620 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 02:19:52" (1/1) ... [2018-10-04 14:19:52,627 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 02:19:52" (1/1) ... [2018-10-04 14:19:52,629 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 02:19:52" (1/1) ... [2018-10-04 14:19:52,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:19:52,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:19:52,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:19:52,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:19:52,634 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 02:19:52" (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 14:19:52,710 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 14:19:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 14:19:52,710 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 14:19:53,575 INFO L338 CfgBuilder]: Using library mode [2018-10-04 14:19:53,576 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:19:53 BoogieIcfgContainer [2018-10-04 14:19:53,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:19:53,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:19:53,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:19:53,581 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:19:53,581 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 02:19:52" (1/2) ... [2018-10-04 14:19:53,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bf5ab3 and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:19:53, skipping insertion in model container [2018-10-04 14:19:53,583 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 02:19:53" (2/2) ... [2018-10-04 14:19:53,585 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-10-04 14:19:53,595 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:19:53,608 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-10-04 14:19:53,660 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:19:53,661 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:19:53,661 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:19:53,661 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:19:53,662 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:19:53,662 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:19:53,662 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:19:53,662 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:19:53,662 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:19:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-10-04 14:19:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:19:53,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:53,691 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:53,693 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:53,700 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:53,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-10-04 14:19:53,703 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:53,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:53,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:53,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:53,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:54,138 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 14:19:54,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:54,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:19:54,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:19:54,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:19:54,161 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:54,163 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-10-04 14:19:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:56,050 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-10-04 14:19:56,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:19:56,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 14:19:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:56,070 INFO L225 Difference]: With dead ends: 163 [2018-10-04 14:19:56,071 INFO L226 Difference]: Without dead ends: 158 [2018-10-04 14:19:56,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 7 [2018-10-04 14:19:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-04 14:19:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-10-04 14:19:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-04 14:19:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-10-04 14:19:56,139 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-10-04 14:19:56,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:56,139 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-10-04 14:19:56,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:19:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-10-04 14:19:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:19:56,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:56,141 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:56,143 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:56,143 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-10-04 14:19:56,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:56,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:56,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:56,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:56,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:56,306 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 14:19:56,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:56,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:19:56,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:19:56,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:19:56,312 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:56,312 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-10-04 14:19:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:57,259 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-10-04 14:19:57,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:19:57,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 14:19:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:57,272 INFO L225 Difference]: With dead ends: 188 [2018-10-04 14:19:57,272 INFO L226 Difference]: Without dead ends: 183 [2018-10-04 14:19:57,273 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 14:19:57,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-04 14:19:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-10-04 14:19:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-04 14:19:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-10-04 14:19:57,303 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-10-04 14:19:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:57,304 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-10-04 14:19:57,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:19:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-10-04 14:19:57,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:19:57,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:57,305 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:57,306 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:57,307 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:57,307 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-10-04 14:19:57,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:57,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:57,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:57,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:57,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:57,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:57,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:19:57,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:19:57,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:19:57,415 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:57,415 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-10-04 14:19:59,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:59,033 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-10-04 14:19:59,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:19:59,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-04 14:19:59,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:59,038 INFO L225 Difference]: With dead ends: 283 [2018-10-04 14:19:59,039 INFO L226 Difference]: Without dead ends: 278 [2018-10-04 14:19:59,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 14:19:59,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-04 14:19:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-10-04 14:19:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-04 14:19:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-10-04 14:19:59,071 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-10-04 14:19:59,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:59,071 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-10-04 14:19:59,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:19:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-10-04 14:19:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:19:59,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:59,073 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:59,074 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:59,074 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:59,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-10-04 14:19:59,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:59,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:59,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:59,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:59,194 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 14:19:59,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:59,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:19:59,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:19:59,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:19:59,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:59,195 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-10-04 14:20:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:01,603 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-10-04 14:20:01,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:20:01,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-04 14:20:01,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:01,608 INFO L225 Difference]: With dead ends: 387 [2018-10-04 14:20:01,608 INFO L226 Difference]: Without dead ends: 375 [2018-10-04 14:20:01,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 13 [2018-10-04 14:20:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-04 14:20:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-10-04 14:20:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-04 14:20:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-10-04 14:20:01,657 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-10-04 14:20:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:01,657 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-10-04 14:20:01,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-10-04 14:20:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:01,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:01,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:01,661 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:01,661 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:01,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-10-04 14:20:01,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:01,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:01,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:01,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:01,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:01,782 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 14:20:01,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:01,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:01,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:01,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:01,784 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:01,785 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-10-04 14:20:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:04,829 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-10-04 14:20:04,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:20:04,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 14:20:04,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:04,836 INFO L225 Difference]: With dead ends: 725 [2018-10-04 14:20:04,836 INFO L226 Difference]: Without dead ends: 717 [2018-10-04 14:20:04,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 19 [2018-10-04 14:20:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-04 14:20:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-10-04 14:20:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-04 14:20:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-10-04 14:20:04,902 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-10-04 14:20:04,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:04,903 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-10-04 14:20:04,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:04,903 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-10-04 14:20:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:04,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:04,905 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:04,906 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:04,906 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:04,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-10-04 14:20:04,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:04,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:04,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:04,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:04,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:05,029 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 14:20:05,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:05,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:05,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:05,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:05,031 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:05,031 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-10-04 14:20:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:09,203 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-10-04 14:20:09,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:20:09,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 14:20:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:09,211 INFO L225 Difference]: With dead ends: 1008 [2018-10-04 14:20:09,212 INFO L226 Difference]: Without dead ends: 1000 [2018-10-04 14:20:09,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 18 [2018-10-04 14:20:09,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-10-04 14:20:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-10-04 14:20:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-04 14:20:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-10-04 14:20:09,295 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-10-04 14:20:09,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:09,295 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-10-04 14:20:09,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-10-04 14:20:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:09,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:09,297 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:09,298 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:09,298 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:09,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-10-04 14:20:09,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:09,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:09,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:09,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:09,387 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 14:20:09,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:09,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:09,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:09,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:09,389 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:09,389 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-10-04 14:20:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:11,952 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-10-04 14:20:11,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:20:11,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 14:20:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:11,959 INFO L225 Difference]: With dead ends: 924 [2018-10-04 14:20:11,959 INFO L226 Difference]: Without dead ends: 916 [2018-10-04 14:20:11,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 18 [2018-10-04 14:20:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-10-04 14:20:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-10-04 14:20:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-04 14:20:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-10-04 14:20:12,060 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-10-04 14:20:12,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:12,061 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-10-04 14:20:12,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-10-04 14:20:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:12,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:12,063 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:12,063 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:12,063 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:12,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-10-04 14:20:12,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:12,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:12,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:12,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:12,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:12,344 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 14:20:12,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:12,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:12,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:12,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:12,346 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:12,346 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-10-04 14:20:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:14,301 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-10-04 14:20:14,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:20:14,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 14:20:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:14,307 INFO L225 Difference]: With dead ends: 791 [2018-10-04 14:20:14,307 INFO L226 Difference]: Without dead ends: 783 [2018-10-04 14:20:14,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 17 [2018-10-04 14:20:14,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-10-04 14:20:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-10-04 14:20:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-04 14:20:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-10-04 14:20:14,402 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-10-04 14:20:14,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:14,402 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-10-04 14:20:14,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-10-04 14:20:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:14,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:14,403 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:14,404 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:14,404 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-10-04 14:20:14,405 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:14,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:14,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:14,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:14,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:14,496 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 14:20:14,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:14,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:14,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:14,498 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:14,498 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-10-04 14:20:16,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:16,670 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-10-04 14:20:16,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:20:16,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 14:20:16,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:16,678 INFO L225 Difference]: With dead ends: 1040 [2018-10-04 14:20:16,679 INFO L226 Difference]: Without dead ends: 1032 [2018-10-04 14:20:16,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 18 [2018-10-04 14:20:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-10-04 14:20:16,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-10-04 14:20:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-04 14:20:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-10-04 14:20:16,808 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-10-04 14:20:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:16,808 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-10-04 14:20:16,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-10-04 14:20:16,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:16,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:16,809 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:16,810 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:16,810 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:16,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-10-04 14:20:16,810 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:16,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:16,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:16,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:16,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:16,950 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 14:20:16,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:16,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:16,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:16,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:16,952 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:16,953 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-10-04 14:20:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:19,682 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-10-04 14:20:19,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 14:20:19,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 14:20:19,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:19,691 INFO L225 Difference]: With dead ends: 1166 [2018-10-04 14:20:19,691 INFO L226 Difference]: Without dead ends: 1158 [2018-10-04 14:20:19,692 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 14:20:19,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-10-04 14:20:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-10-04 14:20:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-04 14:20:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-10-04 14:20:19,827 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-10-04 14:20:19,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:19,827 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-10-04 14:20:19,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-10-04 14:20:19,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:19,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:19,828 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:19,829 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:19,829 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:19,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-10-04 14:20:19,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:19,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:19,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:19,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:19,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:19,920 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 14:20:19,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:19,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:19,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:19,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:19,921 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:19,922 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-10-04 14:20:22,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:22,424 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-10-04 14:20:22,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:20:22,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 14:20:22,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:22,431 INFO L225 Difference]: With dead ends: 1127 [2018-10-04 14:20:22,431 INFO L226 Difference]: Without dead ends: 1119 [2018-10-04 14:20:22,432 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 14:20:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-10-04 14:20:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-10-04 14:20:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-04 14:20:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-10-04 14:20:22,656 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-10-04 14:20:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:22,656 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-10-04 14:20:22,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-10-04 14:20:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:22,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:22,658 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:22,659 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:22,659 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:22,659 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-10-04 14:20:22,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:22,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:22,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:22,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:22,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:22,854 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 14:20:22,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:22,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:22,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:22,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:22,855 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:22,856 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-10-04 14:20:25,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:25,300 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-10-04 14:20:25,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:20:25,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 14:20:25,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:25,310 INFO L225 Difference]: With dead ends: 975 [2018-10-04 14:20:25,310 INFO L226 Difference]: Without dead ends: 967 [2018-10-04 14:20:25,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 18 [2018-10-04 14:20:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-10-04 14:20:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-10-04 14:20:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-04 14:20:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-10-04 14:20:25,481 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-10-04 14:20:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:25,483 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-10-04 14:20:25,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-10-04 14:20:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:25,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:25,484 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:25,485 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:25,485 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:25,485 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-10-04 14:20:25,485 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:25,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:25,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:25,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:25,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:25,592 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 14:20:25,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:25,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:25,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:25,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:25,594 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:25,594 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-10-04 14:20:28,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:28,123 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-10-04 14:20:28,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:20:28,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 14:20:28,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:28,128 INFO L225 Difference]: With dead ends: 1011 [2018-10-04 14:20:28,129 INFO L226 Difference]: Without dead ends: 1003 [2018-10-04 14:20:28,129 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 14:20:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-10-04 14:20:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-10-04 14:20:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-04 14:20:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-10-04 14:20:28,337 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-10-04 14:20:28,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:28,337 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-10-04 14:20:28,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-10-04 14:20:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:28,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:28,338 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:28,339 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:28,339 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-10-04 14:20:28,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:28,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:28,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:28,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:28,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:28,443 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 14:20:28,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:28,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:28,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:28,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:28,444 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:28,444 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-10-04 14:20:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:30,542 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-10-04 14:20:30,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:20:30,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 14:20:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:30,547 INFO L225 Difference]: With dead ends: 859 [2018-10-04 14:20:30,547 INFO L226 Difference]: Without dead ends: 851 [2018-10-04 14:20:30,547 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 14:20:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-10-04 14:20:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-10-04 14:20:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-04 14:20:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-10-04 14:20:30,726 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-10-04 14:20:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:30,727 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-10-04 14:20:30,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-10-04 14:20:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:30,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:30,728 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:30,728 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:30,728 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:30,728 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-10-04 14:20:30,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:30,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:30,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:30,840 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 14:20:30,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:30,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:30,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:30,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:30,841 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:30,841 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-10-04 14:20:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:33,197 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-10-04 14:20:33,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:20:33,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 14:20:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:33,202 INFO L225 Difference]: With dead ends: 962 [2018-10-04 14:20:33,202 INFO L226 Difference]: Without dead ends: 954 [2018-10-04 14:20:33,203 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 14:20:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-10-04 14:20:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-10-04 14:20:33,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-10-04 14:20:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-10-04 14:20:33,424 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-10-04 14:20:33,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:33,424 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-10-04 14:20:33,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-10-04 14:20:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:33,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:33,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:33,425 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:33,425 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:33,425 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-10-04 14:20:33,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:33,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:33,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:33,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:33,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:33,499 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 14:20:33,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:33,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:33,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:33,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:33,500 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:33,501 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-10-04 14:20:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:36,239 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-10-04 14:20:36,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:20:36,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 14:20:36,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:36,245 INFO L225 Difference]: With dead ends: 1064 [2018-10-04 14:20:36,245 INFO L226 Difference]: Without dead ends: 1056 [2018-10-04 14:20:36,246 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 14:20:36,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-10-04 14:20:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-10-04 14:20:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-10-04 14:20:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-10-04 14:20:36,555 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-10-04 14:20:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:36,555 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-10-04 14:20:36,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-10-04 14:20:36,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:36,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:36,556 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:36,556 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:36,557 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:36,557 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-10-04 14:20:36,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:36,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:36,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:36,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:36,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:36,673 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 14:20:36,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:36,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:36,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:36,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:36,675 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:36,675 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-10-04 14:20:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:40,007 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-10-04 14:20:40,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:20:40,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 14:20:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:40,013 INFO L225 Difference]: With dead ends: 1241 [2018-10-04 14:20:40,013 INFO L226 Difference]: Without dead ends: 1233 [2018-10-04 14:20:40,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 14 [2018-10-04 14:20:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-10-04 14:20:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-10-04 14:20:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-04 14:20:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-10-04 14:20:40,344 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-10-04 14:20:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:40,345 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-10-04 14:20:40,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-10-04 14:20:40,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:40,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:40,346 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:40,347 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:40,347 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:40,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-10-04 14:20:40,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:40,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:40,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:40,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:40,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:40,426 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 14:20:40,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:40,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:40,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:40,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:40,428 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:40,428 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-10-04 14:20:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:42,806 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-10-04 14:20:42,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:20:42,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 14:20:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:42,812 INFO L225 Difference]: With dead ends: 1139 [2018-10-04 14:20:42,812 INFO L226 Difference]: Without dead ends: 1131 [2018-10-04 14:20:42,813 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 14:20:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-10-04 14:20:43,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-10-04 14:20:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-10-04 14:20:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-10-04 14:20:43,144 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-10-04 14:20:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:43,145 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-10-04 14:20:43,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-10-04 14:20:43,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:43,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:43,146 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:43,146 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:43,146 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:43,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-10-04 14:20:43,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:43,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:43,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:43,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:43,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:43,242 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 14:20:43,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:43,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:43,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:43,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:43,244 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:43,244 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-10-04 14:20:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:46,362 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-10-04 14:20:46,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:20:46,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 14:20:46,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:46,368 INFO L225 Difference]: With dead ends: 1325 [2018-10-04 14:20:46,369 INFO L226 Difference]: Without dead ends: 1317 [2018-10-04 14:20:46,369 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 14:20:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-10-04 14:20:46,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-10-04 14:20:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-10-04 14:20:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-10-04 14:20:46,701 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-10-04 14:20:46,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:46,701 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-10-04 14:20:46,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-10-04 14:20:46,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:46,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:46,702 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:46,703 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:46,703 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:46,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-10-04 14:20:46,703 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:46,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:46,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:46,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:46,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:46,777 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 14:20:46,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:46,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:46,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:46,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:46,779 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:46,779 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-10-04 14:20:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:50,168 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-10-04 14:20:50,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:20:50,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 14:20:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:50,174 INFO L225 Difference]: With dead ends: 1334 [2018-10-04 14:20:50,174 INFO L226 Difference]: Without dead ends: 1326 [2018-10-04 14:20:50,174 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 14:20:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-10-04 14:20:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-10-04 14:20:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-10-04 14:20:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-10-04 14:20:50,519 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-10-04 14:20:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:50,519 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-10-04 14:20:50,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-10-04 14:20:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:50,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:50,520 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:50,520 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:50,520 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-10-04 14:20:50,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:50,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:50,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:50,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:50,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:50,593 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 14:20:50,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:50,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:50,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:50,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:50,595 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:50,595 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-10-04 14:20:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:52,623 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-10-04 14:20:52,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:20:52,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 14:20:52,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:52,628 INFO L225 Difference]: With dead ends: 919 [2018-10-04 14:20:52,629 INFO L226 Difference]: Without dead ends: 911 [2018-10-04 14:20:52,629 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 14:20:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-10-04 14:20:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-10-04 14:20:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-04 14:20:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-10-04 14:20:53,010 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-10-04 14:20:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:53,010 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-10-04 14:20:53,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-10-04 14:20:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:53,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:53,011 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:53,011 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:53,011 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:53,011 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-10-04 14:20:53,012 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:53,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:53,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:53,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:53,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:53,085 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 14:20:53,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:53,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:53,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:53,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:53,086 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:53,086 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-10-04 14:20:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:55,772 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-10-04 14:20:55,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:20:55,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 14:20:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:55,780 INFO L225 Difference]: With dead ends: 1095 [2018-10-04 14:20:55,780 INFO L226 Difference]: Without dead ends: 1087 [2018-10-04 14:20:55,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 16 [2018-10-04 14:20:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-10-04 14:20:56,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-10-04 14:20:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-04 14:20:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-10-04 14:20:56,166 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-10-04 14:20:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:56,166 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-10-04 14:20:56,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-10-04 14:20:56,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:56,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:56,167 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:56,167 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:56,167 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:56,168 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-10-04 14:20:56,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:56,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:56,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:56,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:56,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:56,245 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 14:20:56,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:56,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:56,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:56,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:56,246 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:56,246 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-10-04 14:21:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:00,109 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-10-04 14:21:00,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:21:00,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 14:21:00,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:00,114 INFO L225 Difference]: With dead ends: 1304 [2018-10-04 14:21:00,114 INFO L226 Difference]: Without dead ends: 1296 [2018-10-04 14:21:00,114 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 14:21:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-10-04 14:21:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-10-04 14:21:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-10-04 14:21:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-10-04 14:21:00,483 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-10-04 14:21:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:00,483 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-10-04 14:21:00,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-10-04 14:21:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:21:00,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:00,484 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:00,485 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:00,485 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:00,485 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-10-04 14:21:00,485 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:00,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:00,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:00,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:00,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:00,558 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 14:21:00,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:00,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:21:00,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:00,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:00,560 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:00,560 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-10-04 14:21:03,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:03,938 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-10-04 14:21:03,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:21:03,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 14:21:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:03,941 INFO L225 Difference]: With dead ends: 1192 [2018-10-04 14:21:03,941 INFO L226 Difference]: Without dead ends: 1184 [2018-10-04 14:21:03,942 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 20 [2018-10-04 14:21:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-10-04 14:21:04,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-10-04 14:21:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-04 14:21:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-10-04 14:21:04,424 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-10-04 14:21:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:04,424 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-10-04 14:21:04,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-10-04 14:21:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:21:04,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:04,425 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:04,426 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:04,428 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:04,428 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-10-04 14:21:04,428 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:04,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:04,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:04,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:04,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:04,472 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 14:21:04,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:04,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:21:04,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:21:04,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:21:04,474 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:04,474 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-10-04 14:21:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:05,278 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-10-04 14:21:05,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:21:05,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-04 14:21:05,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:05,280 INFO L225 Difference]: With dead ends: 1139 [2018-10-04 14:21:05,280 INFO L226 Difference]: Without dead ends: 625 [2018-10-04 14:21:05,282 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 14:21:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-10-04 14:21:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-10-04 14:21:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-04 14:21:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-10-04 14:21:05,792 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-10-04 14:21:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:05,792 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-10-04 14:21:05,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:21:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-10-04 14:21:05,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:21:05,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:05,793 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:05,793 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:05,793 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:05,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-10-04 14:21:05,793 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:05,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:05,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:05,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:05,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:05,887 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 14:21:05,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:05,887 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 14:21:05,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:05,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:06,655 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 14:21:06,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:06,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-04 14:21:06,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:21:06,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:21:06,680 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:06,680 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-10-04 14:21:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:10,882 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-10-04 14:21:10,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:21:10,882 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-10-04 14:21:10,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:10,884 INFO L225 Difference]: With dead ends: 794 [2018-10-04 14:21:10,884 INFO L226 Difference]: Without dead ends: 789 [2018-10-04 14:21:10,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 19 [2018-10-04 14:21:10,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-04 14:21:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-10-04 14:21:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-10-04 14:21:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-10-04 14:21:11,609 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-10-04 14:21:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:11,609 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-10-04 14:21:11,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:21:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-10-04 14:21:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:21:11,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:11,610 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:11,611 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:11,611 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:11,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-10-04 14:21:11,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:11,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:11,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:11,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:11,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:11,650 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 14:21:11,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:11,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:21:11,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:21:11,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:21:11,652 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:11,652 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-10-04 14:21:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:12,951 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-10-04 14:21:12,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:21:12,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-04 14:21:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:12,953 INFO L225 Difference]: With dead ends: 1317 [2018-10-04 14:21:12,953 INFO L226 Difference]: Without dead ends: 729 [2018-10-04 14:21:12,954 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 14:21:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-04 14:21:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-10-04 14:21:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-04 14:21:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-10-04 14:21:13,596 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-10-04 14:21:13,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:13,596 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-10-04 14:21:13,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:21:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-10-04 14:21:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:21:13,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:13,598 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:13,598 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:13,598 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:13,598 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-10-04 14:21:13,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:13,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:13,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:13,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:13,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:13,771 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 14:21:13,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:13,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:21:13,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:13,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:13,772 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:13,773 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-10-04 14:21:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:17,136 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-10-04 14:21:17,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:21:17,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 14:21:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:17,140 INFO L225 Difference]: With dead ends: 1435 [2018-10-04 14:21:17,140 INFO L226 Difference]: Without dead ends: 1427 [2018-10-04 14:21:17,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 14 [2018-10-04 14:21:17,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-10-04 14:21:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-10-04 14:21:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-04 14:21:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-10-04 14:21:18,037 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-10-04 14:21:18,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:18,038 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-10-04 14:21:18,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-10-04 14:21:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:21:18,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:18,039 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:18,039 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:18,039 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:18,040 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-10-04 14:21:18,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:18,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:18,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:18,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:18,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:18,336 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 14:21:18,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:18,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:21:18,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:18,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:18,338 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:18,338 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-10-04 14:21:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:22,084 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-10-04 14:21:22,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:21:22,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 14:21:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:22,088 INFO L225 Difference]: With dead ends: 1599 [2018-10-04 14:21:22,089 INFO L226 Difference]: Without dead ends: 1591 [2018-10-04 14:21:22,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 13 [2018-10-04 14:21:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-04 14:21:22,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-10-04 14:21:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-04 14:21:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-10-04 14:21:22,926 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-10-04 14:21:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:22,926 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-10-04 14:21:22,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-10-04 14:21:22,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:21:22,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:22,927 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:22,928 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:22,928 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:22,928 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-10-04 14:21:22,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:22,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:22,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:22,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:22,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:23,016 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 14:21:23,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:23,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:21:23,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:23,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:23,017 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:23,017 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-10-04 14:21:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:26,314 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-10-04 14:21:26,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:21:26,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 14:21:26,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:26,318 INFO L225 Difference]: With dead ends: 1411 [2018-10-04 14:21:26,318 INFO L226 Difference]: Without dead ends: 1403 [2018-10-04 14:21:26,319 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 13 [2018-10-04 14:21:26,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-10-04 14:21:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-10-04 14:21:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-10-04 14:21:27,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-10-04 14:21:27,215 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-10-04 14:21:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:27,216 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-10-04 14:21:27,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-10-04 14:21:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:21:27,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:27,217 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:27,217 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:27,217 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:27,217 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-10-04 14:21:27,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:27,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:27,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:27,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:27,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:27,310 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 14:21:27,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:27,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:21:27,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:27,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:27,312 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:27,312 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-10-04 14:21:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:30,800 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-10-04 14:21:30,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:21:30,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 14:21:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:30,803 INFO L225 Difference]: With dead ends: 1490 [2018-10-04 14:21:30,803 INFO L226 Difference]: Without dead ends: 1482 [2018-10-04 14:21:30,804 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 14:21:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-10-04 14:21:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-10-04 14:21:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-10-04 14:21:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-10-04 14:21:31,781 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-10-04 14:21:31,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:31,781 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-10-04 14:21:31,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:31,781 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-10-04 14:21:31,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:21:31,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:31,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:31,782 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:31,782 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:31,782 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-10-04 14:21:31,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:31,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:31,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:31,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:31,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:32,039 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 14:21:32,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:32,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:21:32,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:32,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:32,041 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:32,041 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-10-04 14:21:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:35,348 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-10-04 14:21:35,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:21:35,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 14:21:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:35,350 INFO L225 Difference]: With dead ends: 1427 [2018-10-04 14:21:35,350 INFO L226 Difference]: Without dead ends: 1419 [2018-10-04 14:21:35,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 14 [2018-10-04 14:21:35,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-10-04 14:21:36,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-10-04 14:21:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-04 14:21:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-10-04 14:21:36,266 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-10-04 14:21:36,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:36,266 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-10-04 14:21:36,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-10-04 14:21:36,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:21:36,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:36,267 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:36,267 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:36,268 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:36,268 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-10-04 14:21:36,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:36,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:36,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:36,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:36,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:36,938 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 14:21:36,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:36,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:21:36,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:36,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:36,939 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:36,939 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-10-04 14:21:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:40,116 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-10-04 14:21:40,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:21:40,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 14:21:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:40,119 INFO L225 Difference]: With dead ends: 1306 [2018-10-04 14:21:40,119 INFO L226 Difference]: Without dead ends: 1298 [2018-10-04 14:21:40,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 14 [2018-10-04 14:21:40,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-10-04 14:21:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-10-04 14:21:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-04 14:21:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-10-04 14:21:41,142 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-10-04 14:21:41,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:41,142 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-10-04 14:21:41,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-10-04 14:21:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:21:41,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:41,142 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:41,143 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:41,143 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:41,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-10-04 14:21:41,143 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:41,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:41,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:41,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:41,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:41,276 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 14:21:41,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:41,276 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 14:21:41,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:41,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:41,395 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 14:21:41,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:41,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:21:41,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:41,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:41,430 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:41,430 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-10-04 14:21:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:44,355 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-10-04 14:21:44,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:21:44,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 14:21:44,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:44,357 INFO L225 Difference]: With dead ends: 1285 [2018-10-04 14:21:44,357 INFO L226 Difference]: Without dead ends: 1277 [2018-10-04 14:21:44,357 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 19 [2018-10-04 14:21:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-10-04 14:21:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-10-04 14:21:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-04 14:21:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-10-04 14:21:45,324 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-10-04 14:21:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:45,325 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-10-04 14:21:45,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-10-04 14:21:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:21:45,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:45,326 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:45,326 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:45,326 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:45,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-10-04 14:21:45,327 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:45,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:45,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:45,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:45,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:45,496 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 14:21:45,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:45,497 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 14:21:45,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:45,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:45,532 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 14:21:45,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:45,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:21:45,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:45,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:45,564 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:45,564 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-10-04 14:21:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:49,367 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-10-04 14:21:49,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:21:49,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 14:21:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:49,369 INFO L225 Difference]: With dead ends: 1518 [2018-10-04 14:21:49,369 INFO L226 Difference]: Without dead ends: 1510 [2018-10-04 14:21:49,370 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 14:21:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-04 14:21:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-10-04 14:21:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-10-04 14:21:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-10-04 14:21:50,449 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-10-04 14:21:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:50,449 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-10-04 14:21:50,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-10-04 14:21:50,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:21:50,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:50,450 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:50,451 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:50,451 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:50,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-10-04 14:21:50,451 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:50,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:50,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:50,520 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 14:21:50,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:50,520 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:21:50,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:50,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:50,582 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 14:21:50,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:50,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:21:50,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:50,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:50,603 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:50,603 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-10-04 14:21:54,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:54,184 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-10-04 14:21:54,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:21:54,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 14:21:54,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:54,186 INFO L225 Difference]: With dead ends: 1448 [2018-10-04 14:21:54,186 INFO L226 Difference]: Without dead ends: 1440 [2018-10-04 14:21:54,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-04 14:21:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-10-04 14:21:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-10-04 14:21:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-10-04 14:21:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-10-04 14:21:55,243 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-10-04 14:21:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:55,244 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-10-04 14:21:55,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-10-04 14:21:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:21:55,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:55,245 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:55,245 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:55,245 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:55,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-10-04 14:21:55,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:55,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:55,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:55,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:55,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:55,313 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 14:21:55,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:55,314 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:21:55,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:55,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:55,364 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 14:21:55,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:55,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:21:55,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:55,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:55,387 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:55,387 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-10-04 14:21:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:58,416 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-10-04 14:21:58,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:21:58,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 14:21:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:58,419 INFO L225 Difference]: With dead ends: 1254 [2018-10-04 14:21:58,419 INFO L226 Difference]: Without dead ends: 1246 [2018-10-04 14:21:58,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 13 [2018-10-04 14:21:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-10-04 14:21:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-10-04 14:21:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-10-04 14:21:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-10-04 14:21:59,446 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-10-04 14:21:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:59,446 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-10-04 14:21:59,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-10-04 14:21:59,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:21:59,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:59,447 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:59,448 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:59,448 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:59,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-10-04 14:21:59,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:59,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:59,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:59,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:59,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:59,560 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 14:21:59,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:59,561 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 14:21:59,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:59,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:00,508 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 14:22:00,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:00,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 14:22:00,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:22:00,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:22:00,529 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:00,529 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-10-04 14:22:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:06,029 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-10-04 14:22:06,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 14:22:06,030 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 14:22:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:06,031 INFO L225 Difference]: With dead ends: 1278 [2018-10-04 14:22:06,032 INFO L226 Difference]: Without dead ends: 1270 [2018-10-04 14:22:06,032 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 29 [2018-10-04 14:22:06,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-10-04 14:22:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-10-04 14:22:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-10-04 14:22:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-10-04 14:22:07,072 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-10-04 14:22:07,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:07,073 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-10-04 14:22:07,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:22:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-10-04 14:22:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:22:07,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:07,073 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:07,073 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:07,074 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:07,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-10-04 14:22:07,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:07,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:07,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:07,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:07,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:07,148 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 14:22:07,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:07,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 14:22:07,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:22:07,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:22:07,149 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:07,149 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-10-04 14:22:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:10,536 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-10-04 14:22:10,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:22:10,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 14:22:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:10,538 INFO L225 Difference]: With dead ends: 1180 [2018-10-04 14:22:10,538 INFO L226 Difference]: Without dead ends: 1172 [2018-10-04 14:22:10,539 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 16 [2018-10-04 14:22:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-10-04 14:22:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-10-04 14:22:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-10-04 14:22:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-10-04 14:22:11,628 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-10-04 14:22:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:11,628 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-10-04 14:22:11,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:22:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-10-04 14:22:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:22:11,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:11,628 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:11,629 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:11,629 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:11,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-10-04 14:22:11,629 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:11,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:11,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:11,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:11,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:12,087 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 14:22:12,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:12,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 14:22:12,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:22:12,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:22:12,088 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:12,088 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-10-04 14:22:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:15,745 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-10-04 14:22:15,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:22:15,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 14:22:15,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:15,748 INFO L225 Difference]: With dead ends: 1233 [2018-10-04 14:22:15,748 INFO L226 Difference]: Without dead ends: 1225 [2018-10-04 14:22:15,748 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 14:22:15,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-10-04 14:22:16,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-10-04 14:22:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-10-04 14:22:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-10-04 14:22:16,832 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-10-04 14:22:16,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:16,833 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-10-04 14:22:16,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:22:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-10-04 14:22:16,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:22:16,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:16,833 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:16,834 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:16,834 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:16,834 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-10-04 14:22:16,834 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:16,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:16,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:16,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:16,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:16,933 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 14:22:16,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:16,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 14:22:16,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:22:16,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:22:16,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:16,934 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-10-04 14:22:21,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:21,415 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-10-04 14:22:21,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:22:21,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 14:22:21,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:21,417 INFO L225 Difference]: With dead ends: 1537 [2018-10-04 14:22:21,417 INFO L226 Difference]: Without dead ends: 1529 [2018-10-04 14:22:21,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 17 [2018-10-04 14:22:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-10-04 14:22:22,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-10-04 14:22:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-10-04 14:22:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-10-04 14:22:22,549 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-10-04 14:22:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:22,549 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-10-04 14:22:22,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:22:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-10-04 14:22:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:22:22,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:22,550 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:22,550 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:22,550 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-10-04 14:22:22,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:22,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:22,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:22,638 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 14:22:22,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:22,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 14:22:22,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:22:22,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:22:22,639 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:22,639 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-10-04 14:22:27,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:27,505 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-10-04 14:22:27,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:22:27,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 14:22:27,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:27,507 INFO L225 Difference]: With dead ends: 1590 [2018-10-04 14:22:27,507 INFO L226 Difference]: Without dead ends: 1582 [2018-10-04 14:22:27,508 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 14:22:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-10-04 14:22:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-10-04 14:22:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-10-04 14:22:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-10-04 14:22:28,768 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-10-04 14:22:28,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:28,768 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-10-04 14:22:28,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:22:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-10-04 14:22:28,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:22:28,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:28,769 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:28,769 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:28,769 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:28,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-10-04 14:22:28,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:28,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:28,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:28,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:28,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:28,843 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 14:22:28,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:28,844 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 14:22:28,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:28,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:28,978 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 14:22:28,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:29,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 14:22:29,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:22:29,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:22:29,000 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:29,000 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-10-04 14:22:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:39,200 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-10-04 14:22:39,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-04 14:22:39,200 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 14:22:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:39,202 INFO L225 Difference]: With dead ends: 1949 [2018-10-04 14:22:39,202 INFO L226 Difference]: Without dead ends: 1941 [2018-10-04 14:22:39,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.5s impTime 42 [2018-10-04 14:22:39,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-10-04 14:22:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-10-04 14:22:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-10-04 14:22:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-10-04 14:22:40,463 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-10-04 14:22:40,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:40,463 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-10-04 14:22:40,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:22:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-10-04 14:22:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:22:40,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:40,464 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:40,465 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:40,465 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:40,465 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-10-04 14:22:40,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:40,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:40,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:40,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:40,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:40,550 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 14:22:40,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:40,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 14:22:40,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:22:40,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:22:40,551 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:40,551 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-10-04 14:22:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:44,825 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-10-04 14:22:44,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:22:44,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 14:22:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:44,827 INFO L225 Difference]: With dead ends: 1420 [2018-10-04 14:22:44,827 INFO L226 Difference]: Without dead ends: 1412 [2018-10-04 14:22:44,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.2s impTime 19 [2018-10-04 14:22:44,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-10-04 14:22:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-10-04 14:22:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-10-04 14:22:46,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-10-04 14:22:46,207 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-10-04 14:22:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:46,207 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-10-04 14:22:46,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:22:46,207 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-10-04 14:22:46,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:22:46,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:46,208 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:46,208 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:46,208 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:46,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-10-04 14:22:46,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:46,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:46,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:46,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:46,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:46,278 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 14:22:46,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:46,279 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 14:22:46,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:46,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:46,432 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 14:22:46,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:46,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 14:22:46,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:22:46,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:22:46,455 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:46,455 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-10-04 14:23:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:00,746 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-10-04 14:23:00,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-04 14:23:00,746 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 14:23:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:00,749 INFO L225 Difference]: With dead ends: 2767 [2018-10-04 14:23:00,749 INFO L226 Difference]: Without dead ends: 2759 [2018-10-04 14:23:00,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 2.4s impTime 56 [2018-10-04 14:23:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-10-04 14:23:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-10-04 14:23:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-10-04 14:23:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-10-04 14:23:02,168 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-10-04 14:23:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:02,168 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-10-04 14:23:02,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:23:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-10-04 14:23:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:23:02,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:02,169 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:02,169 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:02,169 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:02,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-10-04 14:23:02,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:02,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:02,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:02,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:02,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:02,278 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 14:23:02,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:02,278 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 14:23:02,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:02,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:02,412 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 14:23:02,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:02,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 14:23:02,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:23:02,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:23:02,435 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:02,435 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-10-04 14:23:16,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:16,416 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-10-04 14:23:16,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-04 14:23:16,416 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 14:23:16,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:16,419 INFO L225 Difference]: With dead ends: 2361 [2018-10-04 14:23:16,419 INFO L226 Difference]: Without dead ends: 2353 [2018-10-04 14:23:16,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time 3.2s impTime 70 [2018-10-04 14:23:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-10-04 14:23:17,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-10-04 14:23:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-10-04 14:23:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-10-04 14:23:17,982 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-10-04 14:23:17,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:17,982 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-10-04 14:23:17,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:23:17,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-10-04 14:23:17,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:23:17,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:17,983 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 14:23:17,984 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:17,984 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:17,984 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-10-04 14:23:17,984 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:17,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:17,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:17,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:17,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:18,065 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 14:23:18,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:18,065 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 14:23:18,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:18,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:18,201 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 14:23:18,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:18,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-04 14:23:18,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:23:18,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:23:18,221 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:18,222 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-10-04 14:23:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:21,329 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-10-04 14:23:21,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:23:21,330 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-10-04 14:23:21,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:21,331 INFO L225 Difference]: With dead ends: 1507 [2018-10-04 14:23:21,331 INFO L226 Difference]: Without dead ends: 1502 [2018-10-04 14:23:21,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 14:23:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-10-04 14:23:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-10-04 14:23:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-10-04 14:23:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-10-04 14:23:23,334 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-10-04 14:23:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:23,334 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-10-04 14:23:23,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:23:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-10-04 14:23:23,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:23:23,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:23,336 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:23,336 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:23,336 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:23,336 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-10-04 14:23:23,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:23,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:23,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:23,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:23,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:23,504 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 14:23:23,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:23,505 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 14:23:23,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:23,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:23,651 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 14:23:23,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:23,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-10-04 14:23:23,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:23:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:23:23,674 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:23,674 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-10-04 14:23:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:34,147 INFO L93 Difference]: Finished difference Result 3662 states and 8082 transitions. [2018-10-04 14:23:34,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 14:23:34,147 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-10-04 14:23:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:34,151 INFO L225 Difference]: With dead ends: 3662 [2018-10-04 14:23:34,152 INFO L226 Difference]: Without dead ends: 3654 [2018-10-04 14:23:34,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 28 [2018-10-04 14:23:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2018-10-04 14:23:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 2136. [2018-10-04 14:23:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-10-04 14:23:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-10-04 14:23:37,096 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-10-04 14:23:37,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:37,096 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-10-04 14:23:37,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:23:37,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-10-04 14:23:37,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 14:23:37,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:37,097 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:37,098 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:37,098 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:37,098 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-10-04 14:23:37,098 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:37,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:37,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:37,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:37,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:37,195 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 14:23:37,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:37,196 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 14:23:37,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:37,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:37,266 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 14:23:37,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:37,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 14:23:37,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:23:37,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:23:37,289 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:37,289 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-10-04 14:23:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:42,883 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-10-04 14:23:42,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:23:42,884 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 14:23:42,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:42,887 INFO L225 Difference]: With dead ends: 2767 [2018-10-04 14:23:42,887 INFO L226 Difference]: Without dead ends: 2759 [2018-10-04 14:23:42,887 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 14:23:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-10-04 14:23:45,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-10-04 14:23:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-10-04 14:23:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-10-04 14:23:45,863 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-10-04 14:23:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:45,863 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-10-04 14:23:45,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:23:45,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-10-04 14:23:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 14:23:45,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:45,864 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 14:23:45,865 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:45,865 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:45,865 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-10-04 14:23:45,865 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:45,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:45,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:45,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:45,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:46,125 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 14:23:46,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:46,126 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 14:23:46,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:46,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:46,424 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 14:23:46,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:46,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 14:23:46,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:23:46,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:23:46,445 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:46,445 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-10-04 14:23:52,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:52,794 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-10-04 14:23:52,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:23:52,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 14:23:52,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:52,798 INFO L225 Difference]: With dead ends: 3146 [2018-10-04 14:23:52,798 INFO L226 Difference]: Without dead ends: 3138 [2018-10-04 14:23:52,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 18 [2018-10-04 14:23:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-10-04 14:23:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-10-04 14:23:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-10-04 14:23:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-10-04 14:23:55,801 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-10-04 14:23:55,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:55,801 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-10-04 14:23:55,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:23:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-10-04 14:23:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 14:23:55,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:55,802 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 14:23:55,802 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:55,803 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:55,803 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-10-04 14:23:55,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:55,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:55,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:55,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:55,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:55,898 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 14:23:55,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:55,899 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 14:23:55,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:55,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:55,973 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 14:23:55,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:55,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 14:23:55,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:23:55,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:23:55,993 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:55,993 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-10-04 14:24:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:02,742 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-10-04 14:24:02,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:24:02,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 14:24:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:02,746 INFO L225 Difference]: With dead ends: 3089 [2018-10-04 14:24:02,747 INFO L226 Difference]: Without dead ends: 3081 [2018-10-04 14:24:02,747 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 14:24:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-10-04 14:24:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-10-04 14:24:05,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-10-04 14:24:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-10-04 14:24:05,710 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-10-04 14:24:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:05,710 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-10-04 14:24:05,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:24:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-10-04 14:24:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 14:24:05,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:05,712 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 14:24:05,712 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:05,712 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:05,713 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-10-04 14:24:05,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:05,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:05,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:05,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:05,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:05,800 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 14:24:05,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:05,800 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 14:24:05,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:05,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:05,866 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 14:24:05,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:05,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 14:24:05,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:24:05,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:24:05,888 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:05,888 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. [2018-10-04 14:24:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:12,595 INFO L93 Difference]: Finished difference Result 3266 states and 7250 transitions. [2018-10-04 14:24:12,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:24:12,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 14:24:12,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:12,599 INFO L225 Difference]: With dead ends: 3266 [2018-10-04 14:24:12,599 INFO L226 Difference]: Without dead ends: 3258 [2018-10-04 14:24:12,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 18 [2018-10-04 14:24:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. Received shutdown request... [2018-10-04 14:24:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2328. [2018-10-04 14:24:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2328 states. [2018-10-04 14:24:15,812 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 14:24:15,817 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 14:24:15,818 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:24:15 BoogieIcfgContainer [2018-10-04 14:24:15,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:24:15,819 INFO L168 Benchmark]: Toolchain (without parser) took 263267.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 683.7 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -309.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-04 14:24:15,821 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:24:15,821 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:24:15,822 INFO L168 Benchmark]: Boogie Preprocessor took 34.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:24:15,822 INFO L168 Benchmark]: RCFGBuilder took 943.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 14:24:15,823 INFO L168 Benchmark]: TraceAbstraction took 262240.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 683.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -340.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-04 14:24:15,827 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 943.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 262240.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 683.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -340.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 262.1s OverallTime, 52 OverallIterations, 2 TraceHistogramMax, 206.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13611 SDtfs, 44011 SDslu, 48460 SDs, 0 SdLazy, 100108 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, 26.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: 44.8s AutomataMinimizationTime, 52 MinimizatonAttempts, 27184 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.7s 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_14-24-15-847.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_14-24-15-847.csv Completed graceful shutdown