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/llreve-bench/smt2/loop__digits10_inl.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:58:31,845 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:58:31,846 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:58:31,861 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:58:31,861 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:58:31,862 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:58:31,863 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:58:31,865 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:58:31,867 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:58:31,868 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:58:31,868 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:58:31,869 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:58:31,870 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:58:31,880 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:58:31,881 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:58:31,881 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:58:31,883 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:58:31,885 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:58:31,886 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:58:31,887 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:58:31,888 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:58:31,894 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:58:31,894 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:58:31,894 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:58:31,895 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:58:31,896 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:58:31,897 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:58:31,897 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:58:31,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:58:31,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:58:31,902 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:58:31,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:58:31,903 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:58:31,904 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:58:31,905 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:58:31,906 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:58:31,925 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:58:31,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:58:31,926 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:58:31,926 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:58:31,927 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:58:31,927 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:58:31,927 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:58:31,927 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:58:31,927 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:58:31,928 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:58:31,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:58:31,928 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:58:31,928 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:58:31,928 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:58:31,929 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:58:31,929 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:58:31,929 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:58:31,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:58:31,929 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:58:31,931 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:58:31,931 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:58:31,989 INFO ]: Repository-Root is: /tmp [2018-06-22 11:58:32,005 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:58:32,010 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:58:32,012 INFO ]: Initializing SmtParser... [2018-06-22 11:58:32,012 INFO ]: SmtParser initialized [2018-06-22 11:58:32,013 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__digits10_inl.smt2 [2018-06-22 11:58:32,014 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:58:32,097 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__digits10_inl.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@41cf1731 [2018-06-22 11:58:32,423 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__digits10_inl.smt2 [2018-06-22 11:58:32,427 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:58:32,435 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:58:32,435 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:58:32,435 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:58:32,435 INFO ]: ChcToBoogie initialized [2018-06-22 11:58:32,441 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:58:32" (1/1) ... [2018-06-22 11:58:32,489 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:32 Unit [2018-06-22 11:58:32,489 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:58:32,489 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:58:32,489 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:58:32,489 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:58:32,512 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:32" (1/1) ... [2018-06-22 11:58:32,512 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:32" (1/1) ... [2018-06-22 11:58:32,522 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:32" (1/1) ... [2018-06-22 11:58:32,522 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:32" (1/1) ... [2018-06-22 11:58:32,537 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:32" (1/1) ... [2018-06-22 11:58:32,548 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:32" (1/1) ... [2018-06-22 11:58:32,549 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:32" (1/1) ... [2018-06-22 11:58:32,551 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:58:32,560 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:58:32,560 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:58:32,560 INFO ]: RCFGBuilder initialized [2018-06-22 11:58:32,561 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:32" (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) [2018-06-22 11:58:32,573 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:58:32,573 INFO ]: Found specification of procedure False [2018-06-22 11:58:32,573 INFO ]: Found implementation of procedure False [2018-06-22 11:58:32,573 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:58:32,573 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:58:32,573 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:58:32,573 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:58:32,573 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:58:32,573 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:58:33,347 INFO ]: Using library mode [2018-06-22 11:58:33,348 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:58:33 BoogieIcfgContainer [2018-06-22 11:58:33,348 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:58:33,349 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:58:33,349 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:58:33,351 INFO ]: TraceAbstraction initialized [2018-06-22 11:58:33,351 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:58:32" (1/3) ... [2018-06-22 11:58:33,353 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b28d8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:58:33, skipping insertion in model container [2018-06-22 11:58:33,353 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:32" (2/3) ... [2018-06-22 11:58:33,354 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b28d8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:58:33, skipping insertion in model container [2018-06-22 11:58:33,354 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:58:33" (3/3) ... [2018-06-22 11:58:33,355 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:58:33,365 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:58:33,372 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:58:33,413 INFO ]: Using default assertion order modulation [2018-06-22 11:58:33,414 INFO ]: Interprodecural is true [2018-06-22 11:58:33,414 INFO ]: Hoare is false [2018-06-22 11:58:33,414 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:58:33,414 INFO ]: Backedges is TWOTRACK [2018-06-22 11:58:33,414 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:58:33,414 INFO ]: Difference is false [2018-06-22 11:58:33,414 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:58:33,414 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:58:33,428 INFO ]: Start isEmpty. Operand 41 states. [2018-06-22 11:58:33,465 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:58:33,465 INFO ]: Found error trace [2018-06-22 11:58:33,466 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:33,466 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:33,471 INFO ]: Analyzing trace with hash -494047663, now seen corresponding path program 1 times [2018-06-22 11:58:33,472 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:33,472 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:33,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:33,505 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:33,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:33,537 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:33,631 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:58:33,634 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:33,634 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:58:33,636 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:33,646 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:33,647 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:33,648 INFO ]: Start difference. First operand 41 states. Second operand 4 states. [2018-06-22 11:58:34,415 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:34,415 INFO ]: Finished difference Result 41 states and 126 transitions. [2018-06-22 11:58:34,417 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:58:34,418 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:58:34,418 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:34,434 INFO ]: With dead ends: 41 [2018-06-22 11:58:34,434 INFO ]: Without dead ends: 41 [2018-06-22 11:58:34,435 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:34,448 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:58:34,498 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-22 11:58:34,500 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:58:34,503 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 126 transitions. [2018-06-22 11:58:34,505 INFO ]: Start accepts. Automaton has 41 states and 126 transitions. Word has length 9 [2018-06-22 11:58:34,506 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:34,506 INFO ]: Abstraction has 41 states and 126 transitions. [2018-06-22 11:58:34,506 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:34,506 INFO ]: Start isEmpty. Operand 41 states and 126 transitions. [2018-06-22 11:58:34,522 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:58:34,522 INFO ]: Found error trace [2018-06-22 11:58:34,522 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:34,522 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:34,522 INFO ]: Analyzing trace with hash 2071137130, now seen corresponding path program 1 times [2018-06-22 11:58:34,522 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:34,522 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:34,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:34,523 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:34,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:34,548 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:34,775 WARN ]: Spent 103.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-06-22 11:58:34,845 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:58:34,845 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:34,845 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:58:34,851 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:34,880 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:34,888 INFO ]: Computing forward predicates... [2018-06-22 11:58:35,321 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:58:35,346 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:35,346 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:58:35,346 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:58:35,347 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:58:35,347 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:58:35,347 INFO ]: Start difference. First operand 41 states and 126 transitions. Second operand 8 states. [2018-06-22 11:58:36,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:36,731 INFO ]: Finished difference Result 55 states and 339 transitions. [2018-06-22 11:58:36,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:58:36,731 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:58:36,731 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:36,744 INFO ]: With dead ends: 55 [2018-06-22 11:58:36,745 INFO ]: Without dead ends: 55 [2018-06-22 11:58:36,745 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:58:36,746 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:58:36,795 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-06-22 11:58:36,795 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:58:36,797 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 217 transitions. [2018-06-22 11:58:36,798 INFO ]: Start accepts. Automaton has 47 states and 217 transitions. Word has length 13 [2018-06-22 11:58:36,798 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:36,798 INFO ]: Abstraction has 47 states and 217 transitions. [2018-06-22 11:58:36,798 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:58:36,798 INFO ]: Start isEmpty. Operand 47 states and 217 transitions. [2018-06-22 11:58:36,803 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:58:36,804 INFO ]: Found error trace [2018-06-22 11:58:36,804 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:36,804 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:36,804 INFO ]: Analyzing trace with hash 473929217, now seen corresponding path program 1 times [2018-06-22 11:58:36,804 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:36,804 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:36,805 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:36,805 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:36,805 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:36,818 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:36,867 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:58:36,867 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:36,867 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:58:36,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:36,888 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:36,889 INFO ]: Computing forward predicates... [2018-06-22 11:58:36,909 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:58:36,928 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:36,928 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:58:36,928 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:58:36,928 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:58:36,928 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:58:36,928 INFO ]: Start difference. First operand 47 states and 217 transitions. Second operand 8 states. [2018-06-22 11:58:37,397 WARN ]: Spent 149.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-06-22 11:58:37,733 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:37,733 INFO ]: Finished difference Result 53 states and 308 transitions. [2018-06-22 11:58:37,733 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:58:37,733 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:58:37,733 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:37,737 INFO ]: With dead ends: 53 [2018-06-22 11:58:37,737 INFO ]: Without dead ends: 53 [2018-06-22 11:58:37,738 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:58:37,738 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:58:37,776 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-06-22 11:58:37,777 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:58:37,778 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 247 transitions. [2018-06-22 11:58:37,779 INFO ]: Start accepts. Automaton has 49 states and 247 transitions. Word has length 13 [2018-06-22 11:58:37,779 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:37,779 INFO ]: Abstraction has 49 states and 247 transitions. [2018-06-22 11:58:37,779 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:58:37,779 INFO ]: Start isEmpty. Operand 49 states and 247 transitions. [2018-06-22 11:58:37,784 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:58:37,784 INFO ]: Found error trace [2018-06-22 11:58:37,784 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:37,785 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:37,785 INFO ]: Analyzing trace with hash 1580635424, now seen corresponding path program 1 times [2018-06-22 11:58:37,785 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:37,785 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:37,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:37,786 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:37,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:37,798 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:37,859 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:58:37,859 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:37,859 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:58:37,859 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:37,860 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:37,860 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:37,860 INFO ]: Start difference. First operand 49 states and 247 transitions. Second operand 4 states. [2018-06-22 11:58:38,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:38,333 INFO ]: Finished difference Result 75 states and 464 transitions. [2018-06-22 11:58:38,334 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:58:38,334 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:58:38,334 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:38,341 INFO ]: With dead ends: 75 [2018-06-22 11:58:38,341 INFO ]: Without dead ends: 75 [2018-06-22 11:58:38,341 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:58:38,342 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:58:38,374 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 67. [2018-06-22 11:58:38,374 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 11:58:38,377 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 345 transitions. [2018-06-22 11:58:38,377 INFO ]: Start accepts. Automaton has 67 states and 345 transitions. Word has length 13 [2018-06-22 11:58:38,377 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:38,377 INFO ]: Abstraction has 67 states and 345 transitions. [2018-06-22 11:58:38,377 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:38,377 INFO ]: Start isEmpty. Operand 67 states and 345 transitions. [2018-06-22 11:58:38,385 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:58:38,385 INFO ]: Found error trace [2018-06-22 11:58:38,385 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:38,385 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:38,385 INFO ]: Analyzing trace with hash -878027843, now seen corresponding path program 1 times [2018-06-22 11:58:38,385 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:38,385 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:38,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:38,386 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:38,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:38,393 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:38,544 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:58:38,544 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:38,544 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:58:38,552 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:38,573 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:38,574 INFO ]: Computing forward predicates... [2018-06-22 11:58:38,624 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:58:38,658 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:38,658 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:58:38,658 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:58:38,658 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:58:38,658 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:58:38,659 INFO ]: Start difference. First operand 67 states and 345 transitions. Second operand 6 states. [2018-06-22 11:58:39,467 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:39,467 INFO ]: Finished difference Result 98 states and 615 transitions. [2018-06-22 11:58:39,468 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:58:39,468 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:58:39,468 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:39,477 INFO ]: With dead ends: 98 [2018-06-22 11:58:39,477 INFO ]: Without dead ends: 98 [2018-06-22 11:58:39,480 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:58:39,480 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 11:58:39,530 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-06-22 11:58:39,530 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:58:39,534 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 593 transitions. [2018-06-22 11:58:39,534 INFO ]: Start accepts. Automaton has 96 states and 593 transitions. Word has length 13 [2018-06-22 11:58:39,534 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:39,535 INFO ]: Abstraction has 96 states and 593 transitions. [2018-06-22 11:58:39,535 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:58:39,535 INFO ]: Start isEmpty. Operand 96 states and 593 transitions. [2018-06-22 11:58:39,546 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:58:39,546 INFO ]: Found error trace [2018-06-22 11:58:39,546 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:39,546 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:39,546 INFO ]: Analyzing trace with hash 1090133718, now seen corresponding path program 1 times [2018-06-22 11:58:39,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:39,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:39,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:39,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:39,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:39,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:39,901 WARN ]: Spent 200.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-06-22 11:58:39,915 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:58:39,915 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:39,915 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:58:39,921 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:39,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:39,933 INFO ]: Computing forward predicates... [2018-06-22 11:58:40,064 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:58:40,083 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:40,083 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:58:40,083 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:58:40,083 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:58:40,084 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:58:40,084 INFO ]: Start difference. First operand 96 states and 593 transitions. Second operand 8 states. [2018-06-22 11:58:40,493 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:40,493 INFO ]: Finished difference Result 104 states and 697 transitions. [2018-06-22 11:58:40,493 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:58:40,493 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:58:40,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:40,500 INFO ]: With dead ends: 104 [2018-06-22 11:58:40,500 INFO ]: Without dead ends: 104 [2018-06-22 11:58:40,500 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:58:40,500 INFO ]: Start minimizeSevpa. Operand 104 states. [2018-06-22 11:58:40,538 INFO ]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-06-22 11:58:40,538 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 11:58:40,541 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 662 transitions. [2018-06-22 11:58:40,541 INFO ]: Start accepts. Automaton has 102 states and 662 transitions. Word has length 13 [2018-06-22 11:58:40,541 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:40,541 INFO ]: Abstraction has 102 states and 662 transitions. [2018-06-22 11:58:40,541 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:58:40,541 INFO ]: Start isEmpty. Operand 102 states and 662 transitions. [2018-06-22 11:58:40,550 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:58:40,550 INFO ]: Found error trace [2018-06-22 11:58:40,550 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:40,550 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:40,550 INFO ]: Analyzing trace with hash -261823342, now seen corresponding path program 1 times [2018-06-22 11:58:40,550 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:40,550 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:40,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:40,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:40,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:40,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:40,645 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:58:40,645 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:40,645 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:58:40,645 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:40,645 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:40,645 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:40,646 INFO ]: Start difference. First operand 102 states and 662 transitions. Second operand 4 states. [2018-06-22 11:58:40,867 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:40,867 INFO ]: Finished difference Result 106 states and 713 transitions. [2018-06-22 11:58:40,868 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:58:40,868 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:58:40,868 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:40,872 INFO ]: With dead ends: 106 [2018-06-22 11:58:40,872 INFO ]: Without dead ends: 106 [2018-06-22 11:58:40,873 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:40,873 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-22 11:58:40,907 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 102. [2018-06-22 11:58:40,907 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 11:58:40,910 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 656 transitions. [2018-06-22 11:58:40,910 INFO ]: Start accepts. Automaton has 102 states and 656 transitions. Word has length 13 [2018-06-22 11:58:40,910 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:40,910 INFO ]: Abstraction has 102 states and 656 transitions. [2018-06-22 11:58:40,910 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:40,910 INFO ]: Start isEmpty. Operand 102 states and 656 transitions. [2018-06-22 11:58:40,919 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:58:40,919 INFO ]: Found error trace [2018-06-22 11:58:40,919 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:40,919 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:40,919 INFO ]: Analyzing trace with hash -997575901, now seen corresponding path program 1 times [2018-06-22 11:58:40,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:40,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:40,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:40,920 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:40,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:40,926 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:41,061 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:58:41,061 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:41,061 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:41,076 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:41,093 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:41,095 INFO ]: Computing forward predicates... [2018-06-22 11:58:41,133 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:58:41,152 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:41,152 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:58:41,152 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:58:41,152 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:58:41,152 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:58:41,153 INFO ]: Start difference. First operand 102 states and 656 transitions. Second operand 8 states. [2018-06-22 11:58:41,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:41,683 INFO ]: Finished difference Result 122 states and 894 transitions. [2018-06-22 11:58:41,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:58:41,683 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:58:41,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:41,687 INFO ]: With dead ends: 122 [2018-06-22 11:58:41,687 INFO ]: Without dead ends: 122 [2018-06-22 11:58:41,688 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:58:41,688 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-22 11:58:41,733 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 108. [2018-06-22 11:58:41,733 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 11:58:41,761 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 731 transitions. [2018-06-22 11:58:41,761 INFO ]: Start accepts. Automaton has 108 states and 731 transitions. Word has length 13 [2018-06-22 11:58:41,761 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:41,761 INFO ]: Abstraction has 108 states and 731 transitions. [2018-06-22 11:58:41,761 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:58:41,761 INFO ]: Start isEmpty. Operand 108 states and 731 transitions. [2018-06-22 11:58:41,772 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:41,772 INFO ]: Found error trace [2018-06-22 11:58:41,772 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:41,773 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:41,773 INFO ]: Analyzing trace with hash 359012519, now seen corresponding path program 1 times [2018-06-22 11:58:41,773 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:41,773 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:41,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:41,773 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:41,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:41,789 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:41,997 WARN ]: Spent 151.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 11:58:42,117 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:58:42,117 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:42,117 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:58:42,117 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:42,117 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:42,117 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:42,117 INFO ]: Start difference. First operand 108 states and 731 transitions. Second operand 4 states. [2018-06-22 11:58:42,274 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 11:58:42,782 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:42,782 INFO ]: Finished difference Result 106 states and 626 transitions. [2018-06-22 11:58:42,785 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:58:42,785 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:58:42,785 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:42,789 INFO ]: With dead ends: 106 [2018-06-22 11:58:42,789 INFO ]: Without dead ends: 99 [2018-06-22 11:58:42,789 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:58:42,789 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-22 11:58:42,825 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 91. [2018-06-22 11:58:42,825 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 11:58:42,828 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 503 transitions. [2018-06-22 11:58:42,828 INFO ]: Start accepts. Automaton has 91 states and 503 transitions. Word has length 17 [2018-06-22 11:58:42,828 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:42,828 INFO ]: Abstraction has 91 states and 503 transitions. [2018-06-22 11:58:42,828 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:42,828 INFO ]: Start isEmpty. Operand 91 states and 503 transitions. [2018-06-22 11:58:42,833 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:42,833 INFO ]: Found error trace [2018-06-22 11:58:42,833 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:42,833 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:42,834 INFO ]: Analyzing trace with hash -1240349996, now seen corresponding path program 1 times [2018-06-22 11:58:42,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:42,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:42,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:42,834 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:42,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:42,840 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:42,968 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:58:42,968 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:42,968 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:58:42,968 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:42,968 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:42,968 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:42,969 INFO ]: Start difference. First operand 91 states and 503 transitions. Second operand 4 states. [2018-06-22 11:58:44,293 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:44,294 INFO ]: Finished difference Result 165 states and 1044 transitions. [2018-06-22 11:58:44,298 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:58:44,298 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:58:44,298 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:44,303 INFO ]: With dead ends: 165 [2018-06-22 11:58:44,303 INFO ]: Without dead ends: 157 [2018-06-22 11:58:44,304 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 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:58:44,304 INFO ]: Start minimizeSevpa. Operand 157 states. [2018-06-22 11:58:44,358 INFO ]: Finished minimizeSevpa. Reduced states from 157 to 135. [2018-06-22 11:58:44,358 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 11:58:44,362 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 840 transitions. [2018-06-22 11:58:44,362 INFO ]: Start accepts. Automaton has 135 states and 840 transitions. Word has length 17 [2018-06-22 11:58:44,362 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:44,362 INFO ]: Abstraction has 135 states and 840 transitions. [2018-06-22 11:58:44,362 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:44,362 INFO ]: Start isEmpty. Operand 135 states and 840 transitions. [2018-06-22 11:58:44,369 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:44,369 INFO ]: Found error trace [2018-06-22 11:58:44,369 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:44,369 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:44,370 INFO ]: Analyzing trace with hash 579364382, now seen corresponding path program 1 times [2018-06-22 11:58:44,370 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:44,370 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:44,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:44,370 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:44,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:44,379 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:44,510 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:58:44,511 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:44,511 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:58:44,511 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:44,511 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:44,511 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:44,511 INFO ]: Start difference. First operand 135 states and 840 transitions. Second operand 4 states. [2018-06-22 11:58:45,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:45,758 INFO ]: Finished difference Result 155 states and 821 transitions. [2018-06-22 11:58:45,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:58:45,758 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:58:45,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:45,762 INFO ]: With dead ends: 155 [2018-06-22 11:58:45,762 INFO ]: Without dead ends: 155 [2018-06-22 11:58:45,763 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 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:58:45,763 INFO ]: Start minimizeSevpa. Operand 155 states. [2018-06-22 11:58:45,792 INFO ]: Finished minimizeSevpa. Reduced states from 155 to 135. [2018-06-22 11:58:45,792 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 11:58:45,795 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 728 transitions. [2018-06-22 11:58:45,795 INFO ]: Start accepts. Automaton has 135 states and 728 transitions. Word has length 17 [2018-06-22 11:58:45,795 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:45,795 INFO ]: Abstraction has 135 states and 728 transitions. [2018-06-22 11:58:45,795 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:45,795 INFO ]: Start isEmpty. Operand 135 states and 728 transitions. [2018-06-22 11:58:45,804 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:45,804 INFO ]: Found error trace [2018-06-22 11:58:45,804 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:45,804 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:45,804 INFO ]: Analyzing trace with hash 1670089599, now seen corresponding path program 1 times [2018-06-22 11:58:45,804 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:45,804 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:45,805 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:45,805 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:45,805 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:45,817 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:45,955 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:58:45,955 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:45,956 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:58:45,956 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:45,956 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:45,956 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:45,956 INFO ]: Start difference. First operand 135 states and 728 transitions. Second operand 4 states. [2018-06-22 11:58:47,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:47,031 INFO ]: Finished difference Result 175 states and 656 transitions. [2018-06-22 11:58:47,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:58:47,047 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:58:47,047 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:47,051 INFO ]: With dead ends: 175 [2018-06-22 11:58:47,051 INFO ]: Without dead ends: 162 [2018-06-22 11:58:47,051 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 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:58:47,051 INFO ]: Start minimizeSevpa. Operand 162 states. [2018-06-22 11:58:47,072 INFO ]: Finished minimizeSevpa. Reduced states from 162 to 130. [2018-06-22 11:58:47,072 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-22 11:58:47,074 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 504 transitions. [2018-06-22 11:58:47,074 INFO ]: Start accepts. Automaton has 130 states and 504 transitions. Word has length 17 [2018-06-22 11:58:47,074 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:47,074 INFO ]: Abstraction has 130 states and 504 transitions. [2018-06-22 11:58:47,074 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:47,074 INFO ]: Start isEmpty. Operand 130 states and 504 transitions. [2018-06-22 11:58:47,080 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:47,080 INFO ]: Found error trace [2018-06-22 11:58:47,080 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:47,080 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:47,080 INFO ]: Analyzing trace with hash -2723537, now seen corresponding path program 1 times [2018-06-22 11:58:47,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:47,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:47,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:47,081 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:47,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:47,089 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:47,222 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:58:47,222 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:47,222 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:58:47,223 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:47,223 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:47,223 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:47,223 INFO ]: Start difference. First operand 130 states and 504 transitions. Second operand 4 states. [2018-06-22 11:58:48,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:48,615 INFO ]: Finished difference Result 171 states and 574 transitions. [2018-06-22 11:58:48,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:58:48,616 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:58:48,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:48,619 INFO ]: With dead ends: 171 [2018-06-22 11:58:48,619 INFO ]: Without dead ends: 166 [2018-06-22 11:58:48,619 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:48,619 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-22 11:58:48,634 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 146. [2018-06-22 11:58:48,634 INFO ]: Start removeUnreachable. Operand 146 states. [2018-06-22 11:58:48,636 INFO ]: Finished removeUnreachable. Reduced from 146 states to 146 states and 509 transitions. [2018-06-22 11:58:48,636 INFO ]: Start accepts. Automaton has 146 states and 509 transitions. Word has length 17 [2018-06-22 11:58:48,636 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:48,637 INFO ]: Abstraction has 146 states and 509 transitions. [2018-06-22 11:58:48,637 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:48,637 INFO ]: Start isEmpty. Operand 146 states and 509 transitions. [2018-06-22 11:58:48,642 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:48,642 INFO ]: Found error trace [2018-06-22 11:58:48,642 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:48,642 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:48,642 INFO ]: Analyzing trace with hash 2145802651, now seen corresponding path program 2 times [2018-06-22 11:58:48,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:48,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:48,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:48,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:48,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:48,654 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:48,781 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:58:48,781 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:48,781 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:58:48,793 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:58:48,807 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:58:48,807 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:48,809 INFO ]: Computing forward predicates... [2018-06-22 11:58:48,838 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:58:48,857 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:48,857 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 11:58:48,857 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:48,858 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:48,858 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:48,858 INFO ]: Start difference. First operand 146 states and 509 transitions. Second operand 4 states. [2018-06-22 11:58:49,075 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:49,075 INFO ]: Finished difference Result 164 states and 553 transitions. [2018-06-22 11:58:49,076 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:58:49,076 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:58:49,076 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:49,077 INFO ]: With dead ends: 164 [2018-06-22 11:58:49,077 INFO ]: Without dead ends: 137 [2018-06-22 11:58:49,078 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 2 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:58:49,078 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-22 11:58:49,089 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 119. [2018-06-22 11:58:49,089 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-22 11:58:49,091 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 442 transitions. [2018-06-22 11:58:49,091 INFO ]: Start accepts. Automaton has 119 states and 442 transitions. Word has length 17 [2018-06-22 11:58:49,091 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:49,091 INFO ]: Abstraction has 119 states and 442 transitions. [2018-06-22 11:58:49,091 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:49,091 INFO ]: Start isEmpty. Operand 119 states and 442 transitions. [2018-06-22 11:58:49,096 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:49,096 INFO ]: Found error trace [2018-06-22 11:58:49,096 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:49,096 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:49,096 INFO ]: Analyzing trace with hash 354842359, now seen corresponding path program 1 times [2018-06-22 11:58:49,096 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:49,096 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:49,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:49,096 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:49,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:49,104 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:49,193 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:58:49,193 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:49,193 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:58:49,200 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:49,218 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:49,220 INFO ]: Computing forward predicates... [2018-06-22 11:58:50,215 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:58:50,234 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:50,234 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:58:50,234 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:58:50,235 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:58:50,235 INFO ]: CoverageRelationStatistics Valid=25, Invalid=106, Unknown=1, NotChecked=0, Total=132 [2018-06-22 11:58:50,235 INFO ]: Start difference. First operand 119 states and 442 transitions. Second operand 12 states. [2018-06-22 11:58:51,773 WARN ]: Spent 140.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-06-22 11:58:52,415 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:52,416 INFO ]: Finished difference Result 193 states and 629 transitions. [2018-06-22 11:58:52,416 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:58:52,416 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:58:52,416 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:52,418 INFO ]: With dead ends: 193 [2018-06-22 11:58:52,418 INFO ]: Without dead ends: 161 [2018-06-22 11:58:52,419 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=440, Unknown=1, NotChecked=0, Total=600 [2018-06-22 11:58:52,419 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-22 11:58:52,433 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 127. [2018-06-22 11:58:52,433 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-22 11:58:52,435 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 468 transitions. [2018-06-22 11:58:52,435 INFO ]: Start accepts. Automaton has 127 states and 468 transitions. Word has length 17 [2018-06-22 11:58:52,435 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:52,435 INFO ]: Abstraction has 127 states and 468 transitions. [2018-06-22 11:58:52,435 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:58:52,435 INFO ]: Start isEmpty. Operand 127 states and 468 transitions. [2018-06-22 11:58:52,439 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:52,439 INFO ]: Found error trace [2018-06-22 11:58:52,439 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:52,439 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:52,439 INFO ]: Analyzing trace with hash -1252382122, now seen corresponding path program 1 times [2018-06-22 11:58:52,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:52,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:52,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:52,440 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:52,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:52,446 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:52,532 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:58:52,532 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:52,532 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:58:52,540 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:52,564 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:52,566 INFO ]: Computing forward predicates... [2018-06-22 11:58:52,676 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:58:52,695 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:52,695 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:58:52,695 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:58:52,695 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:58:52,695 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:58:52,695 INFO ]: Start difference. First operand 127 states and 468 transitions. Second operand 8 states. [2018-06-22 11:58:53,527 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:53,527 INFO ]: Finished difference Result 184 states and 634 transitions. [2018-06-22 11:58:53,527 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:58:53,527 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:58:53,527 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:53,530 INFO ]: With dead ends: 184 [2018-06-22 11:58:53,530 INFO ]: Without dead ends: 165 [2018-06-22 11:58:53,530 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:58:53,530 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-22 11:58:53,544 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 131. [2018-06-22 11:58:53,544 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-22 11:58:53,546 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 482 transitions. [2018-06-22 11:58:53,546 INFO ]: Start accepts. Automaton has 131 states and 482 transitions. Word has length 17 [2018-06-22 11:58:53,546 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:53,546 INFO ]: Abstraction has 131 states and 482 transitions. [2018-06-22 11:58:53,546 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:58:53,546 INFO ]: Start isEmpty. Operand 131 states and 482 transitions. [2018-06-22 11:58:53,550 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:53,550 INFO ]: Found error trace [2018-06-22 11:58:53,550 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:53,550 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:53,550 INFO ]: Analyzing trace with hash -121130530, now seen corresponding path program 2 times [2018-06-22 11:58:53,550 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:53,550 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:53,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:53,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:53,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:53,571 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:53,774 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:58:53,774 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:53,774 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:58:53,783 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:58:53,820 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:58:53,820 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:53,822 INFO ]: Computing forward predicates... [2018-06-22 11:58:53,984 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:58:54,003 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:54,004 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:58:54,004 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:58:54,004 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:58:54,004 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:58:54,004 INFO ]: Start difference. First operand 131 states and 482 transitions. Second operand 11 states. [2018-06-22 11:58:54,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:54,549 INFO ]: Finished difference Result 209 states and 663 transitions. [2018-06-22 11:58:54,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:58:54,549 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:58:54,550 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:54,552 INFO ]: With dead ends: 209 [2018-06-22 11:58:54,552 INFO ]: Without dead ends: 201 [2018-06-22 11:58:54,552 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:58:54,552 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-22 11:58:54,568 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 135. [2018-06-22 11:58:54,568 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 11:58:54,570 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 489 transitions. [2018-06-22 11:58:54,570 INFO ]: Start accepts. Automaton has 135 states and 489 transitions. Word has length 17 [2018-06-22 11:58:54,570 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:54,570 INFO ]: Abstraction has 135 states and 489 transitions. [2018-06-22 11:58:54,570 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:58:54,570 INFO ]: Start isEmpty. Operand 135 states and 489 transitions. [2018-06-22 11:58:54,574 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:54,574 INFO ]: Found error trace [2018-06-22 11:58:54,574 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:54,574 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:54,574 INFO ]: Analyzing trace with hash -268031772, now seen corresponding path program 1 times [2018-06-22 11:58:54,574 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:54,574 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:54,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:54,576 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:54,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:54,584 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:54,638 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:58:54,638 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:54,638 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:58:54,638 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:58:54,638 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:58:54,638 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:58:54,638 INFO ]: Start difference. First operand 135 states and 489 transitions. Second operand 5 states. [2018-06-22 11:58:55,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:55,041 INFO ]: Finished difference Result 181 states and 619 transitions. [2018-06-22 11:58:55,041 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:58:55,042 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:58:55,042 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:55,044 INFO ]: With dead ends: 181 [2018-06-22 11:58:55,044 INFO ]: Without dead ends: 181 [2018-06-22 11:58:55,045 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:58:55,045 INFO ]: Start minimizeSevpa. Operand 181 states. [2018-06-22 11:58:55,058 INFO ]: Finished minimizeSevpa. Reduced states from 181 to 139. [2018-06-22 11:58:55,058 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-22 11:58:55,060 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 495 transitions. [2018-06-22 11:58:55,060 INFO ]: Start accepts. Automaton has 139 states and 495 transitions. Word has length 17 [2018-06-22 11:58:55,060 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:55,060 INFO ]: Abstraction has 139 states and 495 transitions. [2018-06-22 11:58:55,060 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:58:55,060 INFO ]: Start isEmpty. Operand 139 states and 495 transitions. [2018-06-22 11:58:55,063 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:55,063 INFO ]: Found error trace [2018-06-22 11:58:55,063 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:55,063 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:55,064 INFO ]: Analyzing trace with hash 1698583848, now seen corresponding path program 1 times [2018-06-22 11:58:55,064 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:55,064 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:55,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:55,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:55,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:55,069 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:55,205 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:58:55,205 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:55,205 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:58:55,206 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:58:55,206 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:58:55,206 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:58:55,206 INFO ]: Start difference. First operand 139 states and 495 transitions. Second operand 5 states. [2018-06-22 11:58:55,485 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:55,485 INFO ]: Finished difference Result 147 states and 442 transitions. [2018-06-22 11:58:55,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:58:55,486 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:58:55,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:55,487 INFO ]: With dead ends: 147 [2018-06-22 11:58:55,487 INFO ]: Without dead ends: 114 [2018-06-22 11:58:55,487 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:58:55,488 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-22 11:58:55,493 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 86. [2018-06-22 11:58:55,493 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 11:58:55,494 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 214 transitions. [2018-06-22 11:58:55,494 INFO ]: Start accepts. Automaton has 86 states and 214 transitions. Word has length 17 [2018-06-22 11:58:55,494 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:55,494 INFO ]: Abstraction has 86 states and 214 transitions. [2018-06-22 11:58:55,494 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:58:55,494 INFO ]: Start isEmpty. Operand 86 states and 214 transitions. [2018-06-22 11:58:55,495 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:55,495 INFO ]: Found error trace [2018-06-22 11:58:55,495 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:55,495 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:55,495 INFO ]: Analyzing trace with hash 1043045308, now seen corresponding path program 1 times [2018-06-22 11:58:55,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:55,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:55,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:55,496 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:55,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:55,502 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:55,596 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:58:55,596 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:55,596 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:58:55,596 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:58:55,596 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:58:55,596 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:58:55,596 INFO ]: Start difference. First operand 86 states and 214 transitions. Second operand 5 states. [2018-06-22 11:58:55,779 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:55,779 INFO ]: Finished difference Result 104 states and 260 transitions. [2018-06-22 11:58:55,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:58:55,779 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:58:55,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:55,780 INFO ]: With dead ends: 104 [2018-06-22 11:58:55,780 INFO ]: Without dead ends: 97 [2018-06-22 11:58:55,780 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:58:55,780 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 11:58:55,788 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 79. [2018-06-22 11:58:55,789 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:58:55,790 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 179 transitions. [2018-06-22 11:58:55,790 INFO ]: Start accepts. Automaton has 79 states and 179 transitions. Word has length 17 [2018-06-22 11:58:55,790 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:55,790 INFO ]: Abstraction has 79 states and 179 transitions. [2018-06-22 11:58:55,790 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:58:55,790 INFO ]: Start isEmpty. Operand 79 states and 179 transitions. [2018-06-22 11:58:55,791 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:55,791 INFO ]: Found error trace [2018-06-22 11:58:55,791 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:55,791 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:55,791 INFO ]: Analyzing trace with hash 534408010, now seen corresponding path program 1 times [2018-06-22 11:58:55,791 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:55,791 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:55,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:55,792 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:55,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:55,802 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:56,076 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:58:56,076 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:56,076 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:58:56,082 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:56,093 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:56,094 INFO ]: Computing forward predicates... [2018-06-22 11:58:56,140 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:58:56,159 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:56,159 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:58:56,159 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:58:56,159 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:58:56,159 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:58:56,160 INFO ]: Start difference. First operand 79 states and 179 transitions. Second operand 11 states. [2018-06-22 11:58:56,360 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:56,360 INFO ]: Finished difference Result 127 states and 288 transitions. [2018-06-22 11:58:56,363 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:58:56,363 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:58:56,363 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:56,364 INFO ]: With dead ends: 127 [2018-06-22 11:58:56,364 INFO ]: Without dead ends: 112 [2018-06-22 11:58:56,364 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:58:56,365 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:58:56,375 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 74. [2018-06-22 11:58:56,375 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 11:58:56,375 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 163 transitions. [2018-06-22 11:58:56,375 INFO ]: Start accepts. Automaton has 74 states and 163 transitions. Word has length 17 [2018-06-22 11:58:56,375 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:56,375 INFO ]: Abstraction has 74 states and 163 transitions. [2018-06-22 11:58:56,375 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:58:56,375 INFO ]: Start isEmpty. Operand 74 states and 163 transitions. [2018-06-22 11:58:56,376 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:56,376 INFO ]: Found error trace [2018-06-22 11:58:56,376 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:56,376 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:56,376 INFO ]: Analyzing trace with hash -2014295529, now seen corresponding path program 1 times [2018-06-22 11:58:56,376 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:56,376 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:56,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:56,377 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:56,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:56,398 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:57,026 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:58:57,026 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:57,026 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:58:57,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:57,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:57,047 INFO ]: Computing forward predicates... [2018-06-22 11:58:57,144 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:58:57,163 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:57,163 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:58:57,163 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:58:57,163 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:58:57,163 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:58:57,163 INFO ]: Start difference. First operand 74 states and 163 transitions. Second operand 11 states. [2018-06-22 11:58:57,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:57,391 INFO ]: Finished difference Result 120 states and 268 transitions. [2018-06-22 11:58:57,392 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:58:57,392 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:58:57,392 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:57,393 INFO ]: With dead ends: 120 [2018-06-22 11:58:57,393 INFO ]: Without dead ends: 105 [2018-06-22 11:58:57,393 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:58:57,393 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-22 11:58:57,397 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 69. [2018-06-22 11:58:57,398 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:58:57,398 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 145 transitions. [2018-06-22 11:58:57,398 INFO ]: Start accepts. Automaton has 69 states and 145 transitions. Word has length 17 [2018-06-22 11:58:57,398 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:57,398 INFO ]: Abstraction has 69 states and 145 transitions. [2018-06-22 11:58:57,398 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:58:57,398 INFO ]: Start isEmpty. Operand 69 states and 145 transitions. [2018-06-22 11:58:57,400 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:57,400 INFO ]: Found error trace [2018-06-22 11:58:57,400 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:57,400 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:57,400 INFO ]: Analyzing trace with hash -1391421398, now seen corresponding path program 1 times [2018-06-22 11:58:57,400 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:57,400 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:57,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:57,400 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:57,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:57,404 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:57,649 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:58:57,649 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:57,649 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:58:57,654 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:57,682 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:57,684 INFO ]: Computing forward predicates... [2018-06-22 11:58:58,009 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:58:58,028 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:58,028 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:58:58,029 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:58:58,029 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:58:58,029 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:58:58,029 INFO ]: Start difference. First operand 69 states and 145 transitions. Second operand 8 states. [2018-06-22 11:58:58,388 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:58,388 INFO ]: Finished difference Result 119 states and 230 transitions. [2018-06-22 11:58:58,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:58:58,388 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:58:58,388 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:58,389 INFO ]: With dead ends: 119 [2018-06-22 11:58:58,389 INFO ]: Without dead ends: 109 [2018-06-22 11:58:58,389 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:58:58,389 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-22 11:58:58,393 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 77. [2018-06-22 11:58:58,393 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:58:58,394 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 154 transitions. [2018-06-22 11:58:58,394 INFO ]: Start accepts. Automaton has 77 states and 154 transitions. Word has length 17 [2018-06-22 11:58:58,394 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:58,394 INFO ]: Abstraction has 77 states and 154 transitions. [2018-06-22 11:58:58,394 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:58:58,394 INFO ]: Start isEmpty. Operand 77 states and 154 transitions. [2018-06-22 11:58:58,395 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:58,396 INFO ]: Found error trace [2018-06-22 11:58:58,396 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:58,398 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:58,398 INFO ]: Analyzing trace with hash 1296321417, now seen corresponding path program 1 times [2018-06-22 11:58:58,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:58,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:58,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:58,399 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:58,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:58,405 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:58,532 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:58:58,532 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:58,532 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:58:58,533 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:58,533 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:58,533 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:58,533 INFO ]: Start difference. First operand 77 states and 154 transitions. Second operand 4 states. [2018-06-22 11:58:58,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:58,629 INFO ]: Finished difference Result 95 states and 195 transitions. [2018-06-22 11:58:58,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:58:58,630 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:58:58,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:58,630 INFO ]: With dead ends: 95 [2018-06-22 11:58:58,630 INFO ]: Without dead ends: 95 [2018-06-22 11:58:58,630 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:58,630 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 11:58:58,634 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 79. [2018-06-22 11:58:58,634 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:58:58,635 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 161 transitions. [2018-06-22 11:58:58,635 INFO ]: Start accepts. Automaton has 79 states and 161 transitions. Word has length 17 [2018-06-22 11:58:58,635 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:58,635 INFO ]: Abstraction has 79 states and 161 transitions. [2018-06-22 11:58:58,635 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:58,635 INFO ]: Start isEmpty. Operand 79 states and 161 transitions. [2018-06-22 11:58:58,637 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:58,637 INFO ]: Found error trace [2018-06-22 11:58:58,637 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:58,637 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:58,637 INFO ]: Analyzing trace with hash -850119691, now seen corresponding path program 1 times [2018-06-22 11:58:58,637 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:58,637 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:58,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:58,638 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:58,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:58,644 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:58,714 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:58:58,714 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:58,714 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:58:58,720 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:58,730 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:58,731 INFO ]: Computing forward predicates... [2018-06-22 11:58:58,775 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:58:58,796 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:58,796 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:58:58,796 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:58:58,796 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:58:58,796 INFO ]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:58:58,796 INFO ]: Start difference. First operand 79 states and 161 transitions. Second operand 11 states. [2018-06-22 11:58:59,136 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:59,136 INFO ]: Finished difference Result 129 states and 260 transitions. [2018-06-22 11:58:59,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:58:59,136 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:58:59,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:59,137 INFO ]: With dead ends: 129 [2018-06-22 11:58:59,137 INFO ]: Without dead ends: 116 [2018-06-22 11:58:59,137 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:58:59,137 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-22 11:58:59,143 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 78. [2018-06-22 11:58:59,143 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 11:58:59,144 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 158 transitions. [2018-06-22 11:58:59,144 INFO ]: Start accepts. Automaton has 78 states and 158 transitions. Word has length 17 [2018-06-22 11:58:59,144 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:59,144 INFO ]: Abstraction has 78 states and 158 transitions. [2018-06-22 11:58:59,144 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:58:59,144 INFO ]: Start isEmpty. Operand 78 states and 158 transitions. [2018-06-22 11:58:59,145 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:59,145 INFO ]: Found error trace [2018-06-22 11:58:59,145 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:59,145 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:59,145 INFO ]: Analyzing trace with hash 217888163, now seen corresponding path program 1 times [2018-06-22 11:58:59,145 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:59,145 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:59,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:59,155 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:59,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:59,159 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:59,292 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:58:59,292 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:59,292 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:58:59,292 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:59,292 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:59,292 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:59,292 INFO ]: Start difference. First operand 78 states and 158 transitions. Second operand 4 states. [2018-06-22 11:58:59,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:59,660 INFO ]: Finished difference Result 94 states and 185 transitions. [2018-06-22 11:58:59,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:58:59,660 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:58:59,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:59,660 INFO ]: With dead ends: 94 [2018-06-22 11:58:59,660 INFO ]: Without dead ends: 94 [2018-06-22 11:58:59,661 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:59,661 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 11:58:59,664 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 80. [2018-06-22 11:58:59,664 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 11:58:59,665 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 166 transitions. [2018-06-22 11:58:59,665 INFO ]: Start accepts. Automaton has 80 states and 166 transitions. Word has length 17 [2018-06-22 11:58:59,665 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:59,665 INFO ]: Abstraction has 80 states and 166 transitions. [2018-06-22 11:58:59,665 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:59,665 INFO ]: Start isEmpty. Operand 80 states and 166 transitions. [2018-06-22 11:58:59,666 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:59,666 INFO ]: Found error trace [2018-06-22 11:58:59,666 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:59,666 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:59,666 INFO ]: Analyzing trace with hash 224143403, now seen corresponding path program 1 times [2018-06-22 11:58:59,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:59,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:59,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:59,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:59,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:59,670 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:59,721 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:58:59,721 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:59,721 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:58:59,721 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:59,721 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:59,721 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:59,721 INFO ]: Start difference. First operand 80 states and 166 transitions. Second operand 4 states. [2018-06-22 11:58:59,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:59,747 INFO ]: Finished difference Result 94 states and 179 transitions. [2018-06-22 11:58:59,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:58:59,748 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:58:59,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:59,748 INFO ]: With dead ends: 94 [2018-06-22 11:58:59,748 INFO ]: Without dead ends: 92 [2018-06-22 11:58:59,748 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:59,748 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-22 11:58:59,750 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 78. [2018-06-22 11:58:59,750 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 11:58:59,751 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 158 transitions. [2018-06-22 11:58:59,751 INFO ]: Start accepts. Automaton has 78 states and 158 transitions. Word has length 17 [2018-06-22 11:58:59,751 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:59,751 INFO ]: Abstraction has 78 states and 158 transitions. [2018-06-22 11:58:59,751 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:59,751 INFO ]: Start isEmpty. Operand 78 states and 158 transitions. [2018-06-22 11:58:59,751 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:59,751 INFO ]: Found error trace [2018-06-22 11:58:59,751 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:59,751 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:59,751 INFO ]: Analyzing trace with hash 314056147, now seen corresponding path program 1 times [2018-06-22 11:58:59,752 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:59,752 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:59,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:59,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:59,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:59,756 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:59,823 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:58:59,823 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:59,823 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:58:59,829 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:59,852 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:59,854 INFO ]: Computing forward predicates... [2018-06-22 11:59:01,533 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:59:01,565 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:01,565 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:59:01,565 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:59:01,565 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:59:01,565 INFO ]: CoverageRelationStatistics Valid=22, Invalid=87, Unknown=1, NotChecked=0, Total=110 [2018-06-22 11:59:01,565 INFO ]: Start difference. First operand 78 states and 158 transitions. Second operand 11 states. [2018-06-22 11:59:17,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:17,999 INFO ]: Finished difference Result 123 states and 214 transitions. [2018-06-22 11:59:17,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:59:17,999 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:59:17,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:17,999 INFO ]: With dead ends: 123 [2018-06-22 11:59:17,999 INFO ]: Without dead ends: 88 [2018-06-22 11:59:18,000 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=119, Invalid=296, Unknown=5, NotChecked=0, Total=420 [2018-06-22 11:59:18,000 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 11:59:18,004 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 72. [2018-06-22 11:59:18,004 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:59:18,005 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 137 transitions. [2018-06-22 11:59:18,005 INFO ]: Start accepts. Automaton has 72 states and 137 transitions. Word has length 17 [2018-06-22 11:59:18,005 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:18,005 INFO ]: Abstraction has 72 states and 137 transitions. [2018-06-22 11:59:18,005 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:59:18,005 INFO ]: Start isEmpty. Operand 72 states and 137 transitions. [2018-06-22 11:59:18,006 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:59:18,006 INFO ]: Found error trace [2018-06-22 11:59:18,006 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:18,006 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:18,006 INFO ]: Analyzing trace with hash 1478231985, now seen corresponding path program 1 times [2018-06-22 11:59:18,006 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:18,006 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:18,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:18,008 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:18,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:18,012 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:18,100 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:59:18,100 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:18,100 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:59:18,106 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:18,116 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:18,117 INFO ]: Computing forward predicates... [2018-06-22 11:59:20,247 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:59:20,268 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:20,268 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2018-06-22 11:59:20,268 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:59:20,268 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:59:20,268 INFO ]: CoverageRelationStatistics Valid=16, Invalid=55, Unknown=1, NotChecked=0, Total=72 [2018-06-22 11:59:20,269 INFO ]: Start difference. First operand 72 states and 137 transitions. Second operand 9 states. [2018-06-22 11:59:25,055 WARN ]: Spent 400.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-06-22 11:59:30,258 WARN ]: Spent 2.06 s on a formula simplification. DAG size of input: 34 DAG size of output: 24 [2018-06-22 11:59:34,520 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:34,520 INFO ]: Finished difference Result 102 states and 176 transitions. [2018-06-22 11:59:34,520 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:59:34,520 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:59:34,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:34,521 INFO ]: With dead ends: 102 [2018-06-22 11:59:34,521 INFO ]: Without dead ends: 77 [2018-06-22 11:59:34,521 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=50, Invalid=130, Unknown=2, NotChecked=0, Total=182 [2018-06-22 11:59:34,521 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 11:59:34,524 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-06-22 11:59:34,524 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:59:34,524 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 120 transitions. [2018-06-22 11:59:34,525 INFO ]: Start accepts. Automaton has 65 states and 120 transitions. Word has length 17 [2018-06-22 11:59:34,525 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:34,525 INFO ]: Abstraction has 65 states and 120 transitions. [2018-06-22 11:59:34,525 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:59:34,525 INFO ]: Start isEmpty. Operand 65 states and 120 transitions. [2018-06-22 11:59:34,525 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:59:34,525 INFO ]: Found error trace [2018-06-22 11:59:34,525 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:34,525 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:34,526 INFO ]: Analyzing trace with hash -1669007363, now seen corresponding path program 1 times [2018-06-22 11:59:34,526 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:34,526 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:34,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:34,526 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:34,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:34,554 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:34,605 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:59:34,605 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:34,605 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:59:34,610 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:34,624 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:34,626 INFO ]: Computing forward predicates... [2018-06-22 11:59:37,478 INFO ]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:59:37,497 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:37,497 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:59:37,497 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:59:37,497 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:59:37,497 INFO ]: CoverageRelationStatistics Valid=22, Invalid=87, Unknown=1, NotChecked=0, Total=110 [2018-06-22 11:59:37,497 INFO ]: Start difference. First operand 65 states and 120 transitions. Second operand 11 states. Received shutdown request... [2018-06-22 11:59:37,570 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:59:37,571 WARN ]: Verification canceled [2018-06-22 11:59:37,577 WARN ]: Timeout [2018-06-22 11:59:37,577 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:59:37 BoogieIcfgContainer [2018-06-22 11:59:37,577 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:59:37,579 INFO ]: Toolchain (without parser) took 65151.01 ms. Allocated memory was 308.8 MB in the beginning and 488.1 MB in the end (delta: 179.3 MB). Free memory was 253.2 MB in the beginning and 307.9 MB in the end (delta: -54.6 MB). Peak memory consumption was 124.7 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:37,579 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:59:37,580 INFO ]: ChcToBoogie took 53.88 ms. Allocated memory is still 308.8 MB. Free memory was 253.2 MB in the beginning and 251.2 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:59:37,580 INFO ]: Boogie Preprocessor took 62.01 ms. Allocated memory is still 308.8 MB. Free memory was 251.2 MB in the beginning and 249.2 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:59:37,580 INFO ]: RCFGBuilder took 788.25 ms. Allocated memory is still 308.8 MB. Free memory was 249.2 MB in the beginning and 228.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:37,581 INFO ]: TraceAbstraction took 64228.27 ms. Allocated memory was 308.8 MB in the beginning and 488.1 MB in the end (delta: 179.3 MB). Free memory was 227.2 MB in the beginning and 307.9 MB in the end (delta: -80.6 MB). Peak memory consumption was 98.7 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:37,588 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 53.88 ms. Allocated memory is still 308.8 MB. Free memory was 253.2 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 62.01 ms. Allocated memory is still 308.8 MB. Free memory was 251.2 MB in the beginning and 249.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 788.25 ms. Allocated memory is still 308.8 MB. Free memory was 249.2 MB in the beginning and 228.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 64228.27 ms. Allocated memory was 308.8 MB in the beginning and 488.1 MB in the end (delta: 179.3 MB). Free memory was 227.2 MB in the beginning and 307.9 MB in the end (delta: -80.6 MB). Peak memory consumption was 98.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 (65states) and interpolant automaton (currently 2 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (3 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. TIMEOUT Result, 64.1s OverallTime, 30 OverallIterations, 4 TraceHistogramMax, 48.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1999 SDtfs, 248 SDslu, 2121 SDs, 0 SdLazy, 9658 SolverSat, 1256 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 32.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 489 GetRequests, 252 SyntacticMatches, 22 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 26.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=13, 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.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 600 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 734 NumberOfCodeBlocks, 734 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 688 ConstructedInterpolants, 16 QuantifiedInterpolants, 39576 SizeOfPredicates, 70 NumberOfNonLiveVariables, 1482 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 46 InterpolantComputations, 14 PerfectInterpolantSequences, 243/353 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/loop__digits10_inl.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-59-37-599.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__digits10_inl.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-59-37-599.csv Completed graceful shutdown