java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:09:16,541 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:09:16,543 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:09:16,554 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:09:16,554 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:09:16,555 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:09:16,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:09:16,558 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:09:16,560 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:09:16,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:09:16,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:09:16,562 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:09:16,563 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:09:16,564 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:09:16,565 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:09:16,565 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:09:16,567 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:09:16,569 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:09:16,571 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:09:16,572 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:09:16,573 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:09:16,576 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:09:16,576 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:09:16,576 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:09:16,577 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:09:16,578 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:09:16,579 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:09:16,580 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:09:16,581 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:09:16,581 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:09:16,582 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:09:16,582 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:09:16,583 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:09:16,584 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:09:16,584 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:09:16,585 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:09:16,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:09:16,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:09:16,599 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:09:16,600 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:09:16,601 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:09:16,601 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:09:16,602 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:09:16,602 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:09:16,602 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:09:16,602 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:09:16,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:09:16,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:09:16,603 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:09:16,604 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:09:16,604 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:09:16,604 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:09:16,604 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:09:16,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:09:16,605 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:09:16,606 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:09:16,607 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:09:16,643 INFO ]: Repository-Root is: /tmp [2018-06-22 11:09:16,657 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:09:16,661 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:09:16,662 INFO ]: Initializing SmtParser... [2018-06-22 11:09:16,663 INFO ]: SmtParser initialized [2018-06-22 11:09:16,664 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 [2018-06-22 11:09:16,665 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:09:16,760 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 unknown [2018-06-22 11:09:17,014 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 [2018-06-22 11:09:17,021 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:09:17,026 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:09:17,027 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:09:17,027 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:09:17,027 INFO ]: ChcToBoogie initialized [2018-06-22 11:09:17,030 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:09:17" (1/1) ... [2018-06-22 11:09:17,075 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:09:17 Unit [2018-06-22 11:09:17,075 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:09:17,076 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:09:17,076 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:09:17,076 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:09:17,098 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:09:17" (1/1) ... [2018-06-22 11:09:17,098 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:09:17" (1/1) ... [2018-06-22 11:09:17,106 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:09:17" (1/1) ... [2018-06-22 11:09:17,106 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:09:17" (1/1) ... [2018-06-22 11:09:17,110 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:09:17" (1/1) ... [2018-06-22 11:09:17,112 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:09:17" (1/1) ... [2018-06-22 11:09:17,113 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:09:17" (1/1) ... [2018-06-22 11:09:17,116 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:09:17,117 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:09:17,117 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:09:17,117 INFO ]: RCFGBuilder initialized [2018-06-22 11:09:17,118 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:09:17" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:09:17,138 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:09:17,138 INFO ]: Found specification of procedure False [2018-06-22 11:09:17,138 INFO ]: Found implementation of procedure False [2018-06-22 11:09:17,138 INFO ]: Specification and implementation of procedure INV2 given in one single declaration [2018-06-22 11:09:17,138 INFO ]: Found specification of procedure INV2 [2018-06-22 11:09:17,138 INFO ]: Found implementation of procedure INV2 [2018-06-22 11:09:17,138 INFO ]: Specification and implementation of procedure INV1 given in one single declaration [2018-06-22 11:09:17,138 INFO ]: Found specification of procedure INV1 [2018-06-22 11:09:17,138 INFO ]: Found implementation of procedure INV1 [2018-06-22 11:09:17,138 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:09:17,138 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:09:17,138 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:09:17,486 INFO ]: Using library mode [2018-06-22 11:09:17,487 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:09:17 BoogieIcfgContainer [2018-06-22 11:09:17,487 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:09:17,488 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:09:17,488 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:09:17,492 INFO ]: TraceAbstraction initialized [2018-06-22 11:09:17,492 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:09:17" (1/3) ... [2018-06-22 11:09:17,495 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a64155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:09:17, skipping insertion in model container [2018-06-22 11:09:17,496 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:09:17" (2/3) ... [2018-06-22 11:09:17,496 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a64155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:09:17, skipping insertion in model container [2018-06-22 11:09:17,496 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:09:17" (3/3) ... [2018-06-22 11:09:17,498 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:09:17,508 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:09:17,516 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:09:17,553 INFO ]: Using default assertion order modulation [2018-06-22 11:09:17,554 INFO ]: Interprodecural is true [2018-06-22 11:09:17,554 INFO ]: Hoare is false [2018-06-22 11:09:17,554 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:09:17,554 INFO ]: Backedges is TWOTRACK [2018-06-22 11:09:17,554 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:09:17,554 INFO ]: Difference is false [2018-06-22 11:09:17,554 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:09:17,554 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:09:17,571 INFO ]: Start isEmpty. Operand 26 states. [2018-06-22 11:09:17,586 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:09:17,586 INFO ]: Found error trace [2018-06-22 11:09:17,587 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:17,587 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:17,591 INFO ]: Analyzing trace with hash 1658769108, now seen corresponding path program 1 times [2018-06-22 11:09:17,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:17,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:17,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:17,641 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:17,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:17,714 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:17,942 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:09:17,946 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:09:17,946 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:09:17,948 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:09:17,965 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:09:17,965 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:09:17,967 INFO ]: Start difference. First operand 26 states. Second operand 6 states. [2018-06-22 11:09:18,422 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:18,422 INFO ]: Finished difference Result 30 states and 61 transitions. [2018-06-22 11:09:18,422 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:09:18,424 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:09:18,424 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:18,434 INFO ]: With dead ends: 30 [2018-06-22 11:09:18,434 INFO ]: Without dead ends: 30 [2018-06-22 11:09:18,436 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:09:18,450 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:09:18,482 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-22 11:09:18,483 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:09:18,485 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 52 transitions. [2018-06-22 11:09:18,486 INFO ]: Start accepts. Automaton has 28 states and 52 transitions. Word has length 17 [2018-06-22 11:09:18,487 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:18,487 INFO ]: Abstraction has 28 states and 52 transitions. [2018-06-22 11:09:18,487 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:09:18,487 INFO ]: Start isEmpty. Operand 28 states and 52 transitions. [2018-06-22 11:09:18,490 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:09:18,490 INFO ]: Found error trace [2018-06-22 11:09:18,490 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:18,491 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:18,491 INFO ]: Analyzing trace with hash 800985776, now seen corresponding path program 1 times [2018-06-22 11:09:18,491 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:18,491 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:18,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:18,492 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:18,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:18,515 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:18,776 INFO ]: Checked inductivity of 19 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:09:18,776 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:18,776 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:18,787 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:18,859 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:18,867 INFO ]: Computing forward predicates... [2018-06-22 11:09:19,076 INFO ]: Checked inductivity of 19 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:09:19,103 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:19,103 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 12 [2018-06-22 11:09:19,104 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:09:19,104 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:09:19,104 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:09:19,104 INFO ]: Start difference. First operand 28 states and 52 transitions. Second operand 12 states. [2018-06-22 11:09:20,140 WARN ]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 11:09:21,004 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:21,004 INFO ]: Finished difference Result 54 states and 155 transitions. [2018-06-22 11:09:21,005 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:09:21,005 INFO ]: Start accepts. Automaton has 12 states. Word has length 25 [2018-06-22 11:09:21,005 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:21,008 INFO ]: With dead ends: 54 [2018-06-22 11:09:21,008 INFO ]: Without dead ends: 54 [2018-06-22 11:09:21,009 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:09:21,009 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:09:21,034 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 34. [2018-06-22 11:09:21,034 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:09:21,036 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 74 transitions. [2018-06-22 11:09:21,036 INFO ]: Start accepts. Automaton has 34 states and 74 transitions. Word has length 25 [2018-06-22 11:09:21,037 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:21,037 INFO ]: Abstraction has 34 states and 74 transitions. [2018-06-22 11:09:21,037 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:09:21,037 INFO ]: Start isEmpty. Operand 34 states and 74 transitions. [2018-06-22 11:09:21,039 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:09:21,039 INFO ]: Found error trace [2018-06-22 11:09:21,039 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:21,040 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:21,040 INFO ]: Analyzing trace with hash 1241413030, now seen corresponding path program 1 times [2018-06-22 11:09:21,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:21,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:21,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:21,041 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:21,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:21,060 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:21,263 INFO ]: Checked inductivity of 19 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:09:21,264 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:21,264 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:21,272 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:21,297 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:21,299 INFO ]: Computing forward predicates... [2018-06-22 11:09:21,369 INFO ]: Checked inductivity of 19 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:09:21,402 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:21,402 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 11:09:21,402 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:09:21,403 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:09:21,403 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:09:21,403 INFO ]: Start difference. First operand 34 states and 74 transitions. Second operand 11 states. [2018-06-22 11:09:22,170 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:22,170 INFO ]: Finished difference Result 66 states and 199 transitions. [2018-06-22 11:09:22,170 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:09:22,171 INFO ]: Start accepts. Automaton has 11 states. Word has length 25 [2018-06-22 11:09:22,171 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:22,174 INFO ]: With dead ends: 66 [2018-06-22 11:09:22,174 INFO ]: Without dead ends: 66 [2018-06-22 11:09:22,174 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:09:22,174 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:09:22,200 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 48. [2018-06-22 11:09:22,200 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:09:22,203 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 127 transitions. [2018-06-22 11:09:22,203 INFO ]: Start accepts. Automaton has 48 states and 127 transitions. Word has length 25 [2018-06-22 11:09:22,203 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:22,203 INFO ]: Abstraction has 48 states and 127 transitions. [2018-06-22 11:09:22,203 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:09:22,203 INFO ]: Start isEmpty. Operand 48 states and 127 transitions. [2018-06-22 11:09:22,206 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:09:22,206 INFO ]: Found error trace [2018-06-22 11:09:22,206 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:22,207 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:22,207 INFO ]: Analyzing trace with hash -126569217, now seen corresponding path program 1 times [2018-06-22 11:09:22,207 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:22,207 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:22,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:22,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:22,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:22,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:22,304 INFO ]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:09:22,304 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:22,304 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:22,312 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:22,344 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:22,347 INFO ]: Computing forward predicates... [2018-06-22 11:09:22,471 INFO ]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:09:22,491 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:09:22,491 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2018-06-22 11:09:22,491 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:09:22,491 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:09:22,491 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:09:22,491 INFO ]: Start difference. First operand 48 states and 127 transitions. Second operand 9 states. [2018-06-22 11:09:22,943 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:22,943 INFO ]: Finished difference Result 79 states and 219 transitions. [2018-06-22 11:09:22,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:09:22,943 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 11:09:22,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:22,946 INFO ]: With dead ends: 79 [2018-06-22 11:09:22,946 INFO ]: Without dead ends: 79 [2018-06-22 11:09:22,946 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:09:22,947 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:09:22,973 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 61. [2018-06-22 11:09:22,973 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:09:22,979 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 155 transitions. [2018-06-22 11:09:22,979 INFO ]: Start accepts. Automaton has 61 states and 155 transitions. Word has length 25 [2018-06-22 11:09:22,979 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:22,979 INFO ]: Abstraction has 61 states and 155 transitions. [2018-06-22 11:09:22,979 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:09:22,980 INFO ]: Start isEmpty. Operand 61 states and 155 transitions. [2018-06-22 11:09:22,985 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:09:22,985 INFO ]: Found error trace [2018-06-22 11:09:22,985 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:22,985 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:22,985 INFO ]: Analyzing trace with hash -736856035, now seen corresponding path program 2 times [2018-06-22 11:09:22,985 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:22,985 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:22,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:22,986 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:22,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:23,012 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:23,092 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:09:23,092 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:23,092 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:23,099 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:09:23,116 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:09:23,116 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:23,118 INFO ]: Computing forward predicates... [2018-06-22 11:09:23,299 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:09:23,320 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:23,320 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:09:23,346 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:09:23,347 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:09:23,347 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:09:23,347 INFO ]: Start difference. First operand 61 states and 155 transitions. Second operand 13 states. [2018-06-22 11:09:23,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:23,637 INFO ]: Finished difference Result 93 states and 222 transitions. [2018-06-22 11:09:23,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:09:23,637 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 11:09:23,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:23,640 INFO ]: With dead ends: 93 [2018-06-22 11:09:23,640 INFO ]: Without dead ends: 93 [2018-06-22 11:09:23,641 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:09:23,641 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:09:23,670 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 49. [2018-06-22 11:09:23,670 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:09:23,672 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 114 transitions. [2018-06-22 11:09:23,672 INFO ]: Start accepts. Automaton has 49 states and 114 transitions. Word has length 21 [2018-06-22 11:09:23,672 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:23,672 INFO ]: Abstraction has 49 states and 114 transitions. [2018-06-22 11:09:23,672 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:09:23,672 INFO ]: Start isEmpty. Operand 49 states and 114 transitions. [2018-06-22 11:09:23,675 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:09:23,675 INFO ]: Found error trace [2018-06-22 11:09:23,675 INFO ]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:23,675 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:23,675 INFO ]: Analyzing trace with hash 583230729, now seen corresponding path program 1 times [2018-06-22 11:09:23,675 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:23,675 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:23,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:23,676 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:09:23,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:23,697 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:23,808 INFO ]: Checked inductivity of 33 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:09:23,808 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:23,808 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-06-22 11:09:23,823 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:09:23,855 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:23,857 INFO ]: Computing forward predicates... [2018-06-22 11:09:24,019 INFO ]: Checked inductivity of 33 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:09:24,039 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:24,039 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-06-22 11:09:24,040 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:09:24,040 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:09:24,040 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:09:24,040 INFO ]: Start difference. First operand 49 states and 114 transitions. Second operand 16 states. [2018-06-22 11:09:25,372 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:25,372 INFO ]: Finished difference Result 135 states and 375 transitions. [2018-06-22 11:09:25,373 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:09:25,373 INFO ]: Start accepts. Automaton has 16 states. Word has length 33 [2018-06-22 11:09:25,373 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:25,376 INFO ]: With dead ends: 135 [2018-06-22 11:09:25,376 INFO ]: Without dead ends: 135 [2018-06-22 11:09:25,376 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:09:25,377 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-22 11:09:25,402 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 95. [2018-06-22 11:09:25,402 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-22 11:09:25,405 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 258 transitions. [2018-06-22 11:09:25,405 INFO ]: Start accepts. Automaton has 95 states and 258 transitions. Word has length 33 [2018-06-22 11:09:25,405 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:25,405 INFO ]: Abstraction has 95 states and 258 transitions. [2018-06-22 11:09:25,405 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:09:25,405 INFO ]: Start isEmpty. Operand 95 states and 258 transitions. [2018-06-22 11:09:25,408 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:09:25,408 INFO ]: Found error trace [2018-06-22 11:09:25,408 INFO ]: trace histogram [6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:25,408 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:25,409 INFO ]: Analyzing trace with hash -1119020584, now seen corresponding path program 1 times [2018-06-22 11:09:25,409 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:25,409 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:25,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:25,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:25,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:25,424 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:25,565 INFO ]: Checked inductivity of 49 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 11:09:25,566 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:25,566 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:25,574 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:25,619 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:25,622 INFO ]: Computing forward predicates... [2018-06-22 11:09:25,937 INFO ]: Checked inductivity of 49 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:09:25,970 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:25,970 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-06-22 11:09:25,970 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:09:25,970 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:09:25,970 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:09:25,970 INFO ]: Start difference. First operand 95 states and 258 transitions. Second operand 8 states. [2018-06-22 11:09:26,281 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:26,281 INFO ]: Finished difference Result 89 states and 226 transitions. [2018-06-22 11:09:26,281 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:09:26,282 INFO ]: Start accepts. Automaton has 8 states. Word has length 37 [2018-06-22 11:09:26,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:26,283 INFO ]: With dead ends: 89 [2018-06-22 11:09:26,283 INFO ]: Without dead ends: 75 [2018-06-22 11:09:26,284 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:09:26,284 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:09:26,299 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-06-22 11:09:26,299 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 11:09:26,301 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 176 transitions. [2018-06-22 11:09:26,301 INFO ]: Start accepts. Automaton has 71 states and 176 transitions. Word has length 37 [2018-06-22 11:09:26,301 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:26,301 INFO ]: Abstraction has 71 states and 176 transitions. [2018-06-22 11:09:26,301 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:09:26,301 INFO ]: Start isEmpty. Operand 71 states and 176 transitions. [2018-06-22 11:09:26,304 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:09:26,304 INFO ]: Found error trace [2018-06-22 11:09:26,304 INFO ]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:26,304 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:26,304 INFO ]: Analyzing trace with hash 867216845, now seen corresponding path program 1 times [2018-06-22 11:09:26,304 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:26,304 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:26,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:26,305 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:26,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:26,363 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:26,575 INFO ]: Checked inductivity of 89 backedges. 3 proven. 49 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:09:26,575 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:26,575 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:26,583 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:26,640 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:26,644 INFO ]: Computing forward predicates... [2018-06-22 11:09:26,942 INFO ]: Checked inductivity of 89 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-22 11:09:26,965 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:26,965 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-06-22 11:09:26,965 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:09:26,965 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:09:26,965 INFO ]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:09:26,966 INFO ]: Start difference. First operand 71 states and 176 transitions. Second operand 21 states. [2018-06-22 11:09:29,992 WARN ]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-22 11:09:30,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:30,621 INFO ]: Finished difference Result 169 states and 451 transitions. [2018-06-22 11:09:30,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:09:30,621 INFO ]: Start accepts. Automaton has 21 states. Word has length 45 [2018-06-22 11:09:30,622 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:30,623 INFO ]: With dead ends: 169 [2018-06-22 11:09:30,623 INFO ]: Without dead ends: 118 [2018-06-22 11:09:30,624 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=223, Invalid=1757, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:09:30,624 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 11:09:30,658 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 96. [2018-06-22 11:09:30,658 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:09:30,660 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 240 transitions. [2018-06-22 11:09:30,660 INFO ]: Start accepts. Automaton has 96 states and 240 transitions. Word has length 45 [2018-06-22 11:09:30,660 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:30,660 INFO ]: Abstraction has 96 states and 240 transitions. [2018-06-22 11:09:30,660 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:09:30,660 INFO ]: Start isEmpty. Operand 96 states and 240 transitions. [2018-06-22 11:09:30,665 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:09:30,666 INFO ]: Found error trace [2018-06-22 11:09:30,666 INFO ]: trace histogram [5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:30,666 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:30,666 INFO ]: Analyzing trace with hash 1556912570, now seen corresponding path program 1 times [2018-06-22 11:09:30,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:30,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:30,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:30,670 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:30,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:30,685 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:30,802 INFO ]: Checked inductivity of 34 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:09:30,802 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:30,802 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:30,810 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:30,851 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:30,853 INFO ]: Computing forward predicates... [2018-06-22 11:09:30,902 INFO ]: Checked inductivity of 34 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:09:30,922 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:30,922 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-06-22 11:09:30,923 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:09:30,923 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:09:30,923 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:09:30,923 INFO ]: Start difference. First operand 96 states and 240 transitions. Second operand 8 states. [2018-06-22 11:09:31,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:31,080 INFO ]: Finished difference Result 73 states and 166 transitions. [2018-06-22 11:09:31,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:09:31,081 INFO ]: Start accepts. Automaton has 8 states. Word has length 33 [2018-06-22 11:09:31,081 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:31,082 INFO ]: With dead ends: 73 [2018-06-22 11:09:31,082 INFO ]: Without dead ends: 67 [2018-06-22 11:09:31,083 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:09:31,083 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 11:09:31,091 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-06-22 11:09:31,091 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 11:09:31,092 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 155 transitions. [2018-06-22 11:09:31,092 INFO ]: Start accepts. Automaton has 67 states and 155 transitions. Word has length 33 [2018-06-22 11:09:31,092 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:31,092 INFO ]: Abstraction has 67 states and 155 transitions. [2018-06-22 11:09:31,092 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:09:31,093 INFO ]: Start isEmpty. Operand 67 states and 155 transitions. [2018-06-22 11:09:31,094 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:09:31,094 INFO ]: Found error trace [2018-06-22 11:09:31,094 INFO ]: trace histogram [6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:31,094 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:31,095 INFO ]: Analyzing trace with hash 91503894, now seen corresponding path program 1 times [2018-06-22 11:09:31,095 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:31,095 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:31,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:31,095 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:31,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:31,108 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:31,259 INFO ]: Checked inductivity of 49 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:09:31,259 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:31,259 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:31,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:31,293 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:31,296 INFO ]: Computing forward predicates... [2018-06-22 11:09:31,369 INFO ]: Checked inductivity of 49 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:09:31,389 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:31,389 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2018-06-22 11:09:31,390 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:09:31,390 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:09:31,390 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:09:31,390 INFO ]: Start difference. First operand 67 states and 155 transitions. Second operand 14 states. [2018-06-22 11:09:31,798 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:31,798 INFO ]: Finished difference Result 110 states and 257 transitions. [2018-06-22 11:09:31,798 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:09:31,798 INFO ]: Start accepts. Automaton has 14 states. Word has length 37 [2018-06-22 11:09:31,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:31,799 INFO ]: With dead ends: 110 [2018-06-22 11:09:31,799 INFO ]: Without dead ends: 90 [2018-06-22 11:09:31,800 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:09:31,800 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 11:09:31,810 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 78. [2018-06-22 11:09:31,810 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 11:09:31,812 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 174 transitions. [2018-06-22 11:09:31,812 INFO ]: Start accepts. Automaton has 78 states and 174 transitions. Word has length 37 [2018-06-22 11:09:31,812 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:31,812 INFO ]: Abstraction has 78 states and 174 transitions. [2018-06-22 11:09:31,812 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:09:31,812 INFO ]: Start isEmpty. Operand 78 states and 174 transitions. [2018-06-22 11:09:31,814 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:09:31,814 INFO ]: Found error trace [2018-06-22 11:09:31,814 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:31,815 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:31,815 INFO ]: Analyzing trace with hash 1123958366, now seen corresponding path program 1 times [2018-06-22 11:09:31,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:31,815 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:31,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:31,815 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:31,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:31,827 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:31,945 INFO ]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:09:31,945 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:31,945 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:31,951 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:31,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:31,984 INFO ]: Computing forward predicates... [2018-06-22 11:09:32,046 INFO ]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:09:32,067 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:32,067 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2018-06-22 11:09:32,067 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:09:32,067 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:09:32,067 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:09:32,067 INFO ]: Start difference. First operand 78 states and 174 transitions. Second operand 10 states. [2018-06-22 11:09:32,174 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:32,174 INFO ]: Finished difference Result 96 states and 221 transitions. [2018-06-22 11:09:32,174 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:09:32,174 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-22 11:09:32,174 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:32,176 INFO ]: With dead ends: 96 [2018-06-22 11:09:32,176 INFO ]: Without dead ends: 96 [2018-06-22 11:09:32,176 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:09:32,176 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-22 11:09:32,186 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 84. [2018-06-22 11:09:32,186 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:09:32,187 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 185 transitions. [2018-06-22 11:09:32,187 INFO ]: Start accepts. Automaton has 84 states and 185 transitions. Word has length 25 [2018-06-22 11:09:32,188 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:32,188 INFO ]: Abstraction has 84 states and 185 transitions. [2018-06-22 11:09:32,188 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:09:32,188 INFO ]: Start isEmpty. Operand 84 states and 185 transitions. [2018-06-22 11:09:32,190 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:09:32,190 INFO ]: Found error trace [2018-06-22 11:09:32,190 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:32,190 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:32,190 INFO ]: Analyzing trace with hash -164925718, now seen corresponding path program 1 times [2018-06-22 11:09:32,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:32,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:32,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:32,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:32,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:32,199 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:32,547 INFO ]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:09:32,547 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:09:32,547 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:09:32,548 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:09:32,548 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:09:32,548 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:09:32,548 INFO ]: Start difference. First operand 84 states and 185 transitions. Second operand 6 states. [2018-06-22 11:09:33,186 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:33,186 INFO ]: Finished difference Result 117 states and 279 transitions. [2018-06-22 11:09:33,186 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:09:33,186 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 11:09:33,186 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:33,188 INFO ]: With dead ends: 117 [2018-06-22 11:09:33,188 INFO ]: Without dead ends: 117 [2018-06-22 11:09:33,188 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:09:33,189 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 11:09:33,201 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 108. [2018-06-22 11:09:33,201 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 11:09:33,203 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 250 transitions. [2018-06-22 11:09:33,203 INFO ]: Start accepts. Automaton has 108 states and 250 transitions. Word has length 25 [2018-06-22 11:09:33,203 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:33,203 INFO ]: Abstraction has 108 states and 250 transitions. [2018-06-22 11:09:33,203 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:09:33,203 INFO ]: Start isEmpty. Operand 108 states and 250 transitions. [2018-06-22 11:09:33,206 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:09:33,206 INFO ]: Found error trace [2018-06-22 11:09:33,206 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:33,208 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:33,208 INFO ]: Analyzing trace with hash 479516324, now seen corresponding path program 1 times [2018-06-22 11:09:33,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:33,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:33,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:33,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:33,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:33,218 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:33,593 INFO ]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:09:33,593 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:09:33,593 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:09:33,593 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:09:33,593 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:09:33,593 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:09:33,593 INFO ]: Start difference. First operand 108 states and 250 transitions. Second operand 6 states. [2018-06-22 11:09:33,879 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:33,879 INFO ]: Finished difference Result 113 states and 248 transitions. [2018-06-22 11:09:33,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:09:33,879 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 11:09:33,880 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:33,881 INFO ]: With dead ends: 113 [2018-06-22 11:09:33,881 INFO ]: Without dead ends: 93 [2018-06-22 11:09:33,881 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:09:33,881 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:09:33,892 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 83. [2018-06-22 11:09:33,892 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 11:09:33,894 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 188 transitions. [2018-06-22 11:09:33,894 INFO ]: Start accepts. Automaton has 83 states and 188 transitions. Word has length 25 [2018-06-22 11:09:33,894 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:33,894 INFO ]: Abstraction has 83 states and 188 transitions. [2018-06-22 11:09:33,894 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:09:33,895 INFO ]: Start isEmpty. Operand 83 states and 188 transitions. [2018-06-22 11:09:33,896 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:09:33,897 INFO ]: Found error trace [2018-06-22 11:09:33,897 INFO ]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:33,898 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:33,898 INFO ]: Analyzing trace with hash -1619731958, now seen corresponding path program 1 times [2018-06-22 11:09:33,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:33,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:33,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:33,898 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:33,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:33,909 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:34,012 INFO ]: Checked inductivity of 41 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:09:34,012 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:34,012 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:34,018 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:34,060 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:34,063 INFO ]: Computing forward predicates... [2018-06-22 11:09:34,520 INFO ]: Checked inductivity of 41 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:09:34,542 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:34,564 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 11:09:34,564 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:09:34,565 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:09:34,565 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:09:34,565 INFO ]: Start difference. First operand 83 states and 188 transitions. Second operand 16 states. [2018-06-22 11:09:35,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:35,148 INFO ]: Finished difference Result 129 states and 259 transitions. [2018-06-22 11:09:35,148 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:09:35,148 INFO ]: Start accepts. Automaton has 16 states. Word has length 37 [2018-06-22 11:09:35,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:35,151 INFO ]: With dead ends: 129 [2018-06-22 11:09:35,151 INFO ]: Without dead ends: 89 [2018-06-22 11:09:35,151 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:09:35,151 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-22 11:09:35,160 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-06-22 11:09:35,160 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 11:09:35,161 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 157 transitions. [2018-06-22 11:09:35,161 INFO ]: Start accepts. Automaton has 78 states and 157 transitions. Word has length 37 [2018-06-22 11:09:35,162 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:35,162 INFO ]: Abstraction has 78 states and 157 transitions. [2018-06-22 11:09:35,162 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:09:35,162 INFO ]: Start isEmpty. Operand 78 states and 157 transitions. [2018-06-22 11:09:35,163 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:09:35,164 INFO ]: Found error trace [2018-06-22 11:09:35,164 INFO ]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:35,164 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:35,164 INFO ]: Analyzing trace with hash -321081496, now seen corresponding path program 2 times [2018-06-22 11:09:35,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:35,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:35,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:35,164 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:35,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:35,174 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:35,392 INFO ]: Checked inductivity of 29 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:09:35,393 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:35,393 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:35,413 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:09:35,445 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:09:35,445 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:35,447 INFO ]: Computing forward predicates... [2018-06-22 11:09:36,038 INFO ]: Checked inductivity of 29 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:09:36,059 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:36,059 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 16 [2018-06-22 11:09:36,059 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:09:36,060 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:09:36,060 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:09:36,060 INFO ]: Start difference. First operand 78 states and 157 transitions. Second operand 16 states. [2018-06-22 11:09:36,584 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:36,584 INFO ]: Finished difference Result 102 states and 198 transitions. [2018-06-22 11:09:36,584 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:09:36,585 INFO ]: Start accepts. Automaton has 16 states. Word has length 33 [2018-06-22 11:09:36,585 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:36,586 INFO ]: With dead ends: 102 [2018-06-22 11:09:36,586 INFO ]: Without dead ends: 78 [2018-06-22 11:09:36,586 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:09:36,586 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 11:09:36,592 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 61. [2018-06-22 11:09:36,592 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:09:36,593 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 118 transitions. [2018-06-22 11:09:36,593 INFO ]: Start accepts. Automaton has 61 states and 118 transitions. Word has length 33 [2018-06-22 11:09:36,593 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:36,593 INFO ]: Abstraction has 61 states and 118 transitions. [2018-06-22 11:09:36,593 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:09:36,593 INFO ]: Start isEmpty. Operand 61 states and 118 transitions. [2018-06-22 11:09:36,595 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:09:36,595 INFO ]: Found error trace [2018-06-22 11:09:36,595 INFO ]: trace histogram [9, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:36,595 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:36,595 INFO ]: Analyzing trace with hash 1523060244, now seen corresponding path program 2 times [2018-06-22 11:09:36,595 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:36,595 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:36,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:36,596 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:09:36,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:36,612 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:36,772 INFO ]: Checked inductivity of 117 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-22 11:09:36,772 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:36,772 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:36,785 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:09:36,822 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:09:36,822 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:36,825 INFO ]: Computing forward predicates... [2018-06-22 11:09:37,109 INFO ]: Checked inductivity of 117 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:09:37,143 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:37,143 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 23 [2018-06-22 11:09:37,143 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:09:37,143 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:09:37,143 INFO ]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:09:37,143 INFO ]: Start difference. First operand 61 states and 118 transitions. Second operand 23 states. [2018-06-22 11:09:39,275 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:39,275 INFO ]: Finished difference Result 164 states and 369 transitions. [2018-06-22 11:09:39,276 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:09:39,276 INFO ]: Start accepts. Automaton has 23 states. Word has length 49 [2018-06-22 11:09:39,276 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:39,277 INFO ]: With dead ends: 164 [2018-06-22 11:09:39,277 INFO ]: Without dead ends: 164 [2018-06-22 11:09:39,278 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=241, Invalid=1921, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:09:39,278 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-22 11:09:39,290 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 138. [2018-06-22 11:09:39,290 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 11:09:39,293 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 318 transitions. [2018-06-22 11:09:39,293 INFO ]: Start accepts. Automaton has 138 states and 318 transitions. Word has length 49 [2018-06-22 11:09:39,293 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:39,293 INFO ]: Abstraction has 138 states and 318 transitions. [2018-06-22 11:09:39,293 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:09:39,293 INFO ]: Start isEmpty. Operand 138 states and 318 transitions. [2018-06-22 11:09:39,296 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:09:39,296 INFO ]: Found error trace [2018-06-22 11:09:39,296 INFO ]: trace histogram [10, 5, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:39,296 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:39,297 INFO ]: Analyzing trace with hash -1834752608, now seen corresponding path program 2 times [2018-06-22 11:09:39,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:39,299 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:39,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:39,300 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:09:39,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:39,316 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:40,070 INFO ]: Checked inductivity of 149 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-06-22 11:09:40,070 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:40,070 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:40,076 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:09:40,113 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:09:40,113 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:40,115 INFO ]: Computing forward predicates... [2018-06-22 11:09:40,442 INFO ]: Checked inductivity of 149 backedges. 4 proven. 83 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-22 11:09:40,462 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:40,462 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-06-22 11:09:40,463 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:09:40,463 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:09:40,463 INFO ]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:09:40,463 INFO ]: Start difference. First operand 138 states and 318 transitions. Second operand 23 states. [2018-06-22 11:09:42,905 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:42,905 INFO ]: Finished difference Result 336 states and 899 transitions. [2018-06-22 11:09:42,906 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:09:42,906 INFO ]: Start accepts. Automaton has 23 states. Word has length 53 [2018-06-22 11:09:42,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:42,911 INFO ]: With dead ends: 336 [2018-06-22 11:09:42,911 INFO ]: Without dead ends: 310 [2018-06-22 11:09:42,912 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=211, Invalid=1595, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:09:42,912 INFO ]: Start minimizeSevpa. Operand 310 states. [2018-06-22 11:09:42,941 INFO ]: Finished minimizeSevpa. Reduced states from 310 to 272. [2018-06-22 11:09:42,941 INFO ]: Start removeUnreachable. Operand 272 states. [2018-06-22 11:09:42,945 INFO ]: Finished removeUnreachable. Reduced from 272 states to 272 states and 743 transitions. [2018-06-22 11:09:42,945 INFO ]: Start accepts. Automaton has 272 states and 743 transitions. Word has length 53 [2018-06-22 11:09:42,945 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:42,945 INFO ]: Abstraction has 272 states and 743 transitions. [2018-06-22 11:09:42,945 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:09:42,945 INFO ]: Start isEmpty. Operand 272 states and 743 transitions. [2018-06-22 11:09:42,951 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:09:42,951 INFO ]: Found error trace [2018-06-22 11:09:42,951 INFO ]: trace histogram [9, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:42,951 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:42,951 INFO ]: Analyzing trace with hash -143015707, now seen corresponding path program 3 times [2018-06-22 11:09:42,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:42,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:42,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:42,952 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:09:42,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:42,966 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:43,110 INFO ]: Checked inductivity of 117 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-22 11:09:43,110 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:43,110 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:43,116 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:09:43,142 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:09:43,142 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:43,144 INFO ]: Computing forward predicates... [2018-06-22 11:09:43,239 INFO ]: Checked inductivity of 117 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-22 11:09:43,260 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:43,260 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2018-06-22 11:09:43,260 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:09:43,260 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:09:43,260 INFO ]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:09:43,260 INFO ]: Start difference. First operand 272 states and 743 transitions. Second operand 17 states. [2018-06-22 11:09:43,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:43,638 INFO ]: Finished difference Result 292 states and 783 transitions. [2018-06-22 11:09:43,638 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:09:43,638 INFO ]: Start accepts. Automaton has 17 states. Word has length 49 [2018-06-22 11:09:43,638 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:43,642 INFO ]: With dead ends: 292 [2018-06-22 11:09:43,642 INFO ]: Without dead ends: 292 [2018-06-22 11:09:43,643 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:09:43,643 INFO ]: Start minimizeSevpa. Operand 292 states. [2018-06-22 11:09:43,666 INFO ]: Finished minimizeSevpa. Reduced states from 292 to 266. [2018-06-22 11:09:43,666 INFO ]: Start removeUnreachable. Operand 266 states. [2018-06-22 11:09:43,670 INFO ]: Finished removeUnreachable. Reduced from 266 states to 266 states and 725 transitions. [2018-06-22 11:09:43,670 INFO ]: Start accepts. Automaton has 266 states and 725 transitions. Word has length 49 [2018-06-22 11:09:43,670 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:43,670 INFO ]: Abstraction has 266 states and 725 transitions. [2018-06-22 11:09:43,670 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:09:43,670 INFO ]: Start isEmpty. Operand 266 states and 725 transitions. [2018-06-22 11:09:43,677 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:09:43,677 INFO ]: Found error trace [2018-06-22 11:09:43,678 INFO ]: trace histogram [9, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:43,678 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:43,678 INFO ]: Analyzing trace with hash 1721587454, now seen corresponding path program 4 times [2018-06-22 11:09:43,678 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:43,678 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:43,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:43,678 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:09:43,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:43,697 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:43,832 INFO ]: Checked inductivity of 118 backedges. 31 proven. 4 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-22 11:09:43,832 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:43,832 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:43,838 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:09:43,873 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:09:43,873 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:43,875 INFO ]: Computing forward predicates... [2018-06-22 11:09:44,071 INFO ]: Checked inductivity of 118 backedges. 4 proven. 68 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 11:09:44,090 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:44,090 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2018-06-22 11:09:44,090 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:09:44,090 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:09:44,090 INFO ]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:09:44,091 INFO ]: Start difference. First operand 266 states and 725 transitions. Second operand 20 states. [2018-06-22 11:09:45,130 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:45,130 INFO ]: Finished difference Result 495 states and 1462 transitions. [2018-06-22 11:09:45,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:09:45,137 INFO ]: Start accepts. Automaton has 20 states. Word has length 49 [2018-06-22 11:09:45,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:45,144 INFO ]: With dead ends: 495 [2018-06-22 11:09:45,144 INFO ]: Without dead ends: 469 [2018-06-22 11:09:45,144 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=1375, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:09:45,145 INFO ]: Start minimizeSevpa. Operand 469 states. [2018-06-22 11:09:45,186 INFO ]: Finished minimizeSevpa. Reduced states from 469 to 407. [2018-06-22 11:09:45,186 INFO ]: Start removeUnreachable. Operand 407 states. [2018-06-22 11:09:45,193 INFO ]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1235 transitions. [2018-06-22 11:09:45,193 INFO ]: Start accepts. Automaton has 407 states and 1235 transitions. Word has length 49 [2018-06-22 11:09:45,194 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:45,194 INFO ]: Abstraction has 407 states and 1235 transitions. [2018-06-22 11:09:45,194 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:09:45,194 INFO ]: Start isEmpty. Operand 407 states and 1235 transitions. [2018-06-22 11:09:45,205 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:09:45,205 INFO ]: Found error trace [2018-06-22 11:09:45,205 INFO ]: trace histogram [14, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:45,205 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:45,205 INFO ]: Analyzing trace with hash -1640123898, now seen corresponding path program 2 times [2018-06-22 11:09:45,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:45,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:45,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:45,206 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:09:45,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:45,227 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:45,717 INFO ]: Checked inductivity of 297 backedges. 89 proven. 8 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-06-22 11:09:45,717 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:45,717 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:45,723 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:09:45,816 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:09:45,816 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:45,820 INFO ]: Computing forward predicates... [2018-06-22 11:09:46,122 INFO ]: Checked inductivity of 297 backedges. 105 proven. 6 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-06-22 11:09:46,146 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:46,146 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-22 11:09:46,146 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:09:46,146 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:09:46,146 INFO ]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:09:46,146 INFO ]: Start difference. First operand 407 states and 1235 transitions. Second operand 16 states. [2018-06-22 11:09:46,552 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:46,552 INFO ]: Finished difference Result 450 states and 1263 transitions. [2018-06-22 11:09:46,552 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:09:46,552 INFO ]: Start accepts. Automaton has 16 states. Word has length 73 [2018-06-22 11:09:46,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:46,556 INFO ]: With dead ends: 450 [2018-06-22 11:09:46,556 INFO ]: Without dead ends: 325 [2018-06-22 11:09:46,557 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:09:46,557 INFO ]: Start minimizeSevpa. Operand 325 states. [2018-06-22 11:09:46,582 INFO ]: Finished minimizeSevpa. Reduced states from 325 to 307. [2018-06-22 11:09:46,582 INFO ]: Start removeUnreachable. Operand 307 states. [2018-06-22 11:09:46,586 INFO ]: Finished removeUnreachable. Reduced from 307 states to 307 states and 810 transitions. [2018-06-22 11:09:46,586 INFO ]: Start accepts. Automaton has 307 states and 810 transitions. Word has length 73 [2018-06-22 11:09:46,586 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:46,586 INFO ]: Abstraction has 307 states and 810 transitions. [2018-06-22 11:09:46,586 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:09:46,586 INFO ]: Start isEmpty. Operand 307 states and 810 transitions. [2018-06-22 11:09:46,591 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:09:46,591 INFO ]: Found error trace [2018-06-22 11:09:46,591 INFO ]: trace histogram [14, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:46,592 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:46,592 INFO ]: Analyzing trace with hash 1489585124, now seen corresponding path program 1 times [2018-06-22 11:09:46,592 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:46,592 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:46,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:46,592 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:09:46,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:46,613 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:46,830 INFO ]: Checked inductivity of 300 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-06-22 11:09:46,830 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:46,830 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:46,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:46,888 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:46,891 INFO ]: Computing forward predicates... [2018-06-22 11:09:47,070 INFO ]: Checked inductivity of 300 backedges. 6 proven. 143 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-06-22 11:09:47,095 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:47,095 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 19 [2018-06-22 11:09:47,095 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:09:47,095 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:09:47,095 INFO ]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:09:47,095 INFO ]: Start difference. First operand 307 states and 810 transitions. Second operand 19 states. [2018-06-22 11:09:47,749 WARN ]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-22 11:09:48,309 WARN ]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 11:09:49,607 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:49,607 INFO ]: Finished difference Result 488 states and 1475 transitions. [2018-06-22 11:09:49,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:09:49,608 INFO ]: Start accepts. Automaton has 19 states. Word has length 73 [2018-06-22 11:09:49,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:49,612 INFO ]: With dead ends: 488 [2018-06-22 11:09:49,612 INFO ]: Without dead ends: 361 [2018-06-22 11:09:49,612 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:09:49,613 INFO ]: Start minimizeSevpa. Operand 361 states. [2018-06-22 11:09:49,641 INFO ]: Finished minimizeSevpa. Reduced states from 361 to 355. [2018-06-22 11:09:49,658 INFO ]: Start removeUnreachable. Operand 355 states. [2018-06-22 11:09:49,662 INFO ]: Finished removeUnreachable. Reduced from 355 states to 355 states and 984 transitions. [2018-06-22 11:09:49,662 INFO ]: Start accepts. Automaton has 355 states and 984 transitions. Word has length 73 [2018-06-22 11:09:49,663 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:49,663 INFO ]: Abstraction has 355 states and 984 transitions. [2018-06-22 11:09:49,663 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:09:49,665 INFO ]: Start isEmpty. Operand 355 states and 984 transitions. [2018-06-22 11:09:49,670 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:09:49,670 INFO ]: Found error trace [2018-06-22 11:09:49,670 INFO ]: trace histogram [13, 6, 6, 6, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:49,671 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:49,671 INFO ]: Analyzing trace with hash -59595830, now seen corresponding path program 3 times [2018-06-22 11:09:49,671 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:49,671 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:49,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:49,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:49,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:49,693 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:49,857 INFO ]: Checked inductivity of 263 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-22 11:09:49,857 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:09:49,857 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:09:49,857 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:09:49,857 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:09:49,857 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:09:49,858 INFO ]: Start difference. First operand 355 states and 984 transitions. Second operand 5 states. [2018-06-22 11:09:50,012 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:50,012 INFO ]: Finished difference Result 147 states and 280 transitions. [2018-06-22 11:09:50,014 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:09:50,014 INFO ]: Start accepts. Automaton has 5 states. Word has length 69 [2018-06-22 11:09:50,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:50,015 INFO ]: With dead ends: 147 [2018-06-22 11:09:50,015 INFO ]: Without dead ends: 127 [2018-06-22 11:09:50,015 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:09:50,015 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-22 11:09:50,023 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-06-22 11:09:50,024 INFO ]: Start removeUnreachable. Operand 123 states. [2018-06-22 11:09:50,025 INFO ]: Finished removeUnreachable. Reduced from 123 states to 123 states and 240 transitions. [2018-06-22 11:09:50,025 INFO ]: Start accepts. Automaton has 123 states and 240 transitions. Word has length 69 [2018-06-22 11:09:50,025 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:50,025 INFO ]: Abstraction has 123 states and 240 transitions. [2018-06-22 11:09:50,025 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:09:50,025 INFO ]: Start isEmpty. Operand 123 states and 240 transitions. [2018-06-22 11:09:50,027 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:09:50,027 INFO ]: Found error trace [2018-06-22 11:09:50,027 INFO ]: trace histogram [13, 9, 9, 9, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:50,027 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:50,027 INFO ]: Analyzing trace with hash 1457557414, now seen corresponding path program 1 times [2018-06-22 11:09:50,027 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:50,027 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:50,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:50,027 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:09:50,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:50,049 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:50,305 INFO ]: Checked inductivity of 281 backedges. 64 proven. 105 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-06-22 11:09:50,305 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:50,305 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:50,313 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:50,378 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:50,384 INFO ]: Computing forward predicates... [2018-06-22 11:09:50,777 INFO ]: Checked inductivity of 281 backedges. 10 proven. 149 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-06-22 11:09:50,797 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:50,797 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2018-06-22 11:09:50,797 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:09:50,797 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:09:50,797 INFO ]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:09:50,797 INFO ]: Start difference. First operand 123 states and 240 transitions. Second operand 32 states. [2018-06-22 11:09:53,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:53,480 INFO ]: Finished difference Result 260 states and 637 transitions. [2018-06-22 11:09:53,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:09:53,480 INFO ]: Start accepts. Automaton has 32 states. Word has length 69 [2018-06-22 11:09:53,480 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:53,481 INFO ]: With dead ends: 260 [2018-06-22 11:09:53,481 INFO ]: Without dead ends: 234 [2018-06-22 11:09:53,482 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=424, Invalid=2998, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 11:09:53,482 INFO ]: Start minimizeSevpa. Operand 234 states. [2018-06-22 11:09:53,498 INFO ]: Finished minimizeSevpa. Reduced states from 234 to 230. [2018-06-22 11:09:53,498 INFO ]: Start removeUnreachable. Operand 230 states. [2018-06-22 11:09:53,500 INFO ]: Finished removeUnreachable. Reduced from 230 states to 230 states and 540 transitions. [2018-06-22 11:09:53,500 INFO ]: Start accepts. Automaton has 230 states and 540 transitions. Word has length 69 [2018-06-22 11:09:53,500 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:53,500 INFO ]: Abstraction has 230 states and 540 transitions. [2018-06-22 11:09:53,500 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:09:53,500 INFO ]: Start isEmpty. Operand 230 states and 540 transitions. [2018-06-22 11:09:53,503 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:09:53,503 INFO ]: Found error trace [2018-06-22 11:09:53,503 INFO ]: trace histogram [14, 9, 9, 9, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:53,503 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:53,503 INFO ]: Analyzing trace with hash -680323473, now seen corresponding path program 5 times [2018-06-22 11:09:53,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:53,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:53,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:53,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:53,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:53,523 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:54,086 INFO ]: Checked inductivity of 320 backedges. 52 proven. 116 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-06-22 11:09:54,086 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:54,086 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:54,093 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:09:54,119 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 11:09:54,119 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:54,122 INFO ]: Computing forward predicates... [2018-06-22 11:09:54,295 INFO ]: Checked inductivity of 320 backedges. 199 proven. 7 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-06-22 11:09:54,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:54,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 22 [2018-06-22 11:09:54,318 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:09:54,318 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:09:54,318 INFO ]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:09:54,318 INFO ]: Start difference. First operand 230 states and 540 transitions. Second operand 22 states. [2018-06-22 11:09:55,091 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:55,092 INFO ]: Finished difference Result 204 states and 450 transitions. [2018-06-22 11:09:55,115 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:09:55,115 INFO ]: Start accepts. Automaton has 22 states. Word has length 73 [2018-06-22 11:09:55,115 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:55,116 INFO ]: With dead ends: 204 [2018-06-22 11:09:55,116 INFO ]: Without dead ends: 198 [2018-06-22 11:09:55,116 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:09:55,117 INFO ]: Start minimizeSevpa. Operand 198 states. [2018-06-22 11:09:55,129 INFO ]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-06-22 11:09:55,129 INFO ]: Start removeUnreachable. Operand 196 states. [2018-06-22 11:09:55,130 INFO ]: Finished removeUnreachable. Reduced from 196 states to 196 states and 411 transitions. [2018-06-22 11:09:55,131 INFO ]: Start accepts. Automaton has 196 states and 411 transitions. Word has length 73 [2018-06-22 11:09:55,131 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:55,131 INFO ]: Abstraction has 196 states and 411 transitions. [2018-06-22 11:09:55,131 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:09:55,131 INFO ]: Start isEmpty. Operand 196 states and 411 transitions. [2018-06-22 11:09:55,133 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:09:55,133 INFO ]: Found error trace [2018-06-22 11:09:55,133 INFO ]: trace histogram [12, 8, 8, 8, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:55,133 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:55,133 INFO ]: Analyzing trace with hash 1011680132, now seen corresponding path program 2 times [2018-06-22 11:09:55,133 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:55,133 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:55,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:55,134 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:09:55,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:55,172 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:55,545 INFO ]: Checked inductivity of 237 backedges. 68 proven. 11 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-06-22 11:09:55,545 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:55,545 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:55,550 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:09:55,599 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:09:55,599 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:55,602 INFO ]: Computing forward predicates... [2018-06-22 11:09:55,747 INFO ]: Checked inductivity of 237 backedges. 38 proven. 77 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-06-22 11:09:55,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:55,769 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 21 [2018-06-22 11:09:55,769 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:09:55,769 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:09:55,769 INFO ]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:09:55,769 INFO ]: Start difference. First operand 196 states and 411 transitions. Second operand 21 states. [2018-06-22 11:09:56,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:56,146 INFO ]: Finished difference Result 248 states and 507 transitions. [2018-06-22 11:09:56,146 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:09:56,146 INFO ]: Start accepts. Automaton has 21 states. Word has length 65 [2018-06-22 11:09:56,146 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:56,147 INFO ]: With dead ends: 248 [2018-06-22 11:09:56,147 INFO ]: Without dead ends: 248 [2018-06-22 11:09:56,148 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:09:56,148 INFO ]: Start minimizeSevpa. Operand 248 states. [2018-06-22 11:09:56,161 INFO ]: Finished minimizeSevpa. Reduced states from 248 to 208. [2018-06-22 11:09:56,161 INFO ]: Start removeUnreachable. Operand 208 states. [2018-06-22 11:09:56,163 INFO ]: Finished removeUnreachable. Reduced from 208 states to 208 states and 441 transitions. [2018-06-22 11:09:56,163 INFO ]: Start accepts. Automaton has 208 states and 441 transitions. Word has length 65 [2018-06-22 11:09:56,163 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:56,163 INFO ]: Abstraction has 208 states and 441 transitions. [2018-06-22 11:09:56,163 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:09:56,163 INFO ]: Start isEmpty. Operand 208 states and 441 transitions. [2018-06-22 11:09:56,165 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:09:56,165 INFO ]: Found error trace [2018-06-22 11:09:56,165 INFO ]: trace histogram [8, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:56,165 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:56,166 INFO ]: Analyzing trace with hash -241021514, now seen corresponding path program 1 times [2018-06-22 11:09:56,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:56,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:56,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:56,166 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:09:56,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:56,181 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:56,516 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-22 11:09:57,014 INFO ]: Checked inductivity of 99 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 11:09:57,014 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:57,014 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:57,020 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:57,054 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:57,057 INFO ]: Computing forward predicates... [2018-06-22 11:09:57,233 INFO ]: Checked inductivity of 99 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 11:09:57,265 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:57,265 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2018-06-22 11:09:57,265 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:09:57,265 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:09:57,265 INFO ]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:09:57,265 INFO ]: Start difference. First operand 208 states and 441 transitions. Second operand 19 states. [2018-06-22 11:09:57,625 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:57,625 INFO ]: Finished difference Result 230 states and 475 transitions. [2018-06-22 11:09:57,625 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:09:57,625 INFO ]: Start accepts. Automaton has 19 states. Word has length 49 [2018-06-22 11:09:57,626 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:57,627 INFO ]: With dead ends: 230 [2018-06-22 11:09:57,627 INFO ]: Without dead ends: 230 [2018-06-22 11:09:57,627 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:09:57,627 INFO ]: Start minimizeSevpa. Operand 230 states. [2018-06-22 11:09:57,641 INFO ]: Finished minimizeSevpa. Reduced states from 230 to 210. [2018-06-22 11:09:57,641 INFO ]: Start removeUnreachable. Operand 210 states. [2018-06-22 11:09:57,642 INFO ]: Finished removeUnreachable. Reduced from 210 states to 210 states and 443 transitions. [2018-06-22 11:09:57,643 INFO ]: Start accepts. Automaton has 210 states and 443 transitions. Word has length 49 [2018-06-22 11:09:57,643 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:57,643 INFO ]: Abstraction has 210 states and 443 transitions. [2018-06-22 11:09:57,643 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:09:57,643 INFO ]: Start isEmpty. Operand 210 states and 443 transitions. [2018-06-22 11:09:57,645 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:09:57,645 INFO ]: Found error trace [2018-06-22 11:09:57,645 INFO ]: trace histogram [15, 10, 10, 10, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:57,645 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:57,645 INFO ]: Analyzing trace with hash -1054749486, now seen corresponding path program 2 times [2018-06-22 11:09:57,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:57,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:57,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:57,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:09:57,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:57,668 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:58,008 INFO ]: Checked inductivity of 380 backedges. 88 proven. 14 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-06-22 11:09:58,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:58,008 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:58,014 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:09:58,083 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:09:58,083 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:58,088 INFO ]: Computing forward predicates... [2018-06-22 11:09:58,343 INFO ]: Checked inductivity of 380 backedges. 90 proven. 18 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-06-22 11:09:58,365 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:09:58,365 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2018-06-22 11:09:58,366 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:09:58,366 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:09:58,366 INFO ]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:09:58,366 INFO ]: Start difference. First operand 210 states and 443 transitions. Second operand 24 states. [2018-06-22 11:09:59,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:09:59,038 INFO ]: Finished difference Result 258 states and 523 transitions. [2018-06-22 11:09:59,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:09:59,038 INFO ]: Start accepts. Automaton has 24 states. Word has length 81 [2018-06-22 11:09:59,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:09:59,039 INFO ]: With dead ends: 258 [2018-06-22 11:09:59,039 INFO ]: Without dead ends: 258 [2018-06-22 11:09:59,040 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:09:59,040 INFO ]: Start minimizeSevpa. Operand 258 states. [2018-06-22 11:09:59,053 INFO ]: Finished minimizeSevpa. Reduced states from 258 to 228. [2018-06-22 11:09:59,053 INFO ]: Start removeUnreachable. Operand 228 states. [2018-06-22 11:09:59,055 INFO ]: Finished removeUnreachable. Reduced from 228 states to 228 states and 488 transitions. [2018-06-22 11:09:59,056 INFO ]: Start accepts. Automaton has 228 states and 488 transitions. Word has length 81 [2018-06-22 11:09:59,056 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:09:59,056 INFO ]: Abstraction has 228 states and 488 transitions. [2018-06-22 11:09:59,056 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:09:59,056 INFO ]: Start isEmpty. Operand 228 states and 488 transitions. [2018-06-22 11:09:59,058 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:09:59,058 INFO ]: Found error trace [2018-06-22 11:09:59,059 INFO ]: trace histogram [15, 10, 10, 10, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:09:59,059 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:09:59,059 INFO ]: Analyzing trace with hash 1759156504, now seen corresponding path program 3 times [2018-06-22 11:09:59,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:09:59,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:09:59,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:59,059 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:09:59,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:09:59,082 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:59,536 INFO ]: Checked inductivity of 384 backedges. 100 proven. 10 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-06-22 11:09:59,536 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:09:59,536 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:09:59,541 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:09:59,753 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-06-22 11:09:59,753 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:09:59,758 INFO ]: Computing forward predicates... [2018-06-22 11:09:59,988 INFO ]: Checked inductivity of 384 backedges. 100 proven. 10 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-06-22 11:10:00,046 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:10:00,046 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-22 11:10:00,046 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:10:00,046 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:10:00,047 INFO ]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:10:00,047 INFO ]: Start difference. First operand 228 states and 488 transitions. Second operand 20 states. [2018-06-22 11:10:00,537 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-22 11:10:01,328 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:10:01,328 INFO ]: Finished difference Result 246 states and 503 transitions. [2018-06-22 11:10:01,329 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:10:01,329 INFO ]: Start accepts. Automaton has 20 states. Word has length 81 [2018-06-22 11:10:01,329 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:10:01,331 INFO ]: With dead ends: 246 [2018-06-22 11:10:01,331 INFO ]: Without dead ends: 244 [2018-06-22 11:10:01,331 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:10:01,332 INFO ]: Start minimizeSevpa. Operand 244 states. [2018-06-22 11:10:01,345 INFO ]: Finished minimizeSevpa. Reduced states from 244 to 224. [2018-06-22 11:10:01,345 INFO ]: Start removeUnreachable. Operand 224 states. [2018-06-22 11:10:01,347 INFO ]: Finished removeUnreachable. Reduced from 224 states to 224 states and 478 transitions. [2018-06-22 11:10:01,347 INFO ]: Start accepts. Automaton has 224 states and 478 transitions. Word has length 81 [2018-06-22 11:10:01,347 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:10:01,347 INFO ]: Abstraction has 224 states and 478 transitions. [2018-06-22 11:10:01,347 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:10:01,347 INFO ]: Start isEmpty. Operand 224 states and 478 transitions. [2018-06-22 11:10:01,349 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:10:01,349 INFO ]: Found error trace [2018-06-22 11:10:01,350 INFO ]: trace histogram [14, 9, 9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:10:01,350 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:10:01,350 INFO ]: Analyzing trace with hash -305994250, now seen corresponding path program 1 times [2018-06-22 11:10:01,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:10:01,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:10:01,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:10:01,350 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:10:01,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:10:01,372 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:10:01,600 INFO ]: Checked inductivity of 327 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2018-06-22 11:10:01,600 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:10:01,600 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:10:01,606 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:10:01,661 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:10:01,664 INFO ]: Computing forward predicates... [2018-06-22 11:10:01,706 INFO ]: Checked inductivity of 327 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-06-22 11:10:01,740 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:10:01,740 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2018-06-22 11:10:01,740 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:10:01,740 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:10:01,740 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:10:01,740 INFO ]: Start difference. First operand 224 states and 478 transitions. Second operand 11 states. [2018-06-22 11:10:02,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:10:02,052 INFO ]: Finished difference Result 232 states and 488 transitions. [2018-06-22 11:10:02,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:10:02,053 INFO ]: Start accepts. Automaton has 11 states. Word has length 77 [2018-06-22 11:10:02,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:10:02,054 INFO ]: With dead ends: 232 [2018-06-22 11:10:02,054 INFO ]: Without dead ends: 222 [2018-06-22 11:10:02,055 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:10:02,055 INFO ]: Start minimizeSevpa. Operand 222 states. [2018-06-22 11:10:02,065 INFO ]: Finished minimizeSevpa. Reduced states from 222 to 208. [2018-06-22 11:10:02,065 INFO ]: Start removeUnreachable. Operand 208 states. [2018-06-22 11:10:02,067 INFO ]: Finished removeUnreachable. Reduced from 208 states to 208 states and 424 transitions. [2018-06-22 11:10:02,067 INFO ]: Start accepts. Automaton has 208 states and 424 transitions. Word has length 77 [2018-06-22 11:10:02,068 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:10:02,068 INFO ]: Abstraction has 208 states and 424 transitions. [2018-06-22 11:10:02,068 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:10:02,068 INFO ]: Start isEmpty. Operand 208 states and 424 transitions. [2018-06-22 11:10:02,072 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:10:02,072 INFO ]: Found error trace [2018-06-22 11:10:02,072 INFO ]: trace histogram [10, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:10:02,072 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:10:02,072 INFO ]: Analyzing trace with hash 1305141602, now seen corresponding path program 3 times [2018-06-22 11:10:02,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:10:02,072 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:10:02,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:10:02,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:10:02,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:10:02,089 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:10:02,191 INFO ]: Checked inductivity of 165 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-22 11:10:02,191 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:10:02,191 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:10:02,197 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:10:02,242 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 11:10:02,242 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:10:02,245 INFO ]: Computing forward predicates... [2018-06-22 11:10:02,302 INFO ]: Checked inductivity of 165 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-22 11:10:02,322 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:10:02,322 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-06-22 11:10:02,323 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:10:02,323 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:10:02,323 INFO ]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:10:02,323 INFO ]: Start difference. First operand 208 states and 424 transitions. Second operand 16 states. [2018-06-22 11:10:02,726 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:10:02,726 INFO ]: Finished difference Result 224 states and 449 transitions. [2018-06-22 11:10:02,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:10:02,726 INFO ]: Start accepts. Automaton has 16 states. Word has length 61 [2018-06-22 11:10:02,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:10:02,727 INFO ]: With dead ends: 224 [2018-06-22 11:10:02,727 INFO ]: Without dead ends: 215 [2018-06-22 11:10:02,728 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:10:02,728 INFO ]: Start minimizeSevpa. Operand 215 states. [2018-06-22 11:10:02,738 INFO ]: Finished minimizeSevpa. Reduced states from 215 to 197. [2018-06-22 11:10:02,738 INFO ]: Start removeUnreachable. Operand 197 states. [2018-06-22 11:10:02,739 INFO ]: Finished removeUnreachable. Reduced from 197 states to 197 states and 407 transitions. [2018-06-22 11:10:02,739 INFO ]: Start accepts. Automaton has 197 states and 407 transitions. Word has length 61 [2018-06-22 11:10:02,740 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:10:02,740 INFO ]: Abstraction has 197 states and 407 transitions. [2018-06-22 11:10:02,740 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:10:02,740 INFO ]: Start isEmpty. Operand 197 states and 407 transitions. [2018-06-22 11:10:02,741 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:10:02,741 INFO ]: Found error trace [2018-06-22 11:10:02,741 INFO ]: trace histogram [10, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:10:02,742 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:10:02,742 INFO ]: Analyzing trace with hash -914291404, now seen corresponding path program 1 times [2018-06-22 11:10:02,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:10:02,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:10:02,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:10:02,742 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:10:02,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:10:02,756 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:10:02,887 INFO ]: Checked inductivity of 165 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-22 11:10:02,888 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:10:02,888 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:10:02,894 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:10:02,952 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:10:02,954 INFO ]: Computing forward predicates... [2018-06-22 11:10:02,967 INFO ]: Checked inductivity of 165 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-22 11:10:02,989 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:10:02,989 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 11:10:02,989 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:10:02,989 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:10:02,989 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:10:02,989 INFO ]: Start difference. First operand 197 states and 407 transitions. Second operand 4 states. [2018-06-22 11:10:03,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:10:03,081 INFO ]: Finished difference Result 181 states and 351 transitions. [2018-06-22 11:10:03,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:10:03,081 INFO ]: Start accepts. Automaton has 4 states. Word has length 61 [2018-06-22 11:10:03,081 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:10:03,082 INFO ]: With dead ends: 181 [2018-06-22 11:10:03,082 INFO ]: Without dead ends: 134 [2018-06-22 11:10:03,083 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:10:03,083 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-22 11:10:03,089 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 119. [2018-06-22 11:10:03,089 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-22 11:10:03,090 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 232 transitions. [2018-06-22 11:10:03,090 INFO ]: Start accepts. Automaton has 119 states and 232 transitions. Word has length 61 [2018-06-22 11:10:03,090 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:10:03,090 INFO ]: Abstraction has 119 states and 232 transitions. [2018-06-22 11:10:03,090 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:10:03,090 INFO ]: Start isEmpty. Operand 119 states and 232 transitions. [2018-06-22 11:10:03,102 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:10:03,102 INFO ]: Found error trace [2018-06-22 11:10:03,103 INFO ]: trace histogram [18, 12, 12, 12, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:10:03,103 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:10:03,103 INFO ]: Analyzing trace with hash -1632010593, now seen corresponding path program 1 times [2018-06-22 11:10:03,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:10:03,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:10:03,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:10:03,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:10:03,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:10:03,130 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:10:03,953 INFO ]: Checked inductivity of 545 backedges. 175 proven. 14 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2018-06-22 11:10:03,953 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:10:03,953 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:10:03,969 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:10:04,043 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:10:04,048 INFO ]: Computing forward predicates... [2018-06-22 11:10:04,273 INFO ]: Checked inductivity of 545 backedges. 12 proven. 233 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-06-22 11:10:04,296 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:10:04,296 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-06-22 11:10:04,296 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:10:04,296 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:10:04,297 INFO ]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:10:04,297 INFO ]: Start difference. First operand 119 states and 232 transitions. Second operand 28 states. [2018-06-22 11:10:05,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:10:05,297 INFO ]: Finished difference Result 144 states and 253 transitions. [2018-06-22 11:10:05,297 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 11:10:05,297 INFO ]: Start accepts. Automaton has 28 states. Word has length 93 [2018-06-22 11:10:05,297 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:10:05,298 INFO ]: With dead ends: 144 [2018-06-22 11:10:05,298 INFO ]: Without dead ends: 116 [2018-06-22 11:10:05,298 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=199, Invalid=1963, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:10:05,298 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-22 11:10:05,303 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 111. [2018-06-22 11:10:05,303 INFO ]: Start removeUnreachable. Operand 111 states. [2018-06-22 11:10:05,304 INFO ]: Finished removeUnreachable. Reduced from 111 states to 111 states and 195 transitions. [2018-06-22 11:10:05,304 INFO ]: Start accepts. Automaton has 111 states and 195 transitions. Word has length 93 [2018-06-22 11:10:05,304 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:10:05,304 INFO ]: Abstraction has 111 states and 195 transitions. [2018-06-22 11:10:05,304 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:10:05,304 INFO ]: Start isEmpty. Operand 111 states and 195 transitions. [2018-06-22 11:10:05,305 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:10:05,305 INFO ]: Found error trace [2018-06-22 11:10:05,306 INFO ]: trace histogram [18, 12, 12, 12, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:10:05,306 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:10:05,306 INFO ]: Analyzing trace with hash -1572837147, now seen corresponding path program 6 times [2018-06-22 11:10:05,306 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:10:05,306 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:10:05,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:10:05,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:10:05,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:10:05,329 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:10:06,095 INFO ]: Checked inductivity of 549 backedges. 8 proven. 241 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-06-22 11:10:06,095 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:10:06,095 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:10:06,100 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:10:06,183 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-06-22 11:10:06,183 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:10:06,188 INFO ]: Computing forward predicates... [2018-06-22 11:10:08,114 INFO ]: Checked inductivity of 549 backedges. 13 proven. 237 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2018-06-22 11:10:08,134 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:10:08,134 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2018-06-22 11:10:08,134 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:10:08,134 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:10:08,135 INFO ]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:10:08,135 INFO ]: Start difference. First operand 111 states and 195 transitions. Second operand 27 states. [2018-06-22 11:10:08,800 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:10:08,800 INFO ]: Finished difference Result 130 states and 215 transitions. [2018-06-22 11:10:08,801 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:10:08,801 INFO ]: Start accepts. Automaton has 27 states. Word has length 93 [2018-06-22 11:10:08,801 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:10:08,801 INFO ]: With dead ends: 130 [2018-06-22 11:10:08,801 INFO ]: Without dead ends: 112 [2018-06-22 11:10:08,802 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=154, Invalid=1106, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:10:08,802 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:10:08,806 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-06-22 11:10:08,806 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 11:10:08,806 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 174 transitions. [2018-06-22 11:10:08,807 INFO ]: Start accepts. Automaton has 108 states and 174 transitions. Word has length 93 [2018-06-22 11:10:08,807 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:10:08,807 INFO ]: Abstraction has 108 states and 174 transitions. [2018-06-22 11:10:08,807 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:10:08,807 INFO ]: Start isEmpty. Operand 108 states and 174 transitions. [2018-06-22 11:10:08,808 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 11:10:08,808 INFO ]: Found error trace [2018-06-22 11:10:08,808 INFO ]: trace histogram [22, 15, 15, 15, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:10:08,808 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:10:08,808 INFO ]: Analyzing trace with hash -1663163116, now seen corresponding path program 7 times [2018-06-22 11:10:08,808 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:10:08,808 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:10:08,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:10:08,809 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:10:08,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:10:08,835 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:10:10,293 INFO ]: Checked inductivity of 823 backedges. 186 proven. 20 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2018-06-22 11:10:10,293 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:10:10,293 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:10:10,300 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:10:10,376 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:10:10,381 INFO ]: Computing forward predicates... [2018-06-22 11:10:11,299 INFO ]: Checked inductivity of 823 backedges. 26 proven. 376 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2018-06-22 11:10:11,319 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:10:11,319 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 32 [2018-06-22 11:10:11,319 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:10:11,319 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:10:11,319 INFO ]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:10:11,319 INFO ]: Start difference. First operand 108 states and 174 transitions. Second operand 32 states. Received shutdown request... [2018-06-22 11:10:12,848 WARN ]: Removed 6 from assertion stack [2018-06-22 11:10:12,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:10:12,849 WARN ]: Verification canceled [2018-06-22 11:10:12,852 WARN ]: Timeout [2018-06-22 11:10:12,852 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:10:12 BoogieIcfgContainer [2018-06-22 11:10:12,852 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:10:12,853 INFO ]: Toolchain (without parser) took 55832.17 ms. Allocated memory was 310.4 MB in the beginning and 743.4 MB in the end (delta: 433.1 MB). Free memory was 264.9 MB in the beginning and 716.2 MB in the end (delta: -451.3 MB). Peak memory consumption was 239.7 MB. Max. memory is 3.6 GB. [2018-06-22 11:10:12,854 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 310.4 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:10:12,854 INFO ]: ChcToBoogie took 48.35 ms. Allocated memory is still 310.4 MB. Free memory was 264.9 MB in the beginning and 262.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:10:12,854 INFO ]: Boogie Preprocessor took 39.80 ms. Allocated memory is still 310.4 MB. Free memory was 262.9 MB in the beginning and 260.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:10:12,854 INFO ]: RCFGBuilder took 370.02 ms. Allocated memory is still 310.4 MB. Free memory was 260.9 MB in the beginning and 249.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:10:12,854 INFO ]: TraceAbstraction took 55364.28 ms. Allocated memory was 310.4 MB in the beginning and 743.4 MB in the end (delta: 433.1 MB). Free memory was 249.0 MB in the beginning and 716.2 MB in the end (delta: -467.2 MB). Peak memory consumption was 223.7 MB. Max. memory is 3.6 GB. [2018-06-22 11:10:12,858 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 310.4 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 48.35 ms. Allocated memory is still 310.4 MB. Free memory was 264.9 MB in the beginning and 262.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.80 ms. Allocated memory is still 310.4 MB. Free memory was 262.9 MB in the beginning and 260.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 370.02 ms. Allocated memory is still 310.4 MB. Free memory was 260.9 MB in the beginning and 249.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55364.28 ms. Allocated memory was 310.4 MB in the beginning and 743.4 MB in the end (delta: 433.1 MB). Free memory was 249.0 MB in the beginning and 716.2 MB in the end (delta: -467.2 MB). Peak memory consumption was 223.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (108states) and interpolant automaton (currently 24 states, 32 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 25. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. TIMEOUT Result, 55.3s OverallTime, 34 OverallIterations, 22 TraceHistogramMax, 31.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1276 SDtfs, 494 SDslu, 9645 SDs, 0 SdLazy, 22691 SolverSat, 1937 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2397 GetRequests, 1569 SyntacticMatches, 10 SemanticMatches, 817 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3724 ImplicationChecksByTransitivity, 25.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=19, 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.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 591 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 3404 NumberOfCodeBlocks, 3299 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 3340 ConstructedInterpolants, 0 QuantifiedInterpolants, 487784 SizeOfPredicates, 204 NumberOfNonLiveVariables, 11589 ConjunctsInSsa, 680 ConjunctsInUnsatCore, 64 InterpolantComputations, 6 PerfectInterpolantSequences, 9479/11838 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/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/005b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-10-12-867.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/005b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-10-12-867.csv Completed graceful shutdown