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/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 01:11:26,390 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 01:11:26,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 01:11:26,405 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 01:11:26,406 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 01:11:26,407 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 01:11:26,408 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 01:11:26,411 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 01:11:26,413 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 01:11:26,415 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 01:11:26,417 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 01:11:26,417 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 01:11:26,419 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 01:11:26,420 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 01:11:26,421 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 01:11:26,422 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 01:11:26,423 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 01:11:26,432 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 01:11:26,437 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 01:11:26,439 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 01:11:26,441 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 01:11:26,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 01:11:26,445 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 01:11:26,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 01:11:26,445 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 01:11:26,446 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 01:11:26,448 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 01:11:26,449 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 01:11:26,451 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 01:11:26,453 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 01:11:26,453 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 01:11:26,454 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 01:11:26,454 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 01:11:26,454 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 01:11:26,456 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 01:11:26,457 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 01:11:26,458 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-01 01:11:26,486 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 01:11:26,486 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 01:11:26,487 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 01:11:26,487 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 01:11:26,488 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 01:11:26,489 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 01:11:26,489 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 01:11:26,489 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 01:11:26,489 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 01:11:26,490 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 01:11:26,491 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 01:11:26,491 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 01:11:26,491 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 01:11:26,491 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 01:11:26,491 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 01:11:26,491 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 01:11:26,492 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 01:11:26,492 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 01:11:26,492 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 01:11:26,492 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 01:11:26,494 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 01:11:26,494 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 01:11:26,494 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 01:11:26,494 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 01:11:26,495 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 01:11:26,495 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 01:11:26,495 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 01:11:26,495 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 01:11:26,495 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 01:11:26,495 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 01:11:26,496 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 01:11:26,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 01:11:26,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 01:11:26,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 01:11:26,566 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 01:11:26,567 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 01:11:26,568 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl [2018-10-01 01:11:26,568 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2018-10-01 01:11:26,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 01:11:26,621 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 01:11:26,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 01:11:26,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 01:11:26,622 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 01:11:26,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:11:26" (1/1) ... [2018-10-01 01:11:26,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:11:26" (1/1) ... [2018-10-01 01:11:26,661 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-01 01:11:26,662 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-01 01:11:26,662 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-01 01:11:26,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 01:11:26,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 01:11:26,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 01:11:26,665 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 01:11:26,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:11:26" (1/1) ... [2018-10-01 01:11:26,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:11:26" (1/1) ... [2018-10-01 01:11:26,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:11:26" (1/1) ... [2018-10-01 01:11:26,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:11:26" (1/1) ... [2018-10-01 01:11:26,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:11:26" (1/1) ... [2018-10-01 01:11:26,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:11:26" (1/1) ... [2018-10-01 01:11:26,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:11:26" (1/1) ... [2018-10-01 01:11:26,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 01:11:26,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 01:11:26,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 01:11:26,691 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 01:11:26,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:11:26" (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-01 01:11:26,765 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-01 01:11:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-01 01:11:26,766 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-01 01:11:26,964 INFO L345 CfgBuilder]: Using library mode [2018-10-01 01:11:26,965 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 01:11:26 BoogieIcfgContainer [2018-10-01 01:11:26,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 01:11:26,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 01:11:26,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 01:11:26,969 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 01:11:26,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:11:26" (1/2) ... [2018-10-01 01:11:26,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d00e2ca and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 01:11:26, skipping insertion in model container [2018-10-01 01:11:26,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 01:11:26" (2/2) ... [2018-10-01 01:11:26,973 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2018-10-01 01:11:26,986 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 01:11:26,994 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 01:11:27,043 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 01:11:27,044 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 01:11:27,044 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 01:11:27,044 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 01:11:27,044 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 01:11:27,045 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 01:11:27,045 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 01:11:27,045 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 01:11:27,045 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 01:11:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-01 01:11:27,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-01 01:11:27,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:27,067 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-01 01:11:27,068 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:27,075 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:27,075 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-01 01:11:27,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:27,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:27,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:27,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:11:27,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:27,205 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-01 01:11:27,207 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 01:11:27,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-01 01:11:27,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 01:11:27,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 01:11:27,223 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:27,226 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-01 01:11:27,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:27,422 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-01 01:11:27,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 01:11:27,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-01 01:11:27,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:27,435 INFO L225 Difference]: With dead ends: 9 [2018-10-01 01:11:27,435 INFO L226 Difference]: Without dead ends: 4 [2018-10-01 01:11:27,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 01:11:27,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-01 01:11:27,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-01 01:11:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-01 01:11:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-01 01:11:27,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-01 01:11:27,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:27,474 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-01 01:11:27,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 01:11:27,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-01 01:11:27,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-01 01:11:27,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:27,475 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-01 01:11:27,476 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:27,476 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:27,476 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-01 01:11:27,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:27,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:27,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:27,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:11:27,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:27,585 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-01 01:11:27,585 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:27,585 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-01 01:11:27,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:11:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:27,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:27,738 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-01 01:11:27,760 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:27,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2018-10-01 01:11:27,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 01:11:27,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 01:11:27,762 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:27,764 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 5 states. [2018-10-01 01:11:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:27,874 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-01 01:11:27,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 01:11:27,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 3 [2018-10-01 01:11:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:27,876 INFO L225 Difference]: With dead ends: 6 [2018-10-01 01:11:27,876 INFO L226 Difference]: Without dead ends: 5 [2018-10-01 01:11:27,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 01:11:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-01 01:11:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-01 01:11:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-01 01:11:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-01 01:11:27,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-01 01:11:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:27,880 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-01 01:11:27,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 01:11:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-01 01:11:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 01:11:27,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:27,882 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-01 01:11:27,882 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:27,882 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:27,882 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-01 01:11:27,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:27,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:27,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:27,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:11:27,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:28,010 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-01 01:11:28,011 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:28,011 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-01 01:11:28,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:11:28,031 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:11:28,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:28,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:28,137 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-01 01:11:28,158 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:28,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-01 01:11:28,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 01:11:28,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 01:11:28,159 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:28,159 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-10-01 01:11:28,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:28,551 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-01 01:11:28,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 01:11:28,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-10-01 01:11:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:28,552 INFO L225 Difference]: With dead ends: 7 [2018-10-01 01:11:28,552 INFO L226 Difference]: Without dead ends: 6 [2018-10-01 01:11:28,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 01:11:28,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-01 01:11:28,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-01 01:11:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-01 01:11:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-01 01:11:28,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-01 01:11:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:28,557 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-01 01:11:28,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 01:11:28,557 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-01 01:11:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 01:11:28,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:28,558 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-01 01:11:28,559 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:28,559 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-01 01:11:28,559 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:28,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:28,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:28,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:11:28,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:28,649 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:28,649 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-01 01:11:28,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:11:28,669 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-01 01:11:28,669 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:28,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:28,864 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:28,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-01 01:11:28,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 01:11:28,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 01:11:28,866 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:28,866 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-10-01 01:11:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:29,029 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-01 01:11:29,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 01:11:29,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-10-01 01:11:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:29,031 INFO L225 Difference]: With dead ends: 8 [2018-10-01 01:11:29,031 INFO L226 Difference]: Without dead ends: 7 [2018-10-01 01:11:29,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 01:11:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-01 01:11:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-01 01:11:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-01 01:11:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-01 01:11:29,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-01 01:11:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:29,035 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-01 01:11:29,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 01:11:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-01 01:11:29,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 01:11:29,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:29,036 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-01 01:11:29,036 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:29,036 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:29,036 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-01 01:11:29,037 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:29,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:29,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:29,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:11:29,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:29,283 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-01 01:11:29,283 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:29,284 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 01:11:29,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:11:29,323 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:11:29,324 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:29,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:29,713 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-01 01:11:29,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:29,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-01 01:11:29,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 01:11:29,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 01:11:29,736 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:29,736 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 11 states. [2018-10-01 01:11:30,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:30,019 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-01 01:11:30,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 01:11:30,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-10-01 01:11:30,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:30,020 INFO L225 Difference]: With dead ends: 9 [2018-10-01 01:11:30,020 INFO L226 Difference]: Without dead ends: 8 [2018-10-01 01:11:30,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 01:11:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-01 01:11:30,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-01 01:11:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-01 01:11:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-01 01:11:30,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-01 01:11:30,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:30,024 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-01 01:11:30,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 01:11:30,025 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-01 01:11:30,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 01:11:30,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:30,025 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-01 01:11:30,026 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:30,026 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:30,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-01 01:11:30,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:30,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:30,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:30,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:11:30,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:30,143 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:30,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 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-01 01:11:30,152 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:11:30,168 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-01 01:11:30,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:30,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:30,335 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:30,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-01 01:11:30,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 01:11:30,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 01:11:30,336 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:30,336 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2018-10-01 01:11:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:30,719 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-01 01:11:30,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 01:11:30,720 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2018-10-01 01:11:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:30,720 INFO L225 Difference]: With dead ends: 10 [2018-10-01 01:11:30,720 INFO L226 Difference]: Without dead ends: 9 [2018-10-01 01:11:30,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 01:11:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-01 01:11:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-01 01:11:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 01:11:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-01 01:11:30,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-01 01:11:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:30,725 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-01 01:11:30,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 01:11:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-01 01:11:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 01:11:30,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:30,726 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-01 01:11:30,726 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:30,726 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:30,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-01 01:11:30,727 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:30,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:30,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:30,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:11:30,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:31,218 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-01 01:11:31,218 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:31,219 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-01 01:11:31,228 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:11:31,238 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-01 01:11:31,238 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:31,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:31,479 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-01 01:11:31,502 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:31,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-01 01:11:31,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 01:11:31,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 01:11:31,503 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:31,503 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 15 states. [2018-10-01 01:11:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:31,963 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-01 01:11:31,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 01:11:31,964 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 8 [2018-10-01 01:11:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:31,965 INFO L225 Difference]: With dead ends: 11 [2018-10-01 01:11:31,965 INFO L226 Difference]: Without dead ends: 10 [2018-10-01 01:11:31,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 01:11:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-01 01:11:31,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-01 01:11:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-01 01:11:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-01 01:11:31,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-01 01:11:31,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:31,970 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-01 01:11:31,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 01:11:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-01 01:11:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 01:11:31,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:31,971 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-01 01:11:31,971 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:31,971 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:31,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-01 01:11:31,971 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:31,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:31,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:31,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:11:31,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:32,137 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:32,137 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-01 01:11:32,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:11:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:32,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:32,431 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:32,431 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-01 01:11:32,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 01:11:32,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 01:11:32,432 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:32,432 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 17 states. [2018-10-01 01:11:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:32,850 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-01 01:11:32,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 01:11:32,851 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 9 [2018-10-01 01:11:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:32,852 INFO L225 Difference]: With dead ends: 12 [2018-10-01 01:11:32,852 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 01:11:32,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 01:11:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 01:11:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-01 01:11:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 01:11:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-01 01:11:32,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-01 01:11:32,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:32,857 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-01 01:11:32,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 01:11:32,857 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-01 01:11:32,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 01:11:32,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:32,858 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-01 01:11:32,858 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:32,859 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:32,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-01 01:11:32,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:32,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:32,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:32,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:11:32,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:33,122 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:33,122 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-01 01:11:33,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:11:33,140 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:11:33,140 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:33,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:33,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:33,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-01 01:11:33,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 01:11:33,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 01:11:33,479 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:33,479 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 19 states. [2018-10-01 01:11:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:34,073 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-01 01:11:34,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 01:11:34,074 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 10 [2018-10-01 01:11:34,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:34,074 INFO L225 Difference]: With dead ends: 13 [2018-10-01 01:11:34,074 INFO L226 Difference]: Without dead ends: 12 [2018-10-01 01:11:34,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 01:11:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-01 01:11:34,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-01 01:11:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-01 01:11:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-01 01:11:34,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-01 01:11:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:34,093 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-01 01:11:34,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 01:11:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-01 01:11:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 01:11:34,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:34,094 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-01 01:11:34,095 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:34,095 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:34,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-01 01:11:34,096 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:34,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:34,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:34,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:11:34,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:34,579 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:34,579 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-01 01:11:34,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:11:34,619 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-01 01:11:34,620 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:34,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:34,963 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:34,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-01 01:11:34,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-01 01:11:34,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-01 01:11:34,964 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:34,965 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 21 states. [2018-10-01 01:11:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:35,638 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-01 01:11:35,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 01:11:35,639 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 11 [2018-10-01 01:11:35,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:35,640 INFO L225 Difference]: With dead ends: 14 [2018-10-01 01:11:35,640 INFO L226 Difference]: Without dead ends: 13 [2018-10-01 01:11:35,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 01:11:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-01 01:11:35,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-01 01:11:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-01 01:11:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-01 01:11:35,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-01 01:11:35,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:35,645 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-01 01:11:35,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-01 01:11:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-01 01:11:35,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 01:11:35,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:35,646 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-01 01:11:35,646 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:35,646 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:35,646 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-01 01:11:35,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:35,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:35,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:35,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:11:35,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:35,903 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:35,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 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-01 01:11:35,911 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:11:35,922 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:11:35,922 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:35,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:36,526 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:36,527 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-01 01:11:36,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-01 01:11:36,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-01 01:11:36,528 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:36,528 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 23 states. [2018-10-01 01:11:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:37,407 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-01 01:11:37,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 01:11:37,407 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 12 [2018-10-01 01:11:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:37,409 INFO L225 Difference]: With dead ends: 15 [2018-10-01 01:11:37,409 INFO L226 Difference]: Without dead ends: 14 [2018-10-01 01:11:37,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 01:11:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-01 01:11:37,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-01 01:11:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-01 01:11:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-01 01:11:37,414 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-01 01:11:37,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:37,414 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-01 01:11:37,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-01 01:11:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-01 01:11:37,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 01:11:37,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:37,415 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-01 01:11:37,415 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:37,416 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:37,416 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-01 01:11:37,416 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:37,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:37,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:37,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:11:37,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:38,191 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:38,191 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-01 01:11:38,200 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:11:38,229 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-01 01:11:38,229 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:38,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:38,654 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:38,655 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-01 01:11:38,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-01 01:11:38,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-01 01:11:38,656 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:38,656 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 25 states. [2018-10-01 01:11:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:39,715 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-01 01:11:39,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 01:11:39,716 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 13 [2018-10-01 01:11:39,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:39,717 INFO L225 Difference]: With dead ends: 16 [2018-10-01 01:11:39,717 INFO L226 Difference]: Without dead ends: 15 [2018-10-01 01:11:39,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 01:11:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-01 01:11:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-01 01:11:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-01 01:11:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-01 01:11:39,722 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-01 01:11:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:39,722 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-01 01:11:39,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-01 01:11:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-01 01:11:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 01:11:39,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:39,723 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-01 01:11:39,723 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:39,723 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:39,724 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-01 01:11:39,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:39,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:39,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:11:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:40,418 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:40,419 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-01 01:11:40,427 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:11:40,444 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-01 01:11:40,444 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:40,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:40,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:40,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-01 01:11:40,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-01 01:11:40,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-01 01:11:40,965 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:40,965 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 27 states. [2018-10-01 01:11:41,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:41,979 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-01 01:11:41,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 01:11:41,980 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 14 [2018-10-01 01:11:41,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:41,981 INFO L225 Difference]: With dead ends: 17 [2018-10-01 01:11:41,981 INFO L226 Difference]: Without dead ends: 16 [2018-10-01 01:11:41,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 01:11:41,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-01 01:11:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-01 01:11:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-01 01:11:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-01 01:11:41,986 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-01 01:11:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:41,986 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-01 01:11:41,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-01 01:11:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-01 01:11:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 01:11:41,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:41,987 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-01 01:11:41,987 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:41,988 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:41,988 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-01 01:11:41,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:41,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:41,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:41,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:11:41,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:42,369 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:42,369 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-01 01:11:42,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:11:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:42,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:43,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:43,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-01 01:11:43,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-01 01:11:43,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-01 01:11:43,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:43,189 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 29 states. [2018-10-01 01:11:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:44,509 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-01 01:11:44,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 01:11:44,509 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 15 [2018-10-01 01:11:44,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:44,510 INFO L225 Difference]: With dead ends: 18 [2018-10-01 01:11:44,511 INFO L226 Difference]: Without dead ends: 17 [2018-10-01 01:11:44,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 01:11:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-01 01:11:44,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-01 01:11:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-01 01:11:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-01 01:11:44,516 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-01 01:11:44,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:44,516 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-01 01:11:44,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-01 01:11:44,516 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-01 01:11:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 01:11:44,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:44,517 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-01 01:11:44,517 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:44,517 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:44,518 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-01 01:11:44,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:44,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:44,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:44,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:11:44,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:44,921 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:44,921 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-01 01:11:44,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:11:44,946 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:11:44,946 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:44,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:45,681 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:45,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-01 01:11:45,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-01 01:11:45,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-01 01:11:45,682 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:45,682 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 31 states. [2018-10-01 01:11:47,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:47,405 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-01 01:11:47,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 01:11:47,406 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 16 [2018-10-01 01:11:47,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:47,406 INFO L225 Difference]: With dead ends: 19 [2018-10-01 01:11:47,406 INFO L226 Difference]: Without dead ends: 18 [2018-10-01 01:11:47,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 01:11:47,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-01 01:11:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-01 01:11:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-01 01:11:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-01 01:11:47,411 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-01 01:11:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:47,412 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-01 01:11:47,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-01 01:11:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-01 01:11:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 01:11:47,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:47,413 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-01 01:11:47,413 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:47,413 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:47,413 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-01 01:11:47,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:47,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:47,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:11:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:48,170 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:48,170 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-01 01:11:48,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:11:48,198 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-01 01:11:48,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:48,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:48,888 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:48,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-01 01:11:48,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-01 01:11:48,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-01 01:11:48,889 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:48,890 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 33 states. [2018-10-01 01:11:50,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:50,537 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-01 01:11:50,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 01:11:50,538 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 17 [2018-10-01 01:11:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:50,539 INFO L225 Difference]: With dead ends: 20 [2018-10-01 01:11:50,539 INFO L226 Difference]: Without dead ends: 19 [2018-10-01 01:11:50,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 01:11:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-01 01:11:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-01 01:11:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-01 01:11:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-01 01:11:50,545 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-01 01:11:50,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:50,545 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-01 01:11:50,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-01 01:11:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-01 01:11:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 01:11:50,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:50,546 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-01 01:11:50,546 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:50,546 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:50,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-01 01:11:50,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:50,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:50,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:50,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:11:50,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:51,155 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:51,155 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-01 01:11:51,162 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:11:51,177 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:11:51,178 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:51,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:51,843 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:51,843 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-01 01:11:51,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-01 01:11:51,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-01 01:11:51,844 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:51,844 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 35 states. [2018-10-01 01:11:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:53,439 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-01 01:11:53,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 01:11:53,439 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 18 [2018-10-01 01:11:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:53,440 INFO L225 Difference]: With dead ends: 21 [2018-10-01 01:11:53,440 INFO L226 Difference]: Without dead ends: 20 [2018-10-01 01:11:53,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 01:11:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-01 01:11:53,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-01 01:11:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-01 01:11:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-01 01:11:53,445 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-01 01:11:53,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:53,446 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-01 01:11:53,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-01 01:11:53,446 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-01 01:11:53,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-01 01:11:53,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:53,447 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-01 01:11:53,447 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:53,447 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:53,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-01 01:11:53,447 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:53,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:53,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:53,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:11:53,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:54,196 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:54,197 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 01:11:54,204 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:11:54,225 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-01 01:11:54,225 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:54,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:11:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:55,488 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:11:55,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-01 01:11:55,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-01 01:11:55,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-01 01:11:55,489 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:11:55,489 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 37 states. [2018-10-01 01:11:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:11:58,065 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-01 01:11:58,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 01:11:58,066 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 19 [2018-10-01 01:11:58,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:11:58,066 INFO L225 Difference]: With dead ends: 22 [2018-10-01 01:11:58,067 INFO L226 Difference]: Without dead ends: 21 [2018-10-01 01:11:58,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 01:11:58,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-01 01:11:58,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-01 01:11:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-01 01:11:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-01 01:11:58,072 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-01 01:11:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:11:58,073 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-01 01:11:58,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-01 01:11:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-01 01:11:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 01:11:58,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:11:58,074 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-01 01:11:58,074 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:11:58,074 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:11:58,074 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-01 01:11:58,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:11:58,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:11:58,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:58,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:11:58,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:11:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:11:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:11:58,916 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:11:58,917 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-01 01:11:58,928 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:11:58,949 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-01 01:11:58,949 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:11:58,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:12:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:00,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:12:00,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-01 01:12:00,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-01 01:12:00,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-01 01:12:00,030 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:12:00,031 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 39 states. [2018-10-01 01:12:02,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:12:02,882 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-01 01:12:02,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 01:12:02,882 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 20 [2018-10-01 01:12:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:12:02,883 INFO L225 Difference]: With dead ends: 23 [2018-10-01 01:12:02,883 INFO L226 Difference]: Without dead ends: 22 [2018-10-01 01:12:02,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 01:12:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-01 01:12:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-01 01:12:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-01 01:12:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-01 01:12:02,888 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-01 01:12:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:12:02,888 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-01 01:12:02,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-01 01:12:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-01 01:12:02,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-01 01:12:02,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:12:02,889 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-01 01:12:02,889 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:12:02,889 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:12:02,890 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-01 01:12:02,890 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:12:02,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:12:02,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:02,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:12:02,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:12:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:03,795 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:12:03,795 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-01 01:12:03,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:12:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:12:03,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:12:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:05,112 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:12:05,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-01 01:12:05,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-01 01:12:05,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-01 01:12:05,113 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:12:05,113 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 41 states. [2018-10-01 01:12:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:12:08,041 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-01 01:12:08,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 01:12:08,042 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 21 [2018-10-01 01:12:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:12:08,043 INFO L225 Difference]: With dead ends: 24 [2018-10-01 01:12:08,043 INFO L226 Difference]: Without dead ends: 23 [2018-10-01 01:12:08,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 01:12:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-01 01:12:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-01 01:12:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-01 01:12:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-01 01:12:08,048 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-01 01:12:08,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:12:08,049 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-01 01:12:08,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-01 01:12:08,049 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-01 01:12:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 01:12:08,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:12:08,050 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-01 01:12:08,050 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:12:08,050 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:12:08,050 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-01 01:12:08,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:12:08,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:12:08,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:08,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:12:08,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:12:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:08,951 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:12:08,951 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-01 01:12:08,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:12:08,981 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:12:08,981 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:12:08,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:12:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:10,270 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:12:10,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-01 01:12:10,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-01 01:12:10,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-01 01:12:10,271 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:12:10,271 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 43 states. [2018-10-01 01:12:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:12:13,019 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-01 01:12:13,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 01:12:13,020 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 22 [2018-10-01 01:12:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:12:13,021 INFO L225 Difference]: With dead ends: 25 [2018-10-01 01:12:13,021 INFO L226 Difference]: Without dead ends: 24 [2018-10-01 01:12:13,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 01:12:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-01 01:12:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-01 01:12:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-01 01:12:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-01 01:12:13,026 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-01 01:12:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:12:13,026 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-01 01:12:13,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-01 01:12:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-01 01:12:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-01 01:12:13,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:12:13,027 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-01 01:12:13,027 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:12:13,028 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:12:13,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-01 01:12:13,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:12:13,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:12:13,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:13,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:12:13,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:12:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:14,067 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:12:14,067 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-01 01:12:14,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:12:14,106 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-01 01:12:14,107 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:12:14,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:12:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:15,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:12:15,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-01 01:12:15,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-01 01:12:15,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-01 01:12:15,532 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:12:15,533 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 45 states. [2018-10-01 01:12:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:12:19,299 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-01 01:12:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 01:12:19,302 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 23 [2018-10-01 01:12:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:12:19,302 INFO L225 Difference]: With dead ends: 26 [2018-10-01 01:12:19,302 INFO L226 Difference]: Without dead ends: 25 [2018-10-01 01:12:19,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 01:12:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-01 01:12:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-01 01:12:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-01 01:12:19,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-01 01:12:19,307 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-01 01:12:19,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:12:19,307 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-01 01:12:19,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-01 01:12:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-01 01:12:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 01:12:19,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:12:19,308 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-01 01:12:19,309 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:12:19,309 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:12:19,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-01 01:12:19,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:12:19,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:12:19,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:19,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:12:19,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:12:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:20,387 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:12:20,387 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-01 01:12:20,395 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:12:20,419 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:12:20,419 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:12:20,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:12:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:21,834 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:12:21,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-01 01:12:21,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-01 01:12:21,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-01 01:12:21,835 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:12:21,836 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 47 states. [2018-10-01 01:12:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:12:25,571 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-01 01:12:25,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 01:12:25,571 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 24 [2018-10-01 01:12:25,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:12:25,572 INFO L225 Difference]: With dead ends: 27 [2018-10-01 01:12:25,572 INFO L226 Difference]: Without dead ends: 26 [2018-10-01 01:12:25,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 01:12:25,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-01 01:12:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-01 01:12:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-01 01:12:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-01 01:12:25,578 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-01 01:12:25,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:12:25,578 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-01 01:12:25,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-01 01:12:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-01 01:12:25,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-01 01:12:25,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:12:25,579 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-01 01:12:25,579 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:12:25,579 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:12:25,579 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-01 01:12:25,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:12:25,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:12:25,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:25,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:12:25,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:12:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:27,515 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:12:27,515 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-01 01:12:27,523 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:12:27,554 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-01 01:12:27,555 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:12:27,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:12:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:29,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:12:29,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-01 01:12:29,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-01 01:12:29,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-01 01:12:29,179 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:12:29,179 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 49 states. [2018-10-01 01:12:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:12:33,008 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-01 01:12:33,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-01 01:12:33,008 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 25 [2018-10-01 01:12:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:12:33,009 INFO L225 Difference]: With dead ends: 28 [2018-10-01 01:12:33,009 INFO L226 Difference]: Without dead ends: 27 [2018-10-01 01:12:33,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s Time [2018-10-01 01:12:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-01 01:12:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-01 01:12:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-01 01:12:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-01 01:12:33,013 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-01 01:12:33,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:12:33,014 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-01 01:12:33,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-01 01:12:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-01 01:12:33,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 01:12:33,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:12:33,014 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-01 01:12:33,015 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:12:33,015 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:12:33,015 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-01 01:12:33,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:12:33,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:12:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:33,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:12:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:12:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:34,436 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:12:34,436 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-01 01:12:34,442 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:12:34,482 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-01 01:12:34,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:12:34,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:12:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:36,334 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:12:36,334 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-01 01:12:36,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-01 01:12:36,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-01 01:12:36,335 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:12:36,335 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 51 states. [2018-10-01 01:12:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:12:40,747 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-01 01:12:40,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 01:12:40,747 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 26 [2018-10-01 01:12:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:12:40,748 INFO L225 Difference]: With dead ends: 29 [2018-10-01 01:12:40,748 INFO L226 Difference]: Without dead ends: 28 [2018-10-01 01:12:40,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time [2018-10-01 01:12:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-01 01:12:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-01 01:12:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-01 01:12:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-01 01:12:40,754 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-01 01:12:40,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:12:40,754 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-01 01:12:40,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-01 01:12:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-01 01:12:40,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-01 01:12:40,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:12:40,755 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-01 01:12:40,755 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:12:40,755 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:12:40,755 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-01 01:12:40,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:12:40,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:12:40,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:40,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:12:40,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:12:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:42,261 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:12:42,261 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-01 01:12:42,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:12:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:12:42,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:12:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:44,850 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:12:44,850 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-01 01:12:44,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-01 01:12:44,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-01 01:12:44,851 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:12:44,851 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 53 states. [2018-10-01 01:12:49,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:12:49,867 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-01 01:12:49,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 01:12:49,868 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 27 [2018-10-01 01:12:49,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:12:49,869 INFO L225 Difference]: With dead ends: 30 [2018-10-01 01:12:49,869 INFO L226 Difference]: Without dead ends: 29 [2018-10-01 01:12:49,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time [2018-10-01 01:12:49,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-01 01:12:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-01 01:12:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-01 01:12:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-01 01:12:49,874 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-01 01:12:49,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:12:49,875 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-01 01:12:49,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-01 01:12:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-01 01:12:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 01:12:49,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:12:49,876 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-01 01:12:49,876 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:12:49,876 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:12:49,876 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-01 01:12:49,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:12:49,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:12:49,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:49,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:12:49,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:12:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:51,426 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:12:51,426 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-01 01:12:51,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:12:51,465 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:12:51,465 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:12:51,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:12:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:12:53,693 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:12:53,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-01 01:12:53,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-01 01:12:53,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-01 01:12:53,694 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:12:53,694 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 55 states. [2018-10-01 01:12:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:12:59,715 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-01 01:12:59,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 01:12:59,716 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 28 [2018-10-01 01:12:59,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:12:59,716 INFO L225 Difference]: With dead ends: 31 [2018-10-01 01:12:59,717 INFO L226 Difference]: Without dead ends: 30 [2018-10-01 01:12:59,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s Time [2018-10-01 01:12:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-01 01:12:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-01 01:12:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-01 01:12:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-01 01:12:59,722 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-01 01:12:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:12:59,722 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-01 01:12:59,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-01 01:12:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-01 01:12:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-01 01:12:59,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:12:59,723 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-01 01:12:59,723 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:12:59,723 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:12:59,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-01 01:12:59,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:12:59,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:12:59,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:59,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:12:59,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:12:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:13:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:13:01,930 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:13:01,930 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-01 01:13:01,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:13:01,985 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-01 01:13:01,985 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:13:01,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:13:04,433 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:13:04,453 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:13:04,453 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-01 01:13:04,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-01 01:13:04,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-01 01:13:04,454 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:13:04,454 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 57 states. [2018-10-01 01:13:11,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:13:11,876 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-01 01:13:11,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 01:13:11,876 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 29 [2018-10-01 01:13:11,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:13:11,877 INFO L225 Difference]: With dead ends: 32 [2018-10-01 01:13:11,877 INFO L226 Difference]: Without dead ends: 31 [2018-10-01 01:13:11,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s Time [2018-10-01 01:13:11,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-01 01:13:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-01 01:13:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-01 01:13:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-01 01:13:11,882 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-01 01:13:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:13:11,882 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-01 01:13:11,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-01 01:13:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-01 01:13:11,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 01:13:11,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:13:11,883 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-01 01:13:11,883 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:13:11,883 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:13:11,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-01 01:13:11,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:13:11,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:13:11,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:13:11,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:13:11,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:13:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:13:13,817 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:13:13,818 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:13:13,818 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-01 01:13:13,826 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:13:13,862 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:13:13,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:13:13,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:13:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:13:16,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:13:16,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-01 01:13:16,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-01 01:13:16,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-01 01:13:16,642 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:13:16,642 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 59 states. [2018-10-01 01:13:22,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:13:22,668 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-01 01:13:22,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 01:13:22,669 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 30 [2018-10-01 01:13:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:13:22,669 INFO L225 Difference]: With dead ends: 33 [2018-10-01 01:13:22,670 INFO L226 Difference]: Without dead ends: 32 [2018-10-01 01:13:22,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s Time [2018-10-01 01:13:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-01 01:13:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-01 01:13:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-01 01:13:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-01 01:13:22,677 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-01 01:13:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:13:22,677 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-01 01:13:22,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-01 01:13:22,677 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-01 01:13:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-01 01:13:22,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:13:22,678 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-01 01:13:22,678 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:13:22,678 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:13:22,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-01 01:13:22,678 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:13:22,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:13:22,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:13:22,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:13:22,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:13:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:13:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:13:25,149 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:13:25,149 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 01:13:25,162 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:13:25,213 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-01 01:13:25,213 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:13:25,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:13:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:13:28,316 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:13:28,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-01 01:13:28,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-01 01:13:28,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-01 01:13:28,317 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:13:28,317 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 61 states. [2018-10-01 01:13:35,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:13:35,503 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-01 01:13:35,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 01:13:35,504 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 31 [2018-10-01 01:13:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:13:35,505 INFO L225 Difference]: With dead ends: 34 [2018-10-01 01:13:35,505 INFO L226 Difference]: Without dead ends: 33 [2018-10-01 01:13:35,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s Time [2018-10-01 01:13:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-01 01:13:35,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-01 01:13:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 01:13:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-01 01:13:35,513 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-01 01:13:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:13:35,513 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-01 01:13:35,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-01 01:13:35,514 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-01 01:13:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-01 01:13:35,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:13:35,514 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-01 01:13:35,514 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:13:35,515 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:13:35,515 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-01 01:13:35,515 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:13:35,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:13:35,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:13:35,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:13:35,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:13:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:13:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:13:37,872 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:13:37,872 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-01 01:13:37,881 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:13:37,941 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-01 01:13:37,942 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:13:37,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:13:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:13:40,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:13:40,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-01 01:13:40,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-01 01:13:40,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-01 01:13:40,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:13:40,934 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 63 states. [2018-10-01 01:13:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:13:51,035 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-01 01:13:51,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-01 01:13:51,035 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 32 [2018-10-01 01:13:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:13:51,036 INFO L225 Difference]: With dead ends: 35 [2018-10-01 01:13:51,036 INFO L226 Difference]: Without dead ends: 34 [2018-10-01 01:13:51,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s Time [2018-10-01 01:13:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-01 01:13:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-01 01:13:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-01 01:13:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-01 01:13:51,041 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-01 01:13:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:13:51,041 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-01 01:13:51,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-01 01:13:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-01 01:13:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-01 01:13:51,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:13:51,042 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-01 01:13:51,042 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:13:51,042 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:13:51,042 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-01 01:13:51,042 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:13:51,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:13:51,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:13:51,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:13:51,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:13:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:13:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:13:53,765 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:13:53,765 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-01 01:13:53,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:13:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:13:53,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:13:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:13:57,466 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:13:57,466 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-01 01:13:57,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-01 01:13:57,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-01 01:13:57,467 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:13:57,467 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 65 states. [2018-10-01 01:14:05,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:14:05,892 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-01 01:14:05,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 01:14:05,892 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 33 [2018-10-01 01:14:05,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:14:05,893 INFO L225 Difference]: With dead ends: 36 [2018-10-01 01:14:05,893 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 01:14:05,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s Time [2018-10-01 01:14:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 01:14:05,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-01 01:14:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 01:14:05,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-01 01:14:05,900 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-01 01:14:05,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:14:05,900 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-01 01:14:05,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-01 01:14:05,901 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-01 01:14:05,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 01:14:05,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:14:05,901 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-01 01:14:05,901 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:14:05,901 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:14:05,901 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-01 01:14:05,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:14:05,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:14:05,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:14:05,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:14:05,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:14:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:14:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:14:08,663 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:14:08,663 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-01 01:14:08,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:14:08,717 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:14:08,717 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:14:08,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:14:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:14:12,456 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:14:12,456 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-01 01:14:12,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-01 01:14:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-01 01:14:12,457 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:14:12,457 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 67 states. [2018-10-01 01:14:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:14:21,949 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-01 01:14:21,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 01:14:21,950 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 34 [2018-10-01 01:14:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:14:21,951 INFO L225 Difference]: With dead ends: 37 [2018-10-01 01:14:21,951 INFO L226 Difference]: Without dead ends: 36 [2018-10-01 01:14:21,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s Time [2018-10-01 01:14:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-01 01:14:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-01 01:14:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-01 01:14:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-01 01:14:21,957 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-01 01:14:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:14:21,958 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-01 01:14:21,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-01 01:14:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-01 01:14:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-01 01:14:21,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:14:21,958 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-01 01:14:21,959 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:14:21,959 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:14:21,959 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-01 01:14:21,959 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:14:21,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:14:21,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:14:21,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:14:21,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:14:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:14:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:14:24,976 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:14:24,976 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 01:14:24,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:14:25,057 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-01 01:14:25,057 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:14:25,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:14:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:14:28,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:14:28,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-01 01:14:28,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-01 01:14:28,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-01 01:14:28,944 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:14:28,944 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 69 states. [2018-10-01 01:14:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:14:40,271 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-01 01:14:40,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 01:14:40,272 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 35 [2018-10-01 01:14:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:14:40,272 INFO L225 Difference]: With dead ends: 38 [2018-10-01 01:14:40,272 INFO L226 Difference]: Without dead ends: 37 [2018-10-01 01:14:40,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s Time [2018-10-01 01:14:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-01 01:14:40,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-01 01:14:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-01 01:14:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-01 01:14:40,278 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-01 01:14:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:14:40,278 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-01 01:14:40,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-01 01:14:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-01 01:14:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-01 01:14:40,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:14:40,279 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-01 01:14:40,279 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:14:40,279 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:14:40,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-01 01:14:40,280 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:14:40,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:14:40,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:14:40,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:14:40,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:14:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:14:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:14:43,525 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:14:43,525 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-01 01:14:43,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:14:43,587 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:14:43,587 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:14:43,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:14:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:14:48,205 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:14:48,205 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-01 01:14:48,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-01 01:14:48,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-01 01:14:48,206 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:14:48,206 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 71 states. [2018-10-01 01:14:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:14:59,139 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-01 01:14:59,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 01:14:59,140 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 36 [2018-10-01 01:14:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:14:59,140 INFO L225 Difference]: With dead ends: 39 [2018-10-01 01:14:59,140 INFO L226 Difference]: Without dead ends: 38 [2018-10-01 01:14:59,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s Time [2018-10-01 01:14:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-01 01:14:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-01 01:14:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-01 01:14:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-01 01:14:59,146 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-01 01:14:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:14:59,147 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-01 01:14:59,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-01 01:14:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-01 01:14:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-01 01:14:59,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:14:59,147 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-01 01:14:59,148 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:14:59,148 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:14:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-01 01:14:59,148 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:14:59,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:14:59,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:14:59,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:14:59,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:14:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:15:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:15:02,612 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:15:02,612 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-01 01:15:02,619 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:15:02,693 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-01 01:15:02,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:15:02,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:15:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:15:07,502 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:15:07,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-01 01:15:07,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-01 01:15:07,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-01 01:15:07,503 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:15:07,503 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 73 states. [2018-10-01 01:15:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:15:18,506 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-01 01:15:18,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-01 01:15:18,507 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 37 [2018-10-01 01:15:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:15:18,507 INFO L225 Difference]: With dead ends: 40 [2018-10-01 01:15:18,508 INFO L226 Difference]: Without dead ends: 39 [2018-10-01 01:15:18,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s Time [2018-10-01 01:15:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-01 01:15:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-01 01:15:18,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-01 01:15:18,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-01 01:15:18,513 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-01 01:15:18,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:15:18,513 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-01 01:15:18,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-01 01:15:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-01 01:15:18,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-01 01:15:18,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:15:18,514 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-01 01:15:18,514 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:15:18,514 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:15:18,514 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-01 01:15:18,515 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:15:18,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:15:18,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:15:18,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:15:18,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:15:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:15:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:15:22,276 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:15:22,277 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-01 01:15:22,285 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:15:22,351 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-01 01:15:22,351 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:15:22,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:15:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:15:27,279 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:15:27,279 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-01 01:15:27,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-01 01:15:27,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-01 01:15:27,280 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:15:27,280 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 75 states. [2018-10-01 01:15:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:15:38,969 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-01 01:15:38,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 01:15:38,970 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 38 [2018-10-01 01:15:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:15:38,971 INFO L225 Difference]: With dead ends: 41 [2018-10-01 01:15:38,971 INFO L226 Difference]: Without dead ends: 40 [2018-10-01 01:15:38,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s Time [2018-10-01 01:15:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-01 01:15:38,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-01 01:15:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-01 01:15:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-01 01:15:38,976 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-01 01:15:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:15:38,976 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-01 01:15:38,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-01 01:15:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-01 01:15:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-01 01:15:38,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:15:38,977 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-01 01:15:38,977 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:15:38,977 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:15:38,977 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-01 01:15:38,977 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:15:38,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:15:38,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:15:38,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:15:38,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:15:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:15:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:15:42,981 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:15:42,981 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-01 01:15:42,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:15:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:15:43,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:15:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:15:48,998 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:15:48,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-01 01:15:48,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-01 01:15:48,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-01 01:15:48,999 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:15:48,999 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 77 states. [2018-10-01 01:16:01,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:16:01,821 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-01 01:16:01,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-01 01:16:01,822 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 39 [2018-10-01 01:16:01,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:16:01,822 INFO L225 Difference]: With dead ends: 42 [2018-10-01 01:16:01,822 INFO L226 Difference]: Without dead ends: 41 [2018-10-01 01:16:01,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s Time [2018-10-01 01:16:01,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-01 01:16:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-01 01:16:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-01 01:16:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-01 01:16:01,827 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-01 01:16:01,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:16:01,827 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-01 01:16:01,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-01 01:16:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-01 01:16:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-01 01:16:01,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:16:01,827 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-01 01:16:01,828 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:16:01,828 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:16:01,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-01 01:16:01,828 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:16:01,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:16:01,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:16:01,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:16:01,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:16:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:16:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:16:06,059 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:16:06,059 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-01 01:16:06,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:16:06,129 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:16:06,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:16:06,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:16:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:16:11,723 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:16:11,723 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-01 01:16:11,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-01 01:16:11,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-01 01:16:11,724 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:16:11,724 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 79 states. [2018-10-01 01:16:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:16:25,211 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-01 01:16:25,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-01 01:16:25,212 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 40 [2018-10-01 01:16:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:16:25,213 INFO L225 Difference]: With dead ends: 43 [2018-10-01 01:16:25,213 INFO L226 Difference]: Without dead ends: 42 [2018-10-01 01:16:25,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s Time [2018-10-01 01:16:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-01 01:16:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-01 01:16:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-01 01:16:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-01 01:16:25,218 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-01 01:16:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:16:25,218 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-01 01:16:25,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-01 01:16:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-01 01:16:25,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-01 01:16:25,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:16:25,219 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-01 01:16:25,219 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:16:25,219 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:16:25,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-01 01:16:25,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:16:25,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:16:25,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:16:25,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:16:25,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:16:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:16:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:16:29,728 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:16:29,728 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-01 01:16:29,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:16:29,840 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-01 01:16:29,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:16:29,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:16:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:16:35,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:16:35,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-01 01:16:35,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-01 01:16:35,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-01 01:16:35,736 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:16:35,736 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 81 states. [2018-10-01 01:16:50,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:16:50,827 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-01 01:16:50,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-01 01:16:50,827 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 41 [2018-10-01 01:16:50,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:16:50,828 INFO L225 Difference]: With dead ends: 44 [2018-10-01 01:16:50,828 INFO L226 Difference]: Without dead ends: 43 [2018-10-01 01:16:50,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s Time [2018-10-01 01:16:50,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-01 01:16:50,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-01 01:16:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-01 01:16:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-01 01:16:50,833 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-01 01:16:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:16:50,833 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-01 01:16:50,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-01 01:16:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-01 01:16:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-01 01:16:50,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:16:50,834 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-01 01:16:50,834 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:16:50,834 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:16:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-01 01:16:50,834 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:16:50,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:16:50,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:16:50,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:16:50,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:16:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:16:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:16:55,682 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:16:55,682 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-01 01:16:55,691 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:16:55,763 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:16:55,764 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:16:55,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:17:01,933 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:17:01,953 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:17:01,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-01 01:17:01,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-01 01:17:01,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-01 01:17:01,954 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:17:01,954 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 83 states. [2018-10-01 01:17:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:17:19,118 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-01 01:17:19,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-01 01:17:19,118 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 42 [2018-10-01 01:17:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:17:19,119 INFO L225 Difference]: With dead ends: 45 [2018-10-01 01:17:19,119 INFO L226 Difference]: Without dead ends: 44 [2018-10-01 01:17:19,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s Time [2018-10-01 01:17:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-01 01:17:19,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-01 01:17:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-01 01:17:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-01 01:17:19,124 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-01 01:17:19,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:17:19,124 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-01 01:17:19,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-01 01:17:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-01 01:17:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-01 01:17:19,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:17:19,125 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-01 01:17:19,125 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:17:19,125 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:17:19,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-01 01:17:19,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:17:19,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:17:19,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:17:19,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:17:19,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:17:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:17:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:17:24,283 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:17:24,283 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-01 01:17:24,290 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:17:24,412 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-01 01:17:24,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:17:24,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:17:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:17:31,284 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:17:31,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-01 01:17:31,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-01 01:17:31,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-01 01:17:31,285 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:17:31,285 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 85 states. [2018-10-01 01:17:51,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:17:51,959 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-01 01:17:51,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-01 01:17:51,960 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 43 [2018-10-01 01:17:51,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:17:51,961 INFO L225 Difference]: With dead ends: 46 [2018-10-01 01:17:51,961 INFO L226 Difference]: Without dead ends: 45 [2018-10-01 01:17:51,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s Time [2018-10-01 01:17:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-01 01:17:51,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-01 01:17:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-01 01:17:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-01 01:17:51,965 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-01 01:17:51,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:17:51,965 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-01 01:17:51,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-01 01:17:51,966 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-01 01:17:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-01 01:17:51,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:17:51,966 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-01 01:17:51,966 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:17:51,966 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:17:51,966 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-01 01:17:51,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:17:51,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:17:51,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:17:51,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:17:51,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:17:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:17:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:17:58,127 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:17:58,127 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-01 01:17:58,136 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:17:58,273 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-01 01:17:58,273 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:17:58,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:18:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:18:05,498 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:18:05,498 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-01 01:18:05,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-01 01:18:05,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-01 01:18:05,499 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:18:05,499 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 87 states. [2018-10-01 01:18:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:18:23,387 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-01 01:18:23,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-01 01:18:23,387 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 44 [2018-10-01 01:18:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:18:23,388 INFO L225 Difference]: With dead ends: 47 [2018-10-01 01:18:23,388 INFO L226 Difference]: Without dead ends: 46 [2018-10-01 01:18:23,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s Time [2018-10-01 01:18:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-01 01:18:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-01 01:18:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-01 01:18:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-01 01:18:23,394 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-01 01:18:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:18:23,394 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-01 01:18:23,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-01 01:18:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-01 01:18:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-01 01:18:23,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:18:23,395 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-01 01:18:23,395 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:18:23,395 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:18:23,395 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-01 01:18:23,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:18:23,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:18:23,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:18:23,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:18:23,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:18:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:18:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:18:29,176 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:18:29,176 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-01 01:18:29,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:18:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:18:29,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:18:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:18:37,764 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:18:37,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-01 01:18:37,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-01 01:18:37,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-01 01:18:37,765 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:18:37,765 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 89 states. [2018-10-01 01:18:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:18:59,316 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-01 01:18:59,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-01 01:18:59,316 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 45 [2018-10-01 01:18:59,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:18:59,317 INFO L225 Difference]: With dead ends: 48 [2018-10-01 01:18:59,317 INFO L226 Difference]: Without dead ends: 47 [2018-10-01 01:18:59,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s Time [2018-10-01 01:18:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-01 01:18:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-01 01:18:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-01 01:18:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-01 01:18:59,322 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-10-01 01:18:59,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:18:59,323 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-01 01:18:59,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-01 01:18:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-01 01:18:59,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-01 01:18:59,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:18:59,323 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-10-01 01:18:59,324 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:18:59,324 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:18:59,324 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-10-01 01:18:59,324 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:18:59,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:18:59,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:18:59,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:18:59,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:18:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:19:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:19:05,535 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:19:05,535 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-01 01:19:05,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:19:05,631 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:19:05,631 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:19:05,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:19:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:19:14,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:19:14,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-10-01 01:19:14,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-01 01:19:14,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-01 01:19:14,458 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:19:14,458 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 91 states. [2018-10-01 01:19:35,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:19:35,211 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-01 01:19:35,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-01 01:19:35,212 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 46 [2018-10-01 01:19:35,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:19:35,213 INFO L225 Difference]: With dead ends: 49 [2018-10-01 01:19:35,213 INFO L226 Difference]: Without dead ends: 48 [2018-10-01 01:19:35,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s Time [2018-10-01 01:19:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-01 01:19:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-01 01:19:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-01 01:19:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-01 01:19:35,218 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-10-01 01:19:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:19:35,218 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-01 01:19:35,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-01 01:19:35,218 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-01 01:19:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-01 01:19:35,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:19:35,218 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-10-01 01:19:35,219 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:19:35,219 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:19:35,219 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-10-01 01:19:35,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:19:35,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:19:35,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:19:35,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:19:35,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:19:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:19:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:19:42,031 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:19:42,031 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-01 01:19:42,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:19:42,186 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-01 01:19:42,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:19:42,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:19:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:19:51,154 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:19:51,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-10-01 01:19:51,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-01 01:19:51,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-01 01:19:51,155 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:19:51,155 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 93 states. [2018-10-01 01:20:16,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:20:16,978 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-01 01:20:16,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-01 01:20:16,979 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 47 [2018-10-01 01:20:16,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:20:16,980 INFO L225 Difference]: With dead ends: 50 [2018-10-01 01:20:16,980 INFO L226 Difference]: Without dead ends: 49 [2018-10-01 01:20:16,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s Time [2018-10-01 01:20:16,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-01 01:20:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-01 01:20:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-01 01:20:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-01 01:20:16,986 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-10-01 01:20:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:20:16,986 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-01 01:20:16,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-01 01:20:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-01 01:20:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-01 01:20:16,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:20:16,987 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-10-01 01:20:16,987 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:20:16,987 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:20:16,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-10-01 01:20:16,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:20:16,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:20:16,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:20:16,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:20:16,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:20:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:20:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:20:24,051 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:20:24,051 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-01 01:20:24,059 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:20:24,155 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:20:24,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:20:24,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:20:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:20:33,151 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:20:33,151 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-10-01 01:20:33,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-01 01:20:33,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-01 01:20:33,152 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:20:33,152 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 95 states. [2018-10-01 01:20:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:20:57,344 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-01 01:20:57,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-01 01:20:57,345 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 48 [2018-10-01 01:20:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:20:57,345 INFO L225 Difference]: With dead ends: 51 [2018-10-01 01:20:57,345 INFO L226 Difference]: Without dead ends: 50 [2018-10-01 01:20:57,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s Time [2018-10-01 01:20:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-01 01:20:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-01 01:20:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-01 01:20:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-01 01:20:57,350 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-10-01 01:20:57,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:20:57,351 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-01 01:20:57,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-01 01:20:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-01 01:20:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-01 01:20:57,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:20:57,352 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-10-01 01:20:57,352 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:20:57,352 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:20:57,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-10-01 01:20:57,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:20:57,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:20:57,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:20:57,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:20:57,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:20:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:21:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:21:04,963 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:21:04,963 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-01 01:21:04,973 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:21:05,125 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-01 01:21:05,126 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:21:05,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:21:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:21:14,779 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:21:14,779 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-10-01 01:21:14,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-01 01:21:14,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-01 01:21:14,780 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:21:14,780 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 97 states. [2018-10-01 01:21:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:21:39,209 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-01 01:21:39,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-01 01:21:39,210 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 49 [2018-10-01 01:21:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:21:39,210 INFO L225 Difference]: With dead ends: 52 [2018-10-01 01:21:39,210 INFO L226 Difference]: Without dead ends: 51 [2018-10-01 01:21:39,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s Time [2018-10-01 01:21:39,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-01 01:21:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-01 01:21:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-01 01:21:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-01 01:21:39,217 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-10-01 01:21:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:21:39,217 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-01 01:21:39,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-01 01:21:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-01 01:21:39,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-01 01:21:39,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:21:39,218 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-10-01 01:21:39,218 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:21:39,218 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:21:39,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-10-01 01:21:39,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:21:39,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:21:39,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:21:39,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:21:39,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:21:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:21:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:21:47,133 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:21:47,133 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-01 01:21:47,141 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:21:47,339 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-01 01:21:47,340 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:21:47,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:21:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:21:57,701 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:21:57,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-10-01 01:21:57,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-01 01:21:57,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-01 01:21:57,702 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:21:57,702 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 99 states. [2018-10-01 01:22:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:22:27,902 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-01 01:22:27,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-01 01:22:27,903 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 50 [2018-10-01 01:22:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:22:27,904 INFO L225 Difference]: With dead ends: 53 [2018-10-01 01:22:27,904 INFO L226 Difference]: Without dead ends: 52 [2018-10-01 01:22:27,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6s Time [2018-10-01 01:22:27,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-01 01:22:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-01 01:22:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-01 01:22:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-01 01:22:27,911 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-10-01 01:22:27,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:22:27,911 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-01 01:22:27,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-01 01:22:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-01 01:22:27,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-01 01:22:27,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:22:27,912 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-10-01 01:22:27,912 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:22:27,912 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:22:27,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-10-01 01:22:27,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:22:27,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:22:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:22:27,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:22:27,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:22:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:22:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:22:36,303 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:22:36,303 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:22:36,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:22:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:22:36,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:22:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:22:47,405 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:22:47,405 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-10-01 01:22:47,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-01 01:22:47,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-01 01:22:47,406 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:22:47,406 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 101 states. [2018-10-01 01:23:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:23:23,538 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-01 01:23:23,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-01 01:23:23,538 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 51 [2018-10-01 01:23:23,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:23:23,539 INFO L225 Difference]: With dead ends: 54 [2018-10-01 01:23:23,539 INFO L226 Difference]: Without dead ends: 53 [2018-10-01 01:23:23,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.7s Time [2018-10-01 01:23:23,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-01 01:23:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-01 01:23:23,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-01 01:23:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-01 01:23:23,545 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-10-01 01:23:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:23:23,545 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-01 01:23:23,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-01 01:23:23,545 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-01 01:23:23,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 01:23:23,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:23:23,546 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-10-01 01:23:23,546 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:23:23,546 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:23:23,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-10-01 01:23:23,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:23:23,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:23:23,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:23:23,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:23:23,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:23:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:23:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:23:32,184 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:23:32,184 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:23:32,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:23:32,317 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:23:32,318 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:23:32,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:23:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:23:44,324 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:23:44,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-10-01 01:23:44,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-01 01:23:44,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-01 01:23:44,325 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:23:44,325 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 103 states. [2018-10-01 01:24:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:24:22,433 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-01 01:24:22,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-01 01:24:22,434 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 52 [2018-10-01 01:24:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:24:22,435 INFO L225 Difference]: With dead ends: 55 [2018-10-01 01:24:22,435 INFO L226 Difference]: Without dead ends: 54 [2018-10-01 01:24:22,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.0s Time [2018-10-01 01:24:22,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-01 01:24:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-10-01 01:24:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-01 01:24:22,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-01 01:24:22,440 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-10-01 01:24:22,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:24:22,441 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-01 01:24:22,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-01 01:24:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-01 01:24:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-01 01:24:22,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:24:22,441 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-10-01 01:24:22,441 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:24:22,442 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:24:22,442 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-10-01 01:24:22,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:24:22,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:24:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:24:22,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:24:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:24:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:24:31,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:24:31,779 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:24:31,779 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:24:31,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:24:31,998 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-10-01 01:24:31,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:24:32,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:24:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:24:44,361 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:24:44,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-10-01 01:24:44,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-01 01:24:44,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-01 01:24:44,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:24:44,362 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 105 states. [2018-10-01 01:25:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:25:20,980 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-01 01:25:20,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-01 01:25:20,980 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 53 [2018-10-01 01:25:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:25:20,981 INFO L225 Difference]: With dead ends: 56 [2018-10-01 01:25:20,981 INFO L226 Difference]: Without dead ends: 55 [2018-10-01 01:25:20,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.8s Time [2018-10-01 01:25:20,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-01 01:25:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-01 01:25:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-01 01:25:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-01 01:25:20,988 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-10-01 01:25:20,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:25:20,988 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-01 01:25:20,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-01 01:25:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-01 01:25:20,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-01 01:25:20,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:25:20,989 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-10-01 01:25:20,989 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:25:20,989 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:25:20,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-10-01 01:25:20,989 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:25:20,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:25:20,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:25:20,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:25:20,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:25:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-01 01:25:28,067 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-01 01:25:28,071 WARN L206 ceAbstractionStarter]: Timeout [2018-10-01 01:25:28,071 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 01:25:28 BoogieIcfgContainer [2018-10-01 01:25:28,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 01:25:28,072 INFO L168 Benchmark]: Toolchain (without parser) took 841452.82 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -463.5 MB). Free memory was 1.5 GB in the beginning and 941.8 MB in the end (delta: 513.3 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2018-10-01 01:25:28,074 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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-01 01:25:28,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 01:25:28,075 INFO L168 Benchmark]: Boogie Preprocessor took 25.09 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-01 01:25:28,075 INFO L168 Benchmark]: RCFGBuilder took 274.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 01:25:28,076 INFO L168 Benchmark]: TraceAbstraction took 841105.38 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -463.5 MB). Free memory was 1.4 GB in the beginning and 941.8 MB in the end (delta: 492.1 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2018-10-01 01:25:28,080 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.23 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 42.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.09 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 274.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 841105.38 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -463.5 MB). Free memory was 1.4 GB in the beginning and 941.8 MB in the end (delta: 492.1 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 52, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 53 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 841.0s OverallTime, 53 OverallIterations, 52 TraceHistogramMax, 499.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 105 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 59508 SolverSat, 1326 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 270.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2755 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2704 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 318.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 52 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 327.0s InterpolantComputationTime, 2858 NumberOfCodeBlocks, 2858 NumberOfCodeBlocksAsserted, 454 NumberOfCheckSat, 2755 ConstructedInterpolants, 0 QuantifiedInterpolants, 939797 SizeOfPredicates, 51 NumberOfNonLiveVariables, 5661 ConjunctsInSsa, 2805 ConjunctsInUnsatCore, 103 InterpolantComputations, 1 PerfectInterpolantSequences, 0/46852 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/GeometricalCake.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_01-25-28-090.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GeometricalCake.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_01-25-28-090.csv Completed graceful shutdown