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_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:03:25,783 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:03:25,785 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:03:25,800 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:03:25,800 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:03:25,801 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:03:25,803 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:03:25,805 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:03:25,806 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:03:25,807 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:03:25,808 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:03:25,809 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:03:25,810 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:03:25,811 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:03:25,812 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:03:25,813 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:03:25,814 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:03:25,816 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:03:25,818 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:03:25,820 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:03:25,821 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:03:25,823 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:03:25,825 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:03:25,826 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:03:25,826 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:03:25,827 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:03:25,828 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:03:25,829 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:03:25,830 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:03:25,831 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:03:25,832 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:03:25,832 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:03:25,833 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:03:25,834 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:03:25,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:03:25,836 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:03:25,837 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-02 12:03:25,852 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:03:25,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:03:25,854 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:03:25,854 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:03:25,854 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:03:25,855 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:03:25,855 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:03:25,855 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:03:25,855 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:03:25,856 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:03:25,856 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:03:25,856 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:03:25,856 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:03:25,856 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:03:25,857 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:03:25,857 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:03:25,857 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:03:25,857 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:03:25,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:03:25,858 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:03:25,858 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:03:25,858 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:03:25,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:03:25,859 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:03:25,859 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:03:25,859 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:03:25,859 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:03:25,859 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:03:25,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:03:25,860 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:03:25,860 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:03:25,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:03:25,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:03:25,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:03:25,931 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:03:25,932 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:03:25,932 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl [2018-10-02 12:03:25,933 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-10-02 12:03:26,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:03:26,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:03:26,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:03:26,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:03:26,023 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:03:26,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:26" (1/1) ... [2018-10-02 12:03:26,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:26" (1/1) ... [2018-10-02 12:03:26,070 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 12:03:26,071 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 12:03:26,071 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 12:03:26,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:03:26,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:03:26,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:03:26,075 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:03:26,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:26" (1/1) ... [2018-10-02 12:03:26,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:26" (1/1) ... [2018-10-02 12:03:26,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:26" (1/1) ... [2018-10-02 12:03:26,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:26" (1/1) ... [2018-10-02 12:03:26,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:26" (1/1) ... [2018-10-02 12:03:26,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:26" (1/1) ... [2018-10-02 12:03:26,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:26" (1/1) ... [2018-10-02 12:03:26,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:03:26,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:03:26,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:03:26,150 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:03:26,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:26" (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-02 12:03:26,227 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-02 12:03:26,227 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-02 12:03:26,227 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-02 12:03:27,415 INFO L337 CfgBuilder]: Using library mode [2018-10-02 12:03:27,415 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:27 BoogieIcfgContainer [2018-10-02 12:03:27,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:03:27,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:03:27,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:03:27,420 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:03:27,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:26" (1/2) ... [2018-10-02 12:03:27,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be5552f and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:03:27, skipping insertion in model container [2018-10-02 12:03:27,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:27" (2/2) ... [2018-10-02 12:03:27,424 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-10-02 12:03:27,435 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:03:27,444 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-10-02 12:03:27,501 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:03:27,502 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:03:27,502 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:03:27,502 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:03:27,502 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:03:27,503 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:03:27,503 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:03:27,503 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:03:27,503 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:03:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-10-02 12:03:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 12:03:27,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:27,544 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 12:03:27,547 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:27,561 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:27,562 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-10-02 12:03:27,564 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:27,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:27,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:27,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:27,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:27,770 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-02 12:03:27,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:27,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:27,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:03:27,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:03:27,794 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:27,796 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-10-02 12:03:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:31,277 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-10-02 12:03:31,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:03:31,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-02 12:03:31,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:31,301 INFO L225 Difference]: With dead ends: 142 [2018-10-02 12:03:31,301 INFO L226 Difference]: Without dead ends: 138 [2018-10-02 12:03:31,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:03:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-02 12:03:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-10-02 12:03:31,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-02 12:03:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-10-02 12:03:31,377 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-10-02 12:03:31,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:31,378 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-10-02 12:03:31,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:03:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-10-02 12:03:31,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 12:03:31,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:31,383 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 12:03:31,388 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:31,388 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:31,388 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-10-02 12:03:31,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:31,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:31,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:31,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:31,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:31,520 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-02 12:03:31,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:31,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:31,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:03:31,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:03:31,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:31,523 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-10-02 12:03:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:35,399 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-10-02 12:03:35,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 12:03:35,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-02 12:03:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:35,406 INFO L225 Difference]: With dead ends: 241 [2018-10-02 12:03:35,406 INFO L226 Difference]: Without dead ends: 237 [2018-10-02 12:03:35,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:03:35,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-02 12:03:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-10-02 12:03:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-02 12:03:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-10-02 12:03:35,441 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-10-02 12:03:35,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:35,441 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-10-02 12:03:35,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:03:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-10-02 12:03:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 12:03:35,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:35,442 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 12:03:35,443 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:35,444 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-10-02 12:03:35,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:35,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:35,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:35,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:35,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:35,514 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-02 12:03:35,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:35,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:35,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:03:35,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:03:35,516 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:35,516 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-10-02 12:03:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:39,333 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-10-02 12:03:39,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 12:03:39,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-02 12:03:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:39,338 INFO L225 Difference]: With dead ends: 269 [2018-10-02 12:03:39,338 INFO L226 Difference]: Without dead ends: 265 [2018-10-02 12:03:39,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:03:39,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-02 12:03:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-10-02 12:03:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-02 12:03:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-10-02 12:03:39,403 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-10-02 12:03:39,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:39,403 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-10-02 12:03:39,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:03:39,404 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-10-02 12:03:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:03:39,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:39,405 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:39,406 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:39,406 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:39,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-10-02 12:03:39,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:39,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:39,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:39,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:39,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:39,578 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-02 12:03:39,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:39,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:03:39,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:03:39,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:03:39,580 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:39,580 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-10-02 12:03:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:49,228 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-10-02 12:03:49,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 12:03:49,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:03:49,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:49,235 INFO L225 Difference]: With dead ends: 790 [2018-10-02 12:03:49,235 INFO L226 Difference]: Without dead ends: 629 [2018-10-02 12:03:49,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:03:49,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-02 12:03:49,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-10-02 12:03:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-02 12:03:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-10-02 12:03:49,295 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-10-02 12:03:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:49,295 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-10-02 12:03:49,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:03:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-10-02 12:03:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:03:49,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:49,297 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:49,298 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:49,298 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:49,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-10-02 12:03:49,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:49,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:49,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:49,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:49,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:49,453 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-02 12:03:49,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:49,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:03:49,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:03:49,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:03:49,454 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:49,454 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-10-02 12:03:59,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:59,855 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-10-02 12:03:59,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 12:03:59,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:03:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:59,861 INFO L225 Difference]: With dead ends: 634 [2018-10-02 12:03:59,861 INFO L226 Difference]: Without dead ends: 628 [2018-10-02 12:03:59,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:03:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-02 12:03:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-10-02 12:03:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-02 12:03:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-10-02 12:03:59,917 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-10-02 12:03:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:59,918 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-10-02 12:03:59,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:03:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-10-02 12:03:59,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:03:59,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:59,920 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:59,921 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:59,921 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:59,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-10-02 12:03:59,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:59,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:59,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:59,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:59,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:00,047 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-02 12:04:00,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:00,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:04:00,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:00,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:00,049 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:00,049 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-10-02 12:04:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:08,734 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-10-02 12:04:08,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:04:08,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:04:08,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:08,740 INFO L225 Difference]: With dead ends: 768 [2018-10-02 12:04:08,740 INFO L226 Difference]: Without dead ends: 537 [2018-10-02 12:04:08,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime [2018-10-02 12:04:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-10-02 12:04:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-10-02 12:04:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-02 12:04:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-10-02 12:04:08,807 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-10-02 12:04:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:08,808 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-10-02 12:04:08,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-10-02 12:04:08,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:08,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:08,809 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:08,810 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:08,810 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:08,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-10-02 12:04:08,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:08,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:08,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:08,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:08,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:08,916 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-02 12:04:08,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:08,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:04:08,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:08,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:08,917 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:08,918 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-10-02 12:04:18,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:18,760 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-10-02 12:04:18,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 12:04:18,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:04:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:18,766 INFO L225 Difference]: With dead ends: 1145 [2018-10-02 12:04:18,766 INFO L226 Difference]: Without dead ends: 812 [2018-10-02 12:04:18,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime [2018-10-02 12:04:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-10-02 12:04:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-10-02 12:04:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-10-02 12:04:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-10-02 12:04:18,847 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-10-02 12:04:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:18,848 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-10-02 12:04:18,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-10-02 12:04:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:18,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:18,849 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:18,850 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:18,850 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:18,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-10-02 12:04:18,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:18,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:18,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:18,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:18,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:18,945 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-02 12:04:18,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:18,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:04:18,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:18,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:18,947 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:18,948 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-10-02 12:04:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:26,847 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-10-02 12:04:26,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 12:04:26,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:04:26,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:26,853 INFO L225 Difference]: With dead ends: 877 [2018-10-02 12:04:26,853 INFO L226 Difference]: Without dead ends: 871 [2018-10-02 12:04:26,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime [2018-10-02 12:04:26,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-02 12:04:26,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-10-02 12:04:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-10-02 12:04:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-10-02 12:04:26,958 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-10-02 12:04:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:26,958 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-10-02 12:04:26,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-10-02 12:04:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:26,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:26,959 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:26,960 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:26,960 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-10-02 12:04:26,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:26,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:26,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:26,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:26,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:27,087 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-02 12:04:27,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:27,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:04:27,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:27,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:27,088 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:27,088 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-10-02 12:04:36,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:36,124 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-10-02 12:04:36,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:04:36,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:04:36,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:36,131 INFO L225 Difference]: With dead ends: 1049 [2018-10-02 12:04:36,131 INFO L226 Difference]: Without dead ends: 818 [2018-10-02 12:04:36,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:04:36,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-10-02 12:04:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-10-02 12:04:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-02 12:04:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-10-02 12:04:36,266 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-10-02 12:04:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:36,267 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-10-02 12:04:36,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-10-02 12:04:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:36,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:36,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:36,269 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:36,269 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:36,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-10-02 12:04:36,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:36,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:36,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:36,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:36,363 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-02 12:04:36,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:36,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:04:36,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:36,364 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:36,364 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-10-02 12:04:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:43,657 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-10-02 12:04:43,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:04:43,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:04:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:43,663 INFO L225 Difference]: With dead ends: 733 [2018-10-02 12:04:43,663 INFO L226 Difference]: Without dead ends: 727 [2018-10-02 12:04:43,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:04:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-10-02 12:04:43,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-10-02 12:04:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-02 12:04:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-10-02 12:04:43,795 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-10-02 12:04:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:43,796 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-10-02 12:04:43,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-10-02 12:04:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:43,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:43,797 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:43,798 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:43,798 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:43,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-10-02 12:04:43,798 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:43,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:43,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:43,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:43,922 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-02 12:04:43,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:43,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:04:43,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:43,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:43,924 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:43,924 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-10-02 12:04:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:55,187 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-10-02 12:04:55,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-02 12:04:55,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:04:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:55,196 INFO L225 Difference]: With dead ends: 1329 [2018-10-02 12:04:55,196 INFO L226 Difference]: Without dead ends: 1323 [2018-10-02 12:04:55,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:04:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-10-02 12:04:55,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-10-02 12:04:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-10-02 12:04:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-10-02 12:04:55,422 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-10-02 12:04:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:55,422 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-10-02 12:04:55,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-10-02 12:04:55,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:04:55,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:55,423 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:55,424 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:55,424 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:55,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-10-02 12:04:55,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:55,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:55,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:55,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:55,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:55,662 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-02 12:04:55,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:55,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:04:55,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:55,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:55,663 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:55,663 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-10-02 12:05:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:03,842 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-10-02 12:05:03,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 12:05:03,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:05:03,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:03,853 INFO L225 Difference]: With dead ends: 1268 [2018-10-02 12:05:03,853 INFO L226 Difference]: Without dead ends: 1262 [2018-10-02 12:05:03,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:05:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-10-02 12:05:04,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-10-02 12:05:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-02 12:05:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-10-02 12:05:04,056 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-10-02 12:05:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:04,057 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-10-02 12:05:04,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:05:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-10-02 12:05:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:05:04,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:04,058 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:04,059 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:04,059 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-10-02 12:05:04,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:04,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:04,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:04,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:04,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:04,147 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-02 12:05:04,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:05:04,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:05:04,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:05:04,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:05:04,148 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:04,148 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-10-02 12:05:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:12,665 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-10-02 12:05:12,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 12:05:12,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:05:12,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:12,675 INFO L225 Difference]: With dead ends: 1367 [2018-10-02 12:05:12,675 INFO L226 Difference]: Without dead ends: 1361 [2018-10-02 12:05:12,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime [2018-10-02 12:05:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-10-02 12:05:12,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-10-02 12:05:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-10-02 12:05:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-10-02 12:05:12,892 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-10-02 12:05:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:12,893 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-10-02 12:05:12,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:05:12,893 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-10-02 12:05:12,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:05:12,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:12,894 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:12,895 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:12,895 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:12,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-10-02 12:05:12,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:12,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:12,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:12,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:12,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:12,995 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-02 12:05:12,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:05:12,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:05:12,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:05:12,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:05:12,996 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:12,997 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-10-02 12:05:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:24,404 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-10-02 12:05:24,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 12:05:24,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:05:24,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:24,413 INFO L225 Difference]: With dead ends: 1373 [2018-10-02 12:05:24,414 INFO L226 Difference]: Without dead ends: 1367 [2018-10-02 12:05:24,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:05:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-10-02 12:05:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-10-02 12:05:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-10-02 12:05:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-10-02 12:05:24,763 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-10-02 12:05:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:24,764 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-10-02 12:05:24,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:05:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-10-02 12:05:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:05:24,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:24,765 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:24,766 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:24,766 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:24,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-10-02 12:05:24,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:24,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:24,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:24,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:24,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:25,318 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-02 12:05:25,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:05:25,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:05:25,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:05:25,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:05:25,320 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:25,320 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-10-02 12:05:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:33,816 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-10-02 12:05:33,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:05:33,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:05:33,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:33,825 INFO L225 Difference]: With dead ends: 1526 [2018-10-02 12:05:33,825 INFO L226 Difference]: Without dead ends: 1520 [2018-10-02 12:05:33,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime [2018-10-02 12:05:33,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-10-02 12:05:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-10-02 12:05:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-02 12:05:34,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-10-02 12:05:34,110 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-10-02 12:05:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:34,111 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-10-02 12:05:34,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:05:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-10-02 12:05:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:05:34,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:34,112 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:34,113 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:34,113 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:34,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-10-02 12:05:34,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:34,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:34,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:34,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:34,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:34,250 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-02 12:05:34,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:05:34,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:05:34,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:05:34,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:05:34,251 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:34,252 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-10-02 12:05:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:42,675 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-10-02 12:05:42,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 12:05:42,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:05:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:42,684 INFO L225 Difference]: With dead ends: 1548 [2018-10-02 12:05:42,684 INFO L226 Difference]: Without dead ends: 1542 [2018-10-02 12:05:42,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:05:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-10-02 12:05:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-10-02 12:05:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-02 12:05:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-10-02 12:05:42,963 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-10-02 12:05:42,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:42,964 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-10-02 12:05:42,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:05:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-10-02 12:05:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:05:42,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:42,965 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:42,966 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:42,966 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:42,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-10-02 12:05:42,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:42,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:42,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:42,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:42,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:43,056 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-02 12:05:43,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:05:43,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:05:43,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:05:43,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:05:43,058 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:43,058 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-10-02 12:05:51,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:51,837 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-10-02 12:05:51,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:05:51,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:05:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:51,845 INFO L225 Difference]: With dead ends: 1575 [2018-10-02 12:05:51,845 INFO L226 Difference]: Without dead ends: 1569 [2018-10-02 12:05:51,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:05:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-10-02 12:05:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-10-02 12:05:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-10-02 12:05:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-10-02 12:05:52,152 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-10-02 12:05:52,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:52,152 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-10-02 12:05:52,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:05:52,152 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-10-02 12:05:52,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:05:52,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:52,153 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:52,154 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:52,154 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:52,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-10-02 12:05:52,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:52,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:52,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:52,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:52,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:52,234 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-02 12:05:52,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:05:52,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:05:52,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:05:52,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:05:52,236 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:52,236 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-10-02 12:05:58,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:58,981 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-10-02 12:05:58,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:05:58,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:05:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:58,992 INFO L225 Difference]: With dead ends: 1597 [2018-10-02 12:05:58,992 INFO L226 Difference]: Without dead ends: 1591 [2018-10-02 12:05:58,993 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 [2018-10-02 12:05:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-02 12:05:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-10-02 12:05:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-10-02 12:05:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-10-02 12:05:59,322 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-10-02 12:05:59,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:59,323 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-10-02 12:05:59,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:05:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-10-02 12:05:59,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:05:59,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:59,324 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:59,325 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:59,325 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:59,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-10-02 12:05:59,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:59,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:59,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:59,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:59,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:59,453 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-02 12:05:59,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:05:59,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:05:59,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:05:59,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:05:59,454 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:59,455 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-10-02 12:06:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:05,674 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-10-02 12:06:05,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 12:06:05,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:06:05,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:05,685 INFO L225 Difference]: With dead ends: 1726 [2018-10-02 12:06:05,685 INFO L226 Difference]: Without dead ends: 1720 [2018-10-02 12:06:05,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:06:05,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-10-02 12:06:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-10-02 12:06:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-10-02 12:06:06,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-10-02 12:06:06,092 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-10-02 12:06:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:06,092 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-10-02 12:06:06,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:06:06,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-10-02 12:06:06,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:06:06,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:06,093 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:06,094 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:06,094 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:06,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-10-02 12:06:06,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:06,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:06,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:06,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:06,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:06,209 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-02 12:06:06,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:06:06,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:06:06,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:06:06,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:06:06,210 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:06,210 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-10-02 12:06:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:14,801 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-10-02 12:06:14,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:06:14,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:06:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:14,808 INFO L225 Difference]: With dead ends: 1758 [2018-10-02 12:06:14,808 INFO L226 Difference]: Without dead ends: 1752 [2018-10-02 12:06:14,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:06:14,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-10-02 12:06:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-10-02 12:06:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-02 12:06:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-10-02 12:06:15,298 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-10-02 12:06:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:15,298 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-10-02 12:06:15,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:06:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-10-02 12:06:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:06:15,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:15,299 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:15,299 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:15,299 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:15,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-10-02 12:06:15,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:15,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:15,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:15,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:15,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:15,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-02 12:06:15,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:06:15,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:06:15,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:06:15,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:06:15,389 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:15,389 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-10-02 12:06:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:23,941 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-10-02 12:06:23,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 12:06:23,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:06:23,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:23,948 INFO L225 Difference]: With dead ends: 1867 [2018-10-02 12:06:23,948 INFO L226 Difference]: Without dead ends: 1861 [2018-10-02 12:06:23,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:06:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-10-02 12:06:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-10-02 12:06:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-10-02 12:06:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-10-02 12:06:24,526 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-10-02 12:06:24,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:24,526 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-10-02 12:06:24,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:06:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-10-02 12:06:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:06:24,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:24,528 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:24,528 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:24,528 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:24,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-10-02 12:06:24,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:24,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:24,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:24,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:24,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:24,815 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-02 12:06:24,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:06:24,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:06:24,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:06:24,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:06:24,817 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:24,817 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-10-02 12:06:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:34,587 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-10-02 12:06:34,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:06:34,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:06:34,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:34,596 INFO L225 Difference]: With dead ends: 1968 [2018-10-02 12:06:34,596 INFO L226 Difference]: Without dead ends: 1962 [2018-10-02 12:06:34,597 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 [2018-10-02 12:06:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-10-02 12:06:35,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-10-02 12:06:35,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-10-02 12:06:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-10-02 12:06:35,323 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-10-02 12:06:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:35,323 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-10-02 12:06:35,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:06:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-10-02 12:06:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:06:35,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:35,324 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:35,325 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:35,325 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-10-02 12:06:35,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:35,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:35,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:35,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:35,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:35,397 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-02 12:06:35,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:06:35,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:06:35,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:06:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:06:35,398 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:35,398 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-10-02 12:06:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:43,333 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-10-02 12:06:43,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 12:06:43,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:06:43,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:43,341 INFO L225 Difference]: With dead ends: 2001 [2018-10-02 12:06:43,341 INFO L226 Difference]: Without dead ends: 1995 [2018-10-02 12:06:43,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:06:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-10-02 12:06:44,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-10-02 12:06:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-10-02 12:06:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-10-02 12:06:44,020 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-10-02 12:06:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:44,020 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-10-02 12:06:44,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:06:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-10-02 12:06:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:06:44,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:44,021 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:44,022 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:44,022 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:44,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-10-02 12:06:44,023 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:44,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:44,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:44,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:44,091 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-02 12:06:44,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:06:44,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:06:44,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:06:44,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:06:44,092 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:44,092 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-10-02 12:06:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:50,519 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-10-02 12:06:50,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 12:06:50,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:06:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:50,524 INFO L225 Difference]: With dead ends: 1708 [2018-10-02 12:06:50,524 INFO L226 Difference]: Without dead ends: 1702 [2018-10-02 12:06:50,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:06:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-10-02 12:06:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-10-02 12:06:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-10-02 12:06:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-10-02 12:06:51,192 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-10-02 12:06:51,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:51,192 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-10-02 12:06:51,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:06:51,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-10-02 12:06:51,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:06:51,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:51,194 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:51,194 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:51,194 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:51,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-10-02 12:06:51,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:51,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:51,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:51,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:51,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:51,267 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-02 12:06:51,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:06:51,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:06:51,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:06:51,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:06:51,269 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:51,269 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-10-02 12:07:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:00,735 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-10-02 12:07:00,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 12:07:00,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:07:00,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:00,740 INFO L225 Difference]: With dead ends: 2402 [2018-10-02 12:07:00,740 INFO L226 Difference]: Without dead ends: 2396 [2018-10-02 12:07:00,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:07:00,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-10-02 12:07:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-10-02 12:07:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-10-02 12:07:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-10-02 12:07:01,558 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-10-02 12:07:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:01,559 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-10-02 12:07:01,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:07:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-10-02 12:07:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:07:01,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:01,560 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:07:01,560 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:01,561 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:01,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-10-02 12:07:01,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:01,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:01,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:01,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:01,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:01,669 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-02 12:07:01,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:07:01,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:07:01,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:07:01,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:07:01,670 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:01,670 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-10-02 12:07:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:10,210 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-10-02 12:07:10,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 12:07:10,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 12:07:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:10,215 INFO L225 Difference]: With dead ends: 2274 [2018-10-02 12:07:10,215 INFO L226 Difference]: Without dead ends: 2268 [2018-10-02 12:07:10,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:07:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-10-02 12:07:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-10-02 12:07:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-10-02 12:07:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-10-02 12:07:11,056 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-10-02 12:07:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:11,057 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-10-02 12:07:11,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:07:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-10-02 12:07:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:07:11,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:11,058 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-02 12:07:11,058 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:11,058 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:11,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-10-02 12:07:11,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:11,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:11,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:11,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:11,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:11,088 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-02 12:07:11,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:07:11,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:07:11,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:07:11,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:07:11,089 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:11,089 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-10-02 12:07:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:12,383 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-10-02 12:07:12,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 12:07:12,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-02 12:07:12,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:12,385 INFO L225 Difference]: With dead ends: 2170 [2018-10-02 12:07:12,386 INFO L226 Difference]: Without dead ends: 1253 [2018-10-02 12:07:12,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:07:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-10-02 12:07:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-10-02 12:07:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-10-02 12:07:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-10-02 12:07:13,077 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-10-02 12:07:13,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:13,077 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-10-02 12:07:13,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:07:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-10-02 12:07:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:07:13,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:13,078 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:07:13,078 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:13,079 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:13,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-10-02 12:07:13,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:13,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:13,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:13,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:13,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:13,216 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-02 12:07:13,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:07:13,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:07:13,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:07:13,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:07:13,217 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:13,218 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-10-02 12:07:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:25,502 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-10-02 12:07:25,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 12:07:25,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:07:25,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:25,507 INFO L225 Difference]: With dead ends: 2095 [2018-10-02 12:07:25,507 INFO L226 Difference]: Without dead ends: 2093 [2018-10-02 12:07:25,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:07:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-10-02 12:07:26,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-10-02 12:07:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-10-02 12:07:26,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-10-02 12:07:26,232 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-10-02 12:07:26,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:26,233 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-10-02 12:07:26,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:07:26,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-10-02 12:07:26,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:07:26,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:26,234 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:07:26,234 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:26,234 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:26,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-10-02 12:07:26,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:26,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:26,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:26,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:26,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:26,973 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-02 12:07:26,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:07:26,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:07:26,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:07:26,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:07:26,974 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:26,974 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-10-02 12:07:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:39,357 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-10-02 12:07:39,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 12:07:39,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:07:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:39,362 INFO L225 Difference]: With dead ends: 1994 [2018-10-02 12:07:39,362 INFO L226 Difference]: Without dead ends: 1988 [2018-10-02 12:07:39,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime [2018-10-02 12:07:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-10-02 12:07:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-10-02 12:07:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-10-02 12:07:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-10-02 12:07:40,217 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-10-02 12:07:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:40,217 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-10-02 12:07:40,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:07:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-10-02 12:07:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:07:40,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:40,219 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:07:40,219 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:40,219 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:40,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-10-02 12:07:40,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:40,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:40,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:40,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:40,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:40,300 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-02 12:07:40,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:07:40,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 12:07:40,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:07:40,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:07:40,301 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:40,301 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. Received shutdown request... [2018-10-02 12:07:42,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 12:07:42,927 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 12:07:42,934 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 12:07:42,934 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:07:42 BoogieIcfgContainer [2018-10-02 12:07:42,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:07:42,936 INFO L168 Benchmark]: Toolchain (without parser) took 256917.19 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 226.0 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 425.6 MB). Peak memory consumption was 651.6 MB. Max. memory is 7.1 GB. [2018-10-02 12:07:42,938 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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-02 12:07:42,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.57 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-02 12:07:42,939 INFO L168 Benchmark]: Boogie Preprocessor took 74.58 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-02 12:07:42,940 INFO L168 Benchmark]: RCFGBuilder took 1266.45 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-02 12:07:42,941 INFO L168 Benchmark]: TraceAbstraction took 255517.90 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 226.0 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 383.3 MB). Peak memory consumption was 609.3 MB. Max. memory is 7.1 GB. [2018-10-02 12:07:42,946 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.25 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 51.57 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 74.58 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 1266.45 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255517.90 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 226.0 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 383.3 MB). Peak memory consumption was 609.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (1152states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 255.4s OverallTime, 30 OverallIterations, 2 TraceHistogramMax, 240.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8136 SDtfs, 14019 SDslu, 14501 SDs, 0 SdLazy, 50745 SolverSat, 5258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 63.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 423 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1341occurred in iteration=25, 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: 10.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 16299 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 19339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 3/3 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_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-07-42-960.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-07-42-960.csv Completed graceful shutdown