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_WithProcedures.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:19:57,350 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:19:57,352 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:19:57,365 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:19:57,365 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:19:57,366 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:19:57,367 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:19:57,369 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:19:57,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:19:57,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:19:57,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:19:57,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:19:57,374 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:19:57,375 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:19:57,376 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:19:57,377 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:19:57,378 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:19:57,380 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:19:57,382 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:19:57,384 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:19:57,385 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:19:57,386 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:19:57,389 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:19:57,389 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:19:57,389 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:19:57,390 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:19:57,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:19:57,392 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:19:57,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:19:57,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:19:57,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:19:57,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:19:57,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:19:57,396 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:19:57,397 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:19:57,397 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:19:57,398 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:19:57,427 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:19:57,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:19:57,428 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:19:57,429 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:19:57,429 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:19:57,429 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:19:57,430 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:19:57,431 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:19:57,431 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:19:57,431 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:19:57,431 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:19:57,432 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:19:57,432 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:19:57,432 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:19:57,432 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:19:57,432 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:19:57,433 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:19:57,434 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:19:57,434 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:19:57,434 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:19:57,435 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:19:57,435 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:19:57,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:19:57,435 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:19:57,436 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:19:57,436 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:19:57,436 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:19:57,436 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:19:57,436 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:19:57,437 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:19:57,437 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:19:57,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:19:57,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:19:57,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:19:57,522 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:19:57,522 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:19:57,523 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl [2018-10-04 14:19:57,523 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl' [2018-10-04 14:19:57,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:19:57,581 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:19:57,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:57,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:19:57,582 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:19:57,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:57" (1/1) ... [2018-10-04 14:19:57,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:57" (1/1) ... [2018-10-04 14:19:57,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:57,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:19:57,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:19:57,628 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:19:57,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:57" (1/1) ... [2018-10-04 14:19:57,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:57" (1/1) ... [2018-10-04 14:19:57,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:57" (1/1) ... [2018-10-04 14:19:57,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:57" (1/1) ... [2018-10-04 14:19:57,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:57" (1/1) ... [2018-10-04 14:19:57,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:57" (1/1) ... [2018-10-04 14:19:57,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:57" (1/1) ... [2018-10-04 14:19:57,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:19:57,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:19:57,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:19:57,654 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:19:57,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:19:57,728 INFO L130 BoogieDeclarations]: Found specification of procedure l1l0 [2018-10-04 14:19:57,728 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l0 [2018-10-04 14:19:57,729 INFO L130 BoogieDeclarations]: Found specification of procedure l0l1 [2018-10-04 14:19:57,729 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l1 [2018-10-04 14:19:57,729 INFO L130 BoogieDeclarations]: Found specification of procedure l0l0 [2018-10-04 14:19:57,729 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l0 [2018-10-04 14:19:57,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:19:57,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:19:57,730 INFO L130 BoogieDeclarations]: Found specification of procedure l1l1 [2018-10-04 14:19:57,731 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l1 [2018-10-04 14:19:58,266 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:19:58,267 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:19:58 BoogieIcfgContainer [2018-10-04 14:19:58,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:19:58,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:19:58,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:19:58,272 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:19:58,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:57" (1/2) ... [2018-10-04 14:19:58,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2552a3b and model type threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:19:58, skipping insertion in model container [2018-10-04 14:19:58,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:19:58" (2/2) ... [2018-10-04 14:19:58,276 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithProcedures.bpl [2018-10-04 14:19:58,286 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:19:58,294 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-04 14:19:58,346 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:19:58,347 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:19:58,347 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:19:58,347 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:19:58,347 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:19:58,347 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:19:58,347 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:19:58,348 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:19:58,348 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:19:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-10-04 14:19:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:19:58,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:58,377 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:58,378 INFO L423 AbstractCegarLoop]: === Iteration 1 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:58,385 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:58,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1282157605, now seen corresponding path program 1 times [2018-10-04 14:19:58,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:58,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:58,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:58,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:58,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:58,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:58,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:19:58,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:19:58,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:19:58,731 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:58,733 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-10-04 14:19:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:59,614 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2018-10-04 14:19:59,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:19:59,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 14:19:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:59,645 INFO L225 Difference]: With dead ends: 72 [2018-10-04 14:19:59,645 INFO L226 Difference]: Without dead ends: 70 [2018-10-04 14:19:59,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 5 [2018-10-04 14:19:59,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-04 14:19:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-10-04 14:19:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-04 14:19:59,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2018-10-04 14:19:59,690 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 7 [2018-10-04 14:19:59,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:59,690 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2018-10-04 14:19:59,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:19:59,691 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2018-10-04 14:19:59,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:19:59,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:59,692 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:59,693 INFO L423 AbstractCegarLoop]: === Iteration 2 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:59,693 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:59,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1272619553, now seen corresponding path program 1 times [2018-10-04 14:19:59,693 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:59,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:59,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:59,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:59,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:59,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:59,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:19:59,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:19:59,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:19:59,811 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:59,812 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2018-10-04 14:20:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:00,674 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2018-10-04 14:20:00,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:20:00,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 14:20:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:00,682 INFO L225 Difference]: With dead ends: 81 [2018-10-04 14:20:00,682 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 14:20:00,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:20:00,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 14:20:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2018-10-04 14:20:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 14:20:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2018-10-04 14:20:00,707 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 7 [2018-10-04 14:20:00,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:00,711 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2018-10-04 14:20:00,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:20:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2018-10-04 14:20:00,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:00,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:00,715 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:00,716 INFO L423 AbstractCegarLoop]: === Iteration 3 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:00,716 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:00,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1601446133, now seen corresponding path program 1 times [2018-10-04 14:20:00,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:00,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:00,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:00,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:00,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:00,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:00,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:20:00,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:00,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:00,888 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:00,888 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand 7 states. [2018-10-04 14:20:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:02,187 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2018-10-04 14:20:02,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:20:02,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-10-04 14:20:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:02,192 INFO L225 Difference]: With dead ends: 122 [2018-10-04 14:20:02,192 INFO L226 Difference]: Without dead ends: 120 [2018-10-04 14:20:02,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 9 [2018-10-04 14:20:02,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-04 14:20:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 73. [2018-10-04 14:20:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 14:20:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2018-10-04 14:20:02,210 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 10 [2018-10-04 14:20:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:02,211 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2018-10-04 14:20:02,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2018-10-04 14:20:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:02,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:02,213 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:02,213 INFO L423 AbstractCegarLoop]: === Iteration 4 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:02,213 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:02,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1152651256, now seen corresponding path program 1 times [2018-10-04 14:20:02,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:02,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:02,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:02,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:02,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:02,342 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-04 14:20:02,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:02,343 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:02,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:02,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:02,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:20:02,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-04 14:20:02,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:02,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:02,524 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand 9 states. [2018-10-04 14:20:03,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:03,387 INFO L93 Difference]: Finished difference Result 168 states and 243 transitions. [2018-10-04 14:20:03,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:20:03,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-10-04 14:20:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:03,390 INFO L225 Difference]: With dead ends: 168 [2018-10-04 14:20:03,390 INFO L226 Difference]: Without dead ends: 121 [2018-10-04 14:20:03,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 15 [2018-10-04 14:20:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-04 14:20:03,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2018-10-04 14:20:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-04 14:20:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2018-10-04 14:20:03,418 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 10 [2018-10-04 14:20:03,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:03,419 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2018-10-04 14:20:03,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2018-10-04 14:20:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:03,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:03,423 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:03,424 INFO L423 AbstractCegarLoop]: === Iteration 5 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:03,424 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:03,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1536370777, now seen corresponding path program 1 times [2018-10-04 14:20:03,424 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:03,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:03,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:03,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:03,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:03,565 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-04 14:20:03,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:03,566 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:03,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:03,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:03,720 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-04 14:20:03,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:03,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-04 14:20:03,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:20:03,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:20:03,742 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:03,742 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand 10 states. [2018-10-04 14:20:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:04,606 INFO L93 Difference]: Finished difference Result 164 states and 232 transitions. [2018-10-04 14:20:04,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:20:04,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-04 14:20:04,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:04,609 INFO L225 Difference]: With dead ends: 164 [2018-10-04 14:20:04,609 INFO L226 Difference]: Without dead ends: 162 [2018-10-04 14:20:04,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 10 [2018-10-04 14:20:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-04 14:20:04,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 109. [2018-10-04 14:20:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 14:20:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2018-10-04 14:20:04,633 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 11 [2018-10-04 14:20:04,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:04,634 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2018-10-04 14:20:04,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:20:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2018-10-04 14:20:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:04,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:04,636 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:04,636 INFO L423 AbstractCegarLoop]: === Iteration 6 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:04,636 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:04,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1150793287, now seen corresponding path program 1 times [2018-10-04 14:20:04,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:04,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:04,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:04,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:04,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:04,740 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-04 14:20:04,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:04,741 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:04,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:04,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:04,877 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-04 14:20:04,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:04,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-04 14:20:04,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:20:04,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:20:04,899 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:04,899 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand 10 states. [2018-10-04 14:20:05,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:05,984 INFO L93 Difference]: Finished difference Result 181 states and 254 transitions. [2018-10-04 14:20:05,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:20:05,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-04 14:20:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:05,988 INFO L225 Difference]: With dead ends: 181 [2018-10-04 14:20:05,988 INFO L226 Difference]: Without dead ends: 179 [2018-10-04 14:20:05,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 10 [2018-10-04 14:20:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-04 14:20:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2018-10-04 14:20:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-04 14:20:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 164 transitions. [2018-10-04 14:20:06,014 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 164 transitions. Word has length 11 [2018-10-04 14:20:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:06,015 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 164 transitions. [2018-10-04 14:20:06,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:20:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 164 transitions. [2018-10-04 14:20:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:06,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:06,017 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:06,017 INFO L423 AbstractCegarLoop]: === Iteration 7 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:06,018 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:06,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1829652612, now seen corresponding path program 1 times [2018-10-04 14:20:06,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:06,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:06,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:06,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:06,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:06,220 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-04 14:20:06,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:06,220 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:06,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:06,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:06,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:20:06,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-04 14:20:06,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:06,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:06,365 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:06,365 INFO L87 Difference]: Start difference. First operand 117 states and 164 transitions. Second operand 9 states. [2018-10-04 14:20:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:07,175 INFO L93 Difference]: Finished difference Result 217 states and 304 transitions. [2018-10-04 14:20:07,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:20:07,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-04 14:20:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:07,178 INFO L225 Difference]: With dead ends: 217 [2018-10-04 14:20:07,178 INFO L226 Difference]: Without dead ends: 133 [2018-10-04 14:20:07,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 15 [2018-10-04 14:20:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-04 14:20:07,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2018-10-04 14:20:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-04 14:20:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2018-10-04 14:20:07,203 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 13 [2018-10-04 14:20:07,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:07,203 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2018-10-04 14:20:07,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2018-10-04 14:20:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:20:07,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:07,205 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:07,205 INFO L423 AbstractCegarLoop]: === Iteration 8 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:07,205 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:07,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1433054771, now seen corresponding path program 1 times [2018-10-04 14:20:07,205 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:07,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:07,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:07,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:07,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:07,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:07,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:07,814 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:07,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:07,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:08,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:08,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-04 14:20:08,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:08,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:08,412 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:08,413 INFO L87 Difference]: Start difference. First operand 119 states and 160 transitions. Second operand 13 states. [2018-10-04 14:20:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:10,457 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2018-10-04 14:20:10,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:20:10,459 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-04 14:20:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:10,461 INFO L225 Difference]: With dead ends: 194 [2018-10-04 14:20:10,461 INFO L226 Difference]: Without dead ends: 192 [2018-10-04 14:20:10,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.9s impTime 22 [2018-10-04 14:20:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-04 14:20:10,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 181. [2018-10-04 14:20:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-04 14:20:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 257 transitions. [2018-10-04 14:20:10,503 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 257 transitions. Word has length 14 [2018-10-04 14:20:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:10,504 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 257 transitions. [2018-10-04 14:20:10,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 257 transitions. [2018-10-04 14:20:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:20:10,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:10,505 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:10,505 INFO L423 AbstractCegarLoop]: === Iteration 9 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:10,505 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:10,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1436992942, now seen corresponding path program 1 times [2018-10-04 14:20:10,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:10,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:10,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:10,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:10,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:10,624 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-04 14:20:10,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:10,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:10,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:10,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:11,052 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-04 14:20:11,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:11,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-04 14:20:11,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:11,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:11,086 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:11,086 INFO L87 Difference]: Start difference. First operand 181 states and 257 transitions. Second operand 14 states. [2018-10-04 14:20:12,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:12,477 INFO L93 Difference]: Finished difference Result 246 states and 347 transitions. [2018-10-04 14:20:12,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:20:12,478 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 14:20:12,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:12,481 INFO L225 Difference]: With dead ends: 246 [2018-10-04 14:20:12,481 INFO L226 Difference]: Without dead ends: 244 [2018-10-04 14:20:12,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 18 [2018-10-04 14:20:12,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-04 14:20:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 193. [2018-10-04 14:20:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-04 14:20:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 274 transitions. [2018-10-04 14:20:12,521 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 274 transitions. Word has length 14 [2018-10-04 14:20:12,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:12,523 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 274 transitions. [2018-10-04 14:20:12,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 274 transitions. [2018-10-04 14:20:12,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:20:12,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:12,525 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:12,525 INFO L423 AbstractCegarLoop]: === Iteration 10 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:12,525 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:12,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1436993326, now seen corresponding path program 1 times [2018-10-04 14:20:12,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:12,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:12,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:12,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:12,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:12,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:12,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:12,695 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:12,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:12,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:12,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:12,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-04 14:20:12,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:12,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:12,894 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:12,894 INFO L87 Difference]: Start difference. First operand 193 states and 274 transitions. Second operand 14 states. [2018-10-04 14:20:14,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:14,991 INFO L93 Difference]: Finished difference Result 288 states and 406 transitions. [2018-10-04 14:20:14,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:20:14,994 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 14:20:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:14,996 INFO L225 Difference]: With dead ends: 288 [2018-10-04 14:20:14,997 INFO L226 Difference]: Without dead ends: 286 [2018-10-04 14:20:14,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 33 [2018-10-04 14:20:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-04 14:20:15,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 221. [2018-10-04 14:20:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-04 14:20:15,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 315 transitions. [2018-10-04 14:20:15,054 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 315 transitions. Word has length 14 [2018-10-04 14:20:15,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:15,055 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 315 transitions. [2018-10-04 14:20:15,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:15,055 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 315 transitions. [2018-10-04 14:20:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:20:15,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:15,056 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:15,056 INFO L423 AbstractCegarLoop]: === Iteration 11 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:15,056 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:15,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1791986342, now seen corresponding path program 1 times [2018-10-04 14:20:15,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:15,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:15,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:15,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:15,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:15,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:15,181 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:15,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:15,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:15,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:15,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-04 14:20:15,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:15,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:15,317 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:15,318 INFO L87 Difference]: Start difference. First operand 221 states and 315 transitions. Second operand 14 states. [2018-10-04 14:20:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:16,335 INFO L93 Difference]: Finished difference Result 314 states and 443 transitions. [2018-10-04 14:20:16,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:20:16,343 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 14:20:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:16,345 INFO L225 Difference]: With dead ends: 314 [2018-10-04 14:20:16,345 INFO L226 Difference]: Without dead ends: 312 [2018-10-04 14:20:16,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 25 [2018-10-04 14:20:16,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-10-04 14:20:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 243. [2018-10-04 14:20:16,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-04 14:20:16,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 349 transitions. [2018-10-04 14:20:16,384 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 349 transitions. Word has length 14 [2018-10-04 14:20:16,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:16,384 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 349 transitions. [2018-10-04 14:20:16,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:16,384 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 349 transitions. [2018-10-04 14:20:16,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:20:16,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:16,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:16,386 INFO L423 AbstractCegarLoop]: === Iteration 12 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:16,386 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:16,386 INFO L82 PathProgramCache]: Analyzing trace with hash 844488035, now seen corresponding path program 1 times [2018-10-04 14:20:16,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:16,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:16,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:16,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:16,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:16,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:16,471 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:16,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:16,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:16,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:16,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-04 14:20:16,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:16,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:16,619 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:16,619 INFO L87 Difference]: Start difference. First operand 243 states and 349 transitions. Second operand 13 states. [2018-10-04 14:20:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:17,378 INFO L93 Difference]: Finished difference Result 322 states and 462 transitions. [2018-10-04 14:20:17,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:20:17,386 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-04 14:20:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:17,388 INFO L225 Difference]: With dead ends: 322 [2018-10-04 14:20:17,388 INFO L226 Difference]: Without dead ends: 320 [2018-10-04 14:20:17,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 23 [2018-10-04 14:20:17,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-04 14:20:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 302. [2018-10-04 14:20:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-04 14:20:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 444 transitions. [2018-10-04 14:20:17,448 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 444 transitions. Word has length 14 [2018-10-04 14:20:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:17,448 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 444 transitions. [2018-10-04 14:20:17,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 444 transitions. [2018-10-04 14:20:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:20:17,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:17,450 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:17,450 INFO L423 AbstractCegarLoop]: === Iteration 13 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:17,450 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:17,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1052420626, now seen corresponding path program 1 times [2018-10-04 14:20:17,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:17,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:17,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:17,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:17,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:17,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:17,582 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:17,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:17,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:17,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:17,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-04 14:20:17,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:17,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:17,770 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:17,771 INFO L87 Difference]: Start difference. First operand 302 states and 444 transitions. Second operand 14 states. [2018-10-04 14:20:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:19,229 INFO L93 Difference]: Finished difference Result 378 states and 544 transitions. [2018-10-04 14:20:19,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:20:19,230 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 14:20:19,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:19,234 INFO L225 Difference]: With dead ends: 378 [2018-10-04 14:20:19,234 INFO L226 Difference]: Without dead ends: 376 [2018-10-04 14:20:19,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 23 [2018-10-04 14:20:19,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-04 14:20:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 301. [2018-10-04 14:20:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-04 14:20:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 443 transitions. [2018-10-04 14:20:19,294 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 443 transitions. Word has length 14 [2018-10-04 14:20:19,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:19,296 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 443 transitions. [2018-10-04 14:20:19,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 443 transitions. [2018-10-04 14:20:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:20:19,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:19,299 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:19,300 INFO L423 AbstractCegarLoop]: === Iteration 14 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:19,300 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:19,300 INFO L82 PathProgramCache]: Analyzing trace with hash 697427610, now seen corresponding path program 1 times [2018-10-04 14:20:19,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:19,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:19,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:19,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:19,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:19,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:19,449 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:19,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:19,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:19,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:19,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 15 [2018-10-04 14:20:19,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:20:19,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:20:19,652 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:19,652 INFO L87 Difference]: Start difference. First operand 301 states and 443 transitions. Second operand 16 states. [2018-10-04 14:20:21,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:21,253 INFO L93 Difference]: Finished difference Result 395 states and 572 transitions. [2018-10-04 14:20:21,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:20:21,254 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2018-10-04 14:20:21,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:21,257 INFO L225 Difference]: With dead ends: 395 [2018-10-04 14:20:21,258 INFO L226 Difference]: Without dead ends: 393 [2018-10-04 14:20:21,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 34 [2018-10-04 14:20:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-04 14:20:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 312. [2018-10-04 14:20:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-04 14:20:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 459 transitions. [2018-10-04 14:20:21,307 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 459 transitions. Word has length 14 [2018-10-04 14:20:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:21,307 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 459 transitions. [2018-10-04 14:20:21,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:20:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 459 transitions. [2018-10-04 14:20:21,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:20:21,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:21,308 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:21,309 INFO L423 AbstractCegarLoop]: === Iteration 15 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:21,309 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:21,309 INFO L82 PathProgramCache]: Analyzing trace with hash 697427226, now seen corresponding path program 1 times [2018-10-04 14:20:21,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:21,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:21,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:21,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:21,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:21,446 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-04 14:20:21,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:21,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:21,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:21,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:21,623 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-04 14:20:21,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:21,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 13 [2018-10-04 14:20:21,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:20:21,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:20:21,645 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:21,645 INFO L87 Difference]: Start difference. First operand 312 states and 459 transitions. Second operand 15 states. [2018-10-04 14:20:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:23,796 INFO L93 Difference]: Finished difference Result 383 states and 560 transitions. [2018-10-04 14:20:23,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:20:23,796 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-04 14:20:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:23,799 INFO L225 Difference]: With dead ends: 383 [2018-10-04 14:20:23,799 INFO L226 Difference]: Without dead ends: 381 [2018-10-04 14:20:23,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 20 [2018-10-04 14:20:23,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-04 14:20:23,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 328. [2018-10-04 14:20:23,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-04 14:20:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 482 transitions. [2018-10-04 14:20:23,859 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 482 transitions. Word has length 14 [2018-10-04 14:20:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:23,859 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 482 transitions. [2018-10-04 14:20:23,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:20:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 482 transitions. [2018-10-04 14:20:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:20:23,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:23,860 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:23,860 INFO L423 AbstractCegarLoop]: === Iteration 16 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:23,860 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:23,860 INFO L82 PathProgramCache]: Analyzing trace with hash 406900684, now seen corresponding path program 1 times [2018-10-04 14:20:23,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:23,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:23,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:23,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:23,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:24,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:24,666 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:24,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:24,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:24,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:24,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-04 14:20:24,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:20:24,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:20:24,861 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:24,861 INFO L87 Difference]: Start difference. First operand 328 states and 482 transitions. Second operand 16 states. [2018-10-04 14:20:26,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:26,121 INFO L93 Difference]: Finished difference Result 429 states and 618 transitions. [2018-10-04 14:20:26,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:20:26,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-10-04 14:20:26,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:26,124 INFO L225 Difference]: With dead ends: 429 [2018-10-04 14:20:26,124 INFO L226 Difference]: Without dead ends: 427 [2018-10-04 14:20:26,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.7s impTime 34 [2018-10-04 14:20:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-04 14:20:26,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 242. [2018-10-04 14:20:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-04 14:20:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 351 transitions. [2018-10-04 14:20:26,183 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 351 transitions. Word has length 17 [2018-10-04 14:20:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:26,183 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 351 transitions. [2018-10-04 14:20:26,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:20:26,183 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 351 transitions. [2018-10-04 14:20:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:20:26,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:26,184 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:26,185 INFO L423 AbstractCegarLoop]: === Iteration 17 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:26,185 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2143481530, now seen corresponding path program 1 times [2018-10-04 14:20:26,185 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:26,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:26,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:26,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:26,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:26,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:26,508 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:26,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:26,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:26,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:26,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-04 14:20:26,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:20:26,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:20:26,670 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:26,670 INFO L87 Difference]: Start difference. First operand 242 states and 351 transitions. Second operand 16 states. [2018-10-04 14:20:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:27,882 INFO L93 Difference]: Finished difference Result 330 states and 466 transitions. [2018-10-04 14:20:27,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:20:27,882 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-10-04 14:20:27,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:27,884 INFO L225 Difference]: With dead ends: 330 [2018-10-04 14:20:27,884 INFO L226 Difference]: Without dead ends: 328 [2018-10-04 14:20:27,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 29 [2018-10-04 14:20:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-04 14:20:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 158. [2018-10-04 14:20:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-04 14:20:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 226 transitions. [2018-10-04 14:20:27,945 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 226 transitions. Word has length 17 [2018-10-04 14:20:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:27,946 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 226 transitions. [2018-10-04 14:20:27,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:20:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 226 transitions. [2018-10-04 14:20:27,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:20:27,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:27,947 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-04 14:20:27,947 INFO L423 AbstractCegarLoop]: === Iteration 18 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:27,947 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash -653821292, now seen corresponding path program 1 times [2018-10-04 14:20:27,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:27,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:27,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:27,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:27,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:28,042 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-04 14:20:28,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:28,043 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:28,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:28,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:28,160 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-04 14:20:28,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:28,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-10-04 14:20:28,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:28,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:28,182 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:28,182 INFO L87 Difference]: Start difference. First operand 158 states and 226 transitions. Second operand 13 states. [2018-10-04 14:20:28,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:28,914 INFO L93 Difference]: Finished difference Result 271 states and 380 transitions. [2018-10-04 14:20:28,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:20:28,914 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 14:20:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:28,916 INFO L225 Difference]: With dead ends: 271 [2018-10-04 14:20:28,916 INFO L226 Difference]: Without dead ends: 269 [2018-10-04 14:20:28,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-04 14:20:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-04 14:20:28,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 180. [2018-10-04 14:20:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-04 14:20:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 258 transitions. [2018-10-04 14:20:28,991 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 258 transitions. Word has length 18 [2018-10-04 14:20:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:28,991 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 258 transitions. [2018-10-04 14:20:28,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 258 transitions. [2018-10-04 14:20:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:20:28,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:28,993 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:28,993 INFO L423 AbstractCegarLoop]: === Iteration 19 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:28,993 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:28,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1014964826, now seen corresponding path program 1 times [2018-10-04 14:20:28,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:28,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:28,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:28,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:28,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:29,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:29,460 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:29,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:29,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:29,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:20:29,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-10-04 14:20:29,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:29,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:29,616 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:29,616 INFO L87 Difference]: Start difference. First operand 180 states and 258 transitions. Second operand 13 states. [2018-10-04 14:20:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:32,183 INFO L93 Difference]: Finished difference Result 741 states and 1047 transitions. [2018-10-04 14:20:32,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-04 14:20:32,183 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 14:20:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:32,186 INFO L225 Difference]: With dead ends: 741 [2018-10-04 14:20:32,186 INFO L226 Difference]: Without dead ends: 564 [2018-10-04 14:20:32,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.1s impTime 33 [2018-10-04 14:20:32,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-10-04 14:20:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 341. [2018-10-04 14:20:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-04 14:20:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 486 transitions. [2018-10-04 14:20:32,332 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 486 transitions. Word has length 18 [2018-10-04 14:20:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:32,332 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 486 transitions. [2018-10-04 14:20:32,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 486 transitions. [2018-10-04 14:20:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:20:32,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:32,334 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-04 14:20:32,334 INFO L423 AbstractCegarLoop]: === Iteration 20 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:32,334 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:32,334 INFO L82 PathProgramCache]: Analyzing trace with hash -155045024, now seen corresponding path program 1 times [2018-10-04 14:20:32,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:32,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:32,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:32,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:32,445 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-04 14:20:32,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:32,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:32,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:32,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-04 14:20:32,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:32,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:32,663 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:32,663 INFO L87 Difference]: Start difference. First operand 341 states and 486 transitions. Second operand 13 states. [2018-10-04 14:20:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:33,996 INFO L93 Difference]: Finished difference Result 809 states and 1155 transitions. [2018-10-04 14:20:34,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 14:20:34,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 14:20:34,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:34,004 INFO L225 Difference]: With dead ends: 809 [2018-10-04 14:20:34,004 INFO L226 Difference]: Without dead ends: 470 [2018-10-04 14:20:34,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 21 [2018-10-04 14:20:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-04 14:20:34,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 368. [2018-10-04 14:20:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-04 14:20:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 523 transitions. [2018-10-04 14:20:34,182 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 523 transitions. Word has length 18 [2018-10-04 14:20:34,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:34,183 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 523 transitions. [2018-10-04 14:20:34,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:34,183 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 523 transitions. [2018-10-04 14:20:34,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:20:34,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:34,184 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:34,184 INFO L423 AbstractCegarLoop]: === Iteration 21 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:34,184 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:34,185 INFO L82 PathProgramCache]: Analyzing trace with hash 393788879, now seen corresponding path program 1 times [2018-10-04 14:20:34,185 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:34,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:34,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:34,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:34,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:34,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-04 14:20:34,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:34,433 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-04 14:20:34,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:34,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:34,609 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-04 14:20:34,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:34,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 14:20:34,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:34,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:34,631 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:34,631 INFO L87 Difference]: Start difference. First operand 368 states and 523 transitions. Second operand 13 states. [2018-10-04 14:20:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:37,385 INFO L93 Difference]: Finished difference Result 1106 states and 1568 transitions. [2018-10-04 14:20:37,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 14:20:37,386 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 14:20:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:37,389 INFO L225 Difference]: With dead ends: 1106 [2018-10-04 14:20:37,389 INFO L226 Difference]: Without dead ends: 724 [2018-10-04 14:20:37,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 20 [2018-10-04 14:20:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-10-04 14:20:37,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 519. [2018-10-04 14:20:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-10-04 14:20:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 739 transitions. [2018-10-04 14:20:37,590 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 739 transitions. Word has length 18 [2018-10-04 14:20:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:37,590 INFO L480 AbstractCegarLoop]: Abstraction has 519 states and 739 transitions. [2018-10-04 14:20:37,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 739 transitions. [2018-10-04 14:20:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:20:37,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:37,592 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:37,592 INFO L423 AbstractCegarLoop]: === Iteration 22 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:37,592 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:37,592 INFO L82 PathProgramCache]: Analyzing trace with hash -216264799, now seen corresponding path program 1 times [2018-10-04 14:20:37,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:37,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:37,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:37,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:37,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:37,710 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-04 14:20:37,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:37,711 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-04 14:20:37,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:37,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:37,801 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-04 14:20:37,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:37,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-04 14:20:37,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:20:37,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:20:37,824 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:37,824 INFO L87 Difference]: Start difference. First operand 519 states and 739 transitions. Second operand 11 states. [2018-10-04 14:20:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:38,934 INFO L93 Difference]: Finished difference Result 711 states and 1002 transitions. [2018-10-04 14:20:38,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:20:38,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-10-04 14:20:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:38,941 INFO L225 Difference]: With dead ends: 711 [2018-10-04 14:20:38,941 INFO L226 Difference]: Without dead ends: 709 [2018-10-04 14:20:38,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 13 [2018-10-04 14:20:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-10-04 14:20:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 498. [2018-10-04 14:20:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-10-04 14:20:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 704 transitions. [2018-10-04 14:20:39,167 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 704 transitions. Word has length 18 [2018-10-04 14:20:39,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:39,167 INFO L480 AbstractCegarLoop]: Abstraction has 498 states and 704 transitions. [2018-10-04 14:20:39,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:20:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 704 transitions. [2018-10-04 14:20:39,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:20:39,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:39,168 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:39,168 INFO L423 AbstractCegarLoop]: === Iteration 23 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:39,169 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:39,169 INFO L82 PathProgramCache]: Analyzing trace with hash 983482113, now seen corresponding path program 1 times [2018-10-04 14:20:39,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:39,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:39,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:39,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:39,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:39,432 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-04 14:20:39,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:39,433 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-04 14:20:39,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:39,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:39,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:20:39,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2018-10-04 14:20:39,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:39,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:39,624 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:39,624 INFO L87 Difference]: Start difference. First operand 498 states and 704 transitions. Second operand 13 states. [2018-10-04 14:20:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:41,015 INFO L93 Difference]: Finished difference Result 1319 states and 1864 transitions. [2018-10-04 14:20:41,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 14:20:41,016 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 14:20:41,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:41,018 INFO L225 Difference]: With dead ends: 1319 [2018-10-04 14:20:41,018 INFO L226 Difference]: Without dead ends: 823 [2018-10-04 14:20:41,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 20 [2018-10-04 14:20:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-10-04 14:20:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 566. [2018-10-04 14:20:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-10-04 14:20:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 809 transitions. [2018-10-04 14:20:41,244 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 809 transitions. Word has length 18 [2018-10-04 14:20:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:41,244 INFO L480 AbstractCegarLoop]: Abstraction has 566 states and 809 transitions. [2018-10-04 14:20:41,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 809 transitions. [2018-10-04 14:20:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:20:41,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:41,247 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-04 14:20:41,247 INFO L423 AbstractCegarLoop]: === Iteration 24 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:41,247 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:41,247 INFO L82 PathProgramCache]: Analyzing trace with hash 801556786, now seen corresponding path program 1 times [2018-10-04 14:20:41,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:41,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:41,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:41,615 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-04 14:20:41,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:41,616 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-04 14:20:41,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:41,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:41,762 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-04 14:20:41,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:41,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-04 14:20:41,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:20:41,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:20:41,783 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:41,783 INFO L87 Difference]: Start difference. First operand 566 states and 809 transitions. Second operand 12 states. [2018-10-04 14:20:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:42,642 INFO L93 Difference]: Finished difference Result 766 states and 1086 transitions. [2018-10-04 14:20:42,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:20:42,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-10-04 14:20:42,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:42,645 INFO L225 Difference]: With dead ends: 766 [2018-10-04 14:20:42,645 INFO L226 Difference]: Without dead ends: 764 [2018-10-04 14:20:42,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 14 [2018-10-04 14:20:42,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-10-04 14:20:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 608. [2018-10-04 14:20:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-10-04 14:20:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 869 transitions. [2018-10-04 14:20:42,836 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 869 transitions. Word has length 18 [2018-10-04 14:20:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:42,837 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 869 transitions. [2018-10-04 14:20:42,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:20:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 869 transitions. [2018-10-04 14:20:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:20:42,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:42,838 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:42,838 INFO L423 AbstractCegarLoop]: === Iteration 25 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:42,838 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:42,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1593301430, now seen corresponding path program 1 times [2018-10-04 14:20:42,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:42,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:42,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:42,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:42,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:42,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:42,991 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-04 14:20:42,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:43,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:43,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:20:43,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-10-04 14:20:43,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:43,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:43,439 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:43,439 INFO L87 Difference]: Start difference. First operand 608 states and 869 transitions. Second operand 13 states. [2018-10-04 14:20:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:46,890 INFO L93 Difference]: Finished difference Result 2095 states and 2968 transitions. [2018-10-04 14:20:46,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-04 14:20:46,890 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 14:20:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:46,895 INFO L225 Difference]: With dead ends: 2095 [2018-10-04 14:20:46,895 INFO L226 Difference]: Without dead ends: 1329 [2018-10-04 14:20:46,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.3s impTime 33 [2018-10-04 14:20:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2018-10-04 14:20:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 992. [2018-10-04 14:20:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-10-04 14:20:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1402 transitions. [2018-10-04 14:20:47,226 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1402 transitions. Word has length 18 [2018-10-04 14:20:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:47,226 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1402 transitions. [2018-10-04 14:20:47,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1402 transitions. [2018-10-04 14:20:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:20:47,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:47,227 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:47,227 INFO L423 AbstractCegarLoop]: === Iteration 26 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:47,227 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1366841759, now seen corresponding path program 1 times [2018-10-04 14:20:47,227 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:47,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:47,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:47,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:47,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:47,407 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-04 14:20:47,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:47,407 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-04 14:20:47,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:47,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:47,492 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-04 14:20:47,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:47,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-04 14:20:47,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:20:47,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:20:47,513 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:47,513 INFO L87 Difference]: Start difference. First operand 992 states and 1402 transitions. Second operand 11 states. [2018-10-04 14:20:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:48,713 INFO L93 Difference]: Finished difference Result 1291 states and 1819 transitions. [2018-10-04 14:20:48,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:20:48,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-10-04 14:20:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:48,717 INFO L225 Difference]: With dead ends: 1291 [2018-10-04 14:20:48,717 INFO L226 Difference]: Without dead ends: 1289 [2018-10-04 14:20:48,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 13 [2018-10-04 14:20:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-10-04 14:20:49,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1028. [2018-10-04 14:20:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-10-04 14:20:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1454 transitions. [2018-10-04 14:20:49,080 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1454 transitions. Word has length 18 [2018-10-04 14:20:49,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:49,080 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1454 transitions. [2018-10-04 14:20:49,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:20:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1454 transitions. [2018-10-04 14:20:49,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:20:49,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:49,082 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:49,082 INFO L423 AbstractCegarLoop]: === Iteration 27 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:49,082 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:49,082 INFO L82 PathProgramCache]: Analyzing trace with hash -817918193, now seen corresponding path program 1 times [2018-10-04 14:20:49,082 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:49,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:49,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:49,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:49,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:49,395 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-04 14:20:49,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:49,396 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 14:20:49,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:49,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:49,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:20:49,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2018-10-04 14:20:49,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:49,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:49,524 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:49,524 INFO L87 Difference]: Start difference. First operand 1028 states and 1454 transitions. Second operand 13 states. [2018-10-04 14:20:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:51,193 INFO L93 Difference]: Finished difference Result 2222 states and 3144 transitions. [2018-10-04 14:20:51,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 14:20:51,193 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 14:20:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:51,199 INFO L225 Difference]: With dead ends: 2222 [2018-10-04 14:20:51,199 INFO L226 Difference]: Without dead ends: 1132 [2018-10-04 14:20:51,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 21 [2018-10-04 14:20:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2018-10-04 14:20:51,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 831. [2018-10-04 14:20:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-10-04 14:20:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1173 transitions. [2018-10-04 14:20:51,474 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1173 transitions. Word has length 18 [2018-10-04 14:20:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:51,474 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1173 transitions. [2018-10-04 14:20:51,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1173 transitions. [2018-10-04 14:20:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:20:51,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:51,476 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:51,476 INFO L423 AbstractCegarLoop]: === Iteration 28 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:51,476 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:51,476 INFO L82 PathProgramCache]: Analyzing trace with hash -228224959, now seen corresponding path program 1 times [2018-10-04 14:20:51,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:51,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:51,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:51,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:51,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:51,576 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-04 14:20:51,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:51,577 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-04 14:20:51,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:51,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:51,738 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-04 14:20:51,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:51,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 14:20:51,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:51,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:51,760 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:51,761 INFO L87 Difference]: Start difference. First operand 831 states and 1173 transitions. Second operand 13 states. [2018-10-04 14:20:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:53,882 INFO L93 Difference]: Finished difference Result 1989 states and 2785 transitions. [2018-10-04 14:20:53,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 14:20:53,884 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 14:20:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:53,889 INFO L225 Difference]: With dead ends: 1989 [2018-10-04 14:20:53,889 INFO L226 Difference]: Without dead ends: 1130 [2018-10-04 14:20:53,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 20 [2018-10-04 14:20:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-10-04 14:20:54,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 806. [2018-10-04 14:20:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-04 14:20:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1135 transitions. [2018-10-04 14:20:54,181 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1135 transitions. Word has length 18 [2018-10-04 14:20:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:54,181 INFO L480 AbstractCegarLoop]: Abstraction has 806 states and 1135 transitions. [2018-10-04 14:20:54,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:54,181 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1135 transitions. [2018-10-04 14:20:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:20:54,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:54,182 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:54,183 INFO L423 AbstractCegarLoop]: === Iteration 29 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:54,183 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:54,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1122647006, now seen corresponding path program 1 times [2018-10-04 14:20:54,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:54,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:54,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:54,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:54,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:54,554 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-04 14:20:54,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:54,555 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-04 14:20:54,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:54,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:54,714 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-04 14:20:54,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:54,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-04 14:20:54,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:20:54,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:20:54,735 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:54,735 INFO L87 Difference]: Start difference. First operand 806 states and 1135 transitions. Second operand 11 states. [2018-10-04 14:20:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:56,282 INFO L93 Difference]: Finished difference Result 1022 states and 1428 transitions. [2018-10-04 14:20:56,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:20:56,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-10-04 14:20:56,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:56,287 INFO L225 Difference]: With dead ends: 1022 [2018-10-04 14:20:56,287 INFO L226 Difference]: Without dead ends: 1020 [2018-10-04 14:20:56,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 21 [2018-10-04 14:20:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-10-04 14:20:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 838. [2018-10-04 14:20:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-10-04 14:20:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1182 transitions. [2018-10-04 14:20:56,577 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1182 transitions. Word has length 22 [2018-10-04 14:20:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:56,577 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1182 transitions. [2018-10-04 14:20:56,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:20:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1182 transitions. [2018-10-04 14:20:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:20:56,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:56,578 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:56,579 INFO L423 AbstractCegarLoop]: === Iteration 30 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:56,579 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:56,579 INFO L82 PathProgramCache]: Analyzing trace with hash 15880131, now seen corresponding path program 1 times [2018-10-04 14:20:56,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:56,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:56,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:56,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:56,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:56,804 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-04 14:20:56,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:56,805 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 14:20:56,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:56,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:56,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:56,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-04 14:20:56,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:20:56,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:20:56,935 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:56,935 INFO L87 Difference]: Start difference. First operand 838 states and 1182 transitions. Second operand 11 states. [2018-10-04 14:20:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:58,716 INFO L93 Difference]: Finished difference Result 1127 states and 1575 transitions. [2018-10-04 14:20:58,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:20:58,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-10-04 14:20:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:58,720 INFO L225 Difference]: With dead ends: 1127 [2018-10-04 14:20:58,720 INFO L226 Difference]: Without dead ends: 1125 [2018-10-04 14:20:58,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 19 [2018-10-04 14:20:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-10-04 14:20:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 852. [2018-10-04 14:20:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-10-04 14:20:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1203 transitions. [2018-10-04 14:20:59,017 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1203 transitions. Word has length 22 [2018-10-04 14:20:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:59,018 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1203 transitions. [2018-10-04 14:20:59,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:20:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1203 transitions. [2018-10-04 14:20:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:20:59,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:59,020 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:59,020 INFO L423 AbstractCegarLoop]: === Iteration 31 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:59,020 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash -510719313, now seen corresponding path program 1 times [2018-10-04 14:20:59,020 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:59,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:59,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:59,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:59,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:59,138 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-04 14:20:59,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:59,139 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-04 14:20:59,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:59,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:59,627 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-04 14:20:59,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:59,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 14:20:59,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:59,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:59,648 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:59,648 INFO L87 Difference]: Start difference. First operand 852 states and 1203 transitions. Second operand 14 states. [2018-10-04 14:21:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:01,563 INFO L93 Difference]: Finished difference Result 1127 states and 1578 transitions. [2018-10-04 14:21:01,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 14:21:01,563 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-10-04 14:21:01,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:01,567 INFO L225 Difference]: With dead ends: 1127 [2018-10-04 14:21:01,567 INFO L226 Difference]: Without dead ends: 1125 [2018-10-04 14:21:01,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime 25 [2018-10-04 14:21:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-10-04 14:21:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 830. [2018-10-04 14:21:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-10-04 14:21:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1171 transitions. [2018-10-04 14:21:01,867 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1171 transitions. Word has length 22 [2018-10-04 14:21:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:01,868 INFO L480 AbstractCegarLoop]: Abstraction has 830 states and 1171 transitions. [2018-10-04 14:21:01,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:21:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1171 transitions. [2018-10-04 14:21:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:21:01,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:01,869 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:01,870 INFO L423 AbstractCegarLoop]: === Iteration 32 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:01,870 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:01,870 INFO L82 PathProgramCache]: Analyzing trace with hash 627807824, now seen corresponding path program 1 times [2018-10-04 14:21:01,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:01,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:01,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:02,203 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-04 14:21:02,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:02,203 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-04 14:21:02,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:02,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:02,389 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-04 14:21:02,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:02,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-10-04 14:21:02,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:21:02,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:21:02,411 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:02,412 INFO L87 Difference]: Start difference. First operand 830 states and 1171 transitions. Second operand 15 states. [2018-10-04 14:21:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:04,144 INFO L93 Difference]: Finished difference Result 1072 states and 1499 transitions. [2018-10-04 14:21:04,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:21:04,145 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-10-04 14:21:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:04,148 INFO L225 Difference]: With dead ends: 1072 [2018-10-04 14:21:04,148 INFO L226 Difference]: Without dead ends: 1070 [2018-10-04 14:21:04,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 24 [2018-10-04 14:21:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2018-10-04 14:21:04,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 788. [2018-10-04 14:21:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-10-04 14:21:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1104 transitions. [2018-10-04 14:21:04,447 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1104 transitions. Word has length 22 [2018-10-04 14:21:04,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:04,448 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 1104 transitions. [2018-10-04 14:21:04,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:21:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1104 transitions. [2018-10-04 14:21:04,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:21:04,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:04,449 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:04,450 INFO L423 AbstractCegarLoop]: === Iteration 33 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:04,450 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:04,450 INFO L82 PathProgramCache]: Analyzing trace with hash 345073063, now seen corresponding path program 1 times [2018-10-04 14:21:04,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:04,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:04,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:04,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:04,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:04,657 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-04 14:21:04,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:04,657 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-04 14:21:04,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:04,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:04,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:04,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-04 14:21:04,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:21:04,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:21:04,786 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:04,786 INFO L87 Difference]: Start difference. First operand 788 states and 1104 transitions. Second operand 10 states. [2018-10-04 14:21:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:06,322 INFO L93 Difference]: Finished difference Result 1025 states and 1426 transitions. [2018-10-04 14:21:06,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:21:06,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-10-04 14:21:06,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:06,326 INFO L225 Difference]: With dead ends: 1025 [2018-10-04 14:21:06,326 INFO L226 Difference]: Without dead ends: 1023 [2018-10-04 14:21:06,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 20 [2018-10-04 14:21:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-10-04 14:21:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 818. [2018-10-04 14:21:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-10-04 14:21:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1149 transitions. [2018-10-04 14:21:06,630 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1149 transitions. Word has length 22 [2018-10-04 14:21:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:06,630 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1149 transitions. [2018-10-04 14:21:06,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:21:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1149 transitions. [2018-10-04 14:21:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:21:06,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:06,632 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:06,632 INFO L423 AbstractCegarLoop]: === Iteration 34 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:06,632 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:06,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1613894486, now seen corresponding path program 1 times [2018-10-04 14:21:06,633 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:06,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:06,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:06,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:06,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:06,816 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-04 14:21:06,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:06,816 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-04 14:21:06,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:06,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:06,981 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-04 14:21:07,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:07,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-10-04 14:21:07,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:21:07,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:21:07,003 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:07,004 INFO L87 Difference]: Start difference. First operand 818 states and 1149 transitions. Second operand 15 states. [2018-10-04 14:21:08,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:08,807 INFO L93 Difference]: Finished difference Result 1057 states and 1481 transitions. [2018-10-04 14:21:08,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:21:08,807 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-10-04 14:21:08,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:08,811 INFO L225 Difference]: With dead ends: 1057 [2018-10-04 14:21:08,811 INFO L226 Difference]: Without dead ends: 1055 [2018-10-04 14:21:08,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 23 [2018-10-04 14:21:08,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2018-10-04 14:21:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 770. [2018-10-04 14:21:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-10-04 14:21:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1073 transitions. [2018-10-04 14:21:09,111 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1073 transitions. Word has length 22 [2018-10-04 14:21:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:09,111 INFO L480 AbstractCegarLoop]: Abstraction has 770 states and 1073 transitions. [2018-10-04 14:21:09,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:21:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1073 transitions. [2018-10-04 14:21:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 14:21:09,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:09,112 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:09,113 INFO L423 AbstractCegarLoop]: === Iteration 35 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:09,113 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:09,113 INFO L82 PathProgramCache]: Analyzing trace with hash -488650854, now seen corresponding path program 1 times [2018-10-04 14:21:09,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:09,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:09,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:09,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:09,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:10,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:10,333 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-04 14:21:10,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:10,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:21:10,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:10,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-04 14:21:10,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:21:10,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:21:10,509 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:10,510 INFO L87 Difference]: Start difference. First operand 770 states and 1073 transitions. Second operand 15 states. [2018-10-04 14:21:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:13,047 INFO L93 Difference]: Finished difference Result 1779 states and 2438 transitions. [2018-10-04 14:21:13,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 14:21:13,048 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-04 14:21:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:13,053 INFO L225 Difference]: With dead ends: 1779 [2018-10-04 14:21:13,054 INFO L226 Difference]: Without dead ends: 1507 [2018-10-04 14:21:13,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.2s impTime 26 [2018-10-04 14:21:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-10-04 14:21:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1174. [2018-10-04 14:21:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-10-04 14:21:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1623 transitions. [2018-10-04 14:21:13,522 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1623 transitions. Word has length 25 [2018-10-04 14:21:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:13,522 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 1623 transitions. [2018-10-04 14:21:13,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:21:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1623 transitions. [2018-10-04 14:21:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 14:21:13,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:13,524 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:13,524 INFO L423 AbstractCegarLoop]: === Iteration 36 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:13,524 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1608047085, now seen corresponding path program 1 times [2018-10-04 14:21:13,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:13,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:13,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:13,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:13,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:13,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:13,750 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-04 14:21:13,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:13,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:21:13,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:13,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-04 14:21:13,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:21:13,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:21:13,916 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:13,916 INFO L87 Difference]: Start difference. First operand 1174 states and 1623 transitions. Second operand 15 states. [2018-10-04 14:21:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:16,569 INFO L93 Difference]: Finished difference Result 2685 states and 3700 transitions. [2018-10-04 14:21:16,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 14:21:16,570 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-04 14:21:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:16,576 INFO L225 Difference]: With dead ends: 2685 [2018-10-04 14:21:16,576 INFO L226 Difference]: Without dead ends: 1652 [2018-10-04 14:21:16,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 24 [2018-10-04 14:21:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2018-10-04 14:21:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1212. [2018-10-04 14:21:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2018-10-04 14:21:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1681 transitions. [2018-10-04 14:21:17,057 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1681 transitions. Word has length 25 [2018-10-04 14:21:17,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:17,057 INFO L480 AbstractCegarLoop]: Abstraction has 1212 states and 1681 transitions. [2018-10-04 14:21:17,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:21:17,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1681 transitions. [2018-10-04 14:21:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 14:21:17,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:17,059 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:17,059 INFO L423 AbstractCegarLoop]: === Iteration 37 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:17,059 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:17,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1101622072, now seen corresponding path program 1 times [2018-10-04 14:21:17,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:17,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:17,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:17,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:17,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:17,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:17,255 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-04 14:21:17,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:17,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:21:17,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:17,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-04 14:21:17,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:21:17,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:21:17,417 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:17,417 INFO L87 Difference]: Start difference. First operand 1212 states and 1681 transitions. Second operand 15 states. [2018-10-04 14:21:20,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:20,371 INFO L93 Difference]: Finished difference Result 2130 states and 2907 transitions. [2018-10-04 14:21:20,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 14:21:20,372 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-04 14:21:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:20,379 INFO L225 Difference]: With dead ends: 2130 [2018-10-04 14:21:20,379 INFO L226 Difference]: Without dead ends: 1946 [2018-10-04 14:21:20,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 27 [2018-10-04 14:21:20,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2018-10-04 14:21:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1616. [2018-10-04 14:21:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2018-10-04 14:21:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2248 transitions. [2018-10-04 14:21:21,055 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2248 transitions. Word has length 25 [2018-10-04 14:21:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:21,055 INFO L480 AbstractCegarLoop]: Abstraction has 1616 states and 2248 transitions. [2018-10-04 14:21:21,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:21:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2248 transitions. [2018-10-04 14:21:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 14:21:21,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:21,057 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:21,057 INFO L423 AbstractCegarLoop]: === Iteration 38 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:21,058 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1649781575, now seen corresponding path program 1 times [2018-10-04 14:21:21,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:21,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:21,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:21,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:21,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:21,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:21,279 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-04 14:21:21,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:21,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:21:21,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:21,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-04 14:21:21,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:21:21,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:21:21,448 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:21,448 INFO L87 Difference]: Start difference. First operand 1616 states and 2248 transitions. Second operand 15 states. [2018-10-04 14:21:24,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:24,130 INFO L93 Difference]: Finished difference Result 3372 states and 4705 transitions. [2018-10-04 14:21:24,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 14:21:24,131 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-04 14:21:24,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:24,141 INFO L225 Difference]: With dead ends: 3372 [2018-10-04 14:21:24,141 INFO L226 Difference]: Without dead ends: 2040 [2018-10-04 14:21:24,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 24 [2018-10-04 14:21:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2018-10-04 14:21:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1575. [2018-10-04 14:21:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-10-04 14:21:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2199 transitions. [2018-10-04 14:21:24,938 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2199 transitions. Word has length 25 [2018-10-04 14:21:24,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:24,938 INFO L480 AbstractCegarLoop]: Abstraction has 1575 states and 2199 transitions. [2018-10-04 14:21:24,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:21:24,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2199 transitions. [2018-10-04 14:21:24,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 14:21:24,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:24,940 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:24,940 INFO L423 AbstractCegarLoop]: === Iteration 39 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:24,940 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:24,940 INFO L82 PathProgramCache]: Analyzing trace with hash -664447164, now seen corresponding path program 2 times [2018-10-04 14:21:24,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:24,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:24,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:24,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:24,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:25,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:25,147 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-04 14:21:25,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:21:25,205 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:21:25,205 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:25,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:25,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:25,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 14:21:25,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:21:25,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:21:25,461 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:25,461 INFO L87 Difference]: Start difference. First operand 1575 states and 2199 transitions. Second operand 20 states. [2018-10-04 14:21:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:31,907 INFO L93 Difference]: Finished difference Result 2646 states and 3763 transitions. [2018-10-04 14:21:31,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-04 14:21:31,907 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-10-04 14:21:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:31,922 INFO L225 Difference]: With dead ends: 2646 [2018-10-04 14:21:31,924 INFO L226 Difference]: Without dead ends: 2644 [2018-10-04 14:21:31,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 2.1s impTime 57 [2018-10-04 14:21:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2018-10-04 14:21:32,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 1833. [2018-10-04 14:21:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2018-10-04 14:21:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2576 transitions. [2018-10-04 14:21:32,642 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2576 transitions. Word has length 29 [2018-10-04 14:21:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:32,642 INFO L480 AbstractCegarLoop]: Abstraction has 1833 states and 2576 transitions. [2018-10-04 14:21:32,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:21:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2576 transitions. [2018-10-04 14:21:32,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 14:21:32,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:32,645 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:32,645 INFO L423 AbstractCegarLoop]: === Iteration 40 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:32,645 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:32,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1030242552, now seen corresponding path program 2 times [2018-10-04 14:21:32,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:32,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:32,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:32,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:32,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:32,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:32,834 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-04 14:21:32,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:21:32,898 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:21:32,898 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:32,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:33,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:33,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-10-04 14:21:33,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:21:33,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:21:33,098 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:33,099 INFO L87 Difference]: Start difference. First operand 1833 states and 2576 transitions. Second operand 21 states. [2018-10-04 14:21:39,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:39,108 INFO L93 Difference]: Finished difference Result 2887 states and 4117 transitions. [2018-10-04 14:21:39,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-04 14:21:39,109 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-10-04 14:21:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:39,116 INFO L225 Difference]: With dead ends: 2887 [2018-10-04 14:21:39,116 INFO L226 Difference]: Without dead ends: 2885 [2018-10-04 14:21:39,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.0s impTime 43 [2018-10-04 14:21:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2018-10-04 14:21:39,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2102. [2018-10-04 14:21:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2018-10-04 14:21:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 2970 transitions. [2018-10-04 14:21:39,850 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 2970 transitions. Word has length 29 [2018-10-04 14:21:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:39,851 INFO L480 AbstractCegarLoop]: Abstraction has 2102 states and 2970 transitions. [2018-10-04 14:21:39,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:21:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2970 transitions. [2018-10-04 14:21:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:21:39,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:39,853 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:39,853 INFO L423 AbstractCegarLoop]: === Iteration 41 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:39,854 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1174012687, now seen corresponding path program 2 times [2018-10-04 14:21:39,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:39,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:39,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:39,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 14:21:40,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:40,366 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-04 14:21:40,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:21:40,439 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:21:40,439 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:40,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:21:40,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:40,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 14:21:40,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:21:40,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:21:40,856 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:40,857 INFO L87 Difference]: Start difference. First operand 2102 states and 2970 transitions. Second operand 16 states. [2018-10-04 14:21:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:46,718 INFO L93 Difference]: Finished difference Result 6948 states and 9725 transitions. [2018-10-04 14:21:46,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-04 14:21:46,718 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-10-04 14:21:46,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:46,733 INFO L225 Difference]: With dead ends: 6948 [2018-10-04 14:21:46,733 INFO L226 Difference]: Without dead ends: 4896 [2018-10-04 14:21:46,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time 2.4s impTime 44 [2018-10-04 14:21:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4896 states. [2018-10-04 14:21:48,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4896 to 3634. [2018-10-04 14:21:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3634 states. [2018-10-04 14:21:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 5080 transitions. [2018-10-04 14:21:48,389 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 5080 transitions. Word has length 33 [2018-10-04 14:21:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:48,390 INFO L480 AbstractCegarLoop]: Abstraction has 3634 states and 5080 transitions. [2018-10-04 14:21:48,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:21:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 5080 transitions. [2018-10-04 14:21:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:21:48,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:48,393 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:48,393 INFO L423 AbstractCegarLoop]: === Iteration 42 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:48,393 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:48,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2110003385, now seen corresponding path program 1 times [2018-10-04 14:21:48,393 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:48,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:48,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:48,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:48,570 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-04 14:21:48,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:48,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:21:48,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:48,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-10-04 14:21:48,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:21:48,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:21:48,773 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:48,773 INFO L87 Difference]: Start difference. First operand 3634 states and 5080 transitions. Second operand 18 states. [2018-10-04 14:21:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:55,078 INFO L93 Difference]: Finished difference Result 5436 states and 7576 transitions. [2018-10-04 14:21:55,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 14:21:55,079 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-10-04 14:21:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:55,092 INFO L225 Difference]: With dead ends: 5436 [2018-10-04 14:21:55,092 INFO L226 Difference]: Without dead ends: 5349 [2018-10-04 14:21:55,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.3s impTime 54 [2018-10-04 14:21:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5349 states. [2018-10-04 14:21:56,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5349 to 4022. [2018-10-04 14:21:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4022 states. [2018-10-04 14:21:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 5648 transitions. [2018-10-04 14:21:56,823 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 5648 transitions. Word has length 33 [2018-10-04 14:21:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:56,823 INFO L480 AbstractCegarLoop]: Abstraction has 4022 states and 5648 transitions. [2018-10-04 14:21:56,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:21:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 5648 transitions. [2018-10-04 14:21:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:21:56,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:56,826 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:56,826 INFO L423 AbstractCegarLoop]: === Iteration 43 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:56,826 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash -895180230, now seen corresponding path program 3 times [2018-10-04 14:21:56,827 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:56,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:56,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:56,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:56,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:57,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:57,218 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 14:21:57,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:21:57,283 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 14:21:57,283 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:57,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:21:58,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:58,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-10-04 14:21:58,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:21:58,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:21:58,290 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:58,290 INFO L87 Difference]: Start difference. First operand 4022 states and 5648 transitions. Second operand 22 states. [2018-10-04 14:22:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:09,225 INFO L93 Difference]: Finished difference Result 8032 states and 11417 transitions. [2018-10-04 14:22:09,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-04 14:22:09,225 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2018-10-04 14:22:09,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:09,242 INFO L225 Difference]: With dead ends: 8032 [2018-10-04 14:22:09,242 INFO L226 Difference]: Without dead ends: 7935 [2018-10-04 14:22:09,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s Time 3.2s impTime 45 [2018-10-04 14:22:09,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7935 states. [2018-10-04 14:22:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7935 to 4327. [2018-10-04 14:22:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4327 states. [2018-10-04 14:22:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 6121 transitions. [2018-10-04 14:22:11,265 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 6121 transitions. Word has length 33 [2018-10-04 14:22:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:11,266 INFO L480 AbstractCegarLoop]: Abstraction has 4327 states and 6121 transitions. [2018-10-04 14:22:11,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 14:22:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 6121 transitions. [2018-10-04 14:22:11,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:22:11,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:11,270 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:11,270 INFO L423 AbstractCegarLoop]: === Iteration 44 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:11,270 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:11,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1250173630, now seen corresponding path program 1 times [2018-10-04 14:22:11,270 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:11,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:11,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:11,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:11,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:11,437 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:22:11,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:11,438 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-04 14:22:11,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:11,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:22:11,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:11,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-10-04 14:22:11,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:22:11,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:22:11,772 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:11,772 INFO L87 Difference]: Start difference. First operand 4327 states and 6121 transitions. Second operand 19 states. [2018-10-04 14:22:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:18,785 INFO L93 Difference]: Finished difference Result 9177 states and 12958 transitions. [2018-10-04 14:22:18,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-04 14:22:18,785 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-10-04 14:22:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:18,798 INFO L225 Difference]: With dead ends: 9177 [2018-10-04 14:22:18,798 INFO L226 Difference]: Without dead ends: 5991 [2018-10-04 14:22:18,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.8s impTime 37 [2018-10-04 14:22:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2018-10-04 14:22:20,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 4147. [2018-10-04 14:22:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4147 states. [2018-10-04 14:22:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4147 states to 4147 states and 5817 transitions. [2018-10-04 14:22:20,786 INFO L78 Accepts]: Start accepts. Automaton has 4147 states and 5817 transitions. Word has length 33 [2018-10-04 14:22:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:20,786 INFO L480 AbstractCegarLoop]: Abstraction has 4147 states and 5817 transitions. [2018-10-04 14:22:20,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:22:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 4147 states and 5817 transitions. [2018-10-04 14:22:20,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:22:20,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:20,790 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:20,790 INFO L423 AbstractCegarLoop]: === Iteration 45 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:20,790 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:20,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1810158453, now seen corresponding path program 2 times [2018-10-04 14:22:20,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:20,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:20,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:20,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:20,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:21,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:21,047 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-04 14:22:21,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:21,113 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:21,113 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:21,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:21,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:21,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-10-04 14:22:21,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:22:21,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:22:21,315 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:21,315 INFO L87 Difference]: Start difference. First operand 4147 states and 5817 transitions. Second operand 18 states. [2018-10-04 14:22:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:27,219 INFO L93 Difference]: Finished difference Result 5255 states and 7327 transitions. [2018-10-04 14:22:27,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:22:27,219 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-10-04 14:22:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:27,228 INFO L225 Difference]: With dead ends: 5255 [2018-10-04 14:22:27,228 INFO L226 Difference]: Without dead ends: 5253 [2018-10-04 14:22:27,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 30 [2018-10-04 14:22:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2018-10-04 14:22:29,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4447. [2018-10-04 14:22:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4447 states. [2018-10-04 14:22:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4447 states to 4447 states and 6228 transitions. [2018-10-04 14:22:29,322 INFO L78 Accepts]: Start accepts. Automaton has 4447 states and 6228 transitions. Word has length 33 [2018-10-04 14:22:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:29,322 INFO L480 AbstractCegarLoop]: Abstraction has 4447 states and 6228 transitions. [2018-10-04 14:22:29,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:22:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 4447 states and 6228 transitions. [2018-10-04 14:22:29,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:22:29,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:29,326 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:29,326 INFO L423 AbstractCegarLoop]: === Iteration 46 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:29,326 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:29,326 INFO L82 PathProgramCache]: Analyzing trace with hash -667748710, now seen corresponding path program 1 times [2018-10-04 14:22:29,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:29,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:29,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:29,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:29,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:29,486 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-04 14:22:29,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:29,487 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-04 14:22:29,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:29,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:22:29,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:29,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2018-10-04 14:22:29,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:22:29,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:22:29,754 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:29,754 INFO L87 Difference]: Start difference. First operand 4447 states and 6228 transitions. Second operand 20 states. [2018-10-04 14:22:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:41,281 INFO L93 Difference]: Finished difference Result 7721 states and 10805 transitions. [2018-10-04 14:22:41,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-04 14:22:41,281 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-10-04 14:22:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:41,291 INFO L225 Difference]: With dead ends: 7721 [2018-10-04 14:22:41,291 INFO L226 Difference]: Without dead ends: 7719 [2018-10-04 14:22:41,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 1.7s impTime 74 [2018-10-04 14:22:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7719 states. [2018-10-04 14:22:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7719 to 5438. [2018-10-04 14:22:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5438 states. [2018-10-04 14:22:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5438 states to 5438 states and 7651 transitions. [2018-10-04 14:22:44,043 INFO L78 Accepts]: Start accepts. Automaton has 5438 states and 7651 transitions. Word has length 33 [2018-10-04 14:22:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:44,043 INFO L480 AbstractCegarLoop]: Abstraction has 5438 states and 7651 transitions. [2018-10-04 14:22:44,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:22:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 5438 states and 7651 transitions. [2018-10-04 14:22:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:22:44,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:44,047 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:44,048 INFO L423 AbstractCegarLoop]: === Iteration 47 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:44,048 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:44,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1146614399, now seen corresponding path program 2 times [2018-10-04 14:22:44,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:44,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:44,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:44,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:44,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:44,143 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 14:22:44,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:44,143 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-04 14:22:44,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:44,209 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:44,210 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:44,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:22:44,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:44,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 14:22:44,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:22:44,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:22:44,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:44,362 INFO L87 Difference]: Start difference. First operand 5438 states and 7651 transitions. Second operand 16 states. [2018-10-04 14:22:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:53,498 INFO L93 Difference]: Finished difference Result 15976 states and 22278 transitions. [2018-10-04 14:22:53,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-04 14:22:53,498 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-10-04 14:22:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:53,513 INFO L225 Difference]: With dead ends: 15976 [2018-10-04 14:22:53,513 INFO L226 Difference]: Without dead ends: 10483 [2018-10-04 14:22:53,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 2.0s impTime 39 [2018-10-04 14:22:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10483 states. [2018-10-04 14:22:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10483 to 8111. [2018-10-04 14:22:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8111 states. [2018-10-04 14:22:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8111 states to 8111 states and 11260 transitions. [2018-10-04 14:22:57,541 INFO L78 Accepts]: Start accepts. Automaton has 8111 states and 11260 transitions. Word has length 33 [2018-10-04 14:22:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:57,541 INFO L480 AbstractCegarLoop]: Abstraction has 8111 states and 11260 transitions. [2018-10-04 14:22:57,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:22:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 8111 states and 11260 transitions. [2018-10-04 14:22:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:22:57,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:57,546 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:57,546 INFO L423 AbstractCegarLoop]: === Iteration 48 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:57,546 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1449531796, now seen corresponding path program 1 times [2018-10-04 14:22:57,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:57,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:57,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:57,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:57,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:57,761 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-04 14:22:57,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:57,761 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:57,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:57,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:22:58,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:58,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-10-04 14:22:58,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:22:58,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:22:58,006 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:58,006 INFO L87 Difference]: Start difference. First operand 8111 states and 11260 transitions. Second operand 19 states. [2018-10-04 14:23:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:07,346 INFO L93 Difference]: Finished difference Result 10277 states and 14246 transitions. [2018-10-04 14:23:07,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 14:23:07,346 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-10-04 14:23:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:07,360 INFO L225 Difference]: With dead ends: 10277 [2018-10-04 14:23:07,360 INFO L226 Difference]: Without dead ends: 10275 [2018-10-04 14:23:07,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 41 [2018-10-04 14:23:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10275 states. [2018-10-04 14:23:11,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10275 to 8291. [2018-10-04 14:23:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8291 states. [2018-10-04 14:23:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8291 states to 8291 states and 11531 transitions. [2018-10-04 14:23:11,817 INFO L78 Accepts]: Start accepts. Automaton has 8291 states and 11531 transitions. Word has length 33 [2018-10-04 14:23:11,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:11,817 INFO L480 AbstractCegarLoop]: Abstraction has 8291 states and 11531 transitions. [2018-10-04 14:23:11,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:23:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 8291 states and 11531 transitions. [2018-10-04 14:23:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:23:11,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:11,822 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:11,823 INFO L423 AbstractCegarLoop]: === Iteration 49 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:11,823 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:11,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1026480992, now seen corresponding path program 1 times [2018-10-04 14:23:11,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:11,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:11,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:11,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:23:12,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:12,428 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:12,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:12,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:23:12,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:12,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-10-04 14:23:12,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:23:12,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:23:12,640 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:12,640 INFO L87 Difference]: Start difference. First operand 8291 states and 11531 transitions. Second operand 19 states. [2018-10-04 14:23:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:22,403 INFO L93 Difference]: Finished difference Result 16294 states and 22694 transitions. [2018-10-04 14:23:22,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-04 14:23:22,404 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-10-04 14:23:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:22,418 INFO L225 Difference]: With dead ends: 16294 [2018-10-04 14:23:22,418 INFO L226 Difference]: Without dead ends: 9999 [2018-10-04 14:23:22,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 1.9s impTime 36 [2018-10-04 14:23:22,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9999 states. [2018-10-04 14:23:26,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9999 to 8241. [2018-10-04 14:23:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8241 states. [2018-10-04 14:23:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8241 states to 8241 states and 11466 transitions. [2018-10-04 14:23:26,636 INFO L78 Accepts]: Start accepts. Automaton has 8241 states and 11466 transitions. Word has length 33 [2018-10-04 14:23:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:26,637 INFO L480 AbstractCegarLoop]: Abstraction has 8241 states and 11466 transitions. [2018-10-04 14:23:26,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:23:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 8241 states and 11466 transitions. [2018-10-04 14:23:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:23:26,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:26,641 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:26,641 INFO L423 AbstractCegarLoop]: === Iteration 50 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:26,641 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:26,641 INFO L82 PathProgramCache]: Analyzing trace with hash 610357864, now seen corresponding path program 3 times [2018-10-04 14:23:26,641 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:26,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:26,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:26,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:26,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:27,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:27,114 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:27,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:23:27,176 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 14:23:27,176 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:27,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:23:27,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:27,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 21 [2018-10-04 14:23:27,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:23:27,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:23:27,344 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:27,344 INFO L87 Difference]: Start difference. First operand 8241 states and 11466 transitions. Second operand 21 states. [2018-10-04 14:23:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:47,090 INFO L93 Difference]: Finished difference Result 25684 states and 35500 transitions. [2018-10-04 14:23:47,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-10-04 14:23:47,090 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-10-04 14:23:47,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:47,115 INFO L225 Difference]: With dead ends: 25684 [2018-10-04 14:23:47,115 INFO L226 Difference]: Without dead ends: 16698 [2018-10-04 14:23:47,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s Time 3.8s impTime 68 [2018-10-04 14:23:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16698 states. [2018-10-04 14:23:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16698 to 10011. [2018-10-04 14:23:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10011 states. [2018-10-04 14:23:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10011 states to 10011 states and 13930 transitions. [2018-10-04 14:23:52,652 INFO L78 Accepts]: Start accepts. Automaton has 10011 states and 13930 transitions. Word has length 33 [2018-10-04 14:23:52,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:52,652 INFO L480 AbstractCegarLoop]: Abstraction has 10011 states and 13930 transitions. [2018-10-04 14:23:52,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:23:52,652 INFO L276 IsEmpty]: Start isEmpty. Operand 10011 states and 13930 transitions. [2018-10-04 14:23:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:23:52,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:52,657 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:52,657 INFO L423 AbstractCegarLoop]: === Iteration 51 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:52,657 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:52,658 INFO L82 PathProgramCache]: Analyzing trace with hash 690693469, now seen corresponding path program 1 times [2018-10-04 14:23:52,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:52,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:52,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:52,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:52,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:52,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:52,903 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:52,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:52,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:23:53,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:53,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-10-04 14:23:53,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:23:53,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:23:53,215 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:53,216 INFO L87 Difference]: Start difference. First operand 10011 states and 13930 transitions. Second operand 22 states. [2018-10-04 14:24:06,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:06,120 INFO L93 Difference]: Finished difference Result 12668 states and 17557 transitions. [2018-10-04 14:24:06,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 14:24:06,121 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2018-10-04 14:24:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:06,136 INFO L225 Difference]: With dead ends: 12668 [2018-10-04 14:24:06,136 INFO L226 Difference]: Without dead ends: 12586 [2018-10-04 14:24:06,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.4s impTime 56 [2018-10-04 14:24:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12586 states. Received shutdown request... [2018-10-04 14:24:12,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12586 to 10468. [2018-10-04 14:24:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10468 states. [2018-10-04 14:24:12,338 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 14:24:12,344 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 14:24:12,345 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:24:12 BoogieIcfgContainer [2018-10-04 14:24:12,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:24:12,346 INFO L168 Benchmark]: Toolchain (without parser) took 254765.83 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-04 14:24:12,348 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:24:12,348 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:24:12,349 INFO L168 Benchmark]: Boogie Preprocessor took 25.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:24:12,349 INFO L168 Benchmark]: RCFGBuilder took 613.66 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-04 14:24:12,350 INFO L168 Benchmark]: TraceAbstraction took 254075.92 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-04 14:24:12,353 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.24 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 45.65 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 25.83 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 613.66 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 254075.92 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 66). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 99). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 121). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 112). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 4 error locations. TIMEOUT Result, 254.0s OverallTime, 51 OverallIterations, 4 TraceHistogramMax, 183.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3758 SDtfs, 10729 SDslu, 7283 SDs, 0 SdLazy, 51360 SolverSat, 14445 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3829 GetRequests, 1004 SyntacticMatches, 5 SemanticMatches, 2820 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10011occurred 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: 45.3s AutomataMinimizationTime, 51 MinimizatonAttempts, 32101 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 20.7s InterpolantComputationTime, 2108 NumberOfCodeBlocks, 2108 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 2009 ConstructedInterpolants, 41 QuantifiedInterpolants, 224295 SizeOfPredicates, 797 NumberOfNonLiveVariables, 14213 ConjunctsInSsa, 1503 ConjunctsInUnsatCore, 99 InterpolantComputations, 9 PerfectInterpolantSequences, 199/778 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_WithProcedures.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-24-12-369.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithProcedures.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-24-12-369.csv Completed graceful shutdown