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_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:08:10,769 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:08:10,771 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:08:10,790 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:08:10,791 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:08:10,792 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:08:10,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:08:10,796 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:08:10,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:08:10,800 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:08:10,802 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:08:10,804 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:08:10,805 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:08:10,806 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:08:10,808 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:08:10,808 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:08:10,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:08:10,816 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:08:10,823 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:08:10,828 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:08:10,832 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:08:10,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:08:10,838 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:08:10,838 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:08:10,838 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:08:10,839 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:08:10,841 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:08:10,842 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:08:10,843 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:08:10,844 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:08:10,844 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:08:10,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:08:10,848 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:08:10,848 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:08:10,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:08:10,852 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:08:10,853 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-10-04 09:08:10,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:08:10,881 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:08:10,883 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:08:10,883 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:08:10,884 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:08:10,884 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:08:10,884 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:08:10,884 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:08:10,884 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:08:10,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:08:10,886 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:08:10,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:08:10,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:08:10,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:08:10,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:08:10,887 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:08:10,887 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:08:10,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:08:10,887 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:08:10,888 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:08:10,889 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:08:10,889 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:08:10,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:08:10,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:08:10,890 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:08:10,890 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:08:10,890 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:08:10,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:08:10,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:08:10,891 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:08:10,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:08:10,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:08:10,975 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:08:10,977 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:08:10,978 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:08:10,979 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl [2018-10-04 09:08:10,979 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-10-04 09:08:11,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:08:11,085 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:08:11,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:08:11,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:08:11,086 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:08:11,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:08:11" (1/1) ... [2018-10-04 09:08:11,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:08:11" (1/1) ... [2018-10-04 09:08:11,127 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 09:08:11,127 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 09:08:11,127 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 09:08:11,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:08:11,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:08:11,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:08:11,130 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:08:11,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:08:11" (1/1) ... [2018-10-04 09:08:11,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:08:11" (1/1) ... [2018-10-04 09:08:11,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:08:11" (1/1) ... [2018-10-04 09:08:11,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:08:11" (1/1) ... [2018-10-04 09:08:11,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:08:11" (1/1) ... [2018-10-04 09:08:11,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:08:11" (1/1) ... [2018-10-04 09:08:11,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:08:11" (1/1) ... [2018-10-04 09:08:11,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:08:11,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:08:11,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:08:11,178 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:08:11,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:08:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:08:11,253 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 09:08:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 09:08:11,254 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 09:08:12,003 INFO L338 CfgBuilder]: Using library mode [2018-10-04 09:08:12,004 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:08:12 BoogieIcfgContainer [2018-10-04 09:08:12,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:08:12,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:08:12,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:08:12,008 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:08:12,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:08:11" (1/2) ... [2018-10-04 09:08:12,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18317aeb and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:08:12, skipping insertion in model container [2018-10-04 09:08:12,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:08:12" (2/2) ... [2018-10-04 09:08:12,011 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-10-04 09:08:12,021 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:08:12,029 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-10-04 09:08:12,082 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:08:12,083 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:08:12,083 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:08:12,083 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:08:12,083 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:08:12,083 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:08:12,084 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:08:12,084 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:08:12,084 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:08:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-10-04 09:08:12,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:08:12,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:12,118 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:12,119 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:12,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:12,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-10-04 09:08:12,128 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:12,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:12,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:12,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:12,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:12,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:12,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:08:12,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:08:12,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:08:12,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-04 09:08:12,469 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-10-04 09:08:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:14,238 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-10-04 09:08:14,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:08:14,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 09:08:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:14,257 INFO L225 Difference]: With dead ends: 163 [2018-10-04 09:08:14,257 INFO L226 Difference]: Without dead ends: 158 [2018-10-04 09:08:14,261 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-10-04 09:08:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-04 09:08:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-10-04 09:08:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-04 09:08:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-10-04 09:08:14,320 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-10-04 09:08:14,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:14,321 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-10-04 09:08:14,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:08:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-10-04 09:08:14,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:08:14,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:14,323 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:14,324 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:14,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:14,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-10-04 09:08:14,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:14,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:14,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:14,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:14,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:14,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:14,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:08:14,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:08:14,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:08:14,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-04 09:08:14,455 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-10-04 09:08:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:15,283 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-10-04 09:08:15,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:08:15,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 09:08:15,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:15,288 INFO L225 Difference]: With dead ends: 188 [2018-10-04 09:08:15,289 INFO L226 Difference]: Without dead ends: 183 [2018-10-04 09:08:15,290 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-10-04 09:08:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-04 09:08:15,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-10-04 09:08:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-04 09:08:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-10-04 09:08:15,314 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-10-04 09:08:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:15,314 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-10-04 09:08:15,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:08:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-10-04 09:08:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:08:15,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:15,318 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:15,319 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:15,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:15,319 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-10-04 09:08:15,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:15,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:15,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:15,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:15,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:15,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:15,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:08:15,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:08:15,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:08:15,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:08:15,411 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-10-04 09:08:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:16,937 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-10-04 09:08:16,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:08:16,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-04 09:08:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:16,942 INFO L225 Difference]: With dead ends: 283 [2018-10-04 09:08:16,942 INFO L226 Difference]: Without dead ends: 278 [2018-10-04 09:08:16,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-04 09:08:16,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-04 09:08:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-10-04 09:08:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-04 09:08:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-10-04 09:08:16,974 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-10-04 09:08:16,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:16,975 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-10-04 09:08:16,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:08:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-10-04 09:08:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:08:16,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:16,977 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:16,977 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:16,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:16,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-10-04 09:08:16,978 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:16,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:16,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:16,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:16,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:17,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:17,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:08:17,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:08:17,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:08:17,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:08:17,181 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-10-04 09:08:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:18,959 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-10-04 09:08:18,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:08:18,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-04 09:08:18,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:18,966 INFO L225 Difference]: With dead ends: 387 [2018-10-04 09:08:18,966 INFO L226 Difference]: Without dead ends: 375 [2018-10-04 09:08:18,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-04 09:08:18,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-04 09:08:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-10-04 09:08:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-04 09:08:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-10-04 09:08:19,010 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-10-04 09:08:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:19,011 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-10-04 09:08:19,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:08:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-10-04 09:08:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:08:19,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:19,014 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:19,014 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:19,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:19,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-10-04 09:08:19,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:19,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:19,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:19,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:19,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:19,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:19,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:08:19,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:08:19,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:08:19,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:08:19,423 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-10-04 09:08:20,832 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 09:08:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:24,356 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-10-04 09:08:24,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:08:24,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:08:24,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:24,363 INFO L225 Difference]: With dead ends: 725 [2018-10-04 09:08:24,363 INFO L226 Difference]: Without dead ends: 717 [2018-10-04 09:08:24,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-10-04 09:08:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-04 09:08:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-10-04 09:08:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-04 09:08:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-10-04 09:08:24,430 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-10-04 09:08:24,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:24,430 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-10-04 09:08:24,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:08:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-10-04 09:08:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:08:24,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:24,432 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:24,433 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:24,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:24,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-10-04 09:08:24,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:24,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:24,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:24,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:24,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:24,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:24,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:08:24,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:08:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:08:24,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:08:24,611 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-10-04 09:08:27,267 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-04 09:08:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:29,342 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-10-04 09:08:29,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:08:29,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:08:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:29,351 INFO L225 Difference]: With dead ends: 1008 [2018-10-04 09:08:29,351 INFO L226 Difference]: Without dead ends: 1000 [2018-10-04 09:08:29,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-10-04 09:08:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-10-04 09:08:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-10-04 09:08:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-04 09:08:29,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-10-04 09:08:29,426 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-10-04 09:08:29,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:29,426 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-10-04 09:08:29,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:08:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-10-04 09:08:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:08:29,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:29,428 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:29,429 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:29,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:29,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-10-04 09:08:29,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:29,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:29,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:29,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:29,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:29,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:29,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:08:29,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:08:29,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:08:29,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:08:29,552 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-10-04 09:08:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:32,303 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-10-04 09:08:32,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 09:08:32,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:08:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:32,310 INFO L225 Difference]: With dead ends: 924 [2018-10-04 09:08:32,310 INFO L226 Difference]: Without dead ends: 916 [2018-10-04 09:08:32,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-10-04 09:08:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-10-04 09:08:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-10-04 09:08:32,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-04 09:08:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-10-04 09:08:32,395 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-10-04 09:08:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:32,396 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-10-04 09:08:32,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:08:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-10-04 09:08:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:08:32,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:32,397 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:32,398 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:32,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:32,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-10-04 09:08:32,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:32,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:32,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:32,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:32,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:32,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:32,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:08:32,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:08:32,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:08:32,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:08:32,577 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-10-04 09:08:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:34,462 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-10-04 09:08:34,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:08:34,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:08:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:34,468 INFO L225 Difference]: With dead ends: 791 [2018-10-04 09:08:34,468 INFO L226 Difference]: Without dead ends: 783 [2018-10-04 09:08:34,469 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-10-04 09:08:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-10-04 09:08:34,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-10-04 09:08:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-04 09:08:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-10-04 09:08:34,556 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-10-04 09:08:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:34,556 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-10-04 09:08:34,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:08:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-10-04 09:08:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:08:34,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:34,557 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:34,558 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:34,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:34,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-10-04 09:08:34,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:34,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:34,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:34,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:34,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:34,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:34,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:08:34,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:08:34,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:08:34,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:08:34,643 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-10-04 09:08:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:36,969 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-10-04 09:08:36,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 09:08:36,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:08:36,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:36,977 INFO L225 Difference]: With dead ends: 1040 [2018-10-04 09:08:36,977 INFO L226 Difference]: Without dead ends: 1032 [2018-10-04 09:08:36,978 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-10-04 09:08:36,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-10-04 09:08:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-10-04 09:08:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-04 09:08:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-10-04 09:08:37,098 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-10-04 09:08:37,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:37,098 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-10-04 09:08:37,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:08:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-10-04 09:08:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:08:37,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:37,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:37,100 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:37,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:37,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-10-04 09:08:37,101 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:37,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:37,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:37,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:37,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:37,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:37,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:08:37,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:08:37,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:08:37,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:08:37,200 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-10-04 09:08:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:39,816 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-10-04 09:08:39,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 09:08:39,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:08:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:39,824 INFO L225 Difference]: With dead ends: 1166 [2018-10-04 09:08:39,824 INFO L226 Difference]: Without dead ends: 1158 [2018-10-04 09:08:39,825 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-10-04 09:08:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-10-04 09:08:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-10-04 09:08:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-04 09:08:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-10-04 09:08:39,986 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-10-04 09:08:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:39,986 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-10-04 09:08:39,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:08:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-10-04 09:08:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:08:39,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:39,987 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:39,988 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:39,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:39,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-10-04 09:08:39,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:39,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:39,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:39,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:39,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:40,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:40,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:08:40,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:08:40,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:08:40,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:08:40,243 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-10-04 09:08:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:42,888 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-10-04 09:08:42,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 09:08:42,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:08:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:42,895 INFO L225 Difference]: With dead ends: 1127 [2018-10-04 09:08:42,895 INFO L226 Difference]: Without dead ends: 1119 [2018-10-04 09:08:42,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 09:08:42,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-10-04 09:08:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-10-04 09:08:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-04 09:08:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-10-04 09:08:43,088 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-10-04 09:08:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:43,089 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-10-04 09:08:43,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:08:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-10-04 09:08:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:08:43,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:43,090 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:43,091 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:43,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:43,091 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-10-04 09:08:43,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:43,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:43,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:43,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:43,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:43,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:43,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:08:43,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:08:43,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:08:43,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:08:43,190 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-10-04 09:08:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:45,502 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-10-04 09:08:45,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:08:45,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:08:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:45,509 INFO L225 Difference]: With dead ends: 975 [2018-10-04 09:08:45,509 INFO L226 Difference]: Without dead ends: 967 [2018-10-04 09:08:45,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-10-04 09:08:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-10-04 09:08:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-10-04 09:08:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-04 09:08:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-10-04 09:08:45,660 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-10-04 09:08:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:45,661 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-10-04 09:08:45,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:08:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-10-04 09:08:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:08:45,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:45,662 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:45,663 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:45,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:45,663 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-10-04 09:08:45,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:45,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:45,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:45,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:45,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:08:45,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:08:45,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:08:45,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:08:45,751 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-10-04 09:08:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:48,457 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-10-04 09:08:48,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:08:48,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:08:48,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:48,461 INFO L225 Difference]: With dead ends: 1011 [2018-10-04 09:08:48,462 INFO L226 Difference]: Without dead ends: 1003 [2018-10-04 09:08:48,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-10-04 09:08:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-10-04 09:08:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-10-04 09:08:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-04 09:08:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-10-04 09:08:48,620 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-10-04 09:08:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:48,621 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-10-04 09:08:48,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:08:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-10-04 09:08:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:08:48,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:48,622 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:48,623 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:48,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:48,623 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-10-04 09:08:48,623 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:48,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:48,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:48,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:48,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:48,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:48,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:08:48,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:08:48,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:08:48,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:08:48,716 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-10-04 09:08:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:50,747 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-10-04 09:08:50,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:08:50,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:08:50,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:50,752 INFO L225 Difference]: With dead ends: 859 [2018-10-04 09:08:50,752 INFO L226 Difference]: Without dead ends: 851 [2018-10-04 09:08:50,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-10-04 09:08:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-10-04 09:08:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-10-04 09:08:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-04 09:08:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-10-04 09:08:50,932 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-10-04 09:08:50,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:50,932 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-10-04 09:08:50,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:08:50,932 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-10-04 09:08:50,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:08:50,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:50,933 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:50,934 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:50,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:50,934 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-10-04 09:08:50,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:50,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:50,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:50,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:50,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:51,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:51,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:08:51,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:08:51,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:08:51,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:08:51,026 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-10-04 09:08:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:53,500 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-10-04 09:08:53,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:08:53,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:08:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:53,505 INFO L225 Difference]: With dead ends: 962 [2018-10-04 09:08:53,505 INFO L226 Difference]: Without dead ends: 954 [2018-10-04 09:08:53,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-10-04 09:08:53,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-10-04 09:08:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-10-04 09:08:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-10-04 09:08:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-10-04 09:08:53,747 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-10-04 09:08:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:53,747 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-10-04 09:08:53,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:08:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-10-04 09:08:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:08:53,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:53,748 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:53,749 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:53,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-10-04 09:08:53,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:53,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:53,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:53,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:53,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:53,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:53,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:08:53,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:08:53,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:08:53,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:08:53,830 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-10-04 09:08:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:56,292 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-10-04 09:08:56,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 09:08:56,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:08:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:56,299 INFO L225 Difference]: With dead ends: 1064 [2018-10-04 09:08:56,299 INFO L226 Difference]: Without dead ends: 1056 [2018-10-04 09:08:56,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-10-04 09:08:56,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-10-04 09:08:56,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-10-04 09:08:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-10-04 09:08:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-10-04 09:08:56,644 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-10-04 09:08:56,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:56,644 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-10-04 09:08:56,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:08:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-10-04 09:08:56,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:08:56,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:56,645 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:08:56,645 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:56,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:56,646 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-10-04 09:08:56,646 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:56,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:56,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:56,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:56,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:08:56,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:56,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:08:56,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:08:56,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:08:56,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:08:56,740 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-10-04 09:08:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:59,843 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-10-04 09:08:59,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 09:08:59,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:08:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:59,849 INFO L225 Difference]: With dead ends: 1241 [2018-10-04 09:08:59,849 INFO L226 Difference]: Without dead ends: 1233 [2018-10-04 09:08:59,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 09:08:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-10-04 09:09:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-10-04 09:09:00,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-04 09:09:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-10-04 09:09:00,206 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-10-04 09:09:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:00,206 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-10-04 09:09:00,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:09:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-10-04 09:09:00,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:09:00,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:00,207 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:00,208 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:00,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:00,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-10-04 09:09:00,208 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:00,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:00,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:00,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:00,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:00,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:00,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:09:00,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:09:00,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:09:00,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:09:00,291 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-10-04 09:09:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:02,696 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-10-04 09:09:02,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:09:02,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:09:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:02,703 INFO L225 Difference]: With dead ends: 1139 [2018-10-04 09:09:02,703 INFO L226 Difference]: Without dead ends: 1131 [2018-10-04 09:09:02,704 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-10-04 09:09:02,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-10-04 09:09:02,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-10-04 09:09:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-10-04 09:09:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-10-04 09:09:02,996 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-10-04 09:09:02,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:02,997 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-10-04 09:09:02,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:09:02,997 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-10-04 09:09:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:09:02,997 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:02,998 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:02,998 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:02,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:02,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-10-04 09:09:02,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:02,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:02,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:03,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:03,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:03,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:03,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:09:03,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:09:03,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:09:03,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:09:03,086 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-10-04 09:09:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:06,096 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-10-04 09:09:06,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:09:06,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:09:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:06,103 INFO L225 Difference]: With dead ends: 1325 [2018-10-04 09:09:06,103 INFO L226 Difference]: Without dead ends: 1317 [2018-10-04 09:09:06,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-10-04 09:09:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-10-04 09:09:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-10-04 09:09:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-10-04 09:09:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-10-04 09:09:06,422 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-10-04 09:09:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:06,422 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-10-04 09:09:06,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:09:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-10-04 09:09:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:09:06,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:06,423 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:06,423 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:06,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:06,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-10-04 09:09:06,424 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:06,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:06,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:06,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:06,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:06,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:06,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:09:06,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:09:06,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:09:06,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:09:06,492 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-10-04 09:09:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:09,896 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-10-04 09:09:09,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:09:09,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:09:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:09,902 INFO L225 Difference]: With dead ends: 1334 [2018-10-04 09:09:09,902 INFO L226 Difference]: Without dead ends: 1326 [2018-10-04 09:09:09,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-10-04 09:09:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-10-04 09:09:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-10-04 09:09:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-10-04 09:09:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-10-04 09:09:10,247 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-10-04 09:09:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:10,248 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-10-04 09:09:10,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:09:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-10-04 09:09:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:09:10,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:10,248 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:10,249 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:10,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-10-04 09:09:10,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:10,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:10,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:10,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:10,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:10,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:10,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:09:10,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:09:10,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:09:10,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:09:10,317 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-10-04 09:09:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:12,275 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-10-04 09:09:12,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:09:12,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:09:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:12,281 INFO L225 Difference]: With dead ends: 919 [2018-10-04 09:09:12,281 INFO L226 Difference]: Without dead ends: 911 [2018-10-04 09:09:12,282 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-10-04 09:09:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-10-04 09:09:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-10-04 09:09:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-04 09:09:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-10-04 09:09:12,652 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-10-04 09:09:12,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:12,653 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-10-04 09:09:12,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:09:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-10-04 09:09:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:09:12,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:12,654 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:12,654 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:12,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:12,654 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-10-04 09:09:12,654 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:12,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:12,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:12,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:12,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:12,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:12,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:09:12,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:09:12,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:09:12,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:09:12,738 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-10-04 09:09:15,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:15,294 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-10-04 09:09:15,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:09:15,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:09:15,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:15,300 INFO L225 Difference]: With dead ends: 1095 [2018-10-04 09:09:15,300 INFO L226 Difference]: Without dead ends: 1087 [2018-10-04 09:09:15,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-10-04 09:09:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-10-04 09:09:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-10-04 09:09:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-04 09:09:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-10-04 09:09:15,663 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-10-04 09:09:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:15,663 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-10-04 09:09:15,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:09:15,663 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-10-04 09:09:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:09:15,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:15,664 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:15,664 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:15,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:15,665 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-10-04 09:09:15,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:15,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:15,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:15,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:15,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:15,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:15,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:09:15,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:09:15,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:09:15,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:09:15,736 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-10-04 09:09:19,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:19,538 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-10-04 09:09:19,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 09:09:19,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:09:19,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:19,542 INFO L225 Difference]: With dead ends: 1304 [2018-10-04 09:09:19,543 INFO L226 Difference]: Without dead ends: 1296 [2018-10-04 09:09:19,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-10-04 09:09:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-10-04 09:09:19,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-10-04 09:09:19,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-10-04 09:09:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-10-04 09:09:19,914 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-10-04 09:09:19,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:19,915 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-10-04 09:09:19,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:09:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-10-04 09:09:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:09:19,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:19,916 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:19,916 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:19,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:19,917 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-10-04 09:09:19,917 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:19,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:19,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:19,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:19,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:19,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:19,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:09:19,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:09:19,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:09:19,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:09:19,993 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-10-04 09:09:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:23,262 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-10-04 09:09:23,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 09:09:23,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:09:23,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:23,265 INFO L225 Difference]: With dead ends: 1192 [2018-10-04 09:09:23,265 INFO L226 Difference]: Without dead ends: 1184 [2018-10-04 09:09:23,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-10-04 09:09:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-10-04 09:09:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-10-04 09:09:23,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-04 09:09:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-10-04 09:09:23,694 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-10-04 09:09:23,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:23,694 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-10-04 09:09:23,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:09:23,694 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-10-04 09:09:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:09:23,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:23,695 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:23,695 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:23,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:23,696 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-10-04 09:09:23,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:23,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:23,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:23,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:23,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:23,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:23,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:09:23,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:09:23,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:09:23,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:09:23,744 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-10-04 09:09:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:24,551 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-10-04 09:09:24,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:09:24,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-04 09:09:24,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:24,553 INFO L225 Difference]: With dead ends: 1139 [2018-10-04 09:09:24,553 INFO L226 Difference]: Without dead ends: 625 [2018-10-04 09:09:24,555 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-10-04 09:09:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-10-04 09:09:25,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-10-04 09:09:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-04 09:09:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-10-04 09:09:25,036 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-10-04 09:09:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:25,036 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-10-04 09:09:25,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:09:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-10-04 09:09:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:09:25,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:25,037 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:25,037 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:25,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:25,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-10-04 09:09:25,037 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:25,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:25,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:25,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:25,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:25,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:09:25,140 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:09:25,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:25,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:09:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:26,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:09:26,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-04 09:09:26,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 09:09:26,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 09:09:26,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-04 09:09:26,344 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-10-04 09:09:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:29,707 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-10-04 09:09:29,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:09:29,708 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-10-04 09:09:29,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:29,710 INFO L225 Difference]: With dead ends: 794 [2018-10-04 09:09:29,710 INFO L226 Difference]: Without dead ends: 789 [2018-10-04 09:09:29,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-10-04 09:09:29,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-04 09:09:30,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-10-04 09:09:30,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-10-04 09:09:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-10-04 09:09:30,368 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-10-04 09:09:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:30,368 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-10-04 09:09:30,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 09:09:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-10-04 09:09:30,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:09:30,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:30,369 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:30,369 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:30,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:30,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-10-04 09:09:30,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:30,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:30,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:30,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:30,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:30,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:30,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:09:30,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:09:30,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:09:30,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:09:30,438 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-10-04 09:09:31,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:31,733 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-10-04 09:09:31,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:09:31,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-04 09:09:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:31,735 INFO L225 Difference]: With dead ends: 1317 [2018-10-04 09:09:31,735 INFO L226 Difference]: Without dead ends: 729 [2018-10-04 09:09:31,736 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-10-04 09:09:31,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-04 09:09:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-10-04 09:09:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-04 09:09:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-10-04 09:09:32,308 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-10-04 09:09:32,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:32,308 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-10-04 09:09:32,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:09:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-10-04 09:09:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:09:32,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:32,309 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:32,310 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:32,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:32,310 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-10-04 09:09:32,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:32,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:32,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:32,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:32,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:32,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:32,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:09:32,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:09:32,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:09:32,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:09:32,515 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-10-04 09:09:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:35,902 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-10-04 09:09:35,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 09:09:35,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:09:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:35,906 INFO L225 Difference]: With dead ends: 1435 [2018-10-04 09:09:35,906 INFO L226 Difference]: Without dead ends: 1427 [2018-10-04 09:09:35,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-10-04 09:09:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-10-04 09:09:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-10-04 09:09:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-04 09:09:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-10-04 09:09:36,771 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-10-04 09:09:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:36,771 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-10-04 09:09:36,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:09:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-10-04 09:09:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:09:36,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:36,773 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:36,773 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:36,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:36,773 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-10-04 09:09:36,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:36,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:36,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:36,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:36,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:36,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:36,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:09:36,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:09:36,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:09:36,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:09:36,951 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-10-04 09:09:40,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:40,663 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-10-04 09:09:40,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:09:40,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:09:40,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:40,667 INFO L225 Difference]: With dead ends: 1599 [2018-10-04 09:09:40,667 INFO L226 Difference]: Without dead ends: 1591 [2018-10-04 09:09:40,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-10-04 09:09:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-04 09:09:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-10-04 09:09:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-04 09:09:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-10-04 09:09:41,513 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-10-04 09:09:41,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:41,513 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-10-04 09:09:41,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:09:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-10-04 09:09:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:09:41,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:41,514 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:41,515 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:41,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:41,515 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-10-04 09:09:41,515 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:41,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:41,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:41,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:41,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:41,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:41,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:09:41,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:09:41,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:09:41,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:09:41,599 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-10-04 09:09:44,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:44,701 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-10-04 09:09:44,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:09:44,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:09:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:44,705 INFO L225 Difference]: With dead ends: 1411 [2018-10-04 09:09:44,705 INFO L226 Difference]: Without dead ends: 1403 [2018-10-04 09:09:44,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-10-04 09:09:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-10-04 09:09:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-10-04 09:09:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-10-04 09:09:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-10-04 09:09:45,476 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-10-04 09:09:45,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:45,476 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-10-04 09:09:45,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:09:45,476 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-10-04 09:09:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:09:45,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:45,477 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:45,477 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:45,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:45,478 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-10-04 09:09:45,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:45,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:45,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:45,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:45,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:45,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:45,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:09:45,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:09:45,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:09:45,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:09:45,594 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-10-04 09:09:49,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:49,096 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-10-04 09:09:49,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:09:49,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:09:49,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:49,099 INFO L225 Difference]: With dead ends: 1490 [2018-10-04 09:09:49,100 INFO L226 Difference]: Without dead ends: 1482 [2018-10-04 09:09:49,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-10-04 09:09:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-10-04 09:09:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-10-04 09:09:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-10-04 09:09:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-10-04 09:09:49,954 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-10-04 09:09:49,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:49,954 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-10-04 09:09:49,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:09:49,955 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-10-04 09:09:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:09:49,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:49,956 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:49,956 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:49,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:49,957 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-10-04 09:09:49,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:49,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:49,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:49,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:49,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:50,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:50,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:09:50,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:09:50,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:09:50,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:09:50,040 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-10-04 09:09:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:53,339 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-10-04 09:09:53,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:09:53,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:09:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:53,342 INFO L225 Difference]: With dead ends: 1427 [2018-10-04 09:09:53,342 INFO L226 Difference]: Without dead ends: 1419 [2018-10-04 09:09:53,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-10-04 09:09:53,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-10-04 09:09:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-10-04 09:09:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-04 09:09:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-10-04 09:09:54,178 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-10-04 09:09:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:54,179 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-10-04 09:09:54,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:09:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-10-04 09:09:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:09:54,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:54,180 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:54,180 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:54,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:54,180 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-10-04 09:09:54,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:54,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:54,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:54,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:09:54,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:09:54,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:09:54,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:09:54,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:09:54,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:09:54,249 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-10-04 09:09:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:09:57,346 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-10-04 09:09:57,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 09:09:57,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:09:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:09:57,348 INFO L225 Difference]: With dead ends: 1306 [2018-10-04 09:09:57,348 INFO L226 Difference]: Without dead ends: 1298 [2018-10-04 09:09:57,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-10-04 09:09:57,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-10-04 09:09:58,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-10-04 09:09:58,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-04 09:09:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-10-04 09:09:58,358 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-10-04 09:09:58,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:09:58,358 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-10-04 09:09:58,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:09:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-10-04 09:09:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:09:58,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:09:58,359 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:09:58,359 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:09:58,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:09:58,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-10-04 09:09:58,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:09:58,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:09:58,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:58,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:58,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:09:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:09:58,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:09:58,432 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:09:58,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:09:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:09:58,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:09:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:09:58,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:09:58,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:09:58,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:09:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:09:58,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:09:58,482 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-10-04 09:10:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:10:01,441 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-10-04 09:10:01,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 09:10:01,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:10:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:10:01,443 INFO L225 Difference]: With dead ends: 1285 [2018-10-04 09:10:01,443 INFO L226 Difference]: Without dead ends: 1277 [2018-10-04 09:10:01,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-10-04 09:10:01,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-10-04 09:10:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-10-04 09:10:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-04 09:10:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-10-04 09:10:02,533 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-10-04 09:10:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:10:02,533 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-10-04 09:10:02,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:10:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-10-04 09:10:02,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:10:02,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:10:02,534 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:10:02,534 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:10:02,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:10:02,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-10-04 09:10:02,534 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:10:02,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:10:02,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:02,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:02,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:10:02,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:10:02,614 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:10:02,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:02,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:10:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:10:02,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:10:02,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:10:02,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:10:02,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:10:02,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:10:02,670 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-10-04 09:10:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:10:06,319 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-10-04 09:10:06,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 09:10:06,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:10:06,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:10:06,321 INFO L225 Difference]: With dead ends: 1518 [2018-10-04 09:10:06,321 INFO L226 Difference]: Without dead ends: 1510 [2018-10-04 09:10:06,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-10-04 09:10:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-04 09:10:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-10-04 09:10:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-10-04 09:10:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-10-04 09:10:07,308 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-10-04 09:10:07,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:10:07,308 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-10-04 09:10:07,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:10:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-10-04 09:10:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:10:07,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:10:07,309 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:10:07,309 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:10:07,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:10:07,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-10-04 09:10:07,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:10:07,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:10:07,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:07,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:07,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:10:07,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:10:07,444 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:10:07,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:07,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:10:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:10:07,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:10:07,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:10:07,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:10:07,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:10:07,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:10:07,507 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-10-04 09:10:11,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:10:11,213 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-10-04 09:10:11,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:10:11,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:10:11,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:10:11,215 INFO L225 Difference]: With dead ends: 1448 [2018-10-04 09:10:11,215 INFO L226 Difference]: Without dead ends: 1440 [2018-10-04 09:10:11,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-10-04 09:10:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-10-04 09:10:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-10-04 09:10:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-10-04 09:10:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-10-04 09:10:12,251 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-10-04 09:10:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:10:12,251 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-10-04 09:10:12,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:10:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-10-04 09:10:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:10:12,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:10:12,252 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:10:12,253 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:10:12,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:10:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-10-04 09:10:12,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:10:12,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:10:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:12,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:10:12,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:10:12,849 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:10:12,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:12,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:10:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:10:12,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:10:12,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:10:12,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:10:12,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:10:12,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:10:12,926 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-10-04 09:10:16,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:10:16,208 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-10-04 09:10:16,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:10:16,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:10:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:10:16,210 INFO L225 Difference]: With dead ends: 1254 [2018-10-04 09:10:16,210 INFO L226 Difference]: Without dead ends: 1246 [2018-10-04 09:10:16,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-10-04 09:10:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-10-04 09:10:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-10-04 09:10:17,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-10-04 09:10:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-10-04 09:10:17,124 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-10-04 09:10:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:10:17,124 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-10-04 09:10:17,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:10:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-10-04 09:10:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:10:17,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:10:17,125 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:10:17,125 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:10:17,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:10:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-10-04 09:10:17,126 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:10:17,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:10:17,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:17,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:17,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:10:17,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:10:17,218 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:10:17,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:17,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:10:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:10:17,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:10:17,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 09:10:17,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 09:10:17,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 09:10:17,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-10-04 09:10:17,612 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-10-04 09:10:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:10:23,329 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-10-04 09:10:23,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 09:10:23,329 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 09:10:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:10:23,331 INFO L225 Difference]: With dead ends: 1278 [2018-10-04 09:10:23,331 INFO L226 Difference]: Without dead ends: 1270 [2018-10-04 09:10:23,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=519, Invalid=2133, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 09:10:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-10-04 09:10:24,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-10-04 09:10:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-10-04 09:10:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-10-04 09:10:24,317 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-10-04 09:10:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:10:24,317 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-10-04 09:10:24,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 09:10:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-10-04 09:10:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:10:24,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:10:24,318 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:10:24,318 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:10:24,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:10:24,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-10-04 09:10:24,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:10:24,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:10:24,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:24,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:24,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:10:24,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:10:24,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 09:10:24,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:10:24,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:10:24,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:10:24,429 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-10-04 09:10:27,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:10:27,701 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-10-04 09:10:27,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:10:27,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 09:10:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:10:27,703 INFO L225 Difference]: With dead ends: 1180 [2018-10-04 09:10:27,703 INFO L226 Difference]: Without dead ends: 1172 [2018-10-04 09:10:27,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-10-04 09:10:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-10-04 09:10:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-10-04 09:10:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-10-04 09:10:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-10-04 09:10:28,686 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-10-04 09:10:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:10:28,686 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-10-04 09:10:28,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:10:28,686 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-10-04 09:10:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:10:28,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:10:28,686 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:10:28,687 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:10:28,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:10:28,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-10-04 09:10:28,687 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:10:28,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:10:28,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:28,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:28,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:10:29,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:10:29,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 09:10:29,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:10:29,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:10:29,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:10:29,182 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-10-04 09:10:32,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:10:32,784 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-10-04 09:10:32,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:10:32,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 09:10:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:10:32,786 INFO L225 Difference]: With dead ends: 1233 [2018-10-04 09:10:32,786 INFO L226 Difference]: Without dead ends: 1225 [2018-10-04 09:10:32,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-10-04 09:10:32,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-10-04 09:10:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-10-04 09:10:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-10-04 09:10:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-10-04 09:10:33,850 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-10-04 09:10:33,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:10:33,850 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-10-04 09:10:33,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:10:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-10-04 09:10:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:10:33,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:10:33,851 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:10:33,851 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:10:33,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:10:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-10-04 09:10:33,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:10:33,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:10:33,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:33,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:33,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:10:33,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:10:33,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 09:10:33,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:10:33,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:10:33,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:10:33,942 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-10-04 09:10:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:10:38,261 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-10-04 09:10:38,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 09:10:38,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 09:10:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:10:38,263 INFO L225 Difference]: With dead ends: 1537 [2018-10-04 09:10:38,263 INFO L226 Difference]: Without dead ends: 1529 [2018-10-04 09:10:38,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 09:10:38,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-10-04 09:10:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-10-04 09:10:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-10-04 09:10:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-10-04 09:10:39,352 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-10-04 09:10:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:10:39,352 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-10-04 09:10:39,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:10:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-10-04 09:10:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:10:39,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:10:39,353 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:10:39,353 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:10:39,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:10:39,354 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-10-04 09:10:39,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:10:39,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:10:39,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:39,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:39,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:10:39,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:10:39,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 09:10:39,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:10:39,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:10:39,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:10:39,433 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-10-04 09:10:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:10:43,975 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-10-04 09:10:43,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 09:10:43,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 09:10:43,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:10:43,978 INFO L225 Difference]: With dead ends: 1590 [2018-10-04 09:10:43,978 INFO L226 Difference]: Without dead ends: 1582 [2018-10-04 09:10:43,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-10-04 09:10:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-10-04 09:10:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-10-04 09:10:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-10-04 09:10:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-10-04 09:10:45,123 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-10-04 09:10:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:10:45,123 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-10-04 09:10:45,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:10:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-10-04 09:10:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:10:45,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:10:45,124 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:10:45,124 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:10:45,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:10:45,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-10-04 09:10:45,124 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:10:45,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:10:45,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:45,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:45,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:10:45,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:10:45,196 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:10:45,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:45,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:10:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:10:45,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:10:45,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 09:10:45,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 09:10:45,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 09:10:45,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-04 09:10:45,345 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-10-04 09:10:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:10:55,036 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-10-04 09:10:55,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-04 09:10:55,036 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 09:10:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:10:55,038 INFO L225 Difference]: With dead ends: 1949 [2018-10-04 09:10:55,039 INFO L226 Difference]: Without dead ends: 1941 [2018-10-04 09:10:55,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1453, Invalid=7667, Unknown=0, NotChecked=0, Total=9120 [2018-10-04 09:10:55,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-10-04 09:10:56,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-10-04 09:10:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-10-04 09:10:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-10-04 09:10:56,359 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-10-04 09:10:56,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:10:56,359 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-10-04 09:10:56,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 09:10:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-10-04 09:10:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:10:56,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:10:56,360 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:10:56,361 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:10:56,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:10:56,361 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-10-04 09:10:56,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:10:56,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:10:56,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:56,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:10:56,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:10:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:10:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:10:56,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:10:56,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 09:10:56,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:10:56,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:10:56,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:10:56,437 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-10-04 09:11:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:11:00,709 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-10-04 09:11:00,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 09:11:00,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 09:11:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:11:00,711 INFO L225 Difference]: With dead ends: 1420 [2018-10-04 09:11:00,711 INFO L226 Difference]: Without dead ends: 1412 [2018-10-04 09:11:00,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-10-04 09:11:00,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-10-04 09:11:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-10-04 09:11:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-10-04 09:11:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-10-04 09:11:01,821 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-10-04 09:11:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:11:01,821 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-10-04 09:11:01,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:11:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-10-04 09:11:01,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:11:01,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:11:01,822 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:11:01,822 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:11:01,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:11:01,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-10-04 09:11:01,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:11:01,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:11:01,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:11:01,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:11:01,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:11:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:11:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:11:01,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:11:01,899 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:11:01,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:11:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:11:01,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:11:02,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-10-04 09:11:02,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:11:02,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 09:11:02,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 09:11:02,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 09:11:02,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-04 09:11:02,036 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-10-04 09:11:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:11:15,068 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-10-04 09:11:15,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-04 09:11:15,068 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 09:11:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:11:15,071 INFO L225 Difference]: With dead ends: 2767 [2018-10-04 09:11:15,072 INFO L226 Difference]: Without dead ends: 2759 [2018-10-04 09:11:15,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6116 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2425, Invalid=14867, Unknown=0, NotChecked=0, Total=17292 [2018-10-04 09:11:15,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-10-04 09:11:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-10-04 09:11:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-10-04 09:11:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-10-04 09:11:16,358 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-10-04 09:11:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:11:16,358 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-10-04 09:11:16,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 09:11:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-10-04 09:11:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:11:16,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:11:16,359 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:11:16,360 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:11:16,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:11:16,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-10-04 09:11:16,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:11:16,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:11:16,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:11:16,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:11:16,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:11:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:11:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:11:16,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:11:16,455 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:11:16,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:11:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:11:16,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:11:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:11:16,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:11:16,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 09:11:16,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 09:11:16,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 09:11:16,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-04 09:11:16,609 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-10-04 09:11:30,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:11:30,227 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-10-04 09:11:30,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-04 09:11:30,227 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 09:11:30,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:11:30,229 INFO L225 Difference]: With dead ends: 2361 [2018-10-04 09:11:30,229 INFO L226 Difference]: Without dead ends: 2353 [2018-10-04 09:11:30,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9524 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3069, Invalid=22371, Unknown=0, NotChecked=0, Total=25440 [2018-10-04 09:11:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-10-04 09:11:31,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-10-04 09:11:31,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-10-04 09:11:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-10-04 09:11:31,650 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-10-04 09:11:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:11:31,651 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-10-04 09:11:31,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 09:11:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-10-04 09:11:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:11:31,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:11:31,651 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:11:31,652 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:11:31,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:11:31,652 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-10-04 09:11:31,652 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:11:31,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:11:31,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:11:31,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:11:31,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:11:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:11:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:11:31,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:11:31,805 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:11:31,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:11:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:11:31,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:11:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:11:31,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:11:31,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-04 09:11:31,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 09:11:31,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 09:11:31,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-10-04 09:11:31,937 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-10-04 09:11:34,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:11:34,771 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-10-04 09:11:34,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:11:34,771 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-10-04 09:11:34,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:11:34,773 INFO L225 Difference]: With dead ends: 1507 [2018-10-04 09:11:34,773 INFO L226 Difference]: Without dead ends: 1502 [2018-10-04 09:11:34,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-10-04 09:11:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-10-04 09:11:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-10-04 09:11:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-10-04 09:11:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-10-04 09:11:36,495 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-10-04 09:11:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:11:36,496 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-10-04 09:11:36,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 09:11:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-10-04 09:11:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:11:36,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:11:36,497 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:11:36,497 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:11:36,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:11:36,498 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-10-04 09:11:36,498 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:11:36,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:11:36,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:11:36,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:11:36,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:11:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:11:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:11:36,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:11:36,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:11:36,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:11:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:11:36,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:11:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:11:37,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:11:37,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-10-04 09:11:37,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 09:11:37,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 09:11:37,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-04 09:11:37,128 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-10-04 09:11:37,640 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-10-04 09:11:47,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:11:47,508 INFO L93 Difference]: Finished difference Result 3654 states and 8066 transitions. [2018-10-04 09:11:47,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 09:11:47,509 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-10-04 09:11:47,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:11:47,512 INFO L225 Difference]: With dead ends: 3654 [2018-10-04 09:11:47,513 INFO L226 Difference]: Without dead ends: 3646 [2018-10-04 09:11:47,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1127, Invalid=3703, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 09:11:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2018-10-04 09:11:50,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 2136. [2018-10-04 09:11:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-10-04 09:11:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-10-04 09:11:50,228 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-10-04 09:11:50,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:11:50,228 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-10-04 09:11:50,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 09:11:50,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-10-04 09:11:50,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:11:50,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:11:50,229 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:11:50,230 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:11:50,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:11:50,230 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-10-04 09:11:50,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:11:50,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:11:50,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:11:50,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:11:50,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:11:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:11:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:11:50,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:11:50,321 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:11:50,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:11:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:11:50,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:11:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:11:50,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:11:50,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 09:11:50,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:11:50,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:11:50,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-04 09:11:50,395 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-10-04 09:11:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:11:55,934 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-10-04 09:11:55,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:11:55,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 09:11:55,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:11:55,938 INFO L225 Difference]: With dead ends: 2767 [2018-10-04 09:11:55,939 INFO L226 Difference]: Without dead ends: 2759 [2018-10-04 09:11:55,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-10-04 09:11:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-10-04 09:11:58,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-10-04 09:11:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-10-04 09:11:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-10-04 09:11:58,794 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-10-04 09:11:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:11:58,794 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-10-04 09:11:58,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:11:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-10-04 09:11:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:11:58,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:11:58,795 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:11:58,795 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:11:58,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:11:58,795 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-10-04 09:11:58,795 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:11:58,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:11:58,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:11:58,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:11:58,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:11:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:11:59,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:11:59,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:11:59,046 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:11:59,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:11:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:11:59,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:11:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:11:59,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:11:59,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 09:11:59,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:11:59,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:11:59,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-04 09:11:59,246 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-10-04 09:12:05,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:12:05,488 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-10-04 09:12:05,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:12:05,488 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 09:12:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:12:05,492 INFO L225 Difference]: With dead ends: 3146 [2018-10-04 09:12:05,492 INFO L226 Difference]: Without dead ends: 3138 [2018-10-04 09:12:05,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2018-10-04 09:12:05,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-10-04 09:12:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-10-04 09:12:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-10-04 09:12:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-10-04 09:12:08,298 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-10-04 09:12:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:12:08,298 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-10-04 09:12:08,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:12:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-10-04 09:12:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:12:08,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:12:08,299 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:12:08,300 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:12:08,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:12:08,300 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-10-04 09:12:08,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:12:08,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:12:08,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:12:08,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:12:08,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:12:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:12:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:12:08,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:12:08,396 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:12:08,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:12:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:12:08,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:12:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:12:08,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:12:08,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 09:12:08,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:12:08,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:12:08,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-04 09:12:08,471 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-10-04 09:12:15,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:12:15,071 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-10-04 09:12:15,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 09:12:15,071 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 09:12:15,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:12:15,075 INFO L225 Difference]: With dead ends: 3089 [2018-10-04 09:12:15,076 INFO L226 Difference]: Without dead ends: 3081 [2018-10-04 09:12:15,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2018-10-04 09:12:15,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-10-04 09:12:17,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-10-04 09:12:17,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-10-04 09:12:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-10-04 09:12:17,901 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-10-04 09:12:17,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:12:17,901 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-10-04 09:12:17,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:12:17,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-10-04 09:12:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:12:17,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:12:17,903 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:12:17,903 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:12:17,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:12:17,903 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-10-04 09:12:17,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:12:17,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:12:17,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:12:17,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:12:17,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:12:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:12:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:12:17,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:12:17,989 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:12:17,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:12:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:12:18,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:12:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:12:18,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:12:18,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 09:12:18,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:12:18,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:12:18,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-04 09:12:18,052 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. [2018-10-04 09:12:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:12:24,559 INFO L93 Difference]: Finished difference Result 3266 states and 7250 transitions. [2018-10-04 09:12:24,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:12:24,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 09:12:24,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:12:24,564 INFO L225 Difference]: With dead ends: 3266 [2018-10-04 09:12:24,564 INFO L226 Difference]: Without dead ends: 3258 [2018-10-04 09:12:24,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-10-04 09:12:24,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2018-10-04 09:12:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2328. [2018-10-04 09:12:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2328 states. [2018-10-04 09:12:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 5263 transitions. [2018-10-04 09:12:27,563 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 5263 transitions. Word has length 20 [2018-10-04 09:12:27,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:12:27,563 INFO L480 AbstractCegarLoop]: Abstraction has 2328 states and 5263 transitions. [2018-10-04 09:12:27,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:12:27,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 5263 transitions. [2018-10-04 09:12:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:12:27,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:12:27,564 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:12:27,564 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:12:27,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:12:27,564 INFO L82 PathProgramCache]: Analyzing trace with hash 718975582, now seen corresponding path program 1 times [2018-10-04 09:12:27,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:12:27,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:12:27,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:12:27,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:12:27,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:12:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:12:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:12:27,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:12:27,661 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:12:27,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:12:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:12:27,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:12:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 09:12:27,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:12:27,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 09:12:27,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:12:27,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:12:27,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-04 09:12:27,727 INFO L87 Difference]: Start difference. First operand 2328 states and 5263 transitions. Second operand 11 states. Received shutdown request... [2018-10-04 09:12:31,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:12:31,219 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 09:12:31,225 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 09:12:31,226 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:12:31 BoogieIcfgContainer [2018-10-04 09:12:31,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:12:31,227 INFO L168 Benchmark]: Toolchain (without parser) took 260143.14 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 868.7 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -723.7 MB). Peak memory consumption was 145.0 MB. Max. memory is 7.1 GB. [2018-10-04 09:12:31,228 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:12:31,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:12:31,229 INFO L168 Benchmark]: Boogie Preprocessor took 46.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:12:31,229 INFO L168 Benchmark]: RCFGBuilder took 826.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:12:31,230 INFO L168 Benchmark]: TraceAbstraction took 259221.33 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 868.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -755.4 MB). Peak memory consumption was 113.3 MB. Max. memory is 7.1 GB. [2018-10-04 09:12:31,232 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 826.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 259221.33 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 868.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -755.4 MB). Peak memory consumption was 113.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (724 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (724 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (724 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (724 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (724 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (724 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (724 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (724 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (724 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (724 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (724 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (724 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (724 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (724 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 259.1s OverallTime, 53 OverallIterations, 2 TraceHistogramMax, 206.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13843 SDtfs, 46128 SDslu, 47492 SDs, 0 SdLazy, 97148 SolverSat, 10093 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 92.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1880 GetRequests, 344 SyntacticMatches, 5 SemanticMatches, 1531 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25661 ImplicationChecksByTransitivity, 28.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2328occurred in iteration=52, 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: 42.0s AutomataMinimizationTime, 52 MinimizatonAttempts, 28106 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 1024 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 955 ConstructedInterpolants, 0 QuantifiedInterpolants, 50298 SizeOfPredicates, 82 NumberOfNonLiveVariables, 695 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 69 InterpolantComputations, 37 PerfectInterpolantSequences, 45/117 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-12-31-243.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-12-31-243.csv Completed graceful shutdown