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_product.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:03:31,073 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:03:31,075 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:03:31,087 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:03:31,088 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:03:31,089 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:03:31,090 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:03:31,092 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:03:31,093 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:03:31,094 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:03:31,095 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:03:31,095 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:03:31,096 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:03:31,097 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:03:31,099 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:03:31,099 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:03:31,100 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:03:31,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:03:31,111 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:03:31,113 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:03:31,115 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:03:31,119 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:03:31,122 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:03:31,122 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:03:31,122 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:03:31,123 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:03:31,126 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:03:31,127 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:03:31,128 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:03:31,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:03:31,133 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:03:31,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:03:31,134 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:03:31,134 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:03:31,135 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:03:31,137 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:03:31,137 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-02 12:03:31,165 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:03:31,165 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:03:31,166 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:03:31,166 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:03:31,167 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:03:31,167 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:03:31,167 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:03:31,167 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:03:31,168 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:03:31,168 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:03:31,168 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:03:31,168 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:03:31,168 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:03:31,169 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:03:31,169 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:03:31,169 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:03:31,169 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:03:31,169 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:03:31,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:03:31,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:03:31,170 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:03:31,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:03:31,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:03:31,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:03:31,171 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:03:31,171 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:03:31,171 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:03:31,171 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:03:31,172 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:03:31,172 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:03:31,172 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:03:31,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:03:31,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:03:31,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:03:31,246 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:03:31,246 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:03:31,247 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2018-10-02 12:03:31,247 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-10-02 12:03:31,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:03:31,304 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:03:31,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:03:31,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:03:31,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:03:31,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:31" (1/1) ... [2018-10-02 12:03:31,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:31" (1/1) ... [2018-10-02 12:03:31,344 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 12:03:31,344 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 12:03:31,344 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 12:03:31,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:03:31,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:03:31,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:03:31,348 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:03:31,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:31" (1/1) ... [2018-10-02 12:03:31,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:31" (1/1) ... [2018-10-02 12:03:31,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:31" (1/1) ... [2018-10-02 12:03:31,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:31" (1/1) ... [2018-10-02 12:03:31,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:31" (1/1) ... [2018-10-02 12:03:31,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:31" (1/1) ... [2018-10-02 12:03:31,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:31" (1/1) ... [2018-10-02 12:03:31,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:03:31,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:03:31,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:03:31,371 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:03:31,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:03:31,444 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-02 12:03:31,445 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-02 12:03:31,445 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-02 12:03:31,993 INFO L337 CfgBuilder]: Using library mode [2018-10-02 12:03:31,994 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:31 BoogieIcfgContainer [2018-10-02 12:03:31,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:03:31,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:03:31,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:03:31,998 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:03:31,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:31" (1/2) ... [2018-10-02 12:03:32,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7911f2b9 and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:03:31, skipping insertion in model container [2018-10-02 12:03:32,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:31" (2/2) ... [2018-10-02 12:03:32,002 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-10-02 12:03:32,012 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:03:32,021 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-02 12:03:32,066 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:03:32,066 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:03:32,067 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:03:32,067 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:03:32,067 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:03:32,067 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:03:32,067 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:03:32,067 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:03:32,067 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:03:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-02 12:03:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 12:03:32,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:32,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 12:03:32,089 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:32,095 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:32,095 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-10-02 12:03:32,098 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:32,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:32,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:32,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:32,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:32,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:32,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:32,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:03:32,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:03:32,322 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:32,324 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-10-02 12:03:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:34,061 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-10-02 12:03:34,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 12:03:34,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-02 12:03:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:34,082 INFO L225 Difference]: With dead ends: 49 [2018-10-02 12:03:34,083 INFO L226 Difference]: Without dead ends: 47 [2018-10-02 12:03:34,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:03:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-02 12:03:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-10-02 12:03:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-02 12:03:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-10-02 12:03:34,128 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-10-02 12:03:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:34,128 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-10-02 12:03:34,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:03:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-10-02 12:03:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 12:03:34,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:34,130 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 12:03:34,130 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:34,131 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:34,131 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-10-02 12:03:34,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:34,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:34,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:34,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:34,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:34,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:34,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:03:34,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:03:34,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:03:34,206 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:34,206 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-10-02 12:03:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:34,877 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-10-02 12:03:34,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 12:03:34,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-02 12:03:34,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:34,880 INFO L225 Difference]: With dead ends: 57 [2018-10-02 12:03:34,881 INFO L226 Difference]: Without dead ends: 55 [2018-10-02 12:03:34,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:03:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-02 12:03:34,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-10-02 12:03:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-02 12:03:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-10-02 12:03:34,896 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-10-02 12:03:34,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:34,897 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-10-02 12:03:34,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:03:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-10-02 12:03:34,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 12:03:34,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:34,898 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:34,900 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:34,900 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:34,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-10-02 12:03:34,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:34,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:34,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:34,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:34,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:35,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-02 12:03:35,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:35,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:03:35,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:03:35,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:03:35,012 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:35,012 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-10-02 12:03:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:36,492 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-10-02 12:03:36,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 12:03:36,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-02 12:03:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:36,496 INFO L225 Difference]: With dead ends: 84 [2018-10-02 12:03:36,496 INFO L226 Difference]: Without dead ends: 82 [2018-10-02 12:03:36,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:03:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-02 12:03:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-10-02 12:03:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-02 12:03:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-10-02 12:03:36,510 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-10-02 12:03:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:36,511 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-10-02 12:03:36,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:03:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-10-02 12:03:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 12:03:36,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:36,512 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-02 12:03:36,513 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:36,513 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:36,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-10-02 12:03:36,513 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:36,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:36,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:36,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:36,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:36,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:36,976 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-02 12:03:36,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:37,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:37,117 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-02 12:03:37,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:03:37,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-02 12:03:37,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:03:37,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:03:37,140 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:37,140 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 9 states. [2018-10-02 12:03:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:38,981 INFO L93 Difference]: Finished difference Result 142 states and 245 transitions. [2018-10-02 12:03:38,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 12:03:38,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2018-10-02 12:03:38,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:38,984 INFO L225 Difference]: With dead ends: 142 [2018-10-02 12:03:38,984 INFO L226 Difference]: Without dead ends: 108 [2018-10-02 12:03:38,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime [2018-10-02 12:03:38,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-02 12:03:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 73. [2018-10-02 12:03:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-02 12:03:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2018-10-02 12:03:39,001 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 120 transitions. Word has length 7 [2018-10-02 12:03:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:39,001 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 120 transitions. [2018-10-02 12:03:39,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:03:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 120 transitions. [2018-10-02 12:03:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 12:03:39,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:39,002 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:39,003 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:39,003 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:39,003 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-10-02 12:03:39,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:39,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:39,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:39,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:39,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:39,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:39,131 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-02 12:03:39,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:39,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:39,204 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-02 12:03:39,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:03:39,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2018-10-02 12:03:39,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 12:03:39,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 12:03:39,227 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:39,227 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. Second operand 11 states. [2018-10-02 12:03:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:41,643 INFO L93 Difference]: Finished difference Result 148 states and 240 transitions. [2018-10-02 12:03:41,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 12:03:41,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2018-10-02 12:03:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:41,645 INFO L225 Difference]: With dead ends: 148 [2018-10-02 12:03:41,645 INFO L226 Difference]: Without dead ends: 97 [2018-10-02 12:03:41,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:03:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-02 12:03:41,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-10-02 12:03:41,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-02 12:03:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2018-10-02 12:03:41,662 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 9 [2018-10-02 12:03:41,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:41,663 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2018-10-02 12:03:41,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 12:03:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2018-10-02 12:03:41,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:03:41,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:41,664 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:41,664 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:41,665 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:41,665 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-10-02 12:03:41,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:41,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:41,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:41,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:41,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:41,762 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-02 12:03:41,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:41,763 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-02 12:03:41,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:41,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:41,840 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-02 12:03:41,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:03:41,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 12:03:41,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:03:41,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:03:41,861 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:41,861 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand 14 states. [2018-10-02 12:03:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:44,598 INFO L93 Difference]: Finished difference Result 124 states and 193 transitions. [2018-10-02 12:03:44,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 12:03:44,599 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-02 12:03:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:44,601 INFO L225 Difference]: With dead ends: 124 [2018-10-02 12:03:44,601 INFO L226 Difference]: Without dead ends: 123 [2018-10-02 12:03:44,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime [2018-10-02 12:03:44,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-02 12:03:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2018-10-02 12:03:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-02 12:03:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 173 transitions. [2018-10-02 12:03:44,633 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 173 transitions. Word has length 10 [2018-10-02 12:03:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:44,633 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 173 transitions. [2018-10-02 12:03:44,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:03:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 173 transitions. [2018-10-02 12:03:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:03:44,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:44,637 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:44,637 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:44,638 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:44,638 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-10-02 12:03:44,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:44,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:44,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:44,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:44,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:44,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:03:44,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:03:44,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:03:44,751 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:44,751 INFO L87 Difference]: Start difference. First operand 107 states and 173 transitions. Second operand 8 states. [2018-10-02 12:03:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:46,008 INFO L93 Difference]: Finished difference Result 132 states and 203 transitions. [2018-10-02 12:03:46,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 12:03:46,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-02 12:03:46,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:46,016 INFO L225 Difference]: With dead ends: 132 [2018-10-02 12:03:46,016 INFO L226 Difference]: Without dead ends: 130 [2018-10-02 12:03:46,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:03:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-02 12:03:46,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2018-10-02 12:03:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-02 12:03:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 196 transitions. [2018-10-02 12:03:46,049 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 196 transitions. Word has length 10 [2018-10-02 12:03:46,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:46,050 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 196 transitions. [2018-10-02 12:03:46,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:03:46,050 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 196 transitions. [2018-10-02 12:03:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:03:46,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:46,051 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:46,051 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:46,053 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:46,054 INFO L82 PathProgramCache]: Analyzing trace with hash -176034144, now seen corresponding path program 1 times [2018-10-02 12:03:46,054 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:46,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:46,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:46,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:46,136 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-02 12:03:46,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:46,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:46,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:03:46,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-02 12:03:46,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:03:46,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:03:46,539 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:46,539 INFO L87 Difference]: Start difference. First operand 121 states and 196 transitions. Second operand 14 states. [2018-10-02 12:03:49,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:49,423 INFO L93 Difference]: Finished difference Result 162 states and 262 transitions. [2018-10-02 12:03:49,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:03:49,423 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-02 12:03:49,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:49,425 INFO L225 Difference]: With dead ends: 162 [2018-10-02 12:03:49,425 INFO L226 Difference]: Without dead ends: 160 [2018-10-02 12:03:49,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime [2018-10-02 12:03:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-02 12:03:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2018-10-02 12:03:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-02 12:03:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 209 transitions. [2018-10-02 12:03:49,447 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 209 transitions. Word has length 10 [2018-10-02 12:03:49,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:49,447 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 209 transitions. [2018-10-02 12:03:49,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:03:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 209 transitions. [2018-10-02 12:03:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:03:49,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:49,449 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:49,449 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:49,449 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-10-02 12:03:49,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:49,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:49,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:49,785 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-02 12:03:49,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:49,786 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-02 12:03:49,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:49,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:49,879 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-02 12:03:49,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:03:49,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-02 12:03:49,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:03:49,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:03:49,902 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:49,902 INFO L87 Difference]: Start difference. First operand 129 states and 209 transitions. Second operand 13 states. [2018-10-02 12:03:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:53,631 INFO L93 Difference]: Finished difference Result 223 states and 343 transitions. [2018-10-02 12:03:53,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 12:03:53,632 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-10-02 12:03:53,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:53,634 INFO L225 Difference]: With dead ends: 223 [2018-10-02 12:03:53,634 INFO L226 Difference]: Without dead ends: 221 [2018-10-02 12:03:53,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime [2018-10-02 12:03:53,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-02 12:03:53,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 167. [2018-10-02 12:03:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-02 12:03:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 274 transitions. [2018-10-02 12:03:53,658 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 274 transitions. Word has length 10 [2018-10-02 12:03:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:53,658 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 274 transitions. [2018-10-02 12:03:53,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:03:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 274 transitions. [2018-10-02 12:03:53,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:03:53,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:53,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:53,660 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:53,660 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:53,660 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-10-02 12:03:53,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:53,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:53,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:53,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:53,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:53,733 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-02 12:03:53,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:53,734 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-02 12:03:53,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:53,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:53,829 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-02 12:03:53,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:03:53,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 12:03:53,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:03:53,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:03:53,851 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:53,852 INFO L87 Difference]: Start difference. First operand 167 states and 274 transitions. Second operand 14 states. [2018-10-02 12:03:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:56,246 INFO L93 Difference]: Finished difference Result 222 states and 351 transitions. [2018-10-02 12:03:56,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 12:03:56,247 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-02 12:03:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:56,248 INFO L225 Difference]: With dead ends: 222 [2018-10-02 12:03:56,248 INFO L226 Difference]: Without dead ends: 221 [2018-10-02 12:03:56,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:03:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-02 12:03:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 181. [2018-10-02 12:03:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-02 12:03:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 297 transitions. [2018-10-02 12:03:56,276 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 297 transitions. Word has length 10 [2018-10-02 12:03:56,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:56,277 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 297 transitions. [2018-10-02 12:03:56,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:03:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 297 transitions. [2018-10-02 12:03:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:03:56,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:56,278 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:56,278 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:56,283 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:56,283 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-10-02 12:03:56,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:56,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:56,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:56,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:56,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:56,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:56,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:03:56,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:03:56,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:03:56,388 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:56,389 INFO L87 Difference]: Start difference. First operand 181 states and 297 transitions. Second operand 8 states. [2018-10-02 12:03:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:57,473 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2018-10-02 12:03:57,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 12:03:57,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-02 12:03:57,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:57,475 INFO L225 Difference]: With dead ends: 203 [2018-10-02 12:03:57,475 INFO L226 Difference]: Without dead ends: 201 [2018-10-02 12:03:57,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:03:57,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-02 12:03:57,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2018-10-02 12:03:57,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-02 12:03:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 301 transitions. [2018-10-02 12:03:57,499 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 301 transitions. Word has length 10 [2018-10-02 12:03:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:57,500 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 301 transitions. [2018-10-02 12:03:57,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:03:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 301 transitions. [2018-10-02 12:03:57,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:03:57,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:57,501 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:57,501 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:57,501 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:57,501 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-10-02 12:03:57,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:57,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:57,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:57,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:57,658 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-02 12:03:57,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:57,658 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-02 12:03:57,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:57,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:57,754 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-02 12:03:57,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:03:57,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 12:03:57,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:03:57,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:03:57,777 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:57,777 INFO L87 Difference]: Start difference. First operand 183 states and 301 transitions. Second operand 14 states. [2018-10-02 12:03:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:59,802 INFO L93 Difference]: Finished difference Result 241 states and 385 transitions. [2018-10-02 12:03:59,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 12:03:59,810 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-02 12:03:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:59,811 INFO L225 Difference]: With dead ends: 241 [2018-10-02 12:03:59,811 INFO L226 Difference]: Without dead ends: 240 [2018-10-02 12:03:59,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime [2018-10-02 12:03:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-02 12:03:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2018-10-02 12:03:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-02 12:03:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 336 transitions. [2018-10-02 12:03:59,840 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 336 transitions. Word has length 10 [2018-10-02 12:03:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:59,841 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 336 transitions. [2018-10-02 12:03:59,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:03:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 336 transitions. [2018-10-02 12:03:59,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:03:59,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:59,842 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:59,842 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:59,842 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:59,842 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-10-02 12:03:59,842 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:59,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:59,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:59,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:59,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:59,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:59,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:03:59,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:03:59,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:03:59,926 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:59,927 INFO L87 Difference]: Start difference. First operand 202 states and 336 transitions. Second operand 8 states. [2018-10-02 12:04:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:00,924 INFO L93 Difference]: Finished difference Result 220 states and 353 transitions. [2018-10-02 12:04:00,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 12:04:00,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-02 12:04:00,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:00,926 INFO L225 Difference]: With dead ends: 220 [2018-10-02 12:04:00,926 INFO L226 Difference]: Without dead ends: 218 [2018-10-02 12:04:00,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:04:00,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-02 12:04:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2018-10-02 12:04:00,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-02 12:04:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2018-10-02 12:04:00,950 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 10 [2018-10-02 12:04:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:00,950 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2018-10-02 12:04:00,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2018-10-02 12:04:00,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:04:00,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:00,951 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:00,951 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:00,951 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:00,952 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-10-02 12:04:00,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:00,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:00,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:00,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:00,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:01,007 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-02 12:04:01,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:01,008 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-02 12:04:01,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:01,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:01,138 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-02 12:04:01,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:01,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-02 12:04:01,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:01,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:01,161 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:01,162 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand 13 states. [2018-10-02 12:04:05,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:05,006 INFO L93 Difference]: Finished difference Result 320 states and 507 transitions. [2018-10-02 12:04:05,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 12:04:05,007 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-10-02 12:04:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:05,010 INFO L225 Difference]: With dead ends: 320 [2018-10-02 12:04:05,010 INFO L226 Difference]: Without dead ends: 318 [2018-10-02 12:04:05,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime [2018-10-02 12:04:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-02 12:04:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 259. [2018-10-02 12:04:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-02 12:04:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 430 transitions. [2018-10-02 12:04:05,055 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 430 transitions. Word has length 10 [2018-10-02 12:04:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:05,055 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 430 transitions. [2018-10-02 12:04:05,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:04:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 430 transitions. [2018-10-02 12:04:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:04:05,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:05,056 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:05,056 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:05,057 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:05,057 INFO L82 PathProgramCache]: Analyzing trace with hash -981870889, now seen corresponding path program 1 times [2018-10-02 12:04:05,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:05,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:05,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:05,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:05,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:05,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:05,149 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-02 12:04:05,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:05,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:05,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:05,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-02 12:04:05,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:04:05,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:04:05,296 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:05,296 INFO L87 Difference]: Start difference. First operand 259 states and 430 transitions. Second operand 14 states. [2018-10-02 12:04:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:06,741 INFO L93 Difference]: Finished difference Result 304 states and 503 transitions. [2018-10-02 12:04:06,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:04:06,742 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-02 12:04:06,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:06,743 INFO L225 Difference]: With dead ends: 304 [2018-10-02 12:04:06,743 INFO L226 Difference]: Without dead ends: 302 [2018-10-02 12:04:06,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:04:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-02 12:04:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 270. [2018-10-02 12:04:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-02 12:04:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 448 transitions. [2018-10-02 12:04:06,784 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 448 transitions. Word has length 10 [2018-10-02 12:04:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:06,785 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 448 transitions. [2018-10-02 12:04:06,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:04:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 448 transitions. [2018-10-02 12:04:06,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:04:06,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:06,786 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:06,786 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:06,786 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:06,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-10-02 12:04:06,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:06,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:06,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:06,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:06,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:06,858 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-02 12:04:06,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:06,859 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-02 12:04:06,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:06,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:06,994 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-02 12:04:07,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:07,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 12:04:07,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:04:07,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:04:07,017 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:07,017 INFO L87 Difference]: Start difference. First operand 270 states and 448 transitions. Second operand 14 states. [2018-10-02 12:04:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:08,854 INFO L93 Difference]: Finished difference Result 281 states and 455 transitions. [2018-10-02 12:04:08,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 12:04:08,854 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-02 12:04:08,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:08,856 INFO L225 Difference]: With dead ends: 281 [2018-10-02 12:04:08,856 INFO L226 Difference]: Without dead ends: 280 [2018-10-02 12:04:08,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:04:08,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-02 12:04:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2018-10-02 12:04:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-02 12:04:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 447 transitions. [2018-10-02 12:04:08,903 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 447 transitions. Word has length 10 [2018-10-02 12:04:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:08,904 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 447 transitions. [2018-10-02 12:04:08,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:04:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 447 transitions. [2018-10-02 12:04:08,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:04:08,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:08,905 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:08,905 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:08,905 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:08,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-10-02 12:04:08,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:08,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:08,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:08,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:08,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:09,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:09,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:04:09,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:09,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:09,363 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:09,363 INFO L87 Difference]: Start difference. First operand 270 states and 447 transitions. Second operand 8 states. [2018-10-02 12:04:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:10,286 INFO L93 Difference]: Finished difference Result 286 states and 460 transitions. [2018-10-02 12:04:10,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 12:04:10,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-02 12:04:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:10,291 INFO L225 Difference]: With dead ends: 286 [2018-10-02 12:04:10,291 INFO L226 Difference]: Without dead ends: 284 [2018-10-02 12:04:10,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime [2018-10-02 12:04:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-02 12:04:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2018-10-02 12:04:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-02 12:04:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 443 transitions. [2018-10-02 12:04:10,337 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 443 transitions. Word has length 10 [2018-10-02 12:04:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:10,338 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 443 transitions. [2018-10-02 12:04:10,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 443 transitions. [2018-10-02 12:04:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:04:10,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:10,339 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:10,339 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:10,339 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:10,340 INFO L82 PathProgramCache]: Analyzing trace with hash 240543358, now seen corresponding path program 1 times [2018-10-02 12:04:10,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:10,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:10,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:11,284 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-02 12:04:11,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:11,284 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-02 12:04:11,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:11,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:11,597 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-02 12:04:11,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:11,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-02 12:04:11,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:04:11,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:04:11,620 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:11,621 INFO L87 Difference]: Start difference. First operand 268 states and 443 transitions. Second operand 16 states. [2018-10-02 12:04:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:15,364 INFO L93 Difference]: Finished difference Result 515 states and 842 transitions. [2018-10-02 12:04:15,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 12:04:15,364 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-10-02 12:04:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:15,366 INFO L225 Difference]: With dead ends: 515 [2018-10-02 12:04:15,366 INFO L226 Difference]: Without dead ends: 513 [2018-10-02 12:04:15,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.1s impTime [2018-10-02 12:04:15,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-02 12:04:15,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 338. [2018-10-02 12:04:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-02 12:04:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 568 transitions. [2018-10-02 12:04:15,434 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 568 transitions. Word has length 12 [2018-10-02 12:04:15,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:15,435 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 568 transitions. [2018-10-02 12:04:15,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:04:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 568 transitions. [2018-10-02 12:04:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:04:15,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:15,436 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:15,436 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:15,436 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:15,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1525011273, now seen corresponding path program 1 times [2018-10-02 12:04:15,436 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:15,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:15,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:15,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:15,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:15,594 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-02 12:04:15,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:15,595 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-02 12:04:15,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:15,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:15,675 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-02 12:04:15,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:15,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-02 12:04:15,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:04:15,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:04:15,698 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:15,698 INFO L87 Difference]: Start difference. First operand 338 states and 568 transitions. Second operand 16 states. [2018-10-02 12:04:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:19,393 INFO L93 Difference]: Finished difference Result 631 states and 1050 transitions. [2018-10-02 12:04:19,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 12:04:19,393 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-10-02 12:04:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:19,396 INFO L225 Difference]: With dead ends: 631 [2018-10-02 12:04:19,396 INFO L226 Difference]: Without dead ends: 629 [2018-10-02 12:04:19,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime [2018-10-02 12:04:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-02 12:04:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 403. [2018-10-02 12:04:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-02 12:04:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 685 transitions. [2018-10-02 12:04:19,488 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 685 transitions. Word has length 12 [2018-10-02 12:04:19,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:19,488 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 685 transitions. [2018-10-02 12:04:19,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:04:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 685 transitions. [2018-10-02 12:04:19,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:04:19,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:19,489 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:19,489 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:19,490 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:19,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-10-02 12:04:19,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:19,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:19,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:19,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:19,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:19,608 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-02 12:04:19,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:19,609 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-02 12:04:19,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:19,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:19,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:04:19,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-02 12:04:19,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:04:19,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:04:19,701 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:19,701 INFO L87 Difference]: Start difference. First operand 403 states and 685 transitions. Second operand 14 states. [2018-10-02 12:04:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:24,396 INFO L93 Difference]: Finished difference Result 1330 states and 2225 transitions. [2018-10-02 12:04:24,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-02 12:04:24,396 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-02 12:04:24,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:24,400 INFO L225 Difference]: With dead ends: 1330 [2018-10-02 12:04:24,400 INFO L226 Difference]: Without dead ends: 929 [2018-10-02 12:04:24,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime [2018-10-02 12:04:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-10-02 12:04:24,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 694. [2018-10-02 12:04:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-10-02 12:04:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1171 transitions. [2018-10-02 12:04:24,535 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1171 transitions. Word has length 13 [2018-10-02 12:04:24,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:24,535 INFO L480 AbstractCegarLoop]: Abstraction has 694 states and 1171 transitions. [2018-10-02 12:04:24,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:04:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1171 transitions. [2018-10-02 12:04:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:04:24,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:24,536 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:24,537 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:24,537 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:24,537 INFO L82 PathProgramCache]: Analyzing trace with hash -86603521, now seen corresponding path program 1 times [2018-10-02 12:04:24,537 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:24,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:24,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:24,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:24,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:24,750 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-02 12:04:24,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:24,751 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:24,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:24,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:25,041 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-02 12:04:25,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:25,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-02 12:04:25,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:04:25,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:04:25,072 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:25,072 INFO L87 Difference]: Start difference. First operand 694 states and 1171 transitions. Second operand 14 states. [2018-10-02 12:04:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:29,172 INFO L93 Difference]: Finished difference Result 1557 states and 2604 transitions. [2018-10-02 12:04:29,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 12:04:29,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-02 12:04:29,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:29,176 INFO L225 Difference]: With dead ends: 1557 [2018-10-02 12:04:29,176 INFO L226 Difference]: Without dead ends: 864 [2018-10-02 12:04:29,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime [2018-10-02 12:04:29,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-10-02 12:04:29,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 741. [2018-10-02 12:04:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-02 12:04:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1247 transitions. [2018-10-02 12:04:29,329 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1247 transitions. Word has length 13 [2018-10-02 12:04:29,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:29,329 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 1247 transitions. [2018-10-02 12:04:29,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:04:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1247 transitions. [2018-10-02 12:04:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:04:29,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:29,331 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:29,331 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:29,331 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:29,331 INFO L82 PathProgramCache]: Analyzing trace with hash -63701769, now seen corresponding path program 1 times [2018-10-02 12:04:29,331 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:29,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:29,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:29,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:29,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:29,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:29,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:29,432 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:04:29,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:29,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:29,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:29,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-02 12:04:29,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:29,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:29,567 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:29,567 INFO L87 Difference]: Start difference. First operand 741 states and 1247 transitions. Second operand 13 states. [2018-10-02 12:04:32,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:32,405 INFO L93 Difference]: Finished difference Result 1655 states and 2757 transitions. [2018-10-02 12:04:32,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:04:32,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-02 12:04:32,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:32,408 INFO L225 Difference]: With dead ends: 1655 [2018-10-02 12:04:32,409 INFO L226 Difference]: Without dead ends: 915 [2018-10-02 12:04:32,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:04:32,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-10-02 12:04:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 809. [2018-10-02 12:04:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-10-02 12:04:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1353 transitions. [2018-10-02 12:04:32,552 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1353 transitions. Word has length 13 [2018-10-02 12:04:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:32,553 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1353 transitions. [2018-10-02 12:04:32,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:04:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1353 transitions. [2018-10-02 12:04:32,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:04:32,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:32,554 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:32,554 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:32,554 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:32,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 1 times [2018-10-02 12:04:32,554 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:32,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:32,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:32,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:32,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:32,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:32,654 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:32,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:32,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:32,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:32,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-02 12:04:32,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 12:04:32,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 12:04:32,748 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:32,748 INFO L87 Difference]: Start difference. First operand 809 states and 1353 transitions. Second operand 10 states. [2018-10-02 12:04:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:34,786 INFO L93 Difference]: Finished difference Result 939 states and 1541 transitions. [2018-10-02 12:04:34,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:04:34,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-10-02 12:04:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:34,790 INFO L225 Difference]: With dead ends: 939 [2018-10-02 12:04:34,790 INFO L226 Difference]: Without dead ends: 937 [2018-10-02 12:04:34,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:04:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-10-02 12:04:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 820. [2018-10-02 12:04:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-10-02 12:04:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1367 transitions. [2018-10-02 12:04:34,941 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1367 transitions. Word has length 13 [2018-10-02 12:04:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:34,941 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 1367 transitions. [2018-10-02 12:04:34,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 12:04:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1367 transitions. [2018-10-02 12:04:34,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:04:34,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:34,942 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:34,943 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:34,943 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:34,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1799471129, now seen corresponding path program 1 times [2018-10-02 12:04:34,943 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:34,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:34,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:34,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:34,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:35,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:35,023 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:35,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:35,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:35,324 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-02 12:04:35,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:04:35,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-02 12:04:35,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:04:35,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:04:35,347 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:35,347 INFO L87 Difference]: Start difference. First operand 820 states and 1367 transitions. Second operand 14 states. [2018-10-02 12:04:40,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:40,248 INFO L93 Difference]: Finished difference Result 2058 states and 3403 transitions. [2018-10-02 12:04:40,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-02 12:04:40,249 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-02 12:04:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:40,254 INFO L225 Difference]: With dead ends: 2058 [2018-10-02 12:04:40,254 INFO L226 Difference]: Without dead ends: 1239 [2018-10-02 12:04:40,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime [2018-10-02 12:04:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2018-10-02 12:04:40,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 899. [2018-10-02 12:04:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-02 12:04:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1500 transitions. [2018-10-02 12:04:40,507 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1500 transitions. Word has length 13 [2018-10-02 12:04:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:40,507 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1500 transitions. [2018-10-02 12:04:40,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:04:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1500 transitions. [2018-10-02 12:04:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:04:40,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:40,508 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:40,508 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:40,509 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:40,509 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-10-02 12:04:40,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:40,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:40,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:40,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:40,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:41,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:41,045 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:41,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:41,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:41,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:41,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-02 12:04:41,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 12:04:41,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 12:04:41,844 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:41,844 INFO L87 Difference]: Start difference. First operand 899 states and 1500 transitions. Second operand 10 states. [2018-10-02 12:04:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:43,975 INFO L93 Difference]: Finished difference Result 1038 states and 1712 transitions. [2018-10-02 12:04:43,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:04:43,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-10-02 12:04:43,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:43,980 INFO L225 Difference]: With dead ends: 1038 [2018-10-02 12:04:43,980 INFO L226 Difference]: Without dead ends: 1036 [2018-10-02 12:04:43,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.8s impTime [2018-10-02 12:04:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-10-02 12:04:44,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 897. [2018-10-02 12:04:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-10-02 12:04:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1498 transitions. [2018-10-02 12:04:44,156 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1498 transitions. Word has length 13 [2018-10-02 12:04:44,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:44,156 INFO L480 AbstractCegarLoop]: Abstraction has 897 states and 1498 transitions. [2018-10-02 12:04:44,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 12:04:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1498 transitions. [2018-10-02 12:04:44,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:04:44,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:44,157 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:44,157 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:44,158 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:44,158 INFO L82 PathProgramCache]: Analyzing trace with hash 290277111, now seen corresponding path program 1 times [2018-10-02 12:04:44,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:44,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:44,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:44,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:44,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:44,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:44,267 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:44,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:44,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:44,358 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-02 12:04:44,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:04:44,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-02 12:04:44,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:04:44,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:04:44,381 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:44,382 INFO L87 Difference]: Start difference. First operand 897 states and 1498 transitions. Second operand 14 states. [2018-10-02 12:04:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:48,859 INFO L93 Difference]: Finished difference Result 2193 states and 3616 transitions. [2018-10-02 12:04:48,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-02 12:04:48,860 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-02 12:04:48,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:48,864 INFO L225 Difference]: With dead ends: 2193 [2018-10-02 12:04:48,864 INFO L226 Difference]: Without dead ends: 1286 [2018-10-02 12:04:48,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime [2018-10-02 12:04:48,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2018-10-02 12:04:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 995. [2018-10-02 12:04:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-10-02 12:04:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1646 transitions. [2018-10-02 12:04:49,063 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1646 transitions. Word has length 13 [2018-10-02 12:04:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:49,063 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 1646 transitions. [2018-10-02 12:04:49,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:04:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1646 transitions. [2018-10-02 12:04:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:04:49,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:49,064 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:49,064 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:49,065 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:49,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2115278289, now seen corresponding path program 1 times [2018-10-02 12:04:49,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:49,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:49,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:49,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:49,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:49,142 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-02 12:04:49,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:49,142 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:49,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:49,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:49,276 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-02 12:04:49,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:49,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-02 12:04:49,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:04:49,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:04:49,297 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:49,298 INFO L87 Difference]: Start difference. First operand 995 states and 1646 transitions. Second operand 14 states. [2018-10-02 12:04:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:52,825 INFO L93 Difference]: Finished difference Result 2165 states and 3551 transitions. [2018-10-02 12:04:52,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 12:04:52,826 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-02 12:04:52,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:52,830 INFO L225 Difference]: With dead ends: 2165 [2018-10-02 12:04:52,831 INFO L226 Difference]: Without dead ends: 1153 [2018-10-02 12:04:52,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:04:52,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-10-02 12:04:53,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1001. [2018-10-02 12:04:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-10-02 12:04:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1642 transitions. [2018-10-02 12:04:53,033 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1642 transitions. Word has length 13 [2018-10-02 12:04:53,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:53,033 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1642 transitions. [2018-10-02 12:04:53,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:04:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1642 transitions. [2018-10-02 12:04:53,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:04:53,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:53,035 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:53,035 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:53,035 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:53,035 INFO L82 PathProgramCache]: Analyzing trace with hash -2141517287, now seen corresponding path program 1 times [2018-10-02 12:04:53,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:53,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:53,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:53,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:53,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:53,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:53,121 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:53,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:53,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:53,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:53,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-02 12:04:53,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:53,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:53,268 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:53,268 INFO L87 Difference]: Start difference. First operand 1001 states and 1642 transitions. Second operand 13 states. [2018-10-02 12:04:56,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:56,405 INFO L93 Difference]: Finished difference Result 1397 states and 2244 transitions. [2018-10-02 12:04:56,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:04:56,406 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-02 12:04:56,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:56,410 INFO L225 Difference]: With dead ends: 1397 [2018-10-02 12:04:56,410 INFO L226 Difference]: Without dead ends: 1125 [2018-10-02 12:04:56,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:04:56,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-10-02 12:04:56,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 995. [2018-10-02 12:04:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-10-02 12:04:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1627 transitions. [2018-10-02 12:04:56,584 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1627 transitions. Word has length 13 [2018-10-02 12:04:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:56,585 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 1627 transitions. [2018-10-02 12:04:56,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:04:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1627 transitions. [2018-10-02 12:04:56,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:04:56,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:56,585 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:56,586 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:56,586 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:56,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-10-02 12:04:56,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:56,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:56,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:56,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:56,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:56,666 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-02 12:04:56,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:56,667 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:56,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:56,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:04:56,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:04:56,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-02 12:04:56,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:04:56,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:04:56,778 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:56,778 INFO L87 Difference]: Start difference. First operand 995 states and 1627 transitions. Second operand 14 states. [2018-10-02 12:05:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:02,826 INFO L93 Difference]: Finished difference Result 2724 states and 4397 transitions. [2018-10-02 12:05:02,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-02 12:05:02,827 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-02 12:05:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:02,832 INFO L225 Difference]: With dead ends: 2724 [2018-10-02 12:05:02,832 INFO L226 Difference]: Without dead ends: 1719 [2018-10-02 12:05:02,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime [2018-10-02 12:05:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2018-10-02 12:05:03,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1241. [2018-10-02 12:05:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2018-10-02 12:05:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2017 transitions. [2018-10-02 12:05:03,070 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2017 transitions. Word has length 13 [2018-10-02 12:05:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:03,071 INFO L480 AbstractCegarLoop]: Abstraction has 1241 states and 2017 transitions. [2018-10-02 12:05:03,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:05:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2017 transitions. [2018-10-02 12:05:03,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:05:03,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:03,072 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:03,072 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:03,072 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:03,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1374164806, now seen corresponding path program 1 times [2018-10-02 12:05:03,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:03,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:03,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:03,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:03,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:03,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:03,184 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:03,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:03,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:03,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:03,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 16 [2018-10-02 12:05:03,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 12:05:03,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 12:05:03,366 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:03,366 INFO L87 Difference]: Start difference. First operand 1241 states and 2017 transitions. Second operand 17 states. [2018-10-02 12:05:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:07,839 INFO L93 Difference]: Finished difference Result 1442 states and 2324 transitions. [2018-10-02 12:05:07,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 12:05:07,840 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-10-02 12:05:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:07,844 INFO L225 Difference]: With dead ends: 1442 [2018-10-02 12:05:07,844 INFO L226 Difference]: Without dead ends: 1440 [2018-10-02 12:05:07,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:05:07,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-10-02 12:05:08,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1225. [2018-10-02 12:05:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-10-02 12:05:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1983 transitions. [2018-10-02 12:05:08,099 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1983 transitions. Word has length 15 [2018-10-02 12:05:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:08,099 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 1983 transitions. [2018-10-02 12:05:08,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 12:05:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1983 transitions. [2018-10-02 12:05:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:05:08,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:08,100 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:08,100 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:08,101 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-10-02 12:05:08,101 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:08,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:08,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:08,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:08,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:08,302 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:08,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:08,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:08,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:08,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:08,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-02 12:05:08,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:05:08,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:05:08,467 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:08,467 INFO L87 Difference]: Start difference. First operand 1225 states and 1983 transitions. Second operand 16 states. [2018-10-02 12:05:11,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:11,364 INFO L93 Difference]: Finished difference Result 1389 states and 2225 transitions. [2018-10-02 12:05:11,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 12:05:11,364 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-02 12:05:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:11,369 INFO L225 Difference]: With dead ends: 1389 [2018-10-02 12:05:11,369 INFO L226 Difference]: Without dead ends: 1387 [2018-10-02 12:05:11,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:05:11,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2018-10-02 12:05:11,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1211. [2018-10-02 12:05:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-10-02 12:05:11,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1953 transitions. [2018-10-02 12:05:11,642 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1953 transitions. Word has length 15 [2018-10-02 12:05:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:11,642 INFO L480 AbstractCegarLoop]: Abstraction has 1211 states and 1953 transitions. [2018-10-02 12:05:11,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:05:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1953 transitions. [2018-10-02 12:05:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:05:11,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:11,643 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:11,644 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:11,644 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:11,644 INFO L82 PathProgramCache]: Analyzing trace with hash -593242831, now seen corresponding path program 1 times [2018-10-02 12:05:11,644 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:11,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:11,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:11,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:11,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:11,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:11,757 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:11,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:11,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:11,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:11,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-10-02 12:05:11,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:05:11,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:05:11,936 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:11,936 INFO L87 Difference]: Start difference. First operand 1211 states and 1953 transitions. Second operand 14 states. [2018-10-02 12:05:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:17,665 INFO L93 Difference]: Finished difference Result 1445 states and 2303 transitions. [2018-10-02 12:05:17,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 12:05:17,666 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-10-02 12:05:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:17,670 INFO L225 Difference]: With dead ends: 1445 [2018-10-02 12:05:17,670 INFO L226 Difference]: Without dead ends: 1443 [2018-10-02 12:05:17,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:05:17,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2018-10-02 12:05:17,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1205. [2018-10-02 12:05:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-02 12:05:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-10-02 12:05:17,937 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-10-02 12:05:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:17,937 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-10-02 12:05:17,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:05:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-10-02 12:05:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:05:17,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:17,938 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:17,939 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:17,939 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1223170690, now seen corresponding path program 1 times [2018-10-02 12:05:17,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:17,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:17,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:17,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:17,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:18,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:18,017 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:18,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:18,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:18,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:18,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-02 12:05:18,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:05:18,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:05:18,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:18,189 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 15 states. [2018-10-02 12:05:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:24,066 INFO L93 Difference]: Finished difference Result 1420 states and 2265 transitions. [2018-10-02 12:05:24,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:05:24,066 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-10-02 12:05:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:24,071 INFO L225 Difference]: With dead ends: 1420 [2018-10-02 12:05:24,071 INFO L226 Difference]: Without dead ends: 1418 [2018-10-02 12:05:24,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:05:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-10-02 12:05:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1213. [2018-10-02 12:05:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2018-10-02 12:05:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1951 transitions. [2018-10-02 12:05:24,347 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1951 transitions. Word has length 16 [2018-10-02 12:05:24,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:24,348 INFO L480 AbstractCegarLoop]: Abstraction has 1213 states and 1951 transitions. [2018-10-02 12:05:24,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:05:24,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1951 transitions. [2018-10-02 12:05:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:05:24,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:24,349 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:24,349 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:24,349 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:24,349 INFO L82 PathProgramCache]: Analyzing trace with hash -767609008, now seen corresponding path program 2 times [2018-10-02 12:05:24,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:24,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:24,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:24,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:24,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:24,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:24,446 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:24,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:05:24,471 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:05:24,472 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:05:24,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:24,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:24,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-02 12:05:24,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 12:05:24,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 12:05:24,583 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:24,584 INFO L87 Difference]: Start difference. First operand 1213 states and 1951 transitions. Second operand 11 states. [2018-10-02 12:05:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:27,316 INFO L93 Difference]: Finished difference Result 1334 states and 2129 transitions. [2018-10-02 12:05:27,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 12:05:27,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-10-02 12:05:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:27,321 INFO L225 Difference]: With dead ends: 1334 [2018-10-02 12:05:27,321 INFO L226 Difference]: Without dead ends: 1332 [2018-10-02 12:05:27,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:05:27,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2018-10-02 12:05:27,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1205. [2018-10-02 12:05:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-02 12:05:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-10-02 12:05:27,582 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-10-02 12:05:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:27,582 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-10-02 12:05:27,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 12:05:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-10-02 12:05:27,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:05:27,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:27,583 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:27,583 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:27,583 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:27,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1823106549, now seen corresponding path program 1 times [2018-10-02 12:05:27,583 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:27,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:27,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:27,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:05:27,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:27,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:27,664 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:27,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:27,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:27,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:27,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-02 12:05:27,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 12:05:27,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 12:05:27,768 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:27,768 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 11 states. [2018-10-02 12:05:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:30,600 INFO L93 Difference]: Finished difference Result 1330 states and 2118 transitions. [2018-10-02 12:05:30,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 12:05:30,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-10-02 12:05:30,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:30,606 INFO L225 Difference]: With dead ends: 1330 [2018-10-02 12:05:30,606 INFO L226 Difference]: Without dead ends: 1328 [2018-10-02 12:05:30,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:05:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-10-02 12:05:30,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1211. [2018-10-02 12:05:30,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-10-02 12:05:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1948 transitions. [2018-10-02 12:05:30,893 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1948 transitions. Word has length 16 [2018-10-02 12:05:30,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:30,893 INFO L480 AbstractCegarLoop]: Abstraction has 1211 states and 1948 transitions. [2018-10-02 12:05:30,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 12:05:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1948 transitions. [2018-10-02 12:05:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:05:30,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:30,894 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:30,895 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:30,895 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:30,895 INFO L82 PathProgramCache]: Analyzing trace with hash 481081049, now seen corresponding path program 2 times [2018-10-02 12:05:30,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:30,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:30,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:30,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:30,998 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:31,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:05:31,014 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:05:31,015 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:05:31,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:31,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:31,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-10-02 12:05:31,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:05:31,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:05:31,134 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:31,134 INFO L87 Difference]: Start difference. First operand 1211 states and 1948 transitions. Second operand 14 states. [2018-10-02 12:05:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:36,525 INFO L93 Difference]: Finished difference Result 1430 states and 2273 transitions. [2018-10-02 12:05:36,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:05:36,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-10-02 12:05:36,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:36,536 INFO L225 Difference]: With dead ends: 1430 [2018-10-02 12:05:36,536 INFO L226 Difference]: Without dead ends: 1428 [2018-10-02 12:05:36,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:05:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2018-10-02 12:05:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1205. [2018-10-02 12:05:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-02 12:05:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-10-02 12:05:36,831 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-10-02 12:05:36,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:36,832 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-10-02 12:05:36,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:05:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-10-02 12:05:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:05:36,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:36,833 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:36,833 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:36,833 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:36,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1936399254, now seen corresponding path program 1 times [2018-10-02 12:05:36,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:36,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:36,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:36,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:05:36,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:37,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:37,278 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:37,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:37,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:37,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:37,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-10-02 12:05:37,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:05:37,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:05:37,458 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:37,458 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 13 states. [2018-10-02 12:05:42,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:42,595 INFO L93 Difference]: Finished difference Result 1432 states and 2278 transitions. [2018-10-02 12:05:42,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 12:05:42,596 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-10-02 12:05:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:42,599 INFO L225 Difference]: With dead ends: 1432 [2018-10-02 12:05:42,599 INFO L226 Difference]: Without dead ends: 1430 [2018-10-02 12:05:42,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime [2018-10-02 12:05:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-10-02 12:05:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1199. [2018-10-02 12:05:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-10-02 12:05:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1923 transitions. [2018-10-02 12:05:42,898 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1923 transitions. Word has length 16 [2018-10-02 12:05:42,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:42,898 INFO L480 AbstractCegarLoop]: Abstraction has 1199 states and 1923 transitions. [2018-10-02 12:05:42,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:05:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1923 transitions. [2018-10-02 12:05:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:05:42,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:42,899 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:42,900 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:42,900 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:42,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1085218294, now seen corresponding path program 1 times [2018-10-02 12:05:42,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:42,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:42,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:42,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:42,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:43,442 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-02 12:05:43,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:43,443 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:43,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:43,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:43,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:05:43,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2018-10-02 12:05:43,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 12:05:43,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 12:05:43,558 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:43,558 INFO L87 Difference]: Start difference. First operand 1199 states and 1923 transitions. Second operand 17 states. [2018-10-02 12:05:52,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:52,821 INFO L93 Difference]: Finished difference Result 1695 states and 2653 transitions. [2018-10-02 12:05:52,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-02 12:05:52,821 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-02 12:05:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:52,823 INFO L225 Difference]: With dead ends: 1695 [2018-10-02 12:05:52,824 INFO L226 Difference]: Without dead ends: 1376 [2018-10-02 12:05:52,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.5s impTime [2018-10-02 12:05:52,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2018-10-02 12:05:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1028. [2018-10-02 12:05:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-10-02 12:05:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1643 transitions. [2018-10-02 12:05:53,078 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1643 transitions. Word has length 18 [2018-10-02 12:05:53,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:53,078 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1643 transitions. [2018-10-02 12:05:53,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 12:05:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1643 transitions. [2018-10-02 12:05:53,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:05:53,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:53,079 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:53,079 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:53,079 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:53,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1597439053, now seen corresponding path program 1 times [2018-10-02 12:05:53,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:53,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:53,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:53,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:53,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:53,893 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-02 12:05:53,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:53,893 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:53,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:53,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:53,988 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-02 12:05:54,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:54,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-10-02 12:05:54,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:05:54,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:05:54,010 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:54,010 INFO L87 Difference]: Start difference. First operand 1028 states and 1643 transitions. Second operand 16 states. [2018-10-02 12:05:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:58,586 INFO L93 Difference]: Finished difference Result 1514 states and 2354 transitions. [2018-10-02 12:05:58,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-02 12:05:58,590 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-02 12:05:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:58,592 INFO L225 Difference]: With dead ends: 1514 [2018-10-02 12:05:58,592 INFO L226 Difference]: Without dead ends: 1219 [2018-10-02 12:05:58,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime [2018-10-02 12:05:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-10-02 12:05:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1024. [2018-10-02 12:05:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-10-02 12:05:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1632 transitions. [2018-10-02 12:05:59,010 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1632 transitions. Word has length 18 [2018-10-02 12:05:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:59,010 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1632 transitions. [2018-10-02 12:05:59,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:05:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1632 transitions. [2018-10-02 12:05:59,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:05:59,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:59,012 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:59,012 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:59,012 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:59,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1672170852, now seen corresponding path program 1 times [2018-10-02 12:05:59,012 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:59,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:59,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:59,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:59,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 12:05:59,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:59,320 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:05:59,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:59,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:59,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:59,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-10-02 12:05:59,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:05:59,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:05:59,486 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:59,487 INFO L87 Difference]: Start difference. First operand 1024 states and 1632 transitions. Second operand 16 states. [2018-10-02 12:06:04,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:04,981 INFO L93 Difference]: Finished difference Result 2556 states and 4045 transitions. [2018-10-02 12:06:04,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:06:04,982 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-02 12:06:04,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:04,984 INFO L225 Difference]: With dead ends: 2556 [2018-10-02 12:06:04,984 INFO L226 Difference]: Without dead ends: 1529 [2018-10-02 12:06:04,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime [2018-10-02 12:06:04,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-10-02 12:06:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1073. [2018-10-02 12:06:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2018-10-02 12:06:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1703 transitions. [2018-10-02 12:06:05,272 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1703 transitions. Word has length 18 [2018-10-02 12:06:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:05,273 INFO L480 AbstractCegarLoop]: Abstraction has 1073 states and 1703 transitions. [2018-10-02 12:06:05,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:06:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1703 transitions. [2018-10-02 12:06:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:06:05,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:05,274 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:05,274 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:05,274 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:05,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1136854538, now seen corresponding path program 1 times [2018-10-02 12:06:05,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:05,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:05,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:05,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:05,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:05,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:05,422 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:06:05,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:05,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:05,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:05,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-02 12:06:05,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:06:05,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:06:05,636 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:05,636 INFO L87 Difference]: Start difference. First operand 1073 states and 1703 transitions. Second operand 15 states. [2018-10-02 12:06:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:10,459 INFO L93 Difference]: Finished difference Result 1546 states and 2389 transitions. [2018-10-02 12:06:10,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-02 12:06:10,459 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-10-02 12:06:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:10,461 INFO L225 Difference]: With dead ends: 1546 [2018-10-02 12:06:10,461 INFO L226 Difference]: Without dead ends: 1291 [2018-10-02 12:06:10,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime [2018-10-02 12:06:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-10-02 12:06:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1056. [2018-10-02 12:06:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-10-02 12:06:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1674 transitions. [2018-10-02 12:06:10,799 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1674 transitions. Word has length 18 [2018-10-02 12:06:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:10,800 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1674 transitions. [2018-10-02 12:06:10,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:06:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1674 transitions. [2018-10-02 12:06:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:06:10,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:10,801 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:10,801 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:10,801 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:10,801 INFO L82 PathProgramCache]: Analyzing trace with hash 975863549, now seen corresponding path program 1 times [2018-10-02 12:06:10,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:10,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:10,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:10,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:10,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:10,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:10,861 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:06:10,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:10,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:10,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:10,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 12:06:10,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:06:10,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:06:10,950 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:10,950 INFO L87 Difference]: Start difference. First operand 1056 states and 1674 transitions. Second operand 7 states. [2018-10-02 12:06:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:12,168 INFO L93 Difference]: Finished difference Result 1635 states and 2515 transitions. [2018-10-02 12:06:12,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:06:12,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-02 12:06:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:12,171 INFO L225 Difference]: With dead ends: 1635 [2018-10-02 12:06:12,171 INFO L226 Difference]: Without dead ends: 1494 [2018-10-02 12:06:12,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:06:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2018-10-02 12:06:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1094. [2018-10-02 12:06:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-10-02 12:06:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1728 transitions. [2018-10-02 12:06:12,519 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1728 transitions. Word has length 18 [2018-10-02 12:06:12,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:12,519 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 1728 transitions. [2018-10-02 12:06:12,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:06:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1728 transitions. [2018-10-02 12:06:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 12:06:12,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:12,520 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-10-02 12:06:12,520 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:12,520 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:12,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1152261854, now seen corresponding path program 1 times [2018-10-02 12:06:12,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:12,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:12,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:12,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:12,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:12,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:12,639 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:06:12,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:12,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:12,776 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:12,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:12,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 19 [2018-10-02 12:06:12,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 12:06:12,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 12:06:12,797 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:12,798 INFO L87 Difference]: Start difference. First operand 1094 states and 1728 transitions. Second operand 20 states. [2018-10-02 12:06:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:23,101 INFO L93 Difference]: Finished difference Result 2230 states and 3534 transitions. [2018-10-02 12:06:23,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-02 12:06:23,102 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-10-02 12:06:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:23,106 INFO L225 Difference]: With dead ends: 2230 [2018-10-02 12:06:23,106 INFO L226 Difference]: Without dead ends: 2180 [2018-10-02 12:06:23,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime [2018-10-02 12:06:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2018-10-02 12:06:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 1150. [2018-10-02 12:06:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2018-10-02 12:06:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1853 transitions. [2018-10-02 12:06:23,486 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1853 transitions. Word has length 20 [2018-10-02 12:06:23,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:23,486 INFO L480 AbstractCegarLoop]: Abstraction has 1150 states and 1853 transitions. [2018-10-02 12:06:23,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 12:06:23,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1853 transitions. [2018-10-02 12:06:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 12:06:23,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:23,488 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:23,488 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:23,488 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:23,488 INFO L82 PathProgramCache]: Analyzing trace with hash -79326665, now seen corresponding path program 1 times [2018-10-02 12:06:23,488 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:23,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:23,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 12:06:23,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:23,571 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:06:23,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:23,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 12:06:23,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:23,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 12:06:23,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:06:23,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:06:23,664 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:23,665 INFO L87 Difference]: Start difference. First operand 1150 states and 1853 transitions. Second operand 7 states. [2018-10-02 12:06:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:24,502 INFO L93 Difference]: Finished difference Result 1760 states and 2751 transitions. [2018-10-02 12:06:24,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 12:06:24,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-02 12:06:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:24,507 INFO L225 Difference]: With dead ends: 1760 [2018-10-02 12:06:24,507 INFO L226 Difference]: Without dead ends: 1507 [2018-10-02 12:06:24,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:06:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-10-02 12:06:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1026. [2018-10-02 12:06:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2018-10-02 12:06:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1655 transitions. [2018-10-02 12:06:24,908 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1655 transitions. Word has length 20 [2018-10-02 12:06:24,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:24,909 INFO L480 AbstractCegarLoop]: Abstraction has 1026 states and 1655 transitions. [2018-10-02 12:06:24,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:06:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1655 transitions. [2018-10-02 12:06:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 12:06:24,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:24,909 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-10-02 12:06:24,910 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:24,910 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:24,910 INFO L82 PathProgramCache]: Analyzing trace with hash -79325383, now seen corresponding path program 1 times [2018-10-02 12:06:24,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:24,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:24,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:24,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:24,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:25,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:25,107 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:06:25,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:25,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:25,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:25,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-02 12:06:25,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 12:06:25,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 12:06:25,243 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:25,243 INFO L87 Difference]: Start difference. First operand 1026 states and 1655 transitions. Second operand 17 states. [2018-10-02 12:06:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:31,100 INFO L93 Difference]: Finished difference Result 1878 states and 3019 transitions. [2018-10-02 12:06:31,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-02 12:06:31,100 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-10-02 12:06:31,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:31,102 INFO L225 Difference]: With dead ends: 1878 [2018-10-02 12:06:31,102 INFO L226 Difference]: Without dead ends: 1729 [2018-10-02 12:06:31,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime [2018-10-02 12:06:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2018-10-02 12:06:31,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1013. [2018-10-02 12:06:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-10-02 12:06:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1646 transitions. [2018-10-02 12:06:31,471 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1646 transitions. Word has length 20 [2018-10-02 12:06:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:31,472 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 1646 transitions. [2018-10-02 12:06:31,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 12:06:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1646 transitions. [2018-10-02 12:06:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 12:06:31,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:31,472 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:31,473 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:31,473 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:31,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1614386347, now seen corresponding path program 1 times [2018-10-02 12:06:31,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:31,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:31,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:31,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:31,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 12:06:31,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:31,589 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:06:31,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:31,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:31,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:31,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-02 12:06:31,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 12:06:31,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 12:06:31,809 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:31,809 INFO L87 Difference]: Start difference. First operand 1013 states and 1646 transitions. Second operand 20 states. [2018-10-02 12:06:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:40,498 INFO L93 Difference]: Finished difference Result 2738 states and 4441 transitions. [2018-10-02 12:06:40,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-02 12:06:40,499 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-10-02 12:06:40,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:40,501 INFO L225 Difference]: With dead ends: 2738 [2018-10-02 12:06:40,501 INFO L226 Difference]: Without dead ends: 1726 [2018-10-02 12:06:40,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.5s impTime [2018-10-02 12:06:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2018-10-02 12:06:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1481. [2018-10-02 12:06:40,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-10-02 12:06:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2418 transitions. [2018-10-02 12:06:40,913 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2418 transitions. Word has length 21 [2018-10-02 12:06:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:40,913 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2418 transitions. [2018-10-02 12:06:40,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 12:06:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2418 transitions. [2018-10-02 12:06:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 12:06:40,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:40,914 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:40,915 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:40,915 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:40,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1615679213, now seen corresponding path program 1 times [2018-10-02 12:06:40,915 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:40,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:40,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:40,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:40,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:41,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:41,049 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:06:41,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:41,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:42,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:42,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-02 12:06:42,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 12:06:42,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 12:06:42,298 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:42,298 INFO L87 Difference]: Start difference. First operand 1481 states and 2418 transitions. Second operand 20 states. [2018-10-02 12:06:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:54,817 INFO L93 Difference]: Finished difference Result 2759 states and 4491 transitions. [2018-10-02 12:06:54,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-02 12:06:54,818 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-10-02 12:06:54,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:54,820 INFO L225 Difference]: With dead ends: 2759 [2018-10-02 12:06:54,821 INFO L226 Difference]: Without dead ends: 2757 [2018-10-02 12:06:54,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 1.8s impTime [2018-10-02 12:06:54,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2018-10-02 12:06:55,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 1886. [2018-10-02 12:06:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2018-10-02 12:06:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 3096 transitions. [2018-10-02 12:06:55,318 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 3096 transitions. Word has length 21 [2018-10-02 12:06:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:55,319 INFO L480 AbstractCegarLoop]: Abstraction has 1886 states and 3096 transitions. [2018-10-02 12:06:55,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 12:06:55,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 3096 transitions. [2018-10-02 12:06:55,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 12:06:55,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:55,319 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:55,320 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:55,320 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:55,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1336385522, now seen corresponding path program 1 times [2018-10-02 12:06:55,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:55,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:55,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:55,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:55,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:55,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:55,440 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:06:55,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:55,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:55,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:55,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-10-02 12:06:55,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 12:06:55,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 12:06:55,600 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:55,600 INFO L87 Difference]: Start difference. First operand 1886 states and 3096 transitions. Second operand 18 states. [2018-10-02 12:07:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:05,815 INFO L93 Difference]: Finished difference Result 2657 states and 4320 transitions. [2018-10-02 12:07:05,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-02 12:07:05,816 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-10-02 12:07:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:05,818 INFO L225 Difference]: With dead ends: 2657 [2018-10-02 12:07:05,818 INFO L226 Difference]: Without dead ends: 2655 [2018-10-02 12:07:05,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime [2018-10-02 12:07:05,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2018-10-02 12:07:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 1726. [2018-10-02 12:07:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2018-10-02 12:07:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2827 transitions. [2018-10-02 12:07:06,362 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2827 transitions. Word has length 21 [2018-10-02 12:07:06,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:06,363 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 2827 transitions. [2018-10-02 12:07:06,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 12:07:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2827 transitions. [2018-10-02 12:07:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 12:07:06,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:06,363 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:07:06,364 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:06,364 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:06,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1327798635, now seen corresponding path program 1 times [2018-10-02 12:07:06,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:06,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:06,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:06,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:06,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:07:06,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:07:06,496 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:07:06,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:06,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:07:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:07:06,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:07:06,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-10-02 12:07:06,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 12:07:06,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 12:07:06,682 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:06,682 INFO L87 Difference]: Start difference. First operand 1726 states and 2827 transitions. Second operand 19 states. [2018-10-02 12:07:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:18,199 INFO L93 Difference]: Finished difference Result 2434 states and 3937 transitions. [2018-10-02 12:07:18,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-02 12:07:18,200 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-10-02 12:07:18,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:18,202 INFO L225 Difference]: With dead ends: 2434 [2018-10-02 12:07:18,203 INFO L226 Difference]: Without dead ends: 2432 [2018-10-02 12:07:18,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime [2018-10-02 12:07:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2018-10-02 12:07:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 1872. [2018-10-02 12:07:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1872 states. [2018-10-02 12:07:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3060 transitions. [2018-10-02 12:07:19,213 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3060 transitions. Word has length 21 [2018-10-02 12:07:19,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:19,214 INFO L480 AbstractCegarLoop]: Abstraction has 1872 states and 3060 transitions. [2018-10-02 12:07:19,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 12:07:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3060 transitions. [2018-10-02 12:07:19,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 12:07:19,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:19,215 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:07:19,215 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:19,216 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:19,216 INFO L82 PathProgramCache]: Analyzing trace with hash 133649308, now seen corresponding path program 2 times [2018-10-02 12:07:19,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:19,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:19,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:19,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:19,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:07:19,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:07:19,726 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:07:19,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:07:19,742 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:07:19,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:07:19,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:07:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:07:19,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:07:19,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-10-02 12:07:19,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:07:19,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:07:19,852 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:19,853 INFO L87 Difference]: Start difference. First operand 1872 states and 3060 transitions. Second operand 16 states. [2018-10-02 12:07:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:27,493 INFO L93 Difference]: Finished difference Result 2526 states and 4072 transitions. [2018-10-02 12:07:27,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-02 12:07:27,493 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-10-02 12:07:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:27,495 INFO L225 Difference]: With dead ends: 2526 [2018-10-02 12:07:27,495 INFO L226 Difference]: Without dead ends: 2334 [2018-10-02 12:07:27,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime [2018-10-02 12:07:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2018-10-02 12:07:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2001. [2018-10-02 12:07:28,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2018-10-02 12:07:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 3219 transitions. [2018-10-02 12:07:28,135 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 3219 transitions. Word has length 21 [2018-10-02 12:07:28,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:28,135 INFO L480 AbstractCegarLoop]: Abstraction has 2001 states and 3219 transitions. [2018-10-02 12:07:28,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:07:28,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 3219 transitions. [2018-10-02 12:07:28,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 12:07:28,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:28,136 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:07:28,137 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:28,137 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:28,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1958649716, now seen corresponding path program 1 times [2018-10-02 12:07:28,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:28,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:28,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:28,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:07:28,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:28,258 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:07:28,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:07:28,258 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:07:28,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:28,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:07:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:07:28,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:07:28,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-10-02 12:07:28,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 12:07:28,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 12:07:28,442 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:28,442 INFO L87 Difference]: Start difference. First operand 2001 states and 3219 transitions. Second operand 18 states. Received shutdown request... [2018-10-02 12:07:38,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-02 12:07:38,077 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 12:07:38,084 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 12:07:38,084 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:07:38 BoogieIcfgContainer [2018-10-02 12:07:38,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:07:38,085 INFO L168 Benchmark]: Toolchain (without parser) took 246783.00 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -153.6 MB). Free memory was 1.5 GB in the beginning and 922.0 MB in the end (delta: 553.1 MB). Peak memory consumption was 399.5 MB. Max. memory is 7.1 GB. [2018-10-02 12:07:38,086 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:07:38,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:07:38,087 INFO L168 Benchmark]: Boogie Preprocessor took 22.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:07:38,088 INFO L168 Benchmark]: RCFGBuilder took 623.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 12:07:38,088 INFO L168 Benchmark]: TraceAbstraction took 246089.25 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -153.6 MB). Free memory was 1.5 GB in the beginning and 922.0 MB in the end (delta: 531.9 MB). Peak memory consumption was 378.3 MB. Max. memory is 7.1 GB. [2018-10-02 12:07:38,092 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.22 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 41.77 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 22.45 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 623.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246089.25 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -153.6 MB). Free memory was 1.5 GB in the beginning and 922.0 MB in the end (delta: 531.9 MB). Peak memory consumption was 378.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 85). Cancelled while BasicCegarLoop was constructing difference of abstraction (2001states) and FLOYD_HOARE automaton (currently 65 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1226 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 74). Cancelled while BasicCegarLoop was constructing difference of abstraction (2001states) and FLOYD_HOARE automaton (currently 65 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1226 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 94). Cancelled while BasicCegarLoop was constructing difference of abstraction (2001states) and FLOYD_HOARE automaton (currently 65 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1226 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 45). Cancelled while BasicCegarLoop was constructing difference of abstraction (2001states) and FLOYD_HOARE automaton (currently 65 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1226 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 4 error locations. TIMEOUT Result, 246.0s OverallTime, 51 OverallIterations, 3 TraceHistogramMax, 216.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1997 SDtfs, 9060 SDslu, 6270 SDs, 0 SdLazy, 40380 SolverSat, 4489 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2237 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 1813 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2001occurred 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: 10.5s AutomataMinimizationTime, 50 MinimizatonAttempts, 11293 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 1361 NumberOfCodeBlocks, 1361 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 1266 ConstructedInterpolants, 146 QuantifiedInterpolants, 132522 SizeOfPredicates, 206 NumberOfNonLiveVariables, 1898 ConjunctsInSsa, 409 ConjunctsInUnsatCore, 95 InterpolantComputations, 14 PerfectInterpolantSequences, 122/522 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_product.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-07-38-104.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-07-38-104.csv Completed graceful shutdown