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/arrays/libc__strpbrk_2.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:46:24,405 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:46:24,407 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:46:24,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:46:24,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:46:24,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:46:24,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:46:24,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:46:24,426 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:46:24,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:46:24,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:46:24,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:46:24,429 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:46:24,430 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:46:24,431 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:46:24,431 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:46:24,433 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:46:24,435 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:46:24,436 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:46:24,445 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:46:24,447 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:46:24,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:46:24,454 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:46:24,454 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:46:24,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:46:24,456 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:46:24,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:46:24,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:46:24,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:46:24,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:46:24,460 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:46:24,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:46:24,461 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:46:24,466 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:46:24,467 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:46:24,467 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:46:24,484 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:46:24,484 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:46:24,485 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:46:24,485 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:46:24,486 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:46:24,486 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:46:24,486 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:46:24,487 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:46:24,487 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:46:24,487 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:46:24,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:46:24,487 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:46:24,488 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:46:24,488 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:46:24,488 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:46:24,488 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:46:24,488 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:46:24,488 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:46:24,489 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:46:24,491 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:46:24,491 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:46:24,545 INFO ]: Repository-Root is: /tmp [2018-06-22 11:46:24,562 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:46:24,568 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:46:24,570 INFO ]: Initializing SmtParser... [2018-06-22 11:46:24,570 INFO ]: SmtParser initialized [2018-06-22 11:46:24,571 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__strpbrk_2.array.smt2 [2018-06-22 11:46:24,572 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:46:24,664 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strpbrk_2.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@725d871c [2018-06-22 11:46:24,877 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strpbrk_2.array.smt2 [2018-06-22 11:46:24,882 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:46:24,888 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:46:24,889 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:46:24,889 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:46:24,889 INFO ]: ChcToBoogie initialized [2018-06-22 11:46:24,892 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,948 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24 Unit [2018-06-22 11:46:24,948 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:46:24,948 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:46:24,948 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:46:24,948 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:46:24,970 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,970 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,982 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,982 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,986 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,992 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,993 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,995 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:46:24,995 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:46:24,995 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:46:24,995 INFO ]: RCFGBuilder initialized [2018-06-22 11:46:24,996 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:46:25,006 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:46:25,006 INFO ]: Found specification of procedure False [2018-06-22 11:46:25,006 INFO ]: Found implementation of procedure False [2018-06-22 11:46:25,006 INFO ]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration [2018-06-22 11:46:25,006 INFO ]: Found specification of procedure INV_MAIN_1 [2018-06-22 11:46:25,006 INFO ]: Found implementation of procedure INV_MAIN_1 [2018-06-22 11:46:25,006 INFO ]: Specification and implementation of procedure INV_MAIN_0 given in one single declaration [2018-06-22 11:46:25,006 INFO ]: Found specification of procedure INV_MAIN_0 [2018-06-22 11:46:25,006 INFO ]: Found implementation of procedure INV_MAIN_0 [2018-06-22 11:46:25,007 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:46:25,007 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:46:25,007 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:46:25,336 INFO ]: Using library mode [2018-06-22 11:46:25,337 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:46:25 BoogieIcfgContainer [2018-06-22 11:46:25,337 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:46:25,338 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:46:25,338 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:46:25,341 INFO ]: TraceAbstraction initialized [2018-06-22 11:46:25,341 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:46:24" (1/3) ... [2018-06-22 11:46:25,342 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7363a998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:46:25, skipping insertion in model container [2018-06-22 11:46:25,342 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (2/3) ... [2018-06-22 11:46:25,342 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7363a998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:46:25, skipping insertion in model container [2018-06-22 11:46:25,342 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:46:25" (3/3) ... [2018-06-22 11:46:25,344 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:46:25,352 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:46:25,358 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:46:25,390 INFO ]: Using default assertion order modulation [2018-06-22 11:46:25,390 INFO ]: Interprodecural is true [2018-06-22 11:46:25,390 INFO ]: Hoare is false [2018-06-22 11:46:25,390 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:46:25,390 INFO ]: Backedges is TWOTRACK [2018-06-22 11:46:25,390 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:46:25,390 INFO ]: Difference is false [2018-06-22 11:46:25,390 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:46:25,390 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:46:25,405 INFO ]: Start isEmpty. Operand 25 states. [2018-06-22 11:46:25,418 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:46:25,419 INFO ]: Found error trace [2018-06-22 11:46:25,419 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:25,420 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:25,426 INFO ]: Analyzing trace with hash 1105577094, now seen corresponding path program 1 times [2018-06-22 11:46:25,428 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:25,428 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:25,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:25,460 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:25,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:25,492 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:25,564 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:46:25,566 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:25,566 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:25,567 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:25,577 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:25,577 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:25,579 INFO ]: Start difference. First operand 25 states. Second operand 4 states. [2018-06-22 11:46:25,714 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:25,715 INFO ]: Finished difference Result 27 states and 46 transitions. [2018-06-22 11:46:25,715 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:46:25,716 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:46:25,717 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:25,731 INFO ]: With dead ends: 27 [2018-06-22 11:46:25,731 INFO ]: Without dead ends: 27 [2018-06-22 11:46:25,733 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:46:25,749 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:46:25,774 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:46:25,777 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:46:25,778 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2018-06-22 11:46:25,779 INFO ]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 9 [2018-06-22 11:46:25,781 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:25,781 INFO ]: Abstraction has 25 states and 44 transitions. [2018-06-22 11:46:25,781 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:25,781 INFO ]: Start isEmpty. Operand 25 states and 44 transitions. [2018-06-22 11:46:25,783 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:46:25,783 INFO ]: Found error trace [2018-06-22 11:46:25,783 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:25,783 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:25,783 INFO ]: Analyzing trace with hash -297007691, now seen corresponding path program 1 times [2018-06-22 11:46:25,783 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:25,783 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:25,784 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:25,784 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:25,784 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:25,789 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:25,862 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:46:25,862 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:25,862 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:25,863 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:25,864 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:25,864 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:25,864 INFO ]: Start difference. First operand 25 states and 44 transitions. Second operand 4 states. [2018-06-22 11:46:25,941 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:25,941 INFO ]: Finished difference Result 27 states and 44 transitions. [2018-06-22 11:46:25,941 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:46:25,941 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:46:25,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:25,942 INFO ]: With dead ends: 27 [2018-06-22 11:46:25,942 INFO ]: Without dead ends: 27 [2018-06-22 11:46:25,943 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:46:25,943 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:46:25,949 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:46:25,949 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:46:25,950 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2018-06-22 11:46:25,950 INFO ]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 9 [2018-06-22 11:46:25,951 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:25,951 INFO ]: Abstraction has 25 states and 42 transitions. [2018-06-22 11:46:25,951 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:25,951 INFO ]: Start isEmpty. Operand 25 states and 42 transitions. [2018-06-22 11:46:25,952 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:25,952 INFO ]: Found error trace [2018-06-22 11:46:25,952 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:25,952 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:25,952 INFO ]: Analyzing trace with hash 1389966179, now seen corresponding path program 1 times [2018-06-22 11:46:25,953 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:25,953 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:25,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:25,956 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:25,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:25,988 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:26,370 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:46:26,370 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:26,370 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:46:26,370 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:46:26,370 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:46:26,370 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:26,371 INFO ]: Start difference. First operand 25 states and 42 transitions. Second operand 6 states. [2018-06-22 11:46:26,835 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:26,835 INFO ]: Finished difference Result 31 states and 59 transitions. [2018-06-22 11:46:26,836 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:26,836 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:46:26,836 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:26,837 INFO ]: With dead ends: 31 [2018-06-22 11:46:26,837 INFO ]: Without dead ends: 31 [2018-06-22 11:46:26,838 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:26,838 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:46:26,846 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:46:26,846 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:46:26,847 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 49 transitions. [2018-06-22 11:46:26,847 INFO ]: Start accepts. Automaton has 27 states and 49 transitions. Word has length 13 [2018-06-22 11:46:26,848 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:26,848 INFO ]: Abstraction has 27 states and 49 transitions. [2018-06-22 11:46:26,848 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:46:26,848 INFO ]: Start isEmpty. Operand 27 states and 49 transitions. [2018-06-22 11:46:26,849 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:26,849 INFO ]: Found error trace [2018-06-22 11:46:26,849 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:26,849 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:26,849 INFO ]: Analyzing trace with hash 1645320210, now seen corresponding path program 1 times [2018-06-22 11:46:26,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:26,850 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:26,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:26,850 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:26,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:26,858 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:26,935 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:46:26,935 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:26,935 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:46:26,935 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:46:26,935 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:46:26,935 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:26,936 INFO ]: Start difference. First operand 27 states and 49 transitions. Second operand 5 states. [2018-06-22 11:46:27,082 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:27,082 INFO ]: Finished difference Result 31 states and 57 transitions. [2018-06-22 11:46:27,082 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:46:27,083 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:46:27,083 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:27,084 INFO ]: With dead ends: 31 [2018-06-22 11:46:27,084 INFO ]: Without dead ends: 31 [2018-06-22 11:46:27,084 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:27,084 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:46:27,090 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:46:27,090 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:46:27,091 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions. [2018-06-22 11:46:27,092 INFO ]: Start accepts. Automaton has 29 states and 55 transitions. Word has length 13 [2018-06-22 11:46:27,092 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:27,092 INFO ]: Abstraction has 29 states and 55 transitions. [2018-06-22 11:46:27,092 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:46:27,092 INFO ]: Start isEmpty. Operand 29 states and 55 transitions. [2018-06-22 11:46:27,093 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:27,093 INFO ]: Found error trace [2018-06-22 11:46:27,093 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:27,093 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:27,093 INFO ]: Analyzing trace with hash -1303109331, now seen corresponding path program 1 times [2018-06-22 11:46:27,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:27,093 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:27,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:27,094 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:27,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:27,104 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:27,446 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:46:27,446 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:27,446 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:46:27,447 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:46:27,447 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:46:27,447 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:27,447 INFO ]: Start difference. First operand 29 states and 55 transitions. Second operand 6 states. [2018-06-22 11:46:27,773 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:27,773 INFO ]: Finished difference Result 35 states and 71 transitions. [2018-06-22 11:46:27,774 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:27,774 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:46:27,774 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:27,775 INFO ]: With dead ends: 35 [2018-06-22 11:46:27,775 INFO ]: Without dead ends: 35 [2018-06-22 11:46:27,775 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:27,775 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:46:27,784 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-22 11:46:27,784 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:46:27,785 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 54 transitions. [2018-06-22 11:46:27,785 INFO ]: Start accepts. Automaton has 29 states and 54 transitions. Word has length 13 [2018-06-22 11:46:27,785 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:27,785 INFO ]: Abstraction has 29 states and 54 transitions. [2018-06-22 11:46:27,786 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:46:27,786 INFO ]: Start isEmpty. Operand 29 states and 54 transitions. [2018-06-22 11:46:27,787 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:27,787 INFO ]: Found error trace [2018-06-22 11:46:27,787 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:27,787 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:27,787 INFO ]: Analyzing trace with hash -1931675124, now seen corresponding path program 1 times [2018-06-22 11:46:27,788 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:27,788 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:27,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:27,788 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:27,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:27,796 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:27,870 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:46:27,870 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:27,870 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:46:27,871 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:46:27,871 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:46:27,871 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:27,871 INFO ]: Start difference. First operand 29 states and 54 transitions. Second operand 5 states. [2018-06-22 11:46:27,954 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:27,954 INFO ]: Finished difference Result 29 states and 53 transitions. [2018-06-22 11:46:27,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:46:27,955 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:46:27,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:27,956 INFO ]: With dead ends: 29 [2018-06-22 11:46:27,956 INFO ]: Without dead ends: 28 [2018-06-22 11:46:27,956 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:27,956 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:46:27,960 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 11:46:27,960 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:46:27,961 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 51 transitions. [2018-06-22 11:46:27,961 INFO ]: Start accepts. Automaton has 28 states and 51 transitions. Word has length 17 [2018-06-22 11:46:27,962 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:27,962 INFO ]: Abstraction has 28 states and 51 transitions. [2018-06-22 11:46:27,962 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:46:27,962 INFO ]: Start isEmpty. Operand 28 states and 51 transitions. [2018-06-22 11:46:27,963 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:27,963 INFO ]: Found error trace [2018-06-22 11:46:27,963 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:27,963 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:27,963 INFO ]: Analyzing trace with hash 1657299154, now seen corresponding path program 1 times [2018-06-22 11:46:27,963 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:27,963 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:27,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:27,964 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:27,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:27,975 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:28,159 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:46:28,160 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:28,160 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:46:28,160 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:28,160 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:28,160 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:28,160 INFO ]: Start difference. First operand 28 states and 51 transitions. Second operand 7 states. [2018-06-22 11:46:28,403 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:28,404 INFO ]: Finished difference Result 40 states and 89 transitions. [2018-06-22 11:46:28,404 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:28,404 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:46:28,404 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:28,406 INFO ]: With dead ends: 40 [2018-06-22 11:46:28,406 INFO ]: Without dead ends: 40 [2018-06-22 11:46:28,406 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:46:28,406 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:46:28,414 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 30. [2018-06-22 11:46:28,414 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:46:28,415 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 57 transitions. [2018-06-22 11:46:28,415 INFO ]: Start accepts. Automaton has 30 states and 57 transitions. Word has length 17 [2018-06-22 11:46:28,415 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:28,416 INFO ]: Abstraction has 30 states and 57 transitions. [2018-06-22 11:46:28,416 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:28,416 INFO ]: Start isEmpty. Operand 30 states and 57 transitions. [2018-06-22 11:46:28,417 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:28,417 INFO ]: Found error trace [2018-06-22 11:46:28,417 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:28,417 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:28,417 INFO ]: Analyzing trace with hash 732314524, now seen corresponding path program 1 times [2018-06-22 11:46:28,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:28,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:28,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:28,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:28,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:28,427 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:28,523 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:46:28,523 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:28,523 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:46:28,524 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:28,524 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:28,524 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:28,524 INFO ]: Start difference. First operand 30 states and 57 transitions. Second operand 7 states. [2018-06-22 11:46:28,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:28,864 INFO ]: Finished difference Result 40 states and 88 transitions. [2018-06-22 11:46:28,866 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:28,866 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:46:28,866 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:28,867 INFO ]: With dead ends: 40 [2018-06-22 11:46:28,867 INFO ]: Without dead ends: 40 [2018-06-22 11:46:28,868 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:46:28,868 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:46:28,875 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 28. [2018-06-22 11:46:28,875 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:46:28,876 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 51 transitions. [2018-06-22 11:46:28,876 INFO ]: Start accepts. Automaton has 28 states and 51 transitions. Word has length 17 [2018-06-22 11:46:28,876 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:28,876 INFO ]: Abstraction has 28 states and 51 transitions. [2018-06-22 11:46:28,876 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:28,876 INFO ]: Start isEmpty. Operand 28 states and 51 transitions. [2018-06-22 11:46:28,878 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:28,878 INFO ]: Found error trace [2018-06-22 11:46:28,878 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:28,878 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:28,878 INFO ]: Analyzing trace with hash 975815227, now seen corresponding path program 1 times [2018-06-22 11:46:28,878 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:28,878 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:28,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:28,879 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:28,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:28,886 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:28,950 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:46:28,950 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:28,950 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:46:28,950 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:46:28,950 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:46:28,950 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:28,950 INFO ]: Start difference. First operand 28 states and 51 transitions. Second operand 6 states. [2018-06-22 11:46:29,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:29,052 INFO ]: Finished difference Result 28 states and 49 transitions. [2018-06-22 11:46:29,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:29,053 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:46:29,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:29,053 INFO ]: With dead ends: 28 [2018-06-22 11:46:29,053 INFO ]: Without dead ends: 26 [2018-06-22 11:46:29,054 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:29,054 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:46:29,057 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 11:46:29,057 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:46:29,058 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2018-06-22 11:46:29,058 INFO ]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 17 [2018-06-22 11:46:29,058 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:29,058 INFO ]: Abstraction has 26 states and 45 transitions. [2018-06-22 11:46:29,058 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:46:29,058 INFO ]: Start isEmpty. Operand 26 states and 45 transitions. [2018-06-22 11:46:29,059 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:29,059 INFO ]: Found error trace [2018-06-22 11:46:29,059 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:29,059 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:29,059 INFO ]: Analyzing trace with hash 1969940983, now seen corresponding path program 1 times [2018-06-22 11:46:29,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:29,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:29,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:29,060 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:29,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:29,070 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:29,147 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:46:29,147 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:29,147 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:46:29,155 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:29,170 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:29,178 INFO ]: Computing forward predicates... [2018-06-22 11:46:29,315 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:46:29,335 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:29,335 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:46:29,335 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:46:29,335 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:46:29,335 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:29,336 INFO ]: Start difference. First operand 26 states and 45 transitions. Second operand 10 states. [2018-06-22 11:46:29,823 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:29,823 INFO ]: Finished difference Result 40 states and 88 transitions. [2018-06-22 11:46:29,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:29,824 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:46:29,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:29,824 INFO ]: With dead ends: 40 [2018-06-22 11:46:29,824 INFO ]: Without dead ends: 40 [2018-06-22 11:46:29,825 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:46:29,825 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:46:29,832 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 30. [2018-06-22 11:46:29,832 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:46:29,832 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2018-06-22 11:46:29,832 INFO ]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 17 [2018-06-22 11:46:29,832 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:29,832 INFO ]: Abstraction has 30 states and 56 transitions. [2018-06-22 11:46:29,832 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:46:29,833 INFO ]: Start isEmpty. Operand 30 states and 56 transitions. [2018-06-22 11:46:29,833 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:29,833 INFO ]: Found error trace [2018-06-22 11:46:29,833 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:29,833 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:29,834 INFO ]: Analyzing trace with hash -1400041683, now seen corresponding path program 1 times [2018-06-22 11:46:29,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:29,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:29,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:29,834 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:29,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:29,844 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:29,918 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:46:29,918 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:29,931 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:46:29,939 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:29,964 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:29,966 INFO ]: Computing forward predicates... [2018-06-22 11:46:30,055 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:46:30,075 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:30,075 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:46:30,075 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:46:30,075 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:46:30,075 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:30,075 INFO ]: Start difference. First operand 30 states and 56 transitions. Second operand 10 states. [2018-06-22 11:46:30,334 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:30,334 INFO ]: Finished difference Result 40 states and 87 transitions. [2018-06-22 11:46:30,334 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:30,335 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:46:30,335 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:30,336 INFO ]: With dead ends: 40 [2018-06-22 11:46:30,336 INFO ]: Without dead ends: 40 [2018-06-22 11:46:30,336 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:46:30,336 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:46:30,343 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 30. [2018-06-22 11:46:30,343 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:46:30,344 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 55 transitions. [2018-06-22 11:46:30,344 INFO ]: Start accepts. Automaton has 30 states and 55 transitions. Word has length 17 [2018-06-22 11:46:30,344 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:30,344 INFO ]: Abstraction has 30 states and 55 transitions. [2018-06-22 11:46:30,344 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:46:30,344 INFO ]: Start isEmpty. Operand 30 states and 55 transitions. [2018-06-22 11:46:30,345 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:30,345 INFO ]: Found error trace [2018-06-22 11:46:30,345 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:30,345 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:30,345 INFO ]: Analyzing trace with hash -1087399854, now seen corresponding path program 1 times [2018-06-22 11:46:30,345 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:30,345 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:30,346 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:30,346 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:30,346 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:30,356 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:30,437 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:46:30,437 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:30,437 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) [2018-06-22 11:46:30,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:30,475 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:30,477 INFO ]: Computing forward predicates... [2018-06-22 11:46:30,527 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:46:30,548 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:30,549 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:46:30,549 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:46:30,549 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:46:30,549 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:30,549 INFO ]: Start difference. First operand 30 states and 55 transitions. Second operand 10 states. [2018-06-22 11:46:30,784 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:30,784 INFO ]: Finished difference Result 42 states and 94 transitions. [2018-06-22 11:46:30,784 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:46:30,784 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:46:30,785 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:30,785 INFO ]: With dead ends: 42 [2018-06-22 11:46:30,786 INFO ]: Without dead ends: 42 [2018-06-22 11:46:30,786 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:30,786 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:46:30,791 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-06-22 11:46:30,791 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:46:30,792 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. [2018-06-22 11:46:30,792 INFO ]: Start accepts. Automaton has 32 states and 61 transitions. Word has length 17 [2018-06-22 11:46:30,792 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:30,792 INFO ]: Abstraction has 32 states and 61 transitions. [2018-06-22 11:46:30,792 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:46:30,792 INFO ]: Start isEmpty. Operand 32 states and 61 transitions. [2018-06-22 11:46:30,793 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:30,793 INFO ]: Found error trace [2018-06-22 11:46:30,793 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:30,793 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:30,793 INFO ]: Analyzing trace with hash -162415224, now seen corresponding path program 1 times [2018-06-22 11:46:30,793 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:30,793 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:30,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:30,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:30,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:30,807 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:30,870 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:46:30,870 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:30,870 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:46:30,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:30,886 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:30,888 INFO ]: Computing forward predicates... [2018-06-22 11:46:31,028 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:46:31,048 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:31,048 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:46:31,048 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:46:31,049 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:46:31,049 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:31,049 INFO ]: Start difference. First operand 32 states and 61 transitions. Second operand 10 states. [2018-06-22 11:46:31,240 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:31,240 INFO ]: Finished difference Result 42 states and 93 transitions. [2018-06-22 11:46:31,240 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:46:31,240 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:46:31,240 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:31,241 INFO ]: With dead ends: 42 [2018-06-22 11:46:31,241 INFO ]: Without dead ends: 42 [2018-06-22 11:46:31,241 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:31,241 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:46:31,247 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-06-22 11:46:31,247 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:46:31,247 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 60 transitions. [2018-06-22 11:46:31,247 INFO ]: Start accepts. Automaton has 32 states and 60 transitions. Word has length 17 [2018-06-22 11:46:31,247 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:31,247 INFO ]: Abstraction has 32 states and 60 transitions. [2018-06-22 11:46:31,248 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:46:31,248 INFO ]: Start isEmpty. Operand 32 states and 60 transitions. [2018-06-22 11:46:31,248 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:31,248 INFO ]: Found error trace [2018-06-22 11:46:31,248 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:31,249 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:31,249 INFO ]: Analyzing trace with hash -1057523364, now seen corresponding path program 1 times [2018-06-22 11:46:31,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:31,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:31,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:31,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:31,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:31,258 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:31,481 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:46:31,481 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:31,481 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:46:31,486 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:31,499 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:31,502 INFO ]: Computing forward predicates... [2018-06-22 11:46:31,649 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:46:31,669 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:31,669 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2018-06-22 11:46:31,669 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:46:31,669 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:46:31,669 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:46:31,669 INFO ]: Start difference. First operand 32 states and 60 transitions. Second operand 11 states. [2018-06-22 11:46:31,999 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:31,999 INFO ]: Finished difference Result 48 states and 111 transitions. [2018-06-22 11:46:32,000 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:46:32,000 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:46:32,000 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:32,001 INFO ]: With dead ends: 48 [2018-06-22 11:46:32,001 INFO ]: Without dead ends: 48 [2018-06-22 11:46:32,001 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:46:32,001 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:46:32,010 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-06-22 11:46:32,010 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:46:32,010 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 66 transitions. [2018-06-22 11:46:32,010 INFO ]: Start accepts. Automaton has 34 states and 66 transitions. Word has length 21 [2018-06-22 11:46:32,011 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:32,011 INFO ]: Abstraction has 34 states and 66 transitions. [2018-06-22 11:46:32,011 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:46:32,011 INFO ]: Start isEmpty. Operand 34 states and 66 transitions. [2018-06-22 11:46:32,011 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:32,011 INFO ]: Found error trace [2018-06-22 11:46:32,011 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:32,012 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:32,017 INFO ]: Analyzing trace with hash 2113519910, now seen corresponding path program 1 times [2018-06-22 11:46:32,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:32,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:32,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:32,018 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:32,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:32,026 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:32,415 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:46:32,415 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:32,415 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:46:32,420 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:32,440 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:32,443 INFO ]: Computing forward predicates... [2018-06-22 11:46:32,524 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:46:32,544 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:32,544 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2018-06-22 11:46:32,544 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:46:32,545 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:46:32,545 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:46:32,545 INFO ]: Start difference. First operand 34 states and 66 transitions. Second operand 11 states. [2018-06-22 11:46:32,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:32,991 INFO ]: Finished difference Result 48 states and 110 transitions. [2018-06-22 11:46:32,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:46:32,991 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:46:32,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:32,992 INFO ]: With dead ends: 48 [2018-06-22 11:46:32,992 INFO ]: Without dead ends: 48 [2018-06-22 11:46:32,992 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:46:32,992 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:46:32,998 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 32. [2018-06-22 11:46:32,998 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:46:32,999 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 60 transitions. [2018-06-22 11:46:32,999 INFO ]: Start accepts. Automaton has 32 states and 60 transitions. Word has length 21 [2018-06-22 11:46:32,999 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:32,999 INFO ]: Abstraction has 32 states and 60 transitions. [2018-06-22 11:46:32,999 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:46:32,999 INFO ]: Start isEmpty. Operand 32 states and 60 transitions. [2018-06-22 11:46:33,000 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:33,000 INFO ]: Found error trace [2018-06-22 11:46:33,000 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:33,000 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:33,000 INFO ]: Analyzing trace with hash 1015959863, now seen corresponding path program 1 times [2018-06-22 11:46:33,000 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:33,000 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:33,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:33,001 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:33,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:33,020 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:33,149 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:46:33,150 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:33,150 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) [2018-06-22 11:46:33,169 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:33,185 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:33,187 INFO ]: Computing forward predicates... [2018-06-22 11:46:33,344 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:46:33,366 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:33,366 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12 [2018-06-22 11:46:33,366 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:46:33,366 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:46:33,366 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:33,366 INFO ]: Start difference. First operand 32 states and 60 transitions. Second operand 12 states. [2018-06-22 11:46:33,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:33,724 INFO ]: Finished difference Result 52 states and 125 transitions. [2018-06-22 11:46:33,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:46:33,724 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 11:46:33,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:33,725 INFO ]: With dead ends: 52 [2018-06-22 11:46:33,725 INFO ]: Without dead ends: 52 [2018-06-22 11:46:33,725 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:46:33,725 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:46:33,734 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 34. [2018-06-22 11:46:33,734 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:46:33,737 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 66 transitions. [2018-06-22 11:46:33,737 INFO ]: Start accepts. Automaton has 34 states and 66 transitions. Word has length 21 [2018-06-22 11:46:33,737 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:33,737 INFO ]: Abstraction has 34 states and 66 transitions. [2018-06-22 11:46:33,737 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:46:33,737 INFO ]: Start isEmpty. Operand 34 states and 66 transitions. [2018-06-22 11:46:33,738 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:33,738 INFO ]: Found error trace [2018-06-22 11:46:33,738 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:33,738 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:33,738 INFO ]: Analyzing trace with hash -107964159, now seen corresponding path program 1 times [2018-06-22 11:46:33,738 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:33,738 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:33,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:33,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:33,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:33,755 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:33,882 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:46:33,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:33,882 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:46:33,888 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:33,899 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:33,902 INFO ]: Computing forward predicates... [2018-06-22 11:46:33,995 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:46:34,014 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:34,014 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12 [2018-06-22 11:46:34,015 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:46:34,015 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:46:34,015 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:34,015 INFO ]: Start difference. First operand 34 states and 66 transitions. Second operand 12 states. [2018-06-22 11:46:34,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:34,361 INFO ]: Finished difference Result 52 states and 123 transitions. [2018-06-22 11:46:34,363 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:46:34,363 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 11:46:34,363 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:34,364 INFO ]: With dead ends: 52 [2018-06-22 11:46:34,364 INFO ]: Without dead ends: 52 [2018-06-22 11:46:34,364 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:46:34,364 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:46:34,369 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 30. [2018-06-22 11:46:34,370 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:46:34,370 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 55 transitions. [2018-06-22 11:46:34,370 INFO ]: Start accepts. Automaton has 30 states and 55 transitions. Word has length 21 [2018-06-22 11:46:34,370 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:34,370 INFO ]: Abstraction has 30 states and 55 transitions. [2018-06-22 11:46:34,370 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:46:34,370 INFO ]: Start isEmpty. Operand 30 states and 55 transitions. [2018-06-22 11:46:34,371 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:34,371 INFO ]: Found error trace [2018-06-22 11:46:34,371 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:34,371 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:34,371 INFO ]: Analyzing trace with hash -1578406039, now seen corresponding path program 1 times [2018-06-22 11:46:34,371 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:34,371 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:34,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:34,372 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:34,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:34,376 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:34,487 INFO ]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:46:34,487 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:34,487 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:46:34,493 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:34,508 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:34,510 INFO ]: Computing forward predicates... [2018-06-22 11:46:34,524 INFO ]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:46:34,546 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:34,546 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:46:34,546 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:34,546 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:34,546 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:34,546 INFO ]: Start difference. First operand 30 states and 55 transitions. Second operand 7 states. [2018-06-22 11:46:34,676 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:34,676 INFO ]: Finished difference Result 65 states and 137 transitions. [2018-06-22 11:46:34,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:46:34,677 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:46:34,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:34,678 INFO ]: With dead ends: 65 [2018-06-22 11:46:34,678 INFO ]: Without dead ends: 65 [2018-06-22 11:46:34,679 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:46:34,679 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:46:34,685 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 47. [2018-06-22 11:46:34,685 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:46:34,686 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 94 transitions. [2018-06-22 11:46:34,686 INFO ]: Start accepts. Automaton has 47 states and 94 transitions. Word has length 21 [2018-06-22 11:46:34,686 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:34,686 INFO ]: Abstraction has 47 states and 94 transitions. [2018-06-22 11:46:34,686 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:34,687 INFO ]: Start isEmpty. Operand 47 states and 94 transitions. [2018-06-22 11:46:34,688 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:34,688 INFO ]: Found error trace [2018-06-22 11:46:34,688 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:34,688 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:34,688 INFO ]: Analyzing trace with hash -653791103, now seen corresponding path program 2 times [2018-06-22 11:46:34,688 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:34,688 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:34,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:34,689 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:34,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:34,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:34,860 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:46:34,861 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:34,861 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:46:34,866 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:34,879 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:34,879 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:34,881 INFO ]: Computing forward predicates... [2018-06-22 11:46:34,981 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:46:35,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:35,042 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-22 11:46:35,042 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:46:35,042 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:46:35,042 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:46:35,043 INFO ]: Start difference. First operand 47 states and 94 transitions. Second operand 13 states. [2018-06-22 11:46:37,110 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:37,110 INFO ]: Finished difference Result 101 states and 254 transitions. [2018-06-22 11:46:37,111 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:46:37,111 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 11:46:37,111 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:37,113 INFO ]: With dead ends: 101 [2018-06-22 11:46:37,113 INFO ]: Without dead ends: 101 [2018-06-22 11:46:37,113 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:46:37,113 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-22 11:46:37,127 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 53. [2018-06-22 11:46:37,127 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:46:37,128 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 114 transitions. [2018-06-22 11:46:37,128 INFO ]: Start accepts. Automaton has 53 states and 114 transitions. Word has length 21 [2018-06-22 11:46:37,128 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:37,128 INFO ]: Abstraction has 53 states and 114 transitions. [2018-06-22 11:46:37,128 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:46:37,128 INFO ]: Start isEmpty. Operand 53 states and 114 transitions. [2018-06-22 11:46:37,131 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:37,131 INFO ]: Found error trace [2018-06-22 11:46:37,131 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:37,131 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:37,132 INFO ]: Analyzing trace with hash -454878052, now seen corresponding path program 1 times [2018-06-22 11:46:37,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:37,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:37,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:37,132 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:37,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:37,136 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:37,375 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:46:37,375 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:37,375 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:37,375 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:37,375 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:37,375 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:37,375 INFO ]: Start difference. First operand 53 states and 114 transitions. Second operand 4 states. [2018-06-22 11:46:37,790 WARN ]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 11:46:37,907 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:37,907 INFO ]: Finished difference Result 93 states and 212 transitions. [2018-06-22 11:46:37,907 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:46:37,907 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:46:37,907 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:37,909 INFO ]: With dead ends: 93 [2018-06-22 11:46:37,909 INFO ]: Without dead ends: 87 [2018-06-22 11:46:37,909 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:37,909 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 11:46:37,921 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 75. [2018-06-22 11:46:37,921 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:46:37,922 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 175 transitions. [2018-06-22 11:46:37,922 INFO ]: Start accepts. Automaton has 75 states and 175 transitions. Word has length 21 [2018-06-22 11:46:37,922 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:37,922 INFO ]: Abstraction has 75 states and 175 transitions. [2018-06-22 11:46:37,923 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:37,923 INFO ]: Start isEmpty. Operand 75 states and 175 transitions. [2018-06-22 11:46:37,928 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:37,928 INFO ]: Found error trace [2018-06-22 11:46:37,928 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:37,928 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:37,929 INFO ]: Analyzing trace with hash 1419692124, now seen corresponding path program 2 times [2018-06-22 11:46:37,929 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:37,929 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:37,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:37,929 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:37,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:37,942 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:38,385 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:46:38,385 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:38,385 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:46:38,393 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:38,404 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:38,404 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:38,406 INFO ]: Computing forward predicates... [2018-06-22 11:46:38,519 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:46:38,546 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:38,546 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2018-06-22 11:46:38,546 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:46:38,546 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:46:38,546 INFO ]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:46:38,547 INFO ]: Start difference. First operand 75 states and 175 transitions. Second operand 14 states. [2018-06-22 11:46:38,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:38,820 INFO ]: Finished difference Result 111 states and 257 transitions. [2018-06-22 11:46:38,820 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:46:38,820 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:46:38,820 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:38,822 INFO ]: With dead ends: 111 [2018-06-22 11:46:38,822 INFO ]: Without dead ends: 111 [2018-06-22 11:46:38,823 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:46:38,823 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-22 11:46:38,838 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 85. [2018-06-22 11:46:38,838 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-22 11:46:38,840 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 193 transitions. [2018-06-22 11:46:38,840 INFO ]: Start accepts. Automaton has 85 states and 193 transitions. Word has length 21 [2018-06-22 11:46:38,840 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:38,840 INFO ]: Abstraction has 85 states and 193 transitions. [2018-06-22 11:46:38,840 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:46:38,840 INFO ]: Start isEmpty. Operand 85 states and 193 transitions. [2018-06-22 11:46:38,842 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:38,842 INFO ]: Found error trace [2018-06-22 11:46:38,842 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:38,842 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:38,842 INFO ]: Analyzing trace with hash -1751351150, now seen corresponding path program 1 times [2018-06-22 11:46:38,842 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:38,842 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:38,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:38,844 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:38,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:38,853 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:39,122 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:46:39,122 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:39,122 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:46:39,128 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:39,138 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:39,140 INFO ]: Computing forward predicates... [2018-06-22 11:46:39,263 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:46:39,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:39,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2018-06-22 11:46:39,283 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:46:39,283 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:46:39,283 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:46:39,283 INFO ]: Start difference. First operand 85 states and 193 transitions. Second operand 13 states. [2018-06-22 11:46:39,622 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:39,623 INFO ]: Finished difference Result 111 states and 256 transitions. [2018-06-22 11:46:39,624 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:46:39,624 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 11:46:39,624 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:39,625 INFO ]: With dead ends: 111 [2018-06-22 11:46:39,625 INFO ]: Without dead ends: 111 [2018-06-22 11:46:39,626 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:46:39,626 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-22 11:46:39,636 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 83. [2018-06-22 11:46:39,637 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 11:46:39,638 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 190 transitions. [2018-06-22 11:46:39,638 INFO ]: Start accepts. Automaton has 83 states and 190 transitions. Word has length 21 [2018-06-22 11:46:39,638 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:39,638 INFO ]: Abstraction has 83 states and 190 transitions. [2018-06-22 11:46:39,638 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:46:39,638 INFO ]: Start isEmpty. Operand 83 states and 190 transitions. [2018-06-22 11:46:39,639 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:39,639 INFO ]: Found error trace [2018-06-22 11:46:39,639 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:39,640 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:39,640 INFO ]: Analyzing trace with hash 470132919, now seen corresponding path program 2 times [2018-06-22 11:46:39,640 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:39,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:39,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:39,641 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:39,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:39,647 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:39,815 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:46:39,815 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:39,815 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:46:39,833 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:39,845 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:39,845 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:39,847 INFO ]: Computing forward predicates... [2018-06-22 11:46:39,910 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:46:39,929 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:39,929 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-22 11:46:39,930 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:46:39,930 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:46:39,930 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:46:39,930 INFO ]: Start difference. First operand 83 states and 190 transitions. Second operand 13 states. [2018-06-22 11:46:40,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:40,261 INFO ]: Finished difference Result 159 states and 340 transitions. [2018-06-22 11:46:40,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:46:40,261 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 11:46:40,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:40,263 INFO ]: With dead ends: 159 [2018-06-22 11:46:40,263 INFO ]: Without dead ends: 159 [2018-06-22 11:46:40,263 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:46:40,264 INFO ]: Start minimizeSevpa. Operand 159 states. [2018-06-22 11:46:40,282 INFO ]: Finished minimizeSevpa. Reduced states from 159 to 79. [2018-06-22 11:46:40,282 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:46:40,283 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 170 transitions. [2018-06-22 11:46:40,283 INFO ]: Start accepts. Automaton has 79 states and 170 transitions. Word has length 21 [2018-06-22 11:46:40,283 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:40,283 INFO ]: Abstraction has 79 states and 170 transitions. [2018-06-22 11:46:40,283 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:46:40,283 INFO ]: Start isEmpty. Operand 79 states and 170 transitions. [2018-06-22 11:46:40,285 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:40,285 INFO ]: Found error trace [2018-06-22 11:46:40,285 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:40,285 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:40,285 INFO ]: Analyzing trace with hash 1592637235, now seen corresponding path program 1 times [2018-06-22 11:46:40,285 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:40,285 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:40,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:40,286 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:40,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:40,292 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:40,759 INFO ]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:46:40,759 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:40,759 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:46:40,765 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:40,775 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:40,779 INFO ]: Computing forward predicates... [2018-06-22 11:46:40,845 INFO ]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:46:40,863 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:40,864 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-06-22 11:46:40,864 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:46:40,864 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:46:40,864 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:40,864 INFO ]: Start difference. First operand 79 states and 170 transitions. Second operand 12 states. [2018-06-22 11:46:41,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:41,221 INFO ]: Finished difference Result 163 states and 369 transitions. [2018-06-22 11:46:41,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:46:41,221 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 11:46:41,221 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:41,223 INFO ]: With dead ends: 163 [2018-06-22 11:46:41,223 INFO ]: Without dead ends: 154 [2018-06-22 11:46:41,223 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:46:41,223 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-22 11:46:41,239 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 106. [2018-06-22 11:46:41,239 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-22 11:46:41,241 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 245 transitions. [2018-06-22 11:46:41,241 INFO ]: Start accepts. Automaton has 106 states and 245 transitions. Word has length 21 [2018-06-22 11:46:41,241 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:41,241 INFO ]: Abstraction has 106 states and 245 transitions. [2018-06-22 11:46:41,241 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:46:41,241 INFO ]: Start isEmpty. Operand 106 states and 245 transitions. [2018-06-22 11:46:41,243 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:41,243 INFO ]: Found error trace [2018-06-22 11:46:41,243 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:41,243 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:41,244 INFO ]: Analyzing trace with hash 806438300, now seen corresponding path program 2 times [2018-06-22 11:46:41,244 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:41,244 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:41,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:41,244 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:41,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:41,256 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:41,885 INFO ]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:46:41,885 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:41,885 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:46:41,891 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:41,903 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:41,903 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:41,906 INFO ]: Computing forward predicates... [2018-06-22 11:46:42,051 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:46:42,070 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:42,070 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2018-06-22 11:46:42,071 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:46:42,071 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:46:42,071 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:42,071 INFO ]: Start difference. First operand 106 states and 245 transitions. Second operand 15 states. [2018-06-22 11:46:42,498 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:42,498 INFO ]: Finished difference Result 152 states and 350 transitions. [2018-06-22 11:46:42,498 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:46:42,498 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 11:46:42,498 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:42,500 INFO ]: With dead ends: 152 [2018-06-22 11:46:42,500 INFO ]: Without dead ends: 152 [2018-06-22 11:46:42,500 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:46:42,500 INFO ]: Start minimizeSevpa. Operand 152 states. [2018-06-22 11:46:42,514 INFO ]: Finished minimizeSevpa. Reduced states from 152 to 110. [2018-06-22 11:46:42,514 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-22 11:46:42,517 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 250 transitions. [2018-06-22 11:46:42,517 INFO ]: Start accepts. Automaton has 110 states and 250 transitions. Word has length 25 [2018-06-22 11:46:42,517 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:42,517 INFO ]: Abstraction has 110 states and 250 transitions. [2018-06-22 11:46:42,517 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:46:42,517 INFO ]: Start isEmpty. Operand 110 states and 250 transitions. [2018-06-22 11:46:42,519 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:42,519 INFO ]: Found error trace [2018-06-22 11:46:42,519 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:42,519 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:42,519 INFO ]: Analyzing trace with hash 1607565569, now seen corresponding path program 1 times [2018-06-22 11:46:42,519 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:42,519 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:42,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:42,520 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:42,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:42,527 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:42,753 INFO ]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:46:42,753 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:42,753 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:42,754 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:42,754 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:42,754 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:42,754 INFO ]: Start difference. First operand 110 states and 250 transitions. Second operand 4 states. [2018-06-22 11:46:43,077 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:43,077 INFO ]: Finished difference Result 148 states and 334 transitions. [2018-06-22 11:46:43,077 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:46:43,077 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 11:46:43,078 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:43,079 INFO ]: With dead ends: 148 [2018-06-22 11:46:43,079 INFO ]: Without dead ends: 131 [2018-06-22 11:46:43,080 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:43,080 INFO ]: Start minimizeSevpa. Operand 131 states. [2018-06-22 11:46:43,091 INFO ]: Finished minimizeSevpa. Reduced states from 131 to 115. [2018-06-22 11:46:43,091 INFO ]: Start removeUnreachable. Operand 115 states. [2018-06-22 11:46:43,093 INFO ]: Finished removeUnreachable. Reduced from 115 states to 115 states and 260 transitions. [2018-06-22 11:46:43,093 INFO ]: Start accepts. Automaton has 115 states and 260 transitions. Word has length 25 [2018-06-22 11:46:43,093 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:43,093 INFO ]: Abstraction has 115 states and 260 transitions. [2018-06-22 11:46:43,093 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:43,093 INFO ]: Start isEmpty. Operand 115 states and 260 transitions. [2018-06-22 11:46:43,095 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:43,095 INFO ]: Found error trace [2018-06-22 11:46:43,095 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:43,095 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:43,095 INFO ]: Analyzing trace with hash 1866935384, now seen corresponding path program 1 times [2018-06-22 11:46:43,095 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:43,095 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:43,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:43,096 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:43,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:43,103 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:43,214 INFO ]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:46:43,214 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:43,214 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:46:43,222 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:43,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:43,237 INFO ]: Computing forward predicates... [2018-06-22 11:46:43,329 INFO ]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:46:43,348 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:43,348 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:46:43,348 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:46:43,348 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:46:43,348 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:46:43,349 INFO ]: Start difference. First operand 115 states and 260 transitions. Second operand 13 states. [2018-06-22 11:46:44,074 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:44,074 INFO ]: Finished difference Result 284 states and 751 transitions. [2018-06-22 11:46:44,074 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:46:44,074 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 11:46:44,074 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:44,077 INFO ]: With dead ends: 284 [2018-06-22 11:46:44,077 INFO ]: Without dead ends: 242 [2018-06-22 11:46:44,078 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:46:44,078 INFO ]: Start minimizeSevpa. Operand 242 states. [2018-06-22 11:46:44,102 INFO ]: Finished minimizeSevpa. Reduced states from 242 to 186. [2018-06-22 11:46:44,102 INFO ]: Start removeUnreachable. Operand 186 states. [2018-06-22 11:46:44,105 INFO ]: Finished removeUnreachable. Reduced from 186 states to 186 states and 428 transitions. [2018-06-22 11:46:44,105 INFO ]: Start accepts. Automaton has 186 states and 428 transitions. Word has length 25 [2018-06-22 11:46:44,105 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:44,105 INFO ]: Abstraction has 186 states and 428 transitions. [2018-06-22 11:46:44,105 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:46:44,105 INFO ]: Start isEmpty. Operand 186 states and 428 transitions. [2018-06-22 11:46:44,107 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:44,107 INFO ]: Found error trace [2018-06-22 11:46:44,107 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:44,107 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:44,107 INFO ]: Analyzing trace with hash -301761657, now seen corresponding path program 1 times [2018-06-22 11:46:44,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:44,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:44,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:44,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:44,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:44,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:44,203 INFO ]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:46:44,203 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:44,203 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:46:44,203 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:46:44,203 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:46:44,203 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:44,203 INFO ]: Start difference. First operand 186 states and 428 transitions. Second operand 6 states. [2018-06-22 11:46:44,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:44,263 INFO ]: Finished difference Result 186 states and 420 transitions. [2018-06-22 11:46:44,263 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:44,263 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 11:46:44,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:44,265 INFO ]: With dead ends: 186 [2018-06-22 11:46:44,265 INFO ]: Without dead ends: 182 [2018-06-22 11:46:44,265 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:44,265 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-22 11:46:44,277 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 164. [2018-06-22 11:46:44,277 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-22 11:46:44,279 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 363 transitions. [2018-06-22 11:46:44,279 INFO ]: Start accepts. Automaton has 164 states and 363 transitions. Word has length 25 [2018-06-22 11:46:44,279 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:44,279 INFO ]: Abstraction has 164 states and 363 transitions. [2018-06-22 11:46:44,279 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:46:44,279 INFO ]: Start isEmpty. Operand 164 states and 363 transitions. [2018-06-22 11:46:44,281 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:44,281 INFO ]: Found error trace [2018-06-22 11:46:44,281 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:44,281 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:44,281 INFO ]: Analyzing trace with hash 1679380828, now seen corresponding path program 3 times [2018-06-22 11:46:44,281 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:44,281 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:44,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:44,281 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:44,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:44,290 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:44,613 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:46:44,614 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:44,614 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:44,619 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:46:44,632 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 11:46:44,632 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:44,633 INFO ]: Computing forward predicates... [2018-06-22 11:46:44,696 INFO ]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:46:44,715 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:46:44,715 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2018-06-22 11:46:44,715 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:46:44,716 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:46:44,716 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:44,716 INFO ]: Start difference. First operand 164 states and 363 transitions. Second operand 15 states. [2018-06-22 11:46:45,739 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:45,739 INFO ]: Finished difference Result 242 states and 567 transitions. [2018-06-22 11:46:45,742 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:46:45,742 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 11:46:45,742 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:45,744 INFO ]: With dead ends: 242 [2018-06-22 11:46:45,744 INFO ]: Without dead ends: 232 [2018-06-22 11:46:45,745 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:46:45,745 INFO ]: Start minimizeSevpa. Operand 232 states. [2018-06-22 11:46:45,761 INFO ]: Finished minimizeSevpa. Reduced states from 232 to 166. [2018-06-22 11:46:45,761 INFO ]: Start removeUnreachable. Operand 166 states. [2018-06-22 11:46:45,762 INFO ]: Finished removeUnreachable. Reduced from 166 states to 166 states and 369 transitions. [2018-06-22 11:46:45,762 INFO ]: Start accepts. Automaton has 166 states and 369 transitions. Word has length 25 [2018-06-22 11:46:45,762 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:45,762 INFO ]: Abstraction has 166 states and 369 transitions. [2018-06-22 11:46:45,762 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:46:45,763 INFO ]: Start isEmpty. Operand 166 states and 369 transitions. [2018-06-22 11:46:45,765 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:45,765 INFO ]: Found error trace [2018-06-22 11:46:45,765 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:45,765 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:45,765 INFO ]: Analyzing trace with hash 623352152, now seen corresponding path program 2 times [2018-06-22 11:46:45,765 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:45,765 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:45,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:45,765 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:45,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:45,769 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:45,845 INFO ]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:46:45,845 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:45,845 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:45,851 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:45,866 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:45,866 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:45,867 INFO ]: Computing forward predicates... [2018-06-22 11:46:45,875 INFO ]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:46:45,897 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:45,897 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:46:45,897 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:45,897 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:45,897 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:45,898 INFO ]: Start difference. First operand 166 states and 369 transitions. Second operand 7 states. [2018-06-22 11:46:46,023 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:46,023 INFO ]: Finished difference Result 180 states and 383 transitions. [2018-06-22 11:46:46,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:46:46,023 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 11:46:46,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:46,025 INFO ]: With dead ends: 180 [2018-06-22 11:46:46,025 INFO ]: Without dead ends: 156 [2018-06-22 11:46:46,025 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:46,025 INFO ]: Start minimizeSevpa. Operand 156 states. [2018-06-22 11:46:46,037 INFO ]: Finished minimizeSevpa. Reduced states from 156 to 132. [2018-06-22 11:46:46,037 INFO ]: Start removeUnreachable. Operand 132 states. [2018-06-22 11:46:46,038 INFO ]: Finished removeUnreachable. Reduced from 132 states to 132 states and 264 transitions. [2018-06-22 11:46:46,038 INFO ]: Start accepts. Automaton has 132 states and 264 transitions. Word has length 25 [2018-06-22 11:46:46,038 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:46,038 INFO ]: Abstraction has 132 states and 264 transitions. [2018-06-22 11:46:46,038 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:46,038 INFO ]: Start isEmpty. Operand 132 states and 264 transitions. [2018-06-22 11:46:46,040 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:46:46,040 INFO ]: Found error trace [2018-06-22 11:46:46,040 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:46,040 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:46,040 INFO ]: Analyzing trace with hash 528225836, now seen corresponding path program 1 times [2018-06-22 11:46:46,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:46,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:46,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:46,041 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:46,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:46,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:46,345 INFO ]: Checked inductivity of 22 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:46:46,345 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:46,345 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:46,352 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:46,367 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:46,369 INFO ]: Computing forward predicates... [2018-06-22 11:46:46,395 INFO ]: Checked inductivity of 22 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:46:46,415 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:46,415 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:46:46,415 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:46:46,415 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:46:46,415 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:46:46,415 INFO ]: Start difference. First operand 132 states and 264 transitions. Second operand 8 states. [2018-06-22 11:46:46,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:46,609 INFO ]: Finished difference Result 194 states and 466 transitions. [2018-06-22 11:46:46,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:46:46,609 INFO ]: Start accepts. Automaton has 8 states. Word has length 29 [2018-06-22 11:46:46,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:46,611 INFO ]: With dead ends: 194 [2018-06-22 11:46:46,611 INFO ]: Without dead ends: 170 [2018-06-22 11:46:46,611 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:46:46,611 INFO ]: Start minimizeSevpa. Operand 170 states. [2018-06-22 11:46:46,623 INFO ]: Finished minimizeSevpa. Reduced states from 170 to 129. [2018-06-22 11:46:46,623 INFO ]: Start removeUnreachable. Operand 129 states. [2018-06-22 11:46:46,624 INFO ]: Finished removeUnreachable. Reduced from 129 states to 129 states and 248 transitions. [2018-06-22 11:46:46,624 INFO ]: Start accepts. Automaton has 129 states and 248 transitions. Word has length 29 [2018-06-22 11:46:46,624 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:46,624 INFO ]: Abstraction has 129 states and 248 transitions. [2018-06-22 11:46:46,624 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:46:46,624 INFO ]: Start isEmpty. Operand 129 states and 248 transitions. [2018-06-22 11:46:46,626 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:46:46,626 INFO ]: Found error trace [2018-06-22 11:46:46,626 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:46,626 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:46,626 INFO ]: Analyzing trace with hash 1474529671, now seen corresponding path program 3 times [2018-06-22 11:46:46,626 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:46,626 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:46,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:46,627 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:46,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:46,636 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:46,776 INFO ]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:46:46,777 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:46,777 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:46,782 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:46:46,799 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:46:46,799 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:46,801 INFO ]: Computing forward predicates... [2018-06-22 11:46:46,873 INFO ]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:46:46,893 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:46,893 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12 [2018-06-22 11:46:46,893 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:46:46,893 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:46:46,893 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:46,893 INFO ]: Start difference. First operand 129 states and 248 transitions. Second operand 12 states. [2018-06-22 11:46:47,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:47,214 INFO ]: Finished difference Result 189 states and 364 transitions. [2018-06-22 11:46:47,214 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:46:47,214 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 11:46:47,214 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:47,215 INFO ]: With dead ends: 189 [2018-06-22 11:46:47,215 INFO ]: Without dead ends: 189 [2018-06-22 11:46:47,216 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:46:47,216 INFO ]: Start minimizeSevpa. Operand 189 states. [2018-06-22 11:46:47,225 INFO ]: Finished minimizeSevpa. Reduced states from 189 to 131. [2018-06-22 11:46:47,225 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-22 11:46:47,226 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 257 transitions. [2018-06-22 11:46:47,226 INFO ]: Start accepts. Automaton has 131 states and 257 transitions. Word has length 29 [2018-06-22 11:46:47,226 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:47,226 INFO ]: Abstraction has 131 states and 257 transitions. [2018-06-22 11:46:47,226 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:46:47,226 INFO ]: Start isEmpty. Operand 131 states and 257 transitions. [2018-06-22 11:46:47,227 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:46:47,227 INFO ]: Found error trace [2018-06-22 11:46:47,227 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:47,227 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:47,228 INFO ]: Analyzing trace with hash -963211782, now seen corresponding path program 1 times [2018-06-22 11:46:47,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:47,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:47,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:47,228 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:47,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:47,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:47,398 INFO ]: Checked inductivity of 31 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:46:47,399 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:47,399 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:47,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:47,419 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:47,421 INFO ]: Computing forward predicates... [2018-06-22 11:46:47,769 INFO ]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:46:47,789 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:47,789 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13] total 15 [2018-06-22 11:46:47,790 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:46:47,790 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:46:47,790 INFO ]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:47,790 INFO ]: Start difference. First operand 131 states and 257 transitions. Second operand 15 states. [2018-06-22 11:46:48,216 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:48,216 INFO ]: Finished difference Result 161 states and 276 transitions. [2018-06-22 11:46:48,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:46:48,216 INFO ]: Start accepts. Automaton has 15 states. Word has length 29 [2018-06-22 11:46:48,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:48,217 INFO ]: With dead ends: 161 [2018-06-22 11:46:48,217 INFO ]: Without dead ends: 143 [2018-06-22 11:46:48,218 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:46:48,218 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-22 11:46:48,225 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 105. [2018-06-22 11:46:48,226 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-22 11:46:48,226 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 167 transitions. [2018-06-22 11:46:48,226 INFO ]: Start accepts. Automaton has 105 states and 167 transitions. Word has length 29 [2018-06-22 11:46:48,227 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:48,227 INFO ]: Abstraction has 105 states and 167 transitions. [2018-06-22 11:46:48,227 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:46:48,227 INFO ]: Start isEmpty. Operand 105 states and 167 transitions. [2018-06-22 11:46:48,227 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:46:48,227 INFO ]: Found error trace [2018-06-22 11:46:48,227 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:48,228 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:48,228 INFO ]: Analyzing trace with hash 1827435618, now seen corresponding path program 1 times [2018-06-22 11:46:48,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:48,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:48,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:48,228 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:48,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:48,239 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:48,408 INFO ]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:46:48,408 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:48,408 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:48,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:48,432 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:48,435 INFO ]: Computing forward predicates... [2018-06-22 11:46:48,571 INFO ]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:46:48,590 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:48,590 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-06-22 11:46:48,590 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:46:48,590 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:46:48,590 INFO ]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:48,590 INFO ]: Start difference. First operand 105 states and 167 transitions. Second operand 15 states. [2018-06-22 11:46:48,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:48,837 INFO ]: Finished difference Result 123 states and 202 transitions. [2018-06-22 11:46:48,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:46:48,837 INFO ]: Start accepts. Automaton has 15 states. Word has length 29 [2018-06-22 11:46:48,837 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:48,837 INFO ]: With dead ends: 123 [2018-06-22 11:46:48,837 INFO ]: Without dead ends: 119 [2018-06-22 11:46:48,838 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:46:48,838 INFO ]: Start minimizeSevpa. Operand 119 states. [2018-06-22 11:46:48,843 INFO ]: Finished minimizeSevpa. Reduced states from 119 to 100. [2018-06-22 11:46:48,843 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 11:46:48,844 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 153 transitions. [2018-06-22 11:46:48,844 INFO ]: Start accepts. Automaton has 100 states and 153 transitions. Word has length 29 [2018-06-22 11:46:48,844 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:48,844 INFO ]: Abstraction has 100 states and 153 transitions. [2018-06-22 11:46:48,844 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:46:48,844 INFO ]: Start isEmpty. Operand 100 states and 153 transitions. [2018-06-22 11:46:48,845 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:46:48,845 INFO ]: Found error trace [2018-06-22 11:46:48,845 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:48,845 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:48,845 INFO ]: Analyzing trace with hash 175319889, now seen corresponding path program 1 times [2018-06-22 11:46:48,845 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:48,845 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:48,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:48,845 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:48,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:48,853 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:48,966 INFO ]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:46:48,967 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:48,967 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:48,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:48,987 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:48,989 INFO ]: Computing forward predicates... [2018-06-22 11:46:49,097 INFO ]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:46:49,116 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:49,116 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-06-22 11:46:49,116 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:46:49,116 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:46:49,116 INFO ]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:46:49,116 INFO ]: Start difference. First operand 100 states and 153 transitions. Second operand 17 states. [2018-06-22 11:46:49,796 WARN ]: Spent 291.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-06-22 11:46:50,650 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:50,650 INFO ]: Finished difference Result 197 states and 316 transitions. [2018-06-22 11:46:50,650 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 11:46:50,650 INFO ]: Start accepts. Automaton has 17 states. Word has length 29 [2018-06-22 11:46:50,651 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:50,651 INFO ]: With dead ends: 197 [2018-06-22 11:46:50,651 INFO ]: Without dead ends: 193 [2018-06-22 11:46:50,652 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=271, Invalid=1799, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:46:50,652 INFO ]: Start minimizeSevpa. Operand 193 states. [2018-06-22 11:46:50,660 INFO ]: Finished minimizeSevpa. Reduced states from 193 to 131. [2018-06-22 11:46:50,660 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-22 11:46:50,661 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 210 transitions. [2018-06-22 11:46:50,661 INFO ]: Start accepts. Automaton has 131 states and 210 transitions. Word has length 29 [2018-06-22 11:46:50,661 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:50,661 INFO ]: Abstraction has 131 states and 210 transitions. [2018-06-22 11:46:50,661 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:46:50,661 INFO ]: Start isEmpty. Operand 131 states and 210 transitions. [2018-06-22 11:46:50,664 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:50,664 INFO ]: Found error trace [2018-06-22 11:46:50,664 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:50,664 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:50,664 INFO ]: Analyzing trace with hash -511176835, now seen corresponding path program 1 times [2018-06-22 11:46:50,664 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:50,664 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:50,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:50,665 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:50,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:50,672 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:50,939 INFO ]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:46:50,939 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:50,939 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:50,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:50,956 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:50,958 INFO ]: Computing forward predicates... [2018-06-22 11:46:51,035 INFO ]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:46:51,055 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:51,055 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 13 [2018-06-22 11:46:51,055 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:46:51,055 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:46:51,055 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:46:51,055 INFO ]: Start difference. First operand 131 states and 210 transitions. Second operand 13 states. [2018-06-22 11:46:51,519 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:51,519 INFO ]: Finished difference Result 155 states and 251 transitions. [2018-06-22 11:46:51,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:46:51,522 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 11:46:51,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:51,523 INFO ]: With dead ends: 155 [2018-06-22 11:46:51,523 INFO ]: Without dead ends: 121 [2018-06-22 11:46:51,524 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:46:51,524 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-22 11:46:51,529 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 101. [2018-06-22 11:46:51,529 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-22 11:46:51,530 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 161 transitions. [2018-06-22 11:46:51,530 INFO ]: Start accepts. Automaton has 101 states and 161 transitions. Word has length 25 [2018-06-22 11:46:51,530 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:51,530 INFO ]: Abstraction has 101 states and 161 transitions. [2018-06-22 11:46:51,530 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:46:51,530 INFO ]: Start isEmpty. Operand 101 states and 161 transitions. [2018-06-22 11:46:51,531 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:46:51,531 INFO ]: Found error trace [2018-06-22 11:46:51,531 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:51,531 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:51,531 INFO ]: Analyzing trace with hash 881131783, now seen corresponding path program 1 times [2018-06-22 11:46:51,531 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:51,531 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:51,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:51,532 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:51,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:51,541 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:51,791 INFO ]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:46:51,791 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:51,791 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:51,798 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:51,814 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:51,817 INFO ]: Computing forward predicates... [2018-06-22 11:46:51,953 INFO ]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:46:51,972 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:51,972 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-22 11:46:51,972 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:46:51,972 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:46:51,972 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:46:51,972 INFO ]: Start difference. First operand 101 states and 161 transitions. Second operand 14 states. [2018-06-22 11:46:52,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:52,137 INFO ]: Finished difference Result 117 states and 185 transitions. [2018-06-22 11:46:52,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:46:52,137 INFO ]: Start accepts. Automaton has 14 states. Word has length 29 [2018-06-22 11:46:52,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:52,137 INFO ]: With dead ends: 117 [2018-06-22 11:46:52,137 INFO ]: Without dead ends: 108 [2018-06-22 11:46:52,138 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:46:52,138 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 11:46:52,142 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 96. [2018-06-22 11:46:52,142 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:46:52,143 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 150 transitions. [2018-06-22 11:46:52,143 INFO ]: Start accepts. Automaton has 96 states and 150 transitions. Word has length 29 [2018-06-22 11:46:52,143 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:52,143 INFO ]: Abstraction has 96 states and 150 transitions. [2018-06-22 11:46:52,143 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:46:52,143 INFO ]: Start isEmpty. Operand 96 states and 150 transitions. [2018-06-22 11:46:52,144 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:46:52,144 INFO ]: Found error trace [2018-06-22 11:46:52,144 INFO ]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:52,144 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:52,144 INFO ]: Analyzing trace with hash -408938304, now seen corresponding path program 2 times [2018-06-22 11:46:52,144 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:52,144 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:52,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:52,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:52,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:52,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:52,325 INFO ]: Checked inductivity of 37 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:46:52,325 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:52,325 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:52,331 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:52,348 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:52,348 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:52,350 INFO ]: Computing forward predicates... [2018-06-22 11:46:52,485 INFO ]: Checked inductivity of 37 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:46:52,517 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:52,517 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2018-06-22 11:46:52,517 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:46:52,517 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:46:52,517 INFO ]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:46:52,517 INFO ]: Start difference. First operand 96 states and 150 transitions. Second operand 18 states. [2018-06-22 11:46:53,846 WARN ]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 11:46:54,676 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:54,676 INFO ]: Finished difference Result 160 states and 249 transitions. [2018-06-22 11:46:54,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 11:46:54,676 INFO ]: Start accepts. Automaton has 18 states. Word has length 33 [2018-06-22 11:46:54,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:54,677 INFO ]: With dead ends: 160 [2018-06-22 11:46:54,677 INFO ]: Without dead ends: 154 [2018-06-22 11:46:54,677 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=295, Invalid=1867, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:46:54,677 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-22 11:46:54,683 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 104. [2018-06-22 11:46:54,683 INFO ]: Start removeUnreachable. Operand 104 states. [2018-06-22 11:46:54,683 INFO ]: Finished removeUnreachable. Reduced from 104 states to 104 states and 164 transitions. [2018-06-22 11:46:54,683 INFO ]: Start accepts. Automaton has 104 states and 164 transitions. Word has length 33 [2018-06-22 11:46:54,684 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:54,684 INFO ]: Abstraction has 104 states and 164 transitions. [2018-06-22 11:46:54,684 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:46:54,684 INFO ]: Start isEmpty. Operand 104 states and 164 transitions. [2018-06-22 11:46:54,685 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:46:54,685 INFO ]: Found error trace [2018-06-22 11:46:54,685 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:54,685 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:54,685 INFO ]: Analyzing trace with hash -426746287, now seen corresponding path program 2 times [2018-06-22 11:46:54,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:54,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:54,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:54,686 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:54,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:54,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:54,870 INFO ]: Checked inductivity of 35 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:46:54,870 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:54,870 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:54,876 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:54,893 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:54,893 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:54,896 INFO ]: Computing forward predicates... [2018-06-22 11:46:55,057 INFO ]: Checked inductivity of 35 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:46:55,075 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:55,075 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-06-22 11:46:55,075 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:46:55,075 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:46:55,076 INFO ]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:46:55,076 INFO ]: Start difference. First operand 104 states and 164 transitions. Second operand 21 states. [2018-06-22 11:46:56,002 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:56,021 INFO ]: Finished difference Result 148 states and 229 transitions. [2018-06-22 11:46:56,021 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 11:46:56,021 INFO ]: Start accepts. Automaton has 21 states. Word has length 33 [2018-06-22 11:46:56,021 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:56,022 INFO ]: With dead ends: 148 [2018-06-22 11:46:56,022 INFO ]: Without dead ends: 144 [2018-06-22 11:46:56,022 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=2178, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:46:56,023 INFO ]: Start minimizeSevpa. Operand 144 states. [2018-06-22 11:46:56,026 INFO ]: Finished minimizeSevpa. Reduced states from 144 to 108. [2018-06-22 11:46:56,026 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 11:46:56,027 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 167 transitions. [2018-06-22 11:46:56,027 INFO ]: Start accepts. Automaton has 108 states and 167 transitions. Word has length 33 [2018-06-22 11:46:56,027 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:56,027 INFO ]: Abstraction has 108 states and 167 transitions. [2018-06-22 11:46:56,027 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:46:56,027 INFO ]: Start isEmpty. Operand 108 states and 167 transitions. [2018-06-22 11:46:56,028 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:46:56,028 INFO ]: Found error trace [2018-06-22 11:46:56,028 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:56,028 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:56,029 INFO ]: Analyzing trace with hash 1073296044, now seen corresponding path program 1 times [2018-06-22 11:46:56,029 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:56,029 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:56,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:56,029 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:56,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:56,037 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:57,030 INFO ]: Checked inductivity of 35 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:46:57,030 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:57,030 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:57,035 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:57,052 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:57,054 INFO ]: Computing forward predicates... [2018-06-22 11:46:57,477 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:46:57,614 INFO ]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:46:57,633 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:57,633 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 14 [2018-06-22 11:46:57,633 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:46:57,633 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:46:57,633 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:46:57,633 INFO ]: Start difference. First operand 108 states and 167 transitions. Second operand 14 states. [2018-06-22 11:46:58,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:58,031 INFO ]: Finished difference Result 140 states and 215 transitions. [2018-06-22 11:46:58,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:46:58,031 INFO ]: Start accepts. Automaton has 14 states. Word has length 33 [2018-06-22 11:46:58,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:58,031 INFO ]: With dead ends: 140 [2018-06-22 11:46:58,031 INFO ]: Without dead ends: 107 [2018-06-22 11:46:58,032 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:46:58,032 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 11:46:58,034 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-06-22 11:46:58,034 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:46:58,034 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2018-06-22 11:46:58,034 INFO ]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 33 [2018-06-22 11:46:58,034 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:58,034 INFO ]: Abstraction has 75 states and 112 transitions. [2018-06-22 11:46:58,034 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:46:58,034 INFO ]: Start isEmpty. Operand 75 states and 112 transitions. [2018-06-22 11:46:58,035 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:46:58,035 INFO ]: Found error trace [2018-06-22 11:46:58,035 INFO ]: trace histogram [6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:58,035 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:58,035 INFO ]: Analyzing trace with hash 431794213, now seen corresponding path program 2 times [2018-06-22 11:46:58,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:58,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:58,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:58,036 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:58,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:58,048 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:58,250 INFO ]: Checked inductivity of 52 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:46:58,250 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:58,250 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:58,255 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:58,276 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:58,276 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:58,279 INFO ]: Computing forward predicates... [2018-06-22 11:46:58,387 INFO ]: Checked inductivity of 52 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:46:58,414 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:58,414 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-06-22 11:46:58,414 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:46:58,414 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:46:58,414 INFO ]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:46:58,414 INFO ]: Start difference. First operand 75 states and 112 transitions. Second operand 17 states. [2018-06-22 11:46:58,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:58,692 INFO ]: Finished difference Result 105 states and 154 transitions. [2018-06-22 11:46:58,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:46:58,693 INFO ]: Start accepts. Automaton has 17 states. Word has length 37 [2018-06-22 11:46:58,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:58,693 INFO ]: With dead ends: 105 [2018-06-22 11:46:58,693 INFO ]: Without dead ends: 89 [2018-06-22 11:46:58,693 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:46:58,693 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-22 11:46:58,696 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 69. [2018-06-22 11:46:58,696 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:46:58,696 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 100 transitions. [2018-06-22 11:46:58,696 INFO ]: Start accepts. Automaton has 69 states and 100 transitions. Word has length 37 [2018-06-22 11:46:58,696 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:58,696 INFO ]: Abstraction has 69 states and 100 transitions. [2018-06-22 11:46:58,696 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:46:58,696 INFO ]: Start isEmpty. Operand 69 states and 100 transitions. [2018-06-22 11:46:58,697 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:46:58,697 INFO ]: Found error trace [2018-06-22 11:46:58,697 INFO ]: trace histogram [6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:58,697 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:58,697 INFO ]: Analyzing trace with hash -385570230, now seen corresponding path program 2 times [2018-06-22 11:46:58,697 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:58,697 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:58,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:58,698 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:58,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:58,706 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:59,547 INFO ]: Checked inductivity of 52 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:46:59,547 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:59,547 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:59,552 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:59,572 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:59,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:59,575 INFO ]: Computing forward predicates... [2018-06-22 11:46:59,891 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:47:00,166 INFO ]: Checked inductivity of 52 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:47:00,198 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:00,198 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2018-06-22 11:47:00,198 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:47:00,199 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:47:00,199 INFO ]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:47:00,199 INFO ]: Start difference. First operand 69 states and 100 transitions. Second operand 22 states. [2018-06-22 11:47:01,665 WARN ]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-22 11:47:02,956 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:02,956 INFO ]: Finished difference Result 210 states and 313 transitions. [2018-06-22 11:47:02,956 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-06-22 11:47:02,956 INFO ]: Start accepts. Automaton has 22 states. Word has length 37 [2018-06-22 11:47:02,956 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:02,957 INFO ]: With dead ends: 210 [2018-06-22 11:47:02,957 INFO ]: Without dead ends: 184 [2018-06-22 11:47:02,959 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=530, Invalid=4726, Unknown=0, NotChecked=0, Total=5256 [2018-06-22 11:47:02,959 INFO ]: Start minimizeSevpa. Operand 184 states. [2018-06-22 11:47:02,965 INFO ]: Finished minimizeSevpa. Reduced states from 184 to 108. [2018-06-22 11:47:02,965 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 11:47:02,965 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 163 transitions. [2018-06-22 11:47:02,965 INFO ]: Start accepts. Automaton has 108 states and 163 transitions. Word has length 37 [2018-06-22 11:47:02,966 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:02,966 INFO ]: Abstraction has 108 states and 163 transitions. [2018-06-22 11:47:02,966 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:47:02,966 INFO ]: Start isEmpty. Operand 108 states and 163 transitions. [2018-06-22 11:47:02,966 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:47:02,966 INFO ]: Found error trace [2018-06-22 11:47:02,966 INFO ]: trace histogram [7, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:02,966 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:02,967 INFO ]: Analyzing trace with hash 1705979998, now seen corresponding path program 3 times [2018-06-22 11:47:02,967 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:02,967 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:02,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:02,967 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:02,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:02,979 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:03,270 INFO ]: Checked inductivity of 77 backedges. 14 proven. 34 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 11:47:03,271 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:03,271 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:47:03,276 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:47:03,307 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 11:47:03,307 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:03,310 INFO ]: Computing forward predicates... [2018-06-22 11:47:03,464 INFO ]: Checked inductivity of 77 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:47:03,482 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:03,482 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-06-22 11:47:03,482 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:47:03,483 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:47:03,483 INFO ]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:47:03,483 INFO ]: Start difference. First operand 108 states and 163 transitions. Second operand 21 states. [2018-06-22 11:47:04,007 WARN ]: Spent 172.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-06-22 11:47:04,949 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:04,949 INFO ]: Finished difference Result 225 states and 348 transitions. [2018-06-22 11:47:04,949 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 11:47:04,949 INFO ]: Start accepts. Automaton has 21 states. Word has length 41 [2018-06-22 11:47:04,949 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:04,950 INFO ]: With dead ends: 225 [2018-06-22 11:47:04,950 INFO ]: Without dead ends: 207 [2018-06-22 11:47:04,951 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=415, Invalid=2891, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 11:47:04,951 INFO ]: Start minimizeSevpa. Operand 207 states. [2018-06-22 11:47:04,955 INFO ]: Finished minimizeSevpa. Reduced states from 207 to 139. [2018-06-22 11:47:04,955 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-22 11:47:04,956 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 223 transitions. [2018-06-22 11:47:04,956 INFO ]: Start accepts. Automaton has 139 states and 223 transitions. Word has length 41 [2018-06-22 11:47:04,956 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:04,956 INFO ]: Abstraction has 139 states and 223 transitions. [2018-06-22 11:47:04,956 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:47:04,956 INFO ]: Start isEmpty. Operand 139 states and 223 transitions. [2018-06-22 11:47:04,957 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:47:04,957 INFO ]: Found error trace [2018-06-22 11:47:04,957 INFO ]: trace histogram [9, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:04,957 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:04,957 INFO ]: Analyzing trace with hash -409329065, now seen corresponding path program 3 times [2018-06-22 11:47:04,957 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:04,957 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:04,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:04,960 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:04,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:04,973 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:05,282 INFO ]: Checked inductivity of 127 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-22 11:47:05,282 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:05,282 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:47:05,287 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:47:05,318 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 11:47:05,318 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:05,322 INFO ]: Computing forward predicates... [2018-06-22 11:47:05,503 INFO ]: Checked inductivity of 127 backedges. 4 proven. 78 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:47:05,521 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:05,521 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 23 [2018-06-22 11:47:05,521 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:47:05,521 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:47:05,522 INFO ]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:47:05,522 INFO ]: Start difference. First operand 139 states and 223 transitions. Second operand 23 states. [2018-06-22 11:47:08,594 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:08,594 INFO ]: Finished difference Result 501 states and 1025 transitions. [2018-06-22 11:47:08,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-06-22 11:47:08,594 INFO ]: Start accepts. Automaton has 23 states. Word has length 49 [2018-06-22 11:47:08,594 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:08,600 INFO ]: With dead ends: 501 [2018-06-22 11:47:08,600 INFO ]: Without dead ends: 441 [2018-06-22 11:47:08,602 INFO ]: 0 DeclaredPredicates, 137 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1141, Invalid=6515, Unknown=0, NotChecked=0, Total=7656 [2018-06-22 11:47:08,603 INFO ]: Start minimizeSevpa. Operand 441 states. [2018-06-22 11:47:08,623 INFO ]: Finished minimizeSevpa. Reduced states from 441 to 287. [2018-06-22 11:47:08,623 INFO ]: Start removeUnreachable. Operand 287 states. [2018-06-22 11:47:08,625 INFO ]: Finished removeUnreachable. Reduced from 287 states to 287 states and 486 transitions. [2018-06-22 11:47:08,625 INFO ]: Start accepts. Automaton has 287 states and 486 transitions. Word has length 49 [2018-06-22 11:47:08,625 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:08,625 INFO ]: Abstraction has 287 states and 486 transitions. [2018-06-22 11:47:08,625 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:47:08,625 INFO ]: Start isEmpty. Operand 287 states and 486 transitions. [2018-06-22 11:47:08,627 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:47:08,627 INFO ]: Found error trace [2018-06-22 11:47:08,628 INFO ]: trace histogram [9, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:08,628 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:08,628 INFO ]: Analyzing trace with hash -1947056765, now seen corresponding path program 3 times [2018-06-22 11:47:08,628 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:08,628 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:08,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:08,628 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:08,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:08,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:09,322 INFO ]: Checked inductivity of 121 backedges. 3 proven. 64 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-06-22 11:47:09,322 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:09,322 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:47:09,327 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:47:09,345 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:47:09,345 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:09,348 INFO ]: Computing forward predicates... [2018-06-22 11:47:09,528 INFO ]: Checked inductivity of 121 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-06-22 11:47:09,546 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:09,546 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-06-22 11:47:09,546 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:47:09,547 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:47:09,547 INFO ]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:47:09,547 INFO ]: Start difference. First operand 287 states and 486 transitions. Second operand 19 states. [2018-06-22 11:47:11,286 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:11,286 INFO ]: Finished difference Result 652 states and 1187 transitions. [2018-06-22 11:47:11,286 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-06-22 11:47:11,286 INFO ]: Start accepts. Automaton has 19 states. Word has length 49 [2018-06-22 11:47:11,286 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:11,289 INFO ]: With dead ends: 652 [2018-06-22 11:47:11,289 INFO ]: Without dead ends: 573 [2018-06-22 11:47:11,290 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=482, Invalid=4210, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 11:47:11,291 INFO ]: Start minimizeSevpa. Operand 573 states. [2018-06-22 11:47:11,313 INFO ]: Finished minimizeSevpa. Reduced states from 573 to 305. [2018-06-22 11:47:11,313 INFO ]: Start removeUnreachable. Operand 305 states. [2018-06-22 11:47:11,315 INFO ]: Finished removeUnreachable. Reduced from 305 states to 305 states and 525 transitions. [2018-06-22 11:47:11,315 INFO ]: Start accepts. Automaton has 305 states and 525 transitions. Word has length 49 [2018-06-22 11:47:11,315 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:11,315 INFO ]: Abstraction has 305 states and 525 transitions. [2018-06-22 11:47:11,315 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:47:11,315 INFO ]: Start isEmpty. Operand 305 states and 525 transitions. [2018-06-22 11:47:11,317 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:47:11,317 INFO ]: Found error trace [2018-06-22 11:47:11,317 INFO ]: trace histogram [9, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:11,317 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:11,317 INFO ]: Analyzing trace with hash -9511027, now seen corresponding path program 4 times [2018-06-22 11:47:11,317 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:11,317 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:11,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:11,317 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:11,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:11,330 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:11,716 INFO ]: Checked inductivity of 127 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 11:47:11,717 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:11,717 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:47:11,722 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:47:11,748 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:47:11,748 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:11,753 INFO ]: Computing forward predicates... [2018-06-22 11:47:12,049 INFO ]: Checked inductivity of 127 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 11:47:12,074 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:12,144 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 30 [2018-06-22 11:47:12,144 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:47:12,144 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:47:12,144 INFO ]: CoverageRelationStatistics Valid=64, Invalid=806, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:47:12,144 INFO ]: Start difference. First operand 305 states and 525 transitions. Second operand 30 states. [2018-06-22 11:47:14,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:14,093 INFO ]: Finished difference Result 889 states and 1674 transitions. [2018-06-22 11:47:14,094 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 11:47:14,094 INFO ]: Start accepts. Automaton has 30 states. Word has length 49 [2018-06-22 11:47:14,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:14,098 INFO ]: With dead ends: 889 [2018-06-22 11:47:14,098 INFO ]: Without dead ends: 838 [2018-06-22 11:47:14,099 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=456, Invalid=4100, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 11:47:14,099 INFO ]: Start minimizeSevpa. Operand 838 states. [2018-06-22 11:47:14,129 INFO ]: Finished minimizeSevpa. Reduced states from 838 to 260. [2018-06-22 11:47:14,129 INFO ]: Start removeUnreachable. Operand 260 states. [2018-06-22 11:47:14,130 INFO ]: Finished removeUnreachable. Reduced from 260 states to 260 states and 423 transitions. [2018-06-22 11:47:14,130 INFO ]: Start accepts. Automaton has 260 states and 423 transitions. Word has length 49 [2018-06-22 11:47:14,130 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:14,130 INFO ]: Abstraction has 260 states and 423 transitions. [2018-06-22 11:47:14,130 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:47:14,130 INFO ]: Start isEmpty. Operand 260 states and 423 transitions. [2018-06-22 11:47:14,132 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:47:14,132 INFO ]: Found error trace [2018-06-22 11:47:14,132 INFO ]: trace histogram [10, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:14,132 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:14,132 INFO ]: Analyzing trace with hash -1768827477, now seen corresponding path program 4 times [2018-06-22 11:47:14,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:14,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:14,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:14,132 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:14,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:14,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:14,608 INFO ]: Checked inductivity of 167 backedges. 3 proven. 111 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-22 11:47:14,608 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:14,608 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:47:14,613 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:47:14,641 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:47:14,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:14,646 INFO ]: Computing forward predicates... [2018-06-22 11:47:14,966 INFO ]: Checked inductivity of 167 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-06-22 11:47:14,985 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:14,985 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 29 [2018-06-22 11:47:14,986 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:47:14,986 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:47:14,986 INFO ]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:47:14,986 INFO ]: Start difference. First operand 260 states and 423 transitions. Second operand 29 states. [2018-06-22 11:47:16,433 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:16,434 INFO ]: Finished difference Result 822 states and 1300 transitions. [2018-06-22 11:47:16,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 11:47:16,434 INFO ]: Start accepts. Automaton has 29 states. Word has length 53 [2018-06-22 11:47:16,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:16,439 INFO ]: With dead ends: 822 [2018-06-22 11:47:16,439 INFO ]: Without dead ends: 818 [2018-06-22 11:47:16,440 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=311, Invalid=2881, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:47:16,440 INFO ]: Start minimizeSevpa. Operand 818 states. [2018-06-22 11:47:16,466 INFO ]: Finished minimizeSevpa. Reduced states from 818 to 362. [2018-06-22 11:47:16,466 INFO ]: Start removeUnreachable. Operand 362 states. [2018-06-22 11:47:16,468 INFO ]: Finished removeUnreachable. Reduced from 362 states to 362 states and 595 transitions. [2018-06-22 11:47:16,468 INFO ]: Start accepts. Automaton has 362 states and 595 transitions. Word has length 53 [2018-06-22 11:47:16,468 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:16,468 INFO ]: Abstraction has 362 states and 595 transitions. [2018-06-22 11:47:16,468 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:47:16,468 INFO ]: Start isEmpty. Operand 362 states and 595 transitions. [2018-06-22 11:47:16,470 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:47:16,470 INFO ]: Found error trace [2018-06-22 11:47:16,470 INFO ]: trace histogram [10, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:16,470 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:16,471 INFO ]: Analyzing trace with hash 704858556, now seen corresponding path program 5 times [2018-06-22 11:47:16,471 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:16,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:16,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:16,471 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:16,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:16,496 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:16,918 INFO ]: Checked inductivity of 160 backedges. 1 proven. 72 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-22 11:47:16,919 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:16,919 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:47:16,924 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:47:17,067 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-22 11:47:17,067 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:17,078 INFO ]: Computing forward predicates... [2018-06-22 11:47:17,333 INFO ]: Checked inductivity of 160 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-22 11:47:17,352 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:17,352 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 18 [2018-06-22 11:47:17,352 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:47:17,352 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:47:17,352 INFO ]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:47:17,352 INFO ]: Start difference. First operand 362 states and 595 transitions. Second operand 18 states. [2018-06-22 11:47:17,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:17,769 INFO ]: Finished difference Result 468 states and 756 transitions. [2018-06-22 11:47:17,770 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:47:17,770 INFO ]: Start accepts. Automaton has 18 states. Word has length 53 [2018-06-22 11:47:17,770 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:17,771 INFO ]: With dead ends: 468 [2018-06-22 11:47:17,771 INFO ]: Without dead ends: 450 [2018-06-22 11:47:17,772 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 15 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:47:17,772 INFO ]: Start minimizeSevpa. Operand 450 states. [2018-06-22 11:47:17,788 INFO ]: Finished minimizeSevpa. Reduced states from 450 to 348. [2018-06-22 11:47:17,788 INFO ]: Start removeUnreachable. Operand 348 states. [2018-06-22 11:47:17,790 INFO ]: Finished removeUnreachable. Reduced from 348 states to 348 states and 570 transitions. [2018-06-22 11:47:17,790 INFO ]: Start accepts. Automaton has 348 states and 570 transitions. Word has length 53 [2018-06-22 11:47:17,790 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:17,790 INFO ]: Abstraction has 348 states and 570 transitions. [2018-06-22 11:47:17,790 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:47:17,791 INFO ]: Start isEmpty. Operand 348 states and 570 transitions. [2018-06-22 11:47:17,792 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:47:17,792 INFO ]: Found error trace [2018-06-22 11:47:17,792 INFO ]: trace histogram [11, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:17,792 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:17,792 INFO ]: Analyzing trace with hash 404735642, now seen corresponding path program 5 times [2018-06-22 11:47:17,792 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:17,792 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:17,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:17,793 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:17,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:17,807 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:18,090 INFO ]: Checked inductivity of 205 backedges. 22 proven. 98 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-22 11:47:18,090 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:18,090 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:47:18,095 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:47:18,142 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 11:47:18,142 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:18,147 INFO ]: Computing forward predicates... [2018-06-22 11:47:18,422 INFO ]: Checked inductivity of 205 backedges. 32 proven. 88 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-22 11:47:18,440 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:18,440 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-06-22 11:47:18,440 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:47:18,441 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:47:18,441 INFO ]: CoverageRelationStatistics Valid=62, Invalid=808, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:47:18,441 INFO ]: Start difference. First operand 348 states and 570 transitions. Second operand 30 states. Received shutdown request... [2018-06-22 11:47:22,065 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-06-22 11:47:22,065 WARN ]: Verification canceled [2018-06-22 11:47:22,071 WARN ]: Timeout [2018-06-22 11:47:22,071 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:47:22 BoogieIcfgContainer [2018-06-22 11:47:22,071 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:47:22,071 INFO ]: Toolchain (without parser) took 57189.25 ms. Allocated memory was 309.3 MB in the beginning and 812.6 MB in the end (delta: 503.3 MB). Free memory was 263.9 MB in the beginning and 758.8 MB in the end (delta: -494.9 MB). Peak memory consumption was 447.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:47:22,072 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:47:22,072 INFO ]: ChcToBoogie took 59.28 ms. Allocated memory is still 309.3 MB. Free memory was 263.9 MB in the beginning and 261.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:47:22,073 INFO ]: Boogie Preprocessor took 46.35 ms. Allocated memory is still 309.3 MB. Free memory was 261.9 MB in the beginning and 259.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:47:22,073 INFO ]: RCFGBuilder took 341.35 ms. Allocated memory is still 309.3 MB. Free memory was 259.9 MB in the beginning and 248.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:47:22,073 INFO ]: TraceAbstraction took 56733.08 ms. Allocated memory was 309.3 MB in the beginning and 812.6 MB in the end (delta: 503.3 MB). Free memory was 248.8 MB in the beginning and 758.8 MB in the end (delta: -510.0 MB). Peak memory consumption was 432.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:47:22,076 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 309.3 MB. Free memory is still 274.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.28 ms. Allocated memory is still 309.3 MB. Free memory was 263.9 MB in the beginning and 261.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.35 ms. Allocated memory is still 309.3 MB. Free memory was 261.9 MB in the beginning and 259.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 341.35 ms. Allocated memory is still 309.3 MB. Free memory was 259.9 MB in the beginning and 248.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56733.08 ms. Allocated memory was 309.3 MB in the beginning and 812.6 MB in the end (delta: 503.3 MB). Free memory was 248.8 MB in the beginning and 758.8 MB in the end (delta: -510.0 MB). Peak memory consumption was 432.4 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 (348states) and interpolant automaton (currently 102 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. TIMEOUT Result, 56.6s OverallTime, 49 OverallIterations, 11 TraceHistogramMax, 35.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1641 SDtfs, 655 SDslu, 10660 SDs, 0 SdLazy, 23174 SolverSat, 1969 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2270 GetRequests, 960 SyntacticMatches, 152 SemanticMatches, 1157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13436 ImplicationChecksByTransitivity, 30.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=362occurred in iteration=47, 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.5s AutomataMinimizationTime, 48 MinimizatonAttempts, 2720 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 2398 NumberOfCodeBlocks, 2374 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 2312 ConstructedInterpolants, 14 QuantifiedInterpolants, 459416 SizeOfPredicates, 308 NumberOfNonLiveVariables, 5721 ConjunctsInSsa, 2168 ConjunctsInUnsatCore, 86 InterpolantComputations, 13 PerfectInterpolantSequences, 1599/3078 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/libc__strpbrk_2.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-47-22-085.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strpbrk_2.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-47-22-085.csv Completed graceful shutdown