java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:36:24,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:36:24,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:36:24,028 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:36:24,028 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:36:24,029 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:36:24,030 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:36:24,033 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:36:24,035 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:36:24,036 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:36:24,037 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:36:24,037 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:36:24,038 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:36:24,039 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:36:24,040 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:36:24,041 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:36:24,042 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:36:24,043 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:36:24,045 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:36:24,047 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:36:24,048 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:36:24,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:36:24,052 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:36:24,052 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:36:24,053 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:36:24,053 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:36:24,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:36:24,055 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:36:24,056 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:36:24,057 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:36:24,057 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:36:24,058 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:36:24,058 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:36:24,059 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:36:24,060 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:36:24,060 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:36:24,061 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 09:36:24,078 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:36:24,078 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:36:24,079 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:36:24,079 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:36:24,079 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:36:24,080 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:36:24,080 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:36:24,080 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:36:24,081 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:36:24,081 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:36:24,081 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:36:24,081 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:36:24,081 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:36:24,082 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:36:24,082 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:36:24,082 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:36:24,082 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:36:24,082 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:36:24,083 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:36:24,083 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:36:24,083 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:36:24,083 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:36:24,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:36:24,084 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:36:24,084 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:36:24,084 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:36:24,084 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:36:24,084 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:36:24,085 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:36:24,085 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:36:24,085 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:36:24,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:36:24,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:36:24,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:36:24,167 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:36:24,167 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:36:24,168 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:36:24,169 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-10-04 09:36:24,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:36:24,259 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:36:24,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:36:24,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:36:24,260 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:36:24,283 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:36:24" (1/1) ... [2018-10-04 09:36:24,300 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:36:24" (1/1) ... [2018-10-04 09:36:24,305 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 09:36:24,305 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 09:36:24,306 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 09:36:24,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:36:24,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:36:24,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:36:24,310 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:36:24,322 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:36:24" (1/1) ... [2018-10-04 09:36:24,325 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:36:24" (1/1) ... [2018-10-04 09:36:24,333 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:36:24" (1/1) ... [2018-10-04 09:36:24,334 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:36:24" (1/1) ... [2018-10-04 09:36:24,349 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:36:24" (1/1) ... [2018-10-04 09:36:24,362 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:36:24" (1/1) ... [2018-10-04 09:36:24,365 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:36:24" (1/1) ... [2018-10-04 09:36:24,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:36:24,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:36:24,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:36:24,370 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:36:24,371 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:36:24" (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:36:24,455 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 09:36:24,455 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 09:36:24,456 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 09:36:25,334 INFO L338 CfgBuilder]: Using library mode [2018-10-04 09:36:25,335 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:36:25 BoogieIcfgContainer [2018-10-04 09:36:25,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:36:25,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:36:25,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:36:25,340 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:36:25,340 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:36:24" (1/2) ... [2018-10-04 09:36:25,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e51e491 and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:36:25, skipping insertion in model container [2018-10-04 09:36:25,342 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:36:25" (2/2) ... [2018-10-04 09:36:25,344 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-10-04 09:36:25,354 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:36:25,364 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-10-04 09:36:25,415 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:36:25,416 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:36:25,416 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:36:25,416 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:36:25,416 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:36:25,416 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:36:25,416 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:36:25,417 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:36:25,417 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:36:25,436 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-10-04 09:36:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:36:25,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:25,445 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:25,446 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:25,453 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-10-04 09:36:25,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:25,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:25,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:25,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:25,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:25,909 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:36:25,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:25,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:36:25,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:36:25,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:36:25,930 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:25,932 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-10-04 09:36:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:27,740 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-10-04 09:36:27,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:36:27,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 09:36:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:27,760 INFO L225 Difference]: With dead ends: 163 [2018-10-04 09:36:27,760 INFO L226 Difference]: Without dead ends: 158 [2018-10-04 09:36:27,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 7 [2018-10-04 09:36:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-04 09:36:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-10-04 09:36:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-04 09:36:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-10-04 09:36:27,824 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-10-04 09:36:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:27,825 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-10-04 09:36:27,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:36:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-10-04 09:36:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:36:27,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:27,826 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:27,828 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:27,828 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:27,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-10-04 09:36:27,828 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:27,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:27,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:27,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:27,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:27,929 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:36:27,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:27,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:36:27,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:36:27,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:36:27,932 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:27,932 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-10-04 09:36:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:28,872 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-10-04 09:36:28,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:36:28,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 09:36:28,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:28,877 INFO L225 Difference]: With dead ends: 188 [2018-10-04 09:36:28,877 INFO L226 Difference]: Without dead ends: 183 [2018-10-04 09:36:28,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:36:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-04 09:36:28,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-10-04 09:36:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-04 09:36:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-10-04 09:36:28,904 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-10-04 09:36:28,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:28,904 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-10-04 09:36:28,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:36:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-10-04 09:36:28,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:36:28,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:28,906 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:28,907 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:28,907 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:28,907 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-10-04 09:36:28,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:28,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:28,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:28,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:28,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:29,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:36:29,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:29,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:36:29,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:36:29,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:36:29,041 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:29,041 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-10-04 09:36:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:30,640 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-10-04 09:36:30,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:36:30,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-04 09:36:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:30,645 INFO L225 Difference]: With dead ends: 283 [2018-10-04 09:36:30,645 INFO L226 Difference]: Without dead ends: 278 [2018-10-04 09:36:30,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 09:36:30,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-04 09:36:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-10-04 09:36:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-04 09:36:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-10-04 09:36:30,680 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-10-04 09:36:30,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:30,680 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-10-04 09:36:30,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:36:30,680 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-10-04 09:36:30,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:36:30,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:30,682 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:30,683 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:30,683 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:30,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-10-04 09:36:30,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:30,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:30,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:30,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:30,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:30,804 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:36:30,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:30,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:36:30,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:36:30,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:36:30,806 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:30,806 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-10-04 09:36:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:33,094 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-10-04 09:36:33,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:36:33,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-04 09:36:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:33,100 INFO L225 Difference]: With dead ends: 387 [2018-10-04 09:36:33,100 INFO L226 Difference]: Without dead ends: 375 [2018-10-04 09:36:33,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 13 [2018-10-04 09:36:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-04 09:36:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-10-04 09:36:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-04 09:36:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-10-04 09:36:33,164 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-10-04 09:36:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:33,164 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-10-04 09:36:33,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:36:33,165 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-10-04 09:36:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:36:33,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:33,168 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:33,169 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:33,169 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:33,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-10-04 09:36:33,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:33,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:33,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:33,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:33,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:33,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:33,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:36:33,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:36:33,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:36:33,329 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:33,329 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-10-04 09:36:34,234 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 09:36:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:36,536 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-10-04 09:36:36,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:36:36,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:36:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:36,542 INFO L225 Difference]: With dead ends: 725 [2018-10-04 09:36:36,542 INFO L226 Difference]: Without dead ends: 717 [2018-10-04 09:36:36,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 6 [2018-10-04 09:36:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-04 09:36:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-10-04 09:36:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-04 09:36:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-10-04 09:36:36,608 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-10-04 09:36:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:36,609 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-10-04 09:36:36,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:36:36,609 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-10-04 09:36:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:36:36,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:36,611 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:36,611 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:36,612 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:36,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-10-04 09:36:36,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:36,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:36,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:36,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:36,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:36,768 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:36:36,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:36,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:36:36,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:36:36,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:36:36,770 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:36,770 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-10-04 09:36:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:40,889 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-10-04 09:36:40,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:36:40,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:36:40,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:40,897 INFO L225 Difference]: With dead ends: 1008 [2018-10-04 09:36:40,897 INFO L226 Difference]: Without dead ends: 1000 [2018-10-04 09:36:40,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 18 [2018-10-04 09:36:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-10-04 09:36:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-10-04 09:36:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-04 09:36:40,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-10-04 09:36:40,978 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-10-04 09:36:40,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:40,979 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-10-04 09:36:40,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:36:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-10-04 09:36:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:36:40,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:40,981 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:40,981 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:40,981 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:40,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-10-04 09:36:40,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:40,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:40,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:40,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:40,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:41,094 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:36:41,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:41,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:36:41,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:36:41,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:36:41,095 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:41,096 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-10-04 09:36:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:43,632 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-10-04 09:36:43,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 09:36:43,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:36:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:43,639 INFO L225 Difference]: With dead ends: 924 [2018-10-04 09:36:43,640 INFO L226 Difference]: Without dead ends: 916 [2018-10-04 09:36:43,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 18 [2018-10-04 09:36:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-10-04 09:36:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-10-04 09:36:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-04 09:36:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-10-04 09:36:43,737 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-10-04 09:36:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:43,738 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-10-04 09:36:43,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:36:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-10-04 09:36:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:36:43,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:43,739 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:43,740 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:43,740 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:43,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-10-04 09:36:43,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:43,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:43,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:43,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:43,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:43,841 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:36:43,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:43,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:36:43,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:36:43,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:36:43,842 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:43,843 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-10-04 09:36:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:45,707 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-10-04 09:36:45,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:36:45,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:36:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:45,714 INFO L225 Difference]: With dead ends: 791 [2018-10-04 09:36:45,714 INFO L226 Difference]: Without dead ends: 783 [2018-10-04 09:36:45,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 17 [2018-10-04 09:36:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-10-04 09:36:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-10-04 09:36:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-04 09:36:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-10-04 09:36:45,833 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-10-04 09:36:45,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:45,833 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-10-04 09:36:45,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:36:45,834 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-10-04 09:36:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:36:45,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:45,835 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:45,835 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:45,835 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-10-04 09:36:45,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:45,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:45,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:45,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:45,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:46,322 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:36:46,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:46,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:36:46,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:36:46,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:36:46,323 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:46,324 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-10-04 09:36:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:48,534 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-10-04 09:36:48,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 09:36:48,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:36:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:48,541 INFO L225 Difference]: With dead ends: 1040 [2018-10-04 09:36:48,541 INFO L226 Difference]: Without dead ends: 1032 [2018-10-04 09:36:48,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 18 [2018-10-04 09:36:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-10-04 09:36:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-10-04 09:36:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-04 09:36:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-10-04 09:36:48,672 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-10-04 09:36:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:48,673 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-10-04 09:36:48,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:36:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-10-04 09:36:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:36:48,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:48,674 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:48,674 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:48,675 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:48,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-10-04 09:36:48,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:48,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:48,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:48,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:48,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:48,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:36:48,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:48,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:36:48,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:36:48,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:36:48,829 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:48,830 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-10-04 09:36:51,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:51,551 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-10-04 09:36:51,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 09:36:51,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:36:51,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:51,560 INFO L225 Difference]: With dead ends: 1166 [2018-10-04 09:36:51,560 INFO L226 Difference]: Without dead ends: 1158 [2018-10-04 09:36:51,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 19 [2018-10-04 09:36:51,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-10-04 09:36:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-10-04 09:36:51,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-04 09:36:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-10-04 09:36:51,696 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-10-04 09:36:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:51,697 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-10-04 09:36:51,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:36:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-10-04 09:36:51,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:36:51,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:51,698 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:51,699 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:51,699 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:51,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-10-04 09:36:51,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:51,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:51,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:51,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:51,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:51,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:51,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:36:51,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:36:51,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:36:51,793 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:51,794 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-10-04 09:36:54,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:54,274 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-10-04 09:36:54,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 09:36:54,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:36:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:54,281 INFO L225 Difference]: With dead ends: 1127 [2018-10-04 09:36:54,281 INFO L226 Difference]: Without dead ends: 1119 [2018-10-04 09:36:54,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 18 [2018-10-04 09:36:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-10-04 09:36:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-10-04 09:36:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-04 09:36:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-10-04 09:36:54,481 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-10-04 09:36:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:54,481 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-10-04 09:36:54,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:36:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-10-04 09:36:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:36:54,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:54,482 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:54,483 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:54,483 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:54,483 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-10-04 09:36:54,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:54,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:54,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:54,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:54,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:54,689 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:36:54,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:54,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:36:54,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:36:54,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:36:54,690 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:54,691 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-10-04 09:36:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:57,193 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-10-04 09:36:57,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:36:57,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:36:57,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:57,200 INFO L225 Difference]: With dead ends: 975 [2018-10-04 09:36:57,200 INFO L226 Difference]: Without dead ends: 967 [2018-10-04 09:36:57,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 18 [2018-10-04 09:36:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-10-04 09:36:57,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-10-04 09:36:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-04 09:36:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-10-04 09:36:57,358 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-10-04 09:36:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:57,359 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-10-04 09:36:57,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:36:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-10-04 09:36:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:36:57,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:57,361 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:57,361 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:57,361 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:57,361 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-10-04 09:36:57,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:57,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:57,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:57,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:57,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:57,457 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:36:57,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:57,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:36:57,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:36:57,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:36:57,458 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:57,458 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-10-04 09:37:00,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:00,126 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-10-04 09:37:00,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:37:00,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:37:00,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:00,131 INFO L225 Difference]: With dead ends: 1011 [2018-10-04 09:37:00,131 INFO L226 Difference]: Without dead ends: 1003 [2018-10-04 09:37:00,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 18 [2018-10-04 09:37:00,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-10-04 09:37:00,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-10-04 09:37:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-04 09:37:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-10-04 09:37:00,399 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-10-04 09:37:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:00,399 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-10-04 09:37:00,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:37:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-10-04 09:37:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:37:00,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:00,400 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:00,400 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:00,401 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:00,401 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-10-04 09:37:00,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:00,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:00,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:00,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:00,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:00,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:00,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:00,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:37:00,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:37:00,522 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:00,522 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-10-04 09:37:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:02,732 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-10-04 09:37:02,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:37:02,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 09:37:02,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:02,737 INFO L225 Difference]: With dead ends: 859 [2018-10-04 09:37:02,738 INFO L226 Difference]: Without dead ends: 851 [2018-10-04 09:37:02,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 17 [2018-10-04 09:37:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-10-04 09:37:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-10-04 09:37:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-04 09:37:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-10-04 09:37:02,930 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-10-04 09:37:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:02,930 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-10-04 09:37:02,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:37:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-10-04 09:37:02,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:37:02,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:02,931 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:02,931 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:02,931 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:02,931 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-10-04 09:37:02,932 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:02,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:02,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:02,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:03,010 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:37:03,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:03,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:03,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:03,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:03,012 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:03,012 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-10-04 09:37:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:05,476 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-10-04 09:37:05,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:37:05,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:37:05,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:05,481 INFO L225 Difference]: With dead ends: 962 [2018-10-04 09:37:05,481 INFO L226 Difference]: Without dead ends: 954 [2018-10-04 09:37:05,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 09:37:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-10-04 09:37:05,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-10-04 09:37:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-10-04 09:37:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-10-04 09:37:05,711 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-10-04 09:37:05,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:05,711 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-10-04 09:37:05,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-10-04 09:37:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:37:05,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:05,712 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:05,713 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:05,713 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:05,713 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-10-04 09:37:05,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:05,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:05,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:05,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:05,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:05,797 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:37:05,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:05,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:05,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:05,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:05,799 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:05,799 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-10-04 09:37:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:08,560 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-10-04 09:37:08,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 09:37:08,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:37:08,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:08,567 INFO L225 Difference]: With dead ends: 1064 [2018-10-04 09:37:08,567 INFO L226 Difference]: Without dead ends: 1056 [2018-10-04 09:37:08,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-04 09:37:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-10-04 09:37:08,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-10-04 09:37:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-10-04 09:37:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-10-04 09:37:08,882 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-10-04 09:37:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:08,883 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-10-04 09:37:08,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-10-04 09:37:08,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:37:08,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:08,884 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:08,884 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:08,884 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:08,884 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-10-04 09:37:08,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:08,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:08,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:08,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:08,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:08,978 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:37:08,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:08,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:08,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:08,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:08,980 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:08,980 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-10-04 09:37:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:12,338 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-10-04 09:37:12,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 09:37:12,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:37:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:12,344 INFO L225 Difference]: With dead ends: 1241 [2018-10-04 09:37:12,344 INFO L226 Difference]: Without dead ends: 1233 [2018-10-04 09:37:12,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 14 [2018-10-04 09:37:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-10-04 09:37:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-10-04 09:37:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-04 09:37:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-10-04 09:37:12,681 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-10-04 09:37:12,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:12,681 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-10-04 09:37:12,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-10-04 09:37:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:37:12,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:12,683 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:12,683 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:12,683 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:12,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-10-04 09:37:12,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:12,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:12,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:12,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:12,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:12,774 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:37:12,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:12,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:12,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:12,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:12,776 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:12,776 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-10-04 09:37:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:15,172 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-10-04 09:37:15,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:37:15,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:37:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:15,178 INFO L225 Difference]: With dead ends: 1139 [2018-10-04 09:37:15,179 INFO L226 Difference]: Without dead ends: 1131 [2018-10-04 09:37:15,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 15 [2018-10-04 09:37:15,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-10-04 09:37:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-10-04 09:37:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-10-04 09:37:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-10-04 09:37:15,493 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-10-04 09:37:15,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:15,493 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-10-04 09:37:15,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-10-04 09:37:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:37:15,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:15,494 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:15,494 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:15,495 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:15,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-10-04 09:37:15,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:15,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:15,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:15,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:15,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:15,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:15,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:15,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:15,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:15,593 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:15,594 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-10-04 09:37:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:18,774 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-10-04 09:37:18,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:37:18,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:37:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:18,780 INFO L225 Difference]: With dead ends: 1325 [2018-10-04 09:37:18,780 INFO L226 Difference]: Without dead ends: 1317 [2018-10-04 09:37:18,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 16 [2018-10-04 09:37:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-10-04 09:37:19,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-10-04 09:37:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-10-04 09:37:19,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-10-04 09:37:19,093 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-10-04 09:37:19,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:19,093 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-10-04 09:37:19,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-10-04 09:37:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:37:19,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:19,094 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:19,094 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:19,094 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:19,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-10-04 09:37:19,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:19,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:19,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:19,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:19,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:19,167 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:37:19,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:19,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:19,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:19,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:19,169 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:19,169 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-10-04 09:37:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:22,613 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-10-04 09:37:22,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:37:22,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:37:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:22,618 INFO L225 Difference]: With dead ends: 1334 [2018-10-04 09:37:22,619 INFO L226 Difference]: Without dead ends: 1326 [2018-10-04 09:37:22,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 09:37:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-10-04 09:37:22,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-10-04 09:37:22,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-10-04 09:37:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-10-04 09:37:22,942 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-10-04 09:37:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:22,942 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-10-04 09:37:22,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-10-04 09:37:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:37:22,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:22,943 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:22,943 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:22,943 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:22,943 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-10-04 09:37:22,943 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:22,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:22,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:22,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:22,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:23,024 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:37:23,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:23,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:23,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:23,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:23,026 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:23,026 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-10-04 09:37:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:25,039 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-10-04 09:37:25,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:37:25,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:37:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:25,045 INFO L225 Difference]: With dead ends: 919 [2018-10-04 09:37:25,045 INFO L226 Difference]: Without dead ends: 911 [2018-10-04 09:37:25,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 15 [2018-10-04 09:37:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-10-04 09:37:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-10-04 09:37:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-04 09:37:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-10-04 09:37:25,377 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-10-04 09:37:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:25,378 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-10-04 09:37:25,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-10-04 09:37:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:37:25,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:25,378 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:25,379 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:25,379 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:25,379 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-10-04 09:37:25,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:25,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:25,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:25,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:25,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:25,446 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:37:25,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:25,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:25,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:25,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:25,448 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:25,448 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-10-04 09:37:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:28,201 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-10-04 09:37:28,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:37:28,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:37:28,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:28,211 INFO L225 Difference]: With dead ends: 1095 [2018-10-04 09:37:28,211 INFO L226 Difference]: Without dead ends: 1087 [2018-10-04 09:37:28,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 16 [2018-10-04 09:37:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-10-04 09:37:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-10-04 09:37:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-04 09:37:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-10-04 09:37:28,559 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-10-04 09:37:28,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:28,560 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-10-04 09:37:28,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:28,560 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-10-04 09:37:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:37:28,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:28,560 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:28,561 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:28,561 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:28,561 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-10-04 09:37:28,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:28,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:28,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:28,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:28,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:28,631 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:37:28,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:28,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:28,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:28,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:28,633 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:28,633 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-10-04 09:37:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:32,563 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-10-04 09:37:32,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 09:37:32,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:37:32,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:32,568 INFO L225 Difference]: With dead ends: 1304 [2018-10-04 09:37:32,568 INFO L226 Difference]: Without dead ends: 1296 [2018-10-04 09:37:32,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 16 [2018-10-04 09:37:32,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-10-04 09:37:32,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-10-04 09:37:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-10-04 09:37:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-10-04 09:37:32,939 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-10-04 09:37:32,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:32,939 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-10-04 09:37:32,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-10-04 09:37:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:37:32,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:32,941 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:32,941 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:32,941 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:32,941 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-10-04 09:37:32,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:32,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:32,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:32,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:32,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:33,009 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:37:33,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:33,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:33,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:33,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:33,011 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:33,011 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-10-04 09:37:34,158 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 09:37:36,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:36,395 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-10-04 09:37:36,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 09:37:36,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 09:37:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:36,399 INFO L225 Difference]: With dead ends: 1192 [2018-10-04 09:37:36,399 INFO L226 Difference]: Without dead ends: 1184 [2018-10-04 09:37:36,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 09:37:36,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-10-04 09:37:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-10-04 09:37:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-04 09:37:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-10-04 09:37:36,882 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-10-04 09:37:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:36,883 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-10-04 09:37:36,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-10-04 09:37:36,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:37:36,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:36,883 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:36,884 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:36,884 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:36,884 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-10-04 09:37:36,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:36,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:36,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:36,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:36,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:36,929 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:37:36,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:36,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:37:36,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:37:36,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:37:36,950 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:36,950 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-10-04 09:37:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:37,731 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-10-04 09:37:37,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:37:37,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-04 09:37:37,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:37,733 INFO L225 Difference]: With dead ends: 1139 [2018-10-04 09:37:37,734 INFO L226 Difference]: Without dead ends: 625 [2018-10-04 09:37:37,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 09:37:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-10-04 09:37:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-10-04 09:37:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-04 09:37:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-10-04 09:37:38,190 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-10-04 09:37:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:38,190 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-10-04 09:37:38,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:37:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-10-04 09:37:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:37:38,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:38,191 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:38,191 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:38,192 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:38,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-10-04 09:37:38,192 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:38,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:38,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:38,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:38,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:38,315 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:37:38,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:37:38,315 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:37:38,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:38,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:37:39,057 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:37:39,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:37:39,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-04 09:37:39,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 09:37:39,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 09:37:39,080 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:39,081 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-10-04 09:37:42,551 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 09:37:43,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:43,183 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-10-04 09:37:43,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:37:43,183 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-10-04 09:37:43,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:43,185 INFO L225 Difference]: With dead ends: 794 [2018-10-04 09:37:43,185 INFO L226 Difference]: Without dead ends: 789 [2018-10-04 09:37:43,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime 6 [2018-10-04 09:37:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-04 09:37:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-10-04 09:37:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-10-04 09:37:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-10-04 09:37:43,844 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-10-04 09:37:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:43,844 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-10-04 09:37:43,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 09:37:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-10-04 09:37:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:37:43,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:43,844 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:43,845 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:43,845 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:43,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-10-04 09:37:43,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:43,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:43,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:43,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:43,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:43,944 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:37:43,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:43,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:37:43,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:37:43,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:37:43,945 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:43,945 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-10-04 09:37:45,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:45,277 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-10-04 09:37:45,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:37:45,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-04 09:37:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:45,279 INFO L225 Difference]: With dead ends: 1317 [2018-10-04 09:37:45,279 INFO L226 Difference]: Without dead ends: 729 [2018-10-04 09:37:45,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 09:37:45,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-04 09:37:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-10-04 09:37:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-04 09:37:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-10-04 09:37:45,879 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-10-04 09:37:45,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:45,879 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-10-04 09:37:45,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:37:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-10-04 09:37:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:37:45,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:45,880 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:37:45,880 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:45,880 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:45,880 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-10-04 09:37:45,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:45,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:45,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:45,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:45,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:46,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:46,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:46,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:46,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:46,088 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:46,088 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-10-04 09:37:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:49,472 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-10-04 09:37:49,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 09:37:49,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:37:49,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:49,475 INFO L225 Difference]: With dead ends: 1435 [2018-10-04 09:37:49,475 INFO L226 Difference]: Without dead ends: 1427 [2018-10-04 09:37:49,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 14 [2018-10-04 09:37:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-10-04 09:37:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-10-04 09:37:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-04 09:37:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-10-04 09:37:50,344 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-10-04 09:37:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:50,344 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-10-04 09:37:50,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-10-04 09:37:50,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:37:50,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:50,345 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:37:50,346 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:50,346 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:50,346 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-10-04 09:37:50,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:50,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:50,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:50,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:50,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:50,617 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:37:50,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:50,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:50,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:50,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:50,618 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:50,618 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-10-04 09:37:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:54,276 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-10-04 09:37:54,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:37:54,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:37:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:54,281 INFO L225 Difference]: With dead ends: 1599 [2018-10-04 09:37:54,281 INFO L226 Difference]: Without dead ends: 1591 [2018-10-04 09:37:54,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 13 [2018-10-04 09:37:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-04 09:37:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-10-04 09:37:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-04 09:37:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-10-04 09:37:55,063 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-10-04 09:37:55,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:55,063 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-10-04 09:37:55,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-10-04 09:37:55,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:37:55,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:55,064 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:37:55,065 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:55,065 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:55,065 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-10-04 09:37:55,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:55,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:55,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:55,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:55,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:55,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:55,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:55,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:55,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:55,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:55,178 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-10-04 09:37:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:58,290 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-10-04 09:37:58,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:37:58,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:37:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:58,295 INFO L225 Difference]: With dead ends: 1411 [2018-10-04 09:37:58,295 INFO L226 Difference]: Without dead ends: 1403 [2018-10-04 09:37:58,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 13 [2018-10-04 09:37:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-10-04 09:37:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-10-04 09:37:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-10-04 09:37:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-10-04 09:37:59,159 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-10-04 09:37:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:59,159 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-10-04 09:37:59,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-10-04 09:37:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:37:59,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:59,160 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:37:59,160 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:59,160 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:59,161 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-10-04 09:37:59,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:59,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:59,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:59,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:59,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:59,231 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:37:59,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:59,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:37:59,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:59,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:59,232 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:59,232 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-10-04 09:38:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:02,691 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-10-04 09:38:02,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:38:02,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:38:02,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:02,693 INFO L225 Difference]: With dead ends: 1490 [2018-10-04 09:38:02,693 INFO L226 Difference]: Without dead ends: 1482 [2018-10-04 09:38:02,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 09:38:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-10-04 09:38:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-10-04 09:38:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-10-04 09:38:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-10-04 09:38:03,577 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-10-04 09:38:03,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:03,577 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-10-04 09:38:03,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-10-04 09:38:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:38:03,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:03,578 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:38:03,578 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:03,579 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:03,579 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-10-04 09:38:03,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:03,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:03,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:03,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:03,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:03,843 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:38:03,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:03,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:38:03,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:03,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:03,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:03,845 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-10-04 09:38:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:07,130 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-10-04 09:38:07,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:38:07,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:38:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:07,133 INFO L225 Difference]: With dead ends: 1427 [2018-10-04 09:38:07,133 INFO L226 Difference]: Without dead ends: 1419 [2018-10-04 09:38:07,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 14 [2018-10-04 09:38:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-10-04 09:38:08,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-10-04 09:38:08,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-04 09:38:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-10-04 09:38:08,024 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-10-04 09:38:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:08,024 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-10-04 09:38:08,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-10-04 09:38:08,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:38:08,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:08,025 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:38:08,026 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:08,026 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:08,026 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-10-04 09:38:08,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:08,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:08,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:08,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:08,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:08,133 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:38:08,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:08,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:38:08,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:08,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:08,135 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:08,135 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-10-04 09:38:11,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:11,212 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-10-04 09:38:11,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 09:38:11,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:38:11,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:11,215 INFO L225 Difference]: With dead ends: 1306 [2018-10-04 09:38:11,215 INFO L226 Difference]: Without dead ends: 1298 [2018-10-04 09:38:11,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 09:38:11,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-10-04 09:38:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-10-04 09:38:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-04 09:38:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-10-04 09:38:12,220 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-10-04 09:38:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:12,220 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-10-04 09:38:12,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-10-04 09:38:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:38:12,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:12,221 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:12,221 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:12,221 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:12,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-10-04 09:38:12,221 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:12,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:12,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:12,314 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:38:12,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:38:12,315 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:38:12,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:12,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:38:12,454 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:38:12,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:38:12,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:38:12,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:12,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:12,489 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:12,489 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-10-04 09:38:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:15,487 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-10-04 09:38:15,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 09:38:15,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:38:15,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:15,489 INFO L225 Difference]: With dead ends: 1285 [2018-10-04 09:38:15,489 INFO L226 Difference]: Without dead ends: 1277 [2018-10-04 09:38:15,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 18 [2018-10-04 09:38:15,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-10-04 09:38:16,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-10-04 09:38:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-04 09:38:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-10-04 09:38:16,493 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-10-04 09:38:16,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:16,493 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-10-04 09:38:16,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:16,494 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-10-04 09:38:16,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:38:16,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:16,494 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:16,495 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:16,495 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:16,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-10-04 09:38:16,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:16,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:16,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:16,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:16,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:16,592 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:38:16,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:38:16,592 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:38:16,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:16,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:38:16,673 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:38:16,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:38:16,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:38:16,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:16,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:16,702 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:16,702 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-10-04 09:38:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:20,342 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-10-04 09:38:20,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 09:38:20,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:38:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:20,344 INFO L225 Difference]: With dead ends: 1518 [2018-10-04 09:38:20,344 INFO L226 Difference]: Without dead ends: 1510 [2018-10-04 09:38:20,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 18 [2018-10-04 09:38:20,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-04 09:38:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-10-04 09:38:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-10-04 09:38:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-10-04 09:38:21,321 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-10-04 09:38:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:21,321 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-10-04 09:38:21,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-10-04 09:38:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:38:21,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:21,322 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:21,322 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:21,322 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:21,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-10-04 09:38:21,322 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:21,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:21,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:21,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:21,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:21,433 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:38:21,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:38:21,434 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:38:21,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:21,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:38:21,470 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:38:21,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:38:21,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:38:21,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:21,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:21,493 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:21,493 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-10-04 09:38:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:25,037 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-10-04 09:38:25,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:38:25,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:38:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:25,039 INFO L225 Difference]: With dead ends: 1448 [2018-10-04 09:38:25,040 INFO L226 Difference]: Without dead ends: 1440 [2018-10-04 09:38:25,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-04 09:38:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-10-04 09:38:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-10-04 09:38:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-10-04 09:38:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-10-04 09:38:26,021 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-10-04 09:38:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:26,021 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-10-04 09:38:26,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-10-04 09:38:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:38:26,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:26,022 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:26,022 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:26,022 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:26,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-10-04 09:38:26,023 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:26,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:26,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:26,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:26,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:26,721 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:38:26,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:38:26,722 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:38:26,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:26,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:38:26,762 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:38:26,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:38:26,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:38:26,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:26,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:26,784 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:26,784 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-10-04 09:38:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:29,794 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-10-04 09:38:29,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:38:29,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-04 09:38:29,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:29,796 INFO L225 Difference]: With dead ends: 1254 [2018-10-04 09:38:29,796 INFO L226 Difference]: Without dead ends: 1246 [2018-10-04 09:38:29,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 13 [2018-10-04 09:38:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-10-04 09:38:30,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-10-04 09:38:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-10-04 09:38:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-10-04 09:38:30,817 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-10-04 09:38:30,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:30,818 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-10-04 09:38:30,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-10-04 09:38:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:38:30,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:30,819 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:30,819 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:30,819 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:30,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-10-04 09:38:30,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:30,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:30,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:30,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:30,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:30,895 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:38:30,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:38:30,896 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:30,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:30,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:38:31,864 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:38:31,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:38:31,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 09:38:31,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 09:38:31,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 09:38:31,886 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:31,886 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-10-04 09:38:32,736 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 09:38:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:37,474 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-10-04 09:38:37,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 09:38:37,474 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 09:38:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:37,476 INFO L225 Difference]: With dead ends: 1278 [2018-10-04 09:38:37,476 INFO L226 Difference]: Without dead ends: 1270 [2018-10-04 09:38:37,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.4s impTime 15 [2018-10-04 09:38:37,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-10-04 09:38:38,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-10-04 09:38:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-10-04 09:38:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-10-04 09:38:38,527 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-10-04 09:38:38,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:38,528 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-10-04 09:38:38,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 09:38:38,528 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-10-04 09:38:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:38:38,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:38,528 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:38,529 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:38,529 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:38,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-10-04 09:38:38,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:38,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:38,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:38,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:38,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:38,635 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:38:38,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:38,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 09:38:38,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:38:38,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:38:38,636 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:38,636 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-10-04 09:38:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:42,042 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-10-04 09:38:42,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:38:42,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 09:38:42,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:42,045 INFO L225 Difference]: With dead ends: 1180 [2018-10-04 09:38:42,045 INFO L226 Difference]: Without dead ends: 1172 [2018-10-04 09:38:42,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 16 [2018-10-04 09:38:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-10-04 09:38:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-10-04 09:38:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-10-04 09:38:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-10-04 09:38:43,125 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-10-04 09:38:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:43,126 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-10-04 09:38:43,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:38:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-10-04 09:38:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:38:43,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:43,126 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:43,127 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:43,127 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:43,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-10-04 09:38:43,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:43,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:43,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:43,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:43,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:43,619 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:38:43,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:43,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 09:38:43,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:38:43,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:38:43,620 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:43,621 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-10-04 09:38:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:47,292 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-10-04 09:38:47,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:38:47,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 09:38:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:47,294 INFO L225 Difference]: With dead ends: 1233 [2018-10-04 09:38:47,294 INFO L226 Difference]: Without dead ends: 1225 [2018-10-04 09:38:47,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 16 [2018-10-04 09:38:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-10-04 09:38:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-10-04 09:38:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-10-04 09:38:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-10-04 09:38:48,341 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-10-04 09:38:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:48,341 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-10-04 09:38:48,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:38:48,341 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-10-04 09:38:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:38:48,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:48,342 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:38:48,342 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:48,342 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:48,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-10-04 09:38:48,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:48,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:48,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:48,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:48,414 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:38:48,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:48,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 09:38:48,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:38:48,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:38:48,415 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:48,416 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-10-04 09:38:52,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:52,933 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-10-04 09:38:52,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 09:38:52,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 09:38:52,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:52,935 INFO L225 Difference]: With dead ends: 1537 [2018-10-04 09:38:52,935 INFO L226 Difference]: Without dead ends: 1529 [2018-10-04 09:38:52,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 17 [2018-10-04 09:38:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-10-04 09:38:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-10-04 09:38:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-10-04 09:38:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-10-04 09:38:54,071 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-10-04 09:38:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:54,071 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-10-04 09:38:54,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:38:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-10-04 09:38:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:38:54,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:54,072 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:38:54,072 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:54,072 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:54,072 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-10-04 09:38:54,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:54,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:54,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:54,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:54,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:54,151 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:38:54,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:54,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 09:38:54,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:38:54,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:38:54,152 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:54,152 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-10-04 09:38:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:58,943 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-10-04 09:38:58,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 09:38:58,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 09:38:58,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:58,946 INFO L225 Difference]: With dead ends: 1590 [2018-10-04 09:38:58,946 INFO L226 Difference]: Without dead ends: 1582 [2018-10-04 09:38:58,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 16 [2018-10-04 09:38:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-10-04 09:39:00,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-10-04 09:39:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-10-04 09:39:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-10-04 09:39:00,086 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-10-04 09:39:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:39:00,086 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-10-04 09:39:00,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:39:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-10-04 09:39:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:39:00,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:39:00,087 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:39:00,087 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:39:00,087 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:39:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-10-04 09:39:00,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:39:00,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:39:00,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:00,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:00,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:00,160 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:39:00,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:39:00,161 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:39:00,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:00,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:39:00,304 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:39:00,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:39:00,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 09:39:00,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 09:39:00,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 09:39:00,325 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:39:00,325 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-10-04 09:39:00,633 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 09:39:05,980 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 8 [2018-10-04 09:39:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:39:10,463 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-10-04 09:39:10,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-04 09:39:10,463 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 09:39:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:39:10,465 INFO L225 Difference]: With dead ends: 1949 [2018-10-04 09:39:10,466 INFO L226 Difference]: Without dead ends: 1941 [2018-10-04 09:39:10,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.5s impTime 12 [2018-10-04 09:39:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-10-04 09:39:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-10-04 09:39:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-10-04 09:39:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-10-04 09:39:11,782 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-10-04 09:39:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:39:11,783 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-10-04 09:39:11,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 09:39:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-10-04 09:39:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:39:11,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:39:11,783 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:39:11,784 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:39:11,784 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:39:11,784 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-10-04 09:39:11,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:39:11,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:39:11,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:11,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:11,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:11,858 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:39:11,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:39:11,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-04 09:39:11,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:39:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:39:11,859 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:39:11,859 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-10-04 09:39:16,019 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 09:39:16,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:39:16,170 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-10-04 09:39:16,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 09:39:16,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 09:39:16,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:39:16,173 INFO L225 Difference]: With dead ends: 1420 [2018-10-04 09:39:16,173 INFO L226 Difference]: Without dead ends: 1412 [2018-10-04 09:39:16,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 09:39:16,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-10-04 09:39:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-10-04 09:39:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-10-04 09:39:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-10-04 09:39:17,341 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-10-04 09:39:17,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:39:17,341 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-10-04 09:39:17,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:39:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-10-04 09:39:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:39:17,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:39:17,342 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:39:17,342 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:39:17,342 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:39:17,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-10-04 09:39:17,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:39:17,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:39:17,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:17,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:17,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:17,414 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:39:17,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:39:17,415 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:39:17,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:17,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:39:17,584 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:39:17,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:39:17,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 09:39:17,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 09:39:17,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 09:39:17,607 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:39:17,607 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-10-04 09:39:17,915 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 09:39:26,219 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 09:39:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:39:31,703 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-10-04 09:39:31,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-04 09:39:31,703 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 09:39:31,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:39:31,706 INFO L225 Difference]: With dead ends: 2767 [2018-10-04 09:39:31,706 INFO L226 Difference]: Without dead ends: 2759 [2018-10-04 09:39:31,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 2.3s impTime 13 [2018-10-04 09:39:31,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-10-04 09:39:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-10-04 09:39:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-10-04 09:39:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-10-04 09:39:33,113 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-10-04 09:39:33,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:39:33,113 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-10-04 09:39:33,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 09:39:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-10-04 09:39:33,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:39:33,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:39:33,114 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:39:33,115 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:39:33,115 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:39:33,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-10-04 09:39:33,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:39:33,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:39:33,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:33,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:33,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:33,214 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:39:33,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:39:33,214 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:39:33,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:33,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:39:33,343 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:39:33,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:39:33,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 09:39:33,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 09:39:33,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 09:39:33,366 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:39:33,366 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-10-04 09:39:33,471 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 8 [2018-10-04 09:39:34,491 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 24 new depth: 8 [2018-10-04 09:39:38,543 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 26 new depth: 9 [2018-10-04 09:39:42,616 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 26 new depth: 11 [2018-10-04 09:39:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:39:47,598 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-10-04 09:39:47,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-04 09:39:47,598 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 09:39:47,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:39:47,601 INFO L225 Difference]: With dead ends: 2361 [2018-10-04 09:39:47,601 INFO L226 Difference]: Without dead ends: 2353 [2018-10-04 09:39:47,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s Time 3.1s impTime 19 [2018-10-04 09:39:47,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-10-04 09:39:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-10-04 09:39:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-10-04 09:39:49,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-10-04 09:39:49,110 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-10-04 09:39:49,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:39:49,110 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-10-04 09:39:49,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 09:39:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-10-04 09:39:49,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:39:49,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:39:49,111 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:39:49,111 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:39:49,111 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:39:49,112 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-10-04 09:39:49,112 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:39:49,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:39:49,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:49,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:49,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:49,236 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:39:49,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:39:49,236 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:39:49,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:49,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:39:49,317 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:39:49,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:39:49,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-04 09:39:49,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 09:39:49,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 09:39:49,338 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:39:49,338 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-10-04 09:39:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:39:52,282 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-10-04 09:39:52,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:39:52,283 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-10-04 09:39:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:39:52,284 INFO L225 Difference]: With dead ends: 1507 [2018-10-04 09:39:52,284 INFO L226 Difference]: Without dead ends: 1502 [2018-10-04 09:39:52,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 14 [2018-10-04 09:39:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-10-04 09:39:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-10-04 09:39:54,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-10-04 09:39:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-10-04 09:39:54,096 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-10-04 09:39:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:39:54,096 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-10-04 09:39:54,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 09:39:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-10-04 09:39:54,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:39:54,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:39:54,098 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:39:54,098 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:39:54,098 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:39:54,098 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-10-04 09:39:54,098 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:39:54,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:39:54,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:54,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:54,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:54,196 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:39:54,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:39:54,197 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:39:54,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:54,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:39:54,381 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:39:54,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:39:54,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-10-04 09:39:54,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 09:39:54,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 09:39:54,404 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:39:54,404 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-10-04 09:39:54,744 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 09:40:04,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:04,773 INFO L93 Difference]: Finished difference Result 3662 states and 8082 transitions. [2018-10-04 09:40:04,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 09:40:04,774 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-10-04 09:40:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:04,777 INFO L225 Difference]: With dead ends: 3662 [2018-10-04 09:40:04,777 INFO L226 Difference]: Without dead ends: 3654 [2018-10-04 09:40:04,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 20 [2018-10-04 09:40:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2018-10-04 09:40:07,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 2136. [2018-10-04 09:40:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-10-04 09:40:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-10-04 09:40:07,621 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-10-04 09:40:07,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:07,621 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-10-04 09:40:07,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 09:40:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-10-04 09:40:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:40:07,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:07,622 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:40:07,622 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:07,622 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:07,622 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-10-04 09:40:07,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:07,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:07,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:07,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:07,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:07,725 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:40:07,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:07,725 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:40:07,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:07,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:07,800 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:40:07,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:07,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 09:40:07,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:40:07,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:40:07,821 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:07,821 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-10-04 09:40:13,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:13,267 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-10-04 09:40:13,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:40:13,267 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 09:40:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:13,271 INFO L225 Difference]: With dead ends: 2767 [2018-10-04 09:40:13,271 INFO L226 Difference]: Without dead ends: 2759 [2018-10-04 09:40:13,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 18 [2018-10-04 09:40:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-10-04 09:40:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-10-04 09:40:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-10-04 09:40:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-10-04 09:40:16,322 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-10-04 09:40:16,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:16,322 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-10-04 09:40:16,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:40:16,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-10-04 09:40:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:40:16,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:16,324 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:40:16,324 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:16,324 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:16,324 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-10-04 09:40:16,324 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:16,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:16,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:16,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:16,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:16,536 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:40:16,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:16,537 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:40:16,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:16,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:16,590 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:40:16,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:16,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 09:40:16,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:40:16,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:40:16,613 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:16,613 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-10-04 09:40:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:22,769 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-10-04 09:40:22,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:40:22,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 09:40:22,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:22,773 INFO L225 Difference]: With dead ends: 3146 [2018-10-04 09:40:22,773 INFO L226 Difference]: Without dead ends: 3138 [2018-10-04 09:40:22,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 18 [2018-10-04 09:40:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-10-04 09:40:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-10-04 09:40:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-10-04 09:40:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-10-04 09:40:25,754 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-10-04 09:40:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:25,754 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-10-04 09:40:25,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:40:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-10-04 09:40:25,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:40:25,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:25,755 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:40:25,755 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:25,755 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:25,756 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-10-04 09:40:25,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:25,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:25,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:25,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:25,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:25,875 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:40:25,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:25,876 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) [2018-10-04 09:40:25,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:40:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:25,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:25,987 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:40:26,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:26,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 09:40:26,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:40:26,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:40:26,009 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:26,009 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-10-04 09:40:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:32,714 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-10-04 09:40:32,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 09:40:32,714 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 09:40:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:32,718 INFO L225 Difference]: With dead ends: 3089 [2018-10-04 09:40:32,718 INFO L226 Difference]: Without dead ends: 3081 [2018-10-04 09:40:32,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 18 [2018-10-04 09:40:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-10-04 09:40:35,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-10-04 09:40:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-10-04 09:40:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-10-04 09:40:35,710 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-10-04 09:40:35,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:35,710 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-10-04 09:40:35,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:40:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-10-04 09:40:35,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:40:35,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:35,712 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:35,712 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:35,712 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:35,712 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-10-04 09:40:35,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:35,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:35,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:35,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:35,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:35,857 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:40:35,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:35,858 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:40:35,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:35,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:35,919 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:40:35,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:35,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-04 09:40:35,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:40:35,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:40:35,941 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:35,941 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. [2018-10-04 09:40:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:42,499 INFO L93 Difference]: Finished difference Result 3266 states and 7250 transitions. [2018-10-04 09:40:42,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:40:42,500 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 09:40:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:42,504 INFO L225 Difference]: With dead ends: 3266 [2018-10-04 09:40:42,505 INFO L226 Difference]: Without dead ends: 3258 [2018-10-04 09:40:42,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 18 [2018-10-04 09:40:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. Received shutdown request... [2018-10-04 09:40:45,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2328. [2018-10-04 09:40:45,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2328 states. [2018-10-04 09:40:45,600 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 09:40:45,605 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 09:40:45,605 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:40:45 BoogieIcfgContainer [2018-10-04 09:40:45,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:40:45,606 INFO L168 Benchmark]: Toolchain (without parser) took 261348.61 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 848.8 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -875.0 kB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-04 09:40:45,608 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:40:45,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.01 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:40:45,609 INFO L168 Benchmark]: Boogie Preprocessor took 59.42 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:40:45,610 INFO L168 Benchmark]: RCFGBuilder took 966.11 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:40:45,610 INFO L168 Benchmark]: TraceAbstraction took 260268.99 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 848.8 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -32.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-04 09:40:45,619 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.01 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 59.42 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 966.11 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 260268.99 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 848.8 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -32.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 260.1s OverallTime, 52 OverallIterations, 2 TraceHistogramMax, 205.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13611 SDtfs, 44011 SDslu, 48460 SDs, 0 SdLazy, 100108 SolverSat, 9484 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 91.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1735 GetRequests, 221 SyntacticMatches, 4 SemanticMatches, 1510 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2248occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 43.5s AutomataMinimizationTime, 52 MinimizatonAttempts, 27184 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 917 ConstructedInterpolants, 0 QuantifiedInterpolants, 48028 SizeOfPredicates, 77 NumberOfNonLiveVariables, 645 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 67 InterpolantComputations, 37 PerfectInterpolantSequences, 43/111 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-40-45-633.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-40-45-633.csv Completed graceful shutdown