java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4eac566 [2018-09-23 19:30:58,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:30:58,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:30:58,832 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:30:58,833 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:30:58,834 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:30:58,835 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:30:58,837 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:30:58,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:30:58,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:30:58,840 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:30:58,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:30:58,841 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:30:58,842 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:30:58,843 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:30:58,844 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:30:58,845 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:30:58,847 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:30:58,849 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:30:58,851 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:30:58,852 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:30:58,855 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:30:58,860 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:30:58,860 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:30:58,860 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:30:58,863 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:30:58,865 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:30:58,866 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:30:58,870 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:30:58,871 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:30:58,871 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:30:58,872 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:30:58,872 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:30:58,873 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:30:58,875 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:30:58,875 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:30:58,877 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 19:30:58,893 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:30:58,894 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:30:58,895 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:30:58,895 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:30:58,895 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:30:58,896 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:30:58,896 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:30:58,896 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:30:58,896 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:30:58,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:30:58,897 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:30:58,897 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:30:58,897 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:30:58,897 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:30:58,897 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:30:58,898 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:30:58,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:30:58,898 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:30:58,898 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:30:58,898 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:30:58,899 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:30:58,899 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:30:58,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:30:58,899 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:30:58,899 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:30:58,900 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:30:58,900 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:30:58,900 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:30:58,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:30:58,901 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:30:58,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:30:58,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:30:58,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:30:58,987 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:30:58,988 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:30:58,988 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-09-23 19:30:58,989 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-09-23 19:30:59,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:30:59,082 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:30:59,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:30:59,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:30:59,085 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:30:59,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:59" (1/1) ... [2018-09-23 19:30:59,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:59" (1/1) ... [2018-09-23 19:30:59,138 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-23 19:30:59,144 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-23 19:30:59,144 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-23 19:30:59,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:30:59,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:30:59,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:30:59,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:30:59,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:59" (1/1) ... [2018-09-23 19:30:59,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:59" (1/1) ... [2018-09-23 19:30:59,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:59" (1/1) ... [2018-09-23 19:30:59,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:59" (1/1) ... [2018-09-23 19:30:59,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:59" (1/1) ... [2018-09-23 19:30:59,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:59" (1/1) ... [2018-09-23 19:30:59,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:59" (1/1) ... [2018-09-23 19:30:59,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:30:59,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:30:59,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:30:59,184 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:30:59,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:30:59,257 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-23 19:30:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-23 19:30:59,258 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-23 19:31:00,189 INFO L351 CfgBuilder]: Using library mode [2018-09-23 19:31:00,190 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:31:00 BoogieIcfgContainer [2018-09-23 19:31:00,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:31:00,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:31:00,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:31:00,195 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:31:00,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:30:59" (1/2) ... [2018-09-23 19:31:00,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b118496 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 07:31:00, skipping insertion in model container [2018-09-23 19:31:00,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:31:00" (2/2) ... [2018-09-23 19:31:00,198 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-09-23 19:31:00,209 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:31:00,220 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-23 19:31:00,272 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:31:00,273 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:31:00,273 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:31:00,273 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:31:00,273 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:31:00,273 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:31:00,274 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:31:00,274 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:31:00,274 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:31:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-23 19:31:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-23 19:31:00,305 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:00,306 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:00,307 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:00,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:00,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-23 19:31:00,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:00,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:00,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:00,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:00,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:00,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:00,679 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:00,680 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:31:00,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-23 19:31:00,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-23 19:31:00,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-23 19:31:00,699 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-23 19:31:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:02,704 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-23 19:31:02,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 19:31:02,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-23 19:31:02,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:02,724 INFO L225 Difference]: With dead ends: 163 [2018-09-23 19:31:02,724 INFO L226 Difference]: Without dead ends: 158 [2018-09-23 19:31:02,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:02,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-23 19:31:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-23 19:31:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-23 19:31:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-23 19:31:02,786 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-23 19:31:02,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:02,786 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-23 19:31:02,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-23 19:31:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-23 19:31:02,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-23 19:31:02,788 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:02,788 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:02,789 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:02,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:02,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-23 19:31:02,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:02,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:02,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:02,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:02,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:02,900 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:02,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:31:02,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-23 19:31:02,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-23 19:31:02,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-23 19:31:02,904 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-23 19:31:03,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:03,779 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-23 19:31:03,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 19:31:03,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-23 19:31:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:03,783 INFO L225 Difference]: With dead ends: 188 [2018-09-23 19:31:03,783 INFO L226 Difference]: Without dead ends: 183 [2018-09-23 19:31:03,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:03,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-23 19:31:03,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-23 19:31:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-23 19:31:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-23 19:31:03,817 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-23 19:31:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:03,817 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-23 19:31:03,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-23 19:31:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-23 19:31:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:31:03,820 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:03,821 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:03,822 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:03,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-23 19:31:03,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:03,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:03,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:03,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:03,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:03,949 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:03,949 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:31:03,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:31:03,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:31:03,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:31:03,950 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-23 19:31:05,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:05,665 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-09-23 19:31:05,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:31:05,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-23 19:31:05,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:05,672 INFO L225 Difference]: With dead ends: 361 [2018-09-23 19:31:05,672 INFO L226 Difference]: Without dead ends: 349 [2018-09-23 19:31:05,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:31:05,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-23 19:31:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-09-23 19:31:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-23 19:31:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-09-23 19:31:05,713 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-09-23 19:31:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:05,714 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-09-23 19:31:05,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:31:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-09-23 19:31:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:31:05,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:05,716 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:05,716 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:05,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:05,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-23 19:31:05,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:05,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:05,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:05,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:05,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:05,818 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:05,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:31:05,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:31:05,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:31:05,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:31:05,819 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-09-23 19:31:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:07,036 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-09-23 19:31:07,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-23 19:31:07,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-23 19:31:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:07,042 INFO L225 Difference]: With dead ends: 307 [2018-09-23 19:31:07,042 INFO L226 Difference]: Without dead ends: 302 [2018-09-23 19:31:07,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-09-23 19:31:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-23 19:31:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-09-23 19:31:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-23 19:31:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-23 19:31:07,083 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-23 19:31:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:07,083 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-23 19:31:07,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:31:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-23 19:31:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:07,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:07,086 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:07,087 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:07,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:07,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-23 19:31:07,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:07,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:07,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:07,179 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:07,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:07,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:07,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:07,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:07,181 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-09-23 19:31:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:12,595 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-09-23 19:31:12,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-23 19:31:12,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:31:12,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:12,602 INFO L225 Difference]: With dead ends: 741 [2018-09-23 19:31:12,603 INFO L226 Difference]: Without dead ends: 733 [2018-09-23 19:31:12,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-09-23 19:31:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-09-23 19:31:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-09-23 19:31:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-23 19:31:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-09-23 19:31:12,657 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-09-23 19:31:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:12,657 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-09-23 19:31:12,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-09-23 19:31:12,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:12,659 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:12,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:12,660 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:12,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:12,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-23 19:31:12,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:12,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:12,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:12,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:12,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:12,846 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:12,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:12,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:12,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:12,848 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-09-23 19:31:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:17,161 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-09-23 19:31:17,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-23 19:31:17,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:31:17,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:17,170 INFO L225 Difference]: With dead ends: 797 [2018-09-23 19:31:17,170 INFO L226 Difference]: Without dead ends: 789 [2018-09-23 19:31:17,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-09-23 19:31:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-23 19:31:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-09-23 19:31:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-23 19:31:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-09-23 19:31:17,237 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-09-23 19:31:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:17,237 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-09-23 19:31:17,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-09-23 19:31:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:17,239 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:17,239 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:17,239 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:17,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:17,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-23 19:31:17,240 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:17,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:17,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:17,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:17,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:17,327 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:17,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:17,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:17,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:17,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:17,329 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-09-23 19:31:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:19,310 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-09-23 19:31:19,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 19:31:19,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:31:19,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:19,316 INFO L225 Difference]: With dead ends: 684 [2018-09-23 19:31:19,316 INFO L226 Difference]: Without dead ends: 676 [2018-09-23 19:31:19,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-09-23 19:31:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-09-23 19:31:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-09-23 19:31:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-09-23 19:31:19,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-09-23 19:31:19,372 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-09-23 19:31:19,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:19,373 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-09-23 19:31:19,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:19,373 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-09-23 19:31:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:19,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:19,374 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:19,375 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:19,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:19,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-23 19:31:19,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:19,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:19,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:19,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:19,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:19,494 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:19,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:19,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:19,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:19,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:19,495 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-09-23 19:31:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:21,000 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-09-23 19:31:21,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:31:21,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:31:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:21,005 INFO L225 Difference]: With dead ends: 605 [2018-09-23 19:31:21,005 INFO L226 Difference]: Without dead ends: 597 [2018-09-23 19:31:21,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:31:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-09-23 19:31:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-09-23 19:31:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-23 19:31:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-09-23 19:31:21,077 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-09-23 19:31:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:21,078 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-09-23 19:31:21,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-09-23 19:31:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:21,079 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:21,079 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:21,080 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:21,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:21,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-09-23 19:31:21,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:21,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:21,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:21,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:21,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:21,338 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:21,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:21,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:21,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:21,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:21,339 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-09-23 19:31:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:23,407 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-09-23 19:31:23,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 19:31:23,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:31:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:23,415 INFO L225 Difference]: With dead ends: 935 [2018-09-23 19:31:23,415 INFO L226 Difference]: Without dead ends: 927 [2018-09-23 19:31:23,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:31:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-09-23 19:31:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-09-23 19:31:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-23 19:31:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-09-23 19:31:23,506 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-09-23 19:31:23,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:23,506 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-09-23 19:31:23,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-09-23 19:31:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:23,507 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:23,507 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:23,508 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:23,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:23,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-09-23 19:31:23,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:23,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:23,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:23,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:23,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:23,600 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:23,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:23,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:23,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:23,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:23,602 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-09-23 19:31:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:25,869 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-09-23 19:31:25,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 19:31:25,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:31:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:25,876 INFO L225 Difference]: With dead ends: 923 [2018-09-23 19:31:25,876 INFO L226 Difference]: Without dead ends: 915 [2018-09-23 19:31:25,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-09-23 19:31:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-23 19:31:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-09-23 19:31:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-23 19:31:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-09-23 19:31:25,975 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-09-23 19:31:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:25,975 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-09-23 19:31:25,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-09-23 19:31:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:25,976 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:25,976 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:25,977 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:25,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:25,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-09-23 19:31:25,977 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:25,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:25,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:25,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:25,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:26,070 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:26,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:26,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:26,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:26,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:26,072 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-09-23 19:31:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:27,721 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-09-23 19:31:27,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:31:27,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:31:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:27,727 INFO L225 Difference]: With dead ends: 837 [2018-09-23 19:31:27,728 INFO L226 Difference]: Without dead ends: 829 [2018-09-23 19:31:27,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:31:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-09-23 19:31:27,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-09-23 19:31:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-23 19:31:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-09-23 19:31:27,850 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-09-23 19:31:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:27,851 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-09-23 19:31:27,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-09-23 19:31:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:27,852 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:27,852 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:27,852 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:27,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:27,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-09-23 19:31:27,853 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:27,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:27,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:27,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:27,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:28,070 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:28,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:28,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:28,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:28,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:28,072 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-09-23 19:31:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:30,527 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-09-23 19:31:30,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-23 19:31:30,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:31:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:30,532 INFO L225 Difference]: With dead ends: 996 [2018-09-23 19:31:30,533 INFO L226 Difference]: Without dead ends: 988 [2018-09-23 19:31:30,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-09-23 19:31:30,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-09-23 19:31:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-09-23 19:31:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-23 19:31:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-23 19:31:30,659 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-23 19:31:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:30,661 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-23 19:31:30,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:30,661 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-23 19:31:30,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:30,662 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:30,662 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:30,662 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:30,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:30,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-09-23 19:31:30,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:30,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:30,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:30,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:30,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:30,789 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:30,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:30,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:30,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:30,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:30,790 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-23 19:31:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:32,786 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-09-23 19:31:32,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-23 19:31:32,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:31:32,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:32,792 INFO L225 Difference]: With dead ends: 913 [2018-09-23 19:31:32,792 INFO L226 Difference]: Without dead ends: 905 [2018-09-23 19:31:32,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:31:32,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-09-23 19:31:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-09-23 19:31:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-23 19:31:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-09-23 19:31:32,934 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-09-23 19:31:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:32,934 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-09-23 19:31:32,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-09-23 19:31:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:32,936 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:32,936 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:32,936 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:32,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:32,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-09-23 19:31:32,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:32,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:32,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:32,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:32,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:33,019 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:33,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:33,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:33,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:33,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:33,020 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-09-23 19:31:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:34,844 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-09-23 19:31:34,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 19:31:34,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:31:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:34,848 INFO L225 Difference]: With dead ends: 886 [2018-09-23 19:31:34,848 INFO L226 Difference]: Without dead ends: 878 [2018-09-23 19:31:34,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:31:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-09-23 19:31:34,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-09-23 19:31:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-09-23 19:31:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-09-23 19:31:34,960 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-09-23 19:31:34,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:34,960 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-09-23 19:31:34,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-09-23 19:31:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:34,961 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:34,961 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:34,961 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:34,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:34,962 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-23 19:31:34,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:34,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:34,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:34,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:34,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:35,048 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:35,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:35,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:35,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:35,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:35,049 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-09-23 19:31:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:37,131 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-09-23 19:31:37,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:31:37,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:37,137 INFO L225 Difference]: With dead ends: 801 [2018-09-23 19:31:37,137 INFO L226 Difference]: Without dead ends: 793 [2018-09-23 19:31:37,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:31:37,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-09-23 19:31:37,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-09-23 19:31:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-23 19:31:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-09-23 19:31:37,332 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-09-23 19:31:37,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:37,332 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-09-23 19:31:37,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-09-23 19:31:37,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:37,333 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:37,334 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:37,334 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:37,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:37,334 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-09-23 19:31:37,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:37,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:37,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:37,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:37,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:38,082 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:38,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:38,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:38,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:38,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:38,083 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-09-23 19:31:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:40,503 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-09-23 19:31:40,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 19:31:40,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:40,509 INFO L225 Difference]: With dead ends: 962 [2018-09-23 19:31:40,509 INFO L226 Difference]: Without dead ends: 954 [2018-09-23 19:31:40,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-23 19:31:40,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-23 19:31:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-09-23 19:31:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-23 19:31:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-09-23 19:31:40,670 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-09-23 19:31:40,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:40,671 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-09-23 19:31:40,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-09-23 19:31:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:40,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:40,672 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:40,672 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:40,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:40,673 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-23 19:31:40,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:40,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:40,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:40,764 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:40,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:40,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:40,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:40,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:40,765 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-09-23 19:31:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:43,233 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-09-23 19:31:43,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 19:31:43,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:43,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:43,239 INFO L225 Difference]: With dead ends: 1000 [2018-09-23 19:31:43,239 INFO L226 Difference]: Without dead ends: 992 [2018-09-23 19:31:43,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-23 19:31:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-09-23 19:31:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-09-23 19:31:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-09-23 19:31:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-09-23 19:31:43,422 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-09-23 19:31:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:43,423 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-09-23 19:31:43,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-09-23 19:31:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:43,424 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:43,424 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:43,424 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:43,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:43,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-09-23 19:31:43,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:43,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:43,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:43,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:43,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:43,532 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:43,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:43,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:43,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:43,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:43,533 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-09-23 19:31:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:46,426 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-09-23 19:31:46,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-23 19:31:46,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:46,432 INFO L225 Difference]: With dead ends: 1065 [2018-09-23 19:31:46,432 INFO L226 Difference]: Without dead ends: 1057 [2018-09-23 19:31:46,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 19:31:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-09-23 19:31:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-09-23 19:31:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-09-23 19:31:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-09-23 19:31:46,634 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-09-23 19:31:46,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:46,635 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-09-23 19:31:46,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-09-23 19:31:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:46,636 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:46,636 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:46,637 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:46,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:46,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-09-23 19:31:46,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:46,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:46,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:46,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:46,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:46,719 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:46,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:46,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:46,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:46,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:46,720 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-09-23 19:31:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:49,865 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-09-23 19:31:49,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-23 19:31:49,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:49,871 INFO L225 Difference]: With dead ends: 1227 [2018-09-23 19:31:49,871 INFO L226 Difference]: Without dead ends: 1219 [2018-09-23 19:31:49,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-09-23 19:31:49,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-09-23 19:31:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-09-23 19:31:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-09-23 19:31:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-09-23 19:31:50,119 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-09-23 19:31:50,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:50,119 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-09-23 19:31:50,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-09-23 19:31:50,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:50,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:50,120 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:50,120 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:50,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:50,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-23 19:31:50,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:50,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:50,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:50,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:50,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:50,208 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:50,208 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:50,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:50,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:50,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:50,209 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-09-23 19:31:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:53,125 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-09-23 19:31:53,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-23 19:31:53,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:53,130 INFO L225 Difference]: With dead ends: 1076 [2018-09-23 19:31:53,130 INFO L226 Difference]: Without dead ends: 1068 [2018-09-23 19:31:53,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 19:31:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-09-23 19:31:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-09-23 19:31:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-23 19:31:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-09-23 19:31:53,356 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-09-23 19:31:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:53,356 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-09-23 19:31:53,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-09-23 19:31:53,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:53,357 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:53,357 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:53,357 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:53,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:53,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-09-23 19:31:53,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:53,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:53,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:53,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:53,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:53,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-09-23 19:31:53,453 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:53,453 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:53,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:53,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:53,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:53,454 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-09-23 19:31:56,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:56,094 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-09-23 19:31:56,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 19:31:56,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:56,099 INFO L225 Difference]: With dead ends: 1111 [2018-09-23 19:31:56,099 INFO L226 Difference]: Without dead ends: 1103 [2018-09-23 19:31:56,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:31:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-09-23 19:31:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-09-23 19:31:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-23 19:31:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-09-23 19:31:56,411 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-09-23 19:31:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:56,411 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-09-23 19:31:56,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-09-23 19:31:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:56,412 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:56,412 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:56,412 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:56,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:56,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-09-23 19:31:56,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:56,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:56,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:56,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:56,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:56,519 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:56,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:56,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:56,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:56,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:56,520 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-09-23 19:32:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:00,060 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-09-23 19:32:00,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-23 19:32:00,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:32:00,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:00,067 INFO L225 Difference]: With dead ends: 1304 [2018-09-23 19:32:00,067 INFO L226 Difference]: Without dead ends: 1296 [2018-09-23 19:32:00,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-09-23 19:32:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-23 19:32:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-09-23 19:32:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-23 19:32:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-09-23 19:32:00,384 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-09-23 19:32:00,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:00,384 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-09-23 19:32:00,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:32:00,384 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-09-23 19:32:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:32:00,385 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:00,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:00,385 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:00,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:00,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-09-23 19:32:00,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:00,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:00,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:00,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:00,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:00,465 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:00,465 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:32:00,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:32:00,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:32:00,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:32:00,466 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-09-23 19:32:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:04,578 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-09-23 19:32:04,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 19:32:04,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:32:04,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:04,594 INFO L225 Difference]: With dead ends: 1370 [2018-09-23 19:32:04,595 INFO L226 Difference]: Without dead ends: 1362 [2018-09-23 19:32:04,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-09-23 19:32:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-09-23 19:32:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-09-23 19:32:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-23 19:32:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-09-23 19:32:04,901 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-09-23 19:32:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:04,902 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-09-23 19:32:04,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:32:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-09-23 19:32:04,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:32:04,903 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:04,903 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:04,903 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:04,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:04,904 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-23 19:32:04,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:04,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:04,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:04,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:04,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:04,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:04,983 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:04,984 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:32:04,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:32:04,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:32:04,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:32:04,985 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-09-23 19:32:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:08,018 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-09-23 19:32:08,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:32:08,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:32:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:08,022 INFO L225 Difference]: With dead ends: 1298 [2018-09-23 19:32:08,023 INFO L226 Difference]: Without dead ends: 1290 [2018-09-23 19:32:08,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-09-23 19:32:08,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-09-23 19:32:08,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-09-23 19:32:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-23 19:32:08,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-23 19:32:08,445 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-23 19:32:08,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:08,445 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-23 19:32:08,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:32:08,445 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-23 19:32:08,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-23 19:32:08,446 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:08,446 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:08,446 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:08,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:08,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-09-23 19:32:08,447 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:08,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:08,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:08,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:08,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:08,505 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:08,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:32:08,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 19:32:08,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 19:32:08,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:32:08,506 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-23 19:32:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:09,499 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-09-23 19:32:09,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 19:32:09,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-23 19:32:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:09,502 INFO L225 Difference]: With dead ends: 1242 [2018-09-23 19:32:09,502 INFO L226 Difference]: Without dead ends: 673 [2018-09-23 19:32:09,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:32:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-09-23 19:32:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-09-23 19:32:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-09-23 19:32:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-09-23 19:32:09,932 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-09-23 19:32:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:09,932 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-09-23 19:32:09,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 19:32:09,932 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-09-23 19:32:09,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-23 19:32:09,933 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:09,933 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:09,934 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:09,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:09,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-09-23 19:32:09,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:09,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:09,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:09,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:09,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:10,041 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:10,041 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:32:10,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:10,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:11,207 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:11,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-23 19:32:11,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 19:32:11,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 19:32:11,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:32:11,208 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-09-23 19:32:15,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:15,351 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-09-23 19:32:15,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:32:15,352 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-23 19:32:15,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:15,354 INFO L225 Difference]: With dead ends: 854 [2018-09-23 19:32:15,354 INFO L226 Difference]: Without dead ends: 849 [2018-09-23 19:32:15,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-09-23 19:32:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-09-23 19:32:16,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-09-23 19:32:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-23 19:32:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-09-23 19:32:16,346 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-09-23 19:32:16,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:16,346 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-09-23 19:32:16,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 19:32:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-09-23 19:32:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-23 19:32:16,348 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:16,348 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:16,348 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:16,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:16,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-09-23 19:32:16,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:16,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:16,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:16,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:16,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:16,399 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:16,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:32:16,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 19:32:16,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 19:32:16,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:32:16,400 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-09-23 19:32:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:17,413 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-09-23 19:32:17,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 19:32:17,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-23 19:32:17,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:17,415 INFO L225 Difference]: With dead ends: 1308 [2018-09-23 19:32:17,416 INFO L226 Difference]: Without dead ends: 709 [2018-09-23 19:32:17,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:32:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-09-23 19:32:18,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-09-23 19:32:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-23 19:32:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-23 19:32:18,077 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-23 19:32:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:18,077 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-23 19:32:18,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 19:32:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-23 19:32:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:32:18,079 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:18,079 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:18,079 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:18,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-09-23 19:32:18,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:18,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:18,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:18,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:18,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:18,234 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:18,234 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:32:18,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:18,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:18,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:18,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 19:32:18,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 19:32:18,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 19:32:18,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:32:18,451 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-09-23 19:32:26,209 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-23 19:32:28,951 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-23 19:32:31,253 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-23 19:32:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:34,641 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-09-23 19:32:34,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-23 19:32:34,642 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 19:32:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:34,645 INFO L225 Difference]: With dead ends: 2011 [2018-09-23 19:32:34,645 INFO L226 Difference]: Without dead ends: 2003 [2018-09-23 19:32:34,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9561 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3074, Invalid=22366, Unknown=0, NotChecked=0, Total=25440 [2018-09-23 19:32:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-09-23 19:32:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-09-23 19:32:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-09-23 19:32:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-09-23 19:32:35,812 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-09-23 19:32:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:35,812 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-09-23 19:32:35,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 19:32:35,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-09-23 19:32:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:32:35,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:35,813 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:35,814 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:35,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:35,814 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-09-23 19:32:35,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:35,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:35,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:35,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:35,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:35,905 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:35,905 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:32:35,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:35,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:36,125 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:36,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 19:32:36,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 19:32:36,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 19:32:36,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:32:36,126 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states. [2018-09-23 19:32:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:49,340 INFO L93 Difference]: Finished difference Result 2797 states and 6168 transitions. [2018-09-23 19:32:49,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-23 19:32:49,341 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 19:32:49,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:49,348 INFO L225 Difference]: With dead ends: 2797 [2018-09-23 19:32:49,348 INFO L226 Difference]: Without dead ends: 2789 [2018-09-23 19:32:49,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6171 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2430, Invalid=14862, Unknown=0, NotChecked=0, Total=17292 [2018-09-23 19:32:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2018-09-23 19:32:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1186. [2018-09-23 19:32:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-09-23 19:32:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2705 transitions. [2018-09-23 19:32:50,580 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2705 transitions. Word has length 16 [2018-09-23 19:32:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:50,580 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 2705 transitions. [2018-09-23 19:32:50,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 19:32:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2705 transitions. [2018-09-23 19:32:50,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:32:50,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:50,581 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:50,582 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:50,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:50,582 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-09-23 19:32:50,582 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:50,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:50,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:50,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:50,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:50,721 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:50,721 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:32:50,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:50,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:51,036 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:51,036 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 19:32:51,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 19:32:51,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 19:32:51,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:32:51,037 INFO L87 Difference]: Start difference. First operand 1186 states and 2705 transitions. Second operand 17 states. [2018-09-23 19:33:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:02,984 INFO L93 Difference]: Finished difference Result 2492 states and 5544 transitions. [2018-09-23 19:33:02,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-23 19:33:02,985 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 19:33:02,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:02,991 INFO L225 Difference]: With dead ends: 2492 [2018-09-23 19:33:02,991 INFO L226 Difference]: Without dead ends: 2484 [2018-09-23 19:33:02,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4610 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1718, Invalid=11392, Unknown=0, NotChecked=0, Total=13110 [2018-09-23 19:33:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2018-09-23 19:33:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1219. [2018-09-23 19:33:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-09-23 19:33:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2792 transitions. [2018-09-23 19:33:04,725 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2792 transitions. Word has length 16 [2018-09-23 19:33:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:04,725 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2792 transitions. [2018-09-23 19:33:04,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 19:33:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2792 transitions. [2018-09-23 19:33:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:33:04,726 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:04,726 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:04,727 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:04,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:04,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-09-23 19:33:04,727 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:04,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:04,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:04,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:04,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:04,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:04,874 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:04,874 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-09-23 19:33:04,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:33:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:04,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:05,105 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-23 19:33:05,105 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-09-23 19:33:05,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 19:33:05,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 19:33:05,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:33:05,106 INFO L87 Difference]: Start difference. First operand 1219 states and 2792 transitions. Second operand 17 states. [2018-09-23 19:33:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:21,948 INFO L93 Difference]: Finished difference Result 3178 states and 7226 transitions. [2018-09-23 19:33:21,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-23 19:33:21,948 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 19:33:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:21,956 INFO L225 Difference]: With dead ends: 3178 [2018-09-23 19:33:21,957 INFO L226 Difference]: Without dead ends: 3170 [2018-09-23 19:33:21,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9560 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2932, Invalid=21248, Unknown=0, NotChecked=0, Total=24180 [2018-09-23 19:33:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2018-09-23 19:33:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 1242. [2018-09-23 19:33:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2018-09-23 19:33:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2857 transitions. [2018-09-23 19:33:23,445 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 2857 transitions. Word has length 16 [2018-09-23 19:33:23,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:23,445 INFO L480 AbstractCegarLoop]: Abstraction has 1242 states and 2857 transitions. [2018-09-23 19:33:23,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 19:33:23,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2857 transitions. [2018-09-23 19:33:23,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:33:23,446 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:23,446 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:23,446 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:23,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:23,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-09-23 19:33:23,447 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:23,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:23,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:23,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:23,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:23,524 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:23,524 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:33:23,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:23,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:23,700 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-23 19:33:23,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-09-23 19:33:23,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 19:33:23,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 19:33:23,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:33:23,701 INFO L87 Difference]: Start difference. First operand 1242 states and 2857 transitions. Second operand 17 states. [2018-09-23 19:33:37,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:37,289 INFO L93 Difference]: Finished difference Result 2638 states and 5927 transitions. [2018-09-23 19:33:37,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-23 19:33:37,289 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 19:33:37,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:37,295 INFO L225 Difference]: With dead ends: 2638 [2018-09-23 19:33:37,295 INFO L226 Difference]: Without dead ends: 2630 [2018-09-23 19:33:37,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5685 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1807, Invalid=13199, Unknown=0, NotChecked=0, Total=15006 [2018-09-23 19:33:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2018-09-23 19:33:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1469. [2018-09-23 19:33:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-09-23 19:33:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3433 transitions. [2018-09-23 19:33:38,953 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3433 transitions. Word has length 16 [2018-09-23 19:33:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:38,953 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 3433 transitions. [2018-09-23 19:33:38,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 19:33:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3433 transitions. [2018-09-23 19:33:38,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:33:38,954 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:38,954 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:38,955 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:38,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:38,955 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-09-23 19:33:38,955 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:38,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:38,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:38,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:38,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:39,187 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:39,187 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:33:39,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:39,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:39,381 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:33:39,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 19:33:39,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 19:33:39,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 19:33:39,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:33:39,382 INFO L87 Difference]: Start difference. First operand 1469 states and 3433 transitions. Second operand 17 states. [2018-09-23 19:33:52,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:52,937 INFO L93 Difference]: Finished difference Result 2854 states and 6510 transitions. [2018-09-23 19:33:52,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-23 19:33:52,938 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 19:33:52,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:52,941 INFO L225 Difference]: With dead ends: 2854 [2018-09-23 19:33:52,941 INFO L226 Difference]: Without dead ends: 2846 [2018-09-23 19:33:52,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1456, Invalid=7664, Unknown=0, NotChecked=0, Total=9120 [2018-09-23 19:33:52,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2018-09-23 19:33:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 1479. [2018-09-23 19:33:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1479 states. [2018-09-23 19:33:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3457 transitions. [2018-09-23 19:33:54,599 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3457 transitions. Word has length 16 [2018-09-23 19:33:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:54,599 INFO L480 AbstractCegarLoop]: Abstraction has 1479 states and 3457 transitions. [2018-09-23 19:33:54,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 19:33:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3457 transitions. [2018-09-23 19:33:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:33:54,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:54,600 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:54,601 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:54,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:54,601 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-09-23 19:33:54,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:54,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:54,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:54,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:54,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:55,116 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:55,116 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:33:55,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:55,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:55,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:55,309 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:33:55,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 19:33:55,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 19:33:55,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 19:33:55,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:33:55,311 INFO L87 Difference]: Start difference. First operand 1479 states and 3457 transitions. Second operand 17 states. [2018-09-23 19:34:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:10,737 INFO L93 Difference]: Finished difference Result 3363 states and 7697 transitions. [2018-09-23 19:34:10,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-23 19:34:10,738 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 19:34:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:10,741 INFO L225 Difference]: With dead ends: 3363 [2018-09-23 19:34:10,741 INFO L226 Difference]: Without dead ends: 3355 [2018-09-23 19:34:10,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3712 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1635, Invalid=9495, Unknown=0, NotChecked=0, Total=11130 [2018-09-23 19:34:10,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2018-09-23 19:34:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 1535. [2018-09-23 19:34:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-09-23 19:34:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 3580 transitions. [2018-09-23 19:34:12,478 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 3580 transitions. Word has length 16 [2018-09-23 19:34:12,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:12,478 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 3580 transitions. [2018-09-23 19:34:12,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 19:34:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 3580 transitions. [2018-09-23 19:34:12,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:34:12,479 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:12,479 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:12,480 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:12,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:12,480 INFO L82 PathProgramCache]: Analyzing trace with hash 723989304, now seen corresponding path program 1 times [2018-09-23 19:34:12,480 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:12,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:12,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:12,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:12,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:13,293 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:13,293 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:34:13,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:13,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:13,494 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:13,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-09-23 19:34:13,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-23 19:34:13,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-23 19:34:13,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:34:13,495 INFO L87 Difference]: Start difference. First operand 1535 states and 3580 transitions. Second operand 18 states. [2018-09-23 19:34:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:30,499 INFO L93 Difference]: Finished difference Result 2910 states and 6684 transitions. [2018-09-23 19:34:30,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-23 19:34:30,500 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-09-23 19:34:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:30,503 INFO L225 Difference]: With dead ends: 2910 [2018-09-23 19:34:30,503 INFO L226 Difference]: Without dead ends: 2902 [2018-09-23 19:34:30,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3369 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1407, Invalid=8693, Unknown=0, NotChecked=0, Total=10100 [2018-09-23 19:34:30,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2018-09-23 19:34:31,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1226. [2018-09-23 19:34:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-09-23 19:34:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 2816 transitions. [2018-09-23 19:34:31,962 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 2816 transitions. Word has length 16 [2018-09-23 19:34:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:31,962 INFO L480 AbstractCegarLoop]: Abstraction has 1226 states and 2816 transitions. [2018-09-23 19:34:31,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-23 19:34:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 2816 transitions. [2018-09-23 19:34:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:34:31,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:31,963 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:31,964 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:31,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:31,964 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times [2018-09-23 19:34:31,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:31,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:31,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:31,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:31,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:32,064 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:32,064 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:34:32,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:32,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:32,282 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:32,282 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 19:34:32,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 19:34:32,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 19:34:32,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:34:32,283 INFO L87 Difference]: Start difference. First operand 1226 states and 2816 transitions. Second operand 17 states. [2018-09-23 19:34:46,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:46,330 INFO L93 Difference]: Finished difference Result 2474 states and 5593 transitions. [2018-09-23 19:34:46,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-23 19:34:46,330 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 19:34:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:46,333 INFO L225 Difference]: With dead ends: 2474 [2018-09-23 19:34:46,333 INFO L226 Difference]: Without dead ends: 2466 [2018-09-23 19:34:46,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2722 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1240, Invalid=6950, Unknown=0, NotChecked=0, Total=8190 [2018-09-23 19:34:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2018-09-23 19:34:47,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1069. [2018-09-23 19:34:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-09-23 19:34:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2444 transitions. [2018-09-23 19:34:47,681 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2444 transitions. Word has length 16 [2018-09-23 19:34:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:47,681 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 2444 transitions. [2018-09-23 19:34:47,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 19:34:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2444 transitions. [2018-09-23 19:34:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:34:47,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:47,682 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:47,682 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:47,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:47,683 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-09-23 19:34:47,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:47,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:47,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:47,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:47,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:34:47,753 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:47,753 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:34:47,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:47,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:34:47,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:47,795 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 19:34:47,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:34:47,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:34:47,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:34:47,796 INFO L87 Difference]: Start difference. First operand 1069 states and 2444 transitions. Second operand 8 states. [2018-09-23 19:34:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:51,347 INFO L93 Difference]: Finished difference Result 1522 states and 3375 transitions. [2018-09-23 19:34:51,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-23 19:34:51,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 19:34:51,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:51,350 INFO L225 Difference]: With dead ends: 1522 [2018-09-23 19:34:51,350 INFO L226 Difference]: Without dead ends: 1514 [2018-09-23 19:34:51,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-23 19:34:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-09-23 19:34:52,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1225. [2018-09-23 19:34:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-09-23 19:34:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2809 transitions. [2018-09-23 19:34:52,978 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2809 transitions. Word has length 16 [2018-09-23 19:34:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:52,978 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 2809 transitions. [2018-09-23 19:34:52,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:34:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2809 transitions. [2018-09-23 19:34:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:34:52,979 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:52,979 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:52,979 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:52,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:52,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-09-23 19:34:52,980 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:52,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:52,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:52,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:52,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:53,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:34:53,114 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:53,114 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:34:53,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:53,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:34:53,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:53,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 19:34:53,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:34:53,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:34:53,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:34:53,179 INFO L87 Difference]: Start difference. First operand 1225 states and 2809 transitions. Second operand 8 states. [2018-09-23 19:34:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:57,257 INFO L93 Difference]: Finished difference Result 1661 states and 3674 transitions. [2018-09-23 19:34:57,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 19:34:57,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 19:34:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:57,259 INFO L225 Difference]: With dead ends: 1661 [2018-09-23 19:34:57,259 INFO L226 Difference]: Without dead ends: 1653 [2018-09-23 19:34:57,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:34:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-09-23 19:34:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1237. [2018-09-23 19:34:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2018-09-23 19:34:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2833 transitions. [2018-09-23 19:34:58,801 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2833 transitions. Word has length 16 [2018-09-23 19:34:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:58,801 INFO L480 AbstractCegarLoop]: Abstraction has 1237 states and 2833 transitions. [2018-09-23 19:34:58,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:34:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2833 transitions. [2018-09-23 19:34:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:34:58,801 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:58,802 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:58,802 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:58,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:58,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-09-23 19:34:58,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:58,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:58,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:34:58,896 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:58,896 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:34:58,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:58,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:34:58,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:58,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 19:34:58,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:34:58,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:34:58,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:34:58,937 INFO L87 Difference]: Start difference. First operand 1237 states and 2833 transitions. Second operand 8 states. [2018-09-23 19:35:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:35:03,621 INFO L93 Difference]: Finished difference Result 1772 states and 3936 transitions. [2018-09-23 19:35:03,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 19:35:03,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 19:35:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:35:03,623 INFO L225 Difference]: With dead ends: 1772 [2018-09-23 19:35:03,623 INFO L226 Difference]: Without dead ends: 1764 [2018-09-23 19:35:03,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:35:03,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-09-23 19:35:05,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1318. [2018-09-23 19:35:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2018-09-23 19:35:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 3019 transitions. [2018-09-23 19:35:05,161 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 3019 transitions. Word has length 16 [2018-09-23 19:35:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:35:05,161 INFO L480 AbstractCegarLoop]: Abstraction has 1318 states and 3019 transitions. [2018-09-23 19:35:05,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:35:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 3019 transitions. [2018-09-23 19:35:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:35:05,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:35:05,162 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:35:05,162 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:35:05,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:35:05,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-09-23 19:35:05,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:35:05,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:35:05,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:05,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:35:05,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:35:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:35:05,281 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:35:05,281 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:35:05,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:35:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:35:05,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:35:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:35:05,318 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:35:05,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 19:35:05,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:35:05,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:35:05,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:35:05,319 INFO L87 Difference]: Start difference. First operand 1318 states and 3019 transitions. Second operand 8 states. [2018-09-23 19:35:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:35:09,471 INFO L93 Difference]: Finished difference Result 1789 states and 3956 transitions. [2018-09-23 19:35:09,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:35:09,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 19:35:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:35:09,473 INFO L225 Difference]: With dead ends: 1789 [2018-09-23 19:35:09,473 INFO L226 Difference]: Without dead ends: 1781 [2018-09-23 19:35:09,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:35:09,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2018-09-23 19:35:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1345. [2018-09-23 19:35:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-09-23 19:35:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 3076 transitions. [2018-09-23 19:35:11,087 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 3076 transitions. Word has length 16 [2018-09-23 19:35:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:35:11,087 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 3076 transitions. [2018-09-23 19:35:11,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:35:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 3076 transitions. [2018-09-23 19:35:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:35:11,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:35:11,088 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:35:11,088 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:35:11,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:35:11,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1133347051, now seen corresponding path program 1 times [2018-09-23 19:35:11,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:35:11,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:35:11,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:11,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:35:11,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:35:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:35:11,226 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:35:11,226 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:35:11,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:35:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:35:11,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:35:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:35:11,265 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:35:11,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 19:35:11,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:35:11,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:35:11,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:35:11,266 INFO L87 Difference]: Start difference. First operand 1345 states and 3076 transitions. Second operand 8 states. Received shutdown request... [2018-09-23 19:35:13,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:35:13,550 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-23 19:35:13,557 WARN L206 ceAbstractionStarter]: Timeout [2018-09-23 19:35:13,557 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 07:35:13 BoogieIcfgContainer [2018-09-23 19:35:13,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:35:13,558 INFO L168 Benchmark]: Toolchain (without parser) took 254478.75 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 405.3 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -50.0 MB). Peak memory consumption was 355.3 MB. Max. memory is 7.1 GB. [2018-09-23 19:35:13,561 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:35:13,562 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:35:13,562 INFO L168 Benchmark]: Boogie Preprocessor took 35.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:35:13,563 INFO L168 Benchmark]: RCFGBuilder took 1006.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-23 19:35:13,563 INFO L168 Benchmark]: TraceAbstraction took 253366.45 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 405.3 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -81.7 MB). Peak memory consumption was 323.6 MB. Max. memory is 7.1 GB. [2018-09-23 19:35:13,566 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1006.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253366.45 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 405.3 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -81.7 MB). Peak memory consumption was 323.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 253.2s OverallTime, 41 OverallIterations, 2 TraceHistogramMax, 217.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12237 SDtfs, 40977 SDslu, 49021 SDs, 0 SdLazy, 118875 SolverSat, 8856 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 107.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2035 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 1719 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 51529 ImplicationChecksByTransitivity, 40.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1535occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 25.4s AutomataMinimizationTime, 40 MinimizatonAttempts, 26535 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 772 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 716 ConstructedInterpolants, 78 QuantifiedInterpolants, 46500 SizeOfPredicates, 88 NumberOfNonLiveVariables, 595 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 56 InterpolantComputations, 28 PerfectInterpolantSequences, 40/83 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_19-35-13-579.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-35-13-579.csv Completed graceful shutdown