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/hopv/lia/termination/Ackermann06.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:37:23,595 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:37:23,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:37:23,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:37:23,612 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:37:23,613 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:37:23,633 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:37:23,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:37:23,636 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:37:23,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:37:23,639 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:37:23,639 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:37:23,640 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:37:23,641 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:37:23,642 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:37:23,643 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:37:23,648 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:37:23,659 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:37:23,661 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:37:23,662 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:37:23,663 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:37:23,665 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:37:23,665 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:37:23,665 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:37:23,666 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:37:23,667 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:37:23,673 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:37:23,674 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:37:23,675 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:37:23,675 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:37:23,676 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:37:23,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:37:23,676 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:37:23,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:37:23,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:37:23,684 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:37:23,704 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:37:23,704 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:37:23,704 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:37:23,705 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:37:23,705 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:37:23,706 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:37:23,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:37:23,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:37:23,706 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:37:23,707 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:37:23,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:37:23,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:37:23,708 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:37:23,708 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:37:23,708 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:37:23,709 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:37:23,709 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:37:23,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:37:23,709 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:37:23,710 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:37:23,712 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:37:23,751 INFO ]: Repository-Root is: /tmp [2018-06-22 11:37:23,766 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:37:23,769 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:37:23,770 INFO ]: Initializing SmtParser... [2018-06-22 11:37:23,771 INFO ]: SmtParser initialized [2018-06-22 11:37:23,771 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/termination/Ackermann06.smt2 [2018-06-22 11:37:23,772 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:37:23,863 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/termination/Ackermann06.smt2 unknown [2018-06-22 11:37:24,501 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/termination/Ackermann06.smt2 [2018-06-22 11:37:24,514 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:37:24,521 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:37:24,522 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:37:24,522 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:37:24,522 INFO ]: ChcToBoogie initialized [2018-06-22 11:37:24,525 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:37:24" (1/1) ... [2018-06-22 11:37:24,608 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:37:24 Unit [2018-06-22 11:37:24,608 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:37:24,608 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:37:24,608 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:37:24,608 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:37:24,634 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:37:24" (1/1) ... [2018-06-22 11:37:24,634 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:37:24" (1/1) ... [2018-06-22 11:37:24,656 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:37:24" (1/1) ... [2018-06-22 11:37:24,657 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:37:24" (1/1) ... [2018-06-22 11:37:24,677 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:37:24" (1/1) ... [2018-06-22 11:37:24,685 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:37:24" (1/1) ... [2018-06-22 11:37:24,688 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:37:24" (1/1) ... [2018-06-22 11:37:24,693 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:37:24,694 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:37:24,694 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:37:24,694 INFO ]: RCFGBuilder initialized [2018-06-22 11:37:24,695 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:37: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:37:24,705 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:37:24,705 INFO ]: Found specification of procedure False [2018-06-22 11:37:24,705 INFO ]: Found implementation of procedure False [2018-06-22 11:37:24,706 INFO ]: Specification and implementation of procedure failDLRunknownCLN30 given in one single declaration [2018-06-22 11:37:24,706 INFO ]: Found specification of procedure failDLRunknownCLN30 [2018-06-22 11:37:24,706 INFO ]: Found implementation of procedure failDLRunknownCLN30 [2018-06-22 11:37:24,706 INFO ]: Specification and implementation of procedure ack_1030DLRunknownCLN17 given in one single declaration [2018-06-22 11:37:24,706 INFO ]: Found specification of procedure ack_1030DLRunknownCLN17 [2018-06-22 11:37:24,706 INFO ]: Found implementation of procedure ack_1030DLRunknownCLN17 [2018-06-22 11:37:24,706 INFO ]: Specification and implementation of procedure ack_without_checking_1087DLRunknownCLN26 given in one single declaration [2018-06-22 11:37:24,706 INFO ]: Found specification of procedure ack_without_checking_1087DLRunknownCLN26 [2018-06-22 11:37:24,706 INFO ]: Found implementation of procedure ack_without_checking_1087DLRunknownCLN26 [2018-06-22 11:37:24,706 INFO ]: Specification and implementation of procedure main_1033DLRunknownCLN37 given in one single declaration [2018-06-22 11:37:24,706 INFO ]: Found specification of procedure main_1033DLRunknownCLN37 [2018-06-22 11:37:24,706 INFO ]: Found implementation of procedure main_1033DLRunknownCLN37 [2018-06-22 11:37:24,706 INFO ]: Specification and implementation of procedure ack_1030DLRunknownCLN8 given in one single declaration [2018-06-22 11:37:24,706 INFO ]: Found specification of procedure ack_1030DLRunknownCLN8 [2018-06-22 11:37:24,706 INFO ]: Found implementation of procedure ack_1030DLRunknownCLN8 [2018-06-22 11:37:24,706 INFO ]: Specification and implementation of procedure failDLRunknownCLN31 given in one single declaration [2018-06-22 11:37:24,706 INFO ]: Found specification of procedure failDLRunknownCLN31 [2018-06-22 11:37:24,706 INFO ]: Found implementation of procedure failDLRunknownCLN31 [2018-06-22 11:37:24,706 INFO ]: Specification and implementation of procedure botDLRunknownCLN29 given in one single declaration [2018-06-22 11:37:24,706 INFO ]: Found specification of procedure botDLRunknownCLN29 [2018-06-22 11:37:24,706 INFO ]: Found implementation of procedure botDLRunknownCLN29 [2018-06-22 11:37:24,706 INFO ]: Specification and implementation of procedure ack_without_checking_1087DLRunknownCLN27 given in one single declaration [2018-06-22 11:37:24,706 INFO ]: Found specification of procedure ack_without_checking_1087DLRunknownCLN27 [2018-06-22 11:37:24,706 INFO ]: Found implementation of procedure ack_without_checking_1087DLRunknownCLN27 [2018-06-22 11:37:24,706 INFO ]: Specification and implementation of procedure ack_1030DLRunknownCLN18 given in one single declaration [2018-06-22 11:37:24,706 INFO ]: Found specification of procedure ack_1030DLRunknownCLN18 [2018-06-22 11:37:24,706 INFO ]: Found implementation of procedure ack_1030DLRunknownCLN18 [2018-06-22 11:37:24,706 INFO ]: Specification and implementation of procedure ack_1030DLRunknownCLN9 given in one single declaration [2018-06-22 11:37:24,706 INFO ]: Found specification of procedure ack_1030DLRunknownCLN9 [2018-06-22 11:37:24,707 INFO ]: Found implementation of procedure ack_1030DLRunknownCLN9 [2018-06-22 11:37:24,707 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:37:24,707 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:37:24,707 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:37:25,600 INFO ]: Using library mode [2018-06-22 11:37:25,600 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:37:25 BoogieIcfgContainer [2018-06-22 11:37:25,600 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:37:25,607 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:37:25,607 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:37:25,610 INFO ]: TraceAbstraction initialized [2018-06-22 11:37:25,610 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:37:24" (1/3) ... [2018-06-22 11:37:25,611 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6e4cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:37:25, skipping insertion in model container [2018-06-22 11:37:25,611 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:37:24" (2/3) ... [2018-06-22 11:37:25,611 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6e4cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:37:25, skipping insertion in model container [2018-06-22 11:37:25,612 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:37:25" (3/3) ... [2018-06-22 11:37:25,613 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:37:25,624 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:37:25,634 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:37:25,682 INFO ]: Using default assertion order modulation [2018-06-22 11:37:25,683 INFO ]: Interprodecural is true [2018-06-22 11:37:25,683 INFO ]: Hoare is false [2018-06-22 11:37:25,683 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:37:25,683 INFO ]: Backedges is TWOTRACK [2018-06-22 11:37:25,683 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:37:25,683 INFO ]: Difference is false [2018-06-22 11:37:25,683 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:37:25,683 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:37:25,700 INFO ]: Start isEmpty. Operand 70 states. [2018-06-22 11:37:25,713 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:37:25,713 INFO ]: Found error trace [2018-06-22 11:37:25,714 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:37:25,714 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:25,719 INFO ]: Analyzing trace with hash 403106870, now seen corresponding path program 1 times [2018-06-22 11:37:25,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:25,725 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:25,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:25,756 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:25,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:25,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:25,790 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:37:25,792 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:37:25,792 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:37:25,793 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:37:25,803 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:37:25,803 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:37:25,805 INFO ]: Start difference. First operand 70 states. Second operand 2 states. [2018-06-22 11:37:25,847 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:25,847 INFO ]: Finished difference Result 60 states and 84 transitions. [2018-06-22 11:37:25,847 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:37:25,848 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:37:25,849 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:25,859 INFO ]: With dead ends: 60 [2018-06-22 11:37:25,859 INFO ]: Without dead ends: 54 [2018-06-22 11:37:25,860 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:37:25,876 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:37:25,901 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-22 11:37:25,903 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 11:37:25,905 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2018-06-22 11:37:25,906 INFO ]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 5 [2018-06-22 11:37:25,907 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:25,907 INFO ]: Abstraction has 54 states and 76 transitions. [2018-06-22 11:37:25,907 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:37:25,907 INFO ]: Start isEmpty. Operand 54 states and 76 transitions. [2018-06-22 11:37:25,910 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:37:25,910 INFO ]: Found error trace [2018-06-22 11:37:25,910 INFO ]: trace histogram [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:37:25,910 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:25,910 INFO ]: Analyzing trace with hash -1667384735, now seen corresponding path program 1 times [2018-06-22 11:37:25,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:25,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:25,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:25,911 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:25,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:25,988 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:26,232 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:37:26,232 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:37:26,232 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:37:26,234 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:37:26,234 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:37:26,234 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:37:26,234 INFO ]: Start difference. First operand 54 states and 76 transitions. Second operand 4 states. [2018-06-22 11:37:26,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:26,638 INFO ]: Finished difference Result 56 states and 84 transitions. [2018-06-22 11:37:26,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:37:26,639 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:37:26,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:26,641 INFO ]: With dead ends: 56 [2018-06-22 11:37:26,641 INFO ]: Without dead ends: 56 [2018-06-22 11:37:26,642 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:37:26,642 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:37:26,656 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-06-22 11:37:26,656 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:37:26,659 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2018-06-22 11:37:26,659 INFO ]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 21 [2018-06-22 11:37:26,660 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:26,660 INFO ]: Abstraction has 56 states and 84 transitions. [2018-06-22 11:37:26,660 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:37:26,660 INFO ]: Start isEmpty. Operand 56 states and 84 transitions. [2018-06-22 11:37:26,662 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:37:26,662 INFO ]: Found error trace [2018-06-22 11:37:26,663 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:26,663 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:26,663 INFO ]: Analyzing trace with hash 359454759, now seen corresponding path program 1 times [2018-06-22 11:37:26,663 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:26,663 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:26,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:26,664 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:26,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:26,709 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:27,022 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:37:27,022 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:37:27,022 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:37:27,022 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:37:27,022 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:37:27,022 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:37:27,022 INFO ]: Start difference. First operand 56 states and 84 transitions. Second operand 7 states. [2018-06-22 11:37:27,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:27,588 INFO ]: Finished difference Result 62 states and 107 transitions. [2018-06-22 11:37:27,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:37:27,589 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 11:37:27,589 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:27,592 INFO ]: With dead ends: 62 [2018-06-22 11:37:27,592 INFO ]: Without dead ends: 62 [2018-06-22 11:37:27,592 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:37:27,592 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:37:27,606 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-06-22 11:37:27,606 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:37:27,608 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 98 transitions. [2018-06-22 11:37:27,608 INFO ]: Start accepts. Automaton has 60 states and 98 transitions. Word has length 25 [2018-06-22 11:37:27,608 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:27,608 INFO ]: Abstraction has 60 states and 98 transitions. [2018-06-22 11:37:27,608 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:37:27,608 INFO ]: Start isEmpty. Operand 60 states and 98 transitions. [2018-06-22 11:37:27,611 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:37:27,611 INFO ]: Found error trace [2018-06-22 11:37:27,611 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:27,611 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:27,612 INFO ]: Analyzing trace with hash -1346047582, now seen corresponding path program 1 times [2018-06-22 11:37:27,612 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:27,612 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:27,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:27,613 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:27,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:27,651 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:27,758 INFO ]: Checked inductivity of 22 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:37:27,758 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:27,758 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:37:27,772 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:27,862 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:27,874 INFO ]: Computing forward predicates... [2018-06-22 11:37:28,008 INFO ]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:37:28,029 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:37:28,029 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-06-22 11:37:28,029 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:37:28,029 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:37:28,029 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:37:28,030 INFO ]: Start difference. First operand 60 states and 98 transitions. Second operand 9 states. [2018-06-22 11:37:28,974 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:28,974 INFO ]: Finished difference Result 70 states and 129 transitions. [2018-06-22 11:37:28,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:37:28,974 INFO ]: Start accepts. Automaton has 9 states. Word has length 41 [2018-06-22 11:37:28,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:28,977 INFO ]: With dead ends: 70 [2018-06-22 11:37:28,977 INFO ]: Without dead ends: 70 [2018-06-22 11:37:28,977 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:37:28,978 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 11:37:28,992 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-06-22 11:37:28,992 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:37:28,994 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 119 transitions. [2018-06-22 11:37:28,994 INFO ]: Start accepts. Automaton has 68 states and 119 transitions. Word has length 41 [2018-06-22 11:37:28,994 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:28,994 INFO ]: Abstraction has 68 states and 119 transitions. [2018-06-22 11:37:28,994 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:37:28,994 INFO ]: Start isEmpty. Operand 68 states and 119 transitions. [2018-06-22 11:37:28,996 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:37:28,996 INFO ]: Found error trace [2018-06-22 11:37:28,997 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:28,997 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:28,997 INFO ]: Analyzing trace with hash 705902056, now seen corresponding path program 2 times [2018-06-22 11:37:28,997 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:28,997 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:28,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:28,998 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:28,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:29,022 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:29,091 INFO ]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:37:29,092 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:37:29,092 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:37:29,092 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:37:29,092 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:37:29,092 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:37:29,092 INFO ]: Start difference. First operand 68 states and 119 transitions. Second operand 4 states. [2018-06-22 11:37:29,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:29,234 INFO ]: Finished difference Result 70 states and 128 transitions. [2018-06-22 11:37:29,235 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:37:29,235 INFO ]: Start accepts. Automaton has 4 states. Word has length 45 [2018-06-22 11:37:29,235 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:29,236 INFO ]: With dead ends: 70 [2018-06-22 11:37:29,236 INFO ]: Without dead ends: 70 [2018-06-22 11:37:29,237 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:37:29,237 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 11:37:29,247 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-06-22 11:37:29,247 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:37:29,249 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 118 transitions. [2018-06-22 11:37:29,249 INFO ]: Start accepts. Automaton has 68 states and 118 transitions. Word has length 45 [2018-06-22 11:37:29,249 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:29,249 INFO ]: Abstraction has 68 states and 118 transitions. [2018-06-22 11:37:29,249 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:37:29,250 INFO ]: Start isEmpty. Operand 68 states and 118 transitions. [2018-06-22 11:37:29,254 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:37:29,254 INFO ]: Found error trace [2018-06-22 11:37:29,254 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:29,254 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:29,254 INFO ]: Analyzing trace with hash 318235511, now seen corresponding path program 1 times [2018-06-22 11:37:29,254 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:29,254 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:29,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:29,254 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:37:29,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:29,282 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:29,456 INFO ]: Checked inductivity of 39 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:37:29,456 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:29,456 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:37:29,475 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:29,571 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:29,576 INFO ]: Computing forward predicates... [2018-06-22 11:37:29,643 INFO ]: Checked inductivity of 39 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:37:29,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:37:29,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-06-22 11:37:29,664 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:37:29,664 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:37:29,664 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:37:29,664 INFO ]: Start difference. First operand 68 states and 118 transitions. Second operand 10 states. [2018-06-22 11:37:29,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:29,876 INFO ]: Finished difference Result 70 states and 127 transitions. [2018-06-22 11:37:29,876 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:37:29,876 INFO ]: Start accepts. Automaton has 10 states. Word has length 49 [2018-06-22 11:37:29,876 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:29,877 INFO ]: With dead ends: 70 [2018-06-22 11:37:29,878 INFO ]: Without dead ends: 70 [2018-06-22 11:37:29,878 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:37:29,878 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 11:37:29,897 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-22 11:37:29,925 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 11:37:29,927 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 127 transitions. [2018-06-22 11:37:29,927 INFO ]: Start accepts. Automaton has 70 states and 127 transitions. Word has length 49 [2018-06-22 11:37:29,927 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:29,927 INFO ]: Abstraction has 70 states and 127 transitions. [2018-06-22 11:37:29,928 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:37:29,928 INFO ]: Start isEmpty. Operand 70 states and 127 transitions. [2018-06-22 11:37:29,931 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:37:29,931 INFO ]: Found error trace [2018-06-22 11:37:29,931 INFO ]: trace histogram [6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:29,931 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:29,931 INFO ]: Analyzing trace with hash -1460093891, now seen corresponding path program 2 times [2018-06-22 11:37:29,931 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:29,931 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:29,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:29,932 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:29,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:30,025 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:30,290 INFO ]: Checked inductivity of 56 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:37:30,290 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:30,290 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:37:30,301 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:37:30,397 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:37:30,398 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:30,403 INFO ]: Computing forward predicates... [2018-06-22 11:37:30,579 INFO ]: Checked inductivity of 56 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 11:37:30,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:37:30,603 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 13 [2018-06-22 11:37:30,603 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:37:30,603 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:37:30,603 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:37:30,604 INFO ]: Start difference. First operand 70 states and 127 transitions. Second operand 13 states. [2018-06-22 11:37:30,901 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:30,901 INFO ]: Finished difference Result 81 states and 172 transitions. [2018-06-22 11:37:30,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:37:30,902 INFO ]: Start accepts. Automaton has 13 states. Word has length 53 [2018-06-22 11:37:30,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:30,903 INFO ]: With dead ends: 81 [2018-06-22 11:37:30,903 INFO ]: Without dead ends: 81 [2018-06-22 11:37:30,904 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:37:30,904 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 11:37:30,919 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 75. [2018-06-22 11:37:30,919 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:37:30,921 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 145 transitions. [2018-06-22 11:37:30,921 INFO ]: Start accepts. Automaton has 75 states and 145 transitions. Word has length 53 [2018-06-22 11:37:30,921 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:30,921 INFO ]: Abstraction has 75 states and 145 transitions. [2018-06-22 11:37:30,921 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:37:30,921 INFO ]: Start isEmpty. Operand 75 states and 145 transitions. [2018-06-22 11:37:30,924 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 11:37:30,924 INFO ]: Found error trace [2018-06-22 11:37:30,924 INFO ]: trace histogram [13, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:30,924 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:30,924 INFO ]: Analyzing trace with hash -2141924119, now seen corresponding path program 1 times [2018-06-22 11:37:30,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:30,924 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:30,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:30,925 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:37:30,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:30,971 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:31,250 WARN ]: Spent 148.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-06-22 11:37:31,354 INFO ]: Checked inductivity of 324 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-06-22 11:37:31,354 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:31,354 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) [2018-06-22 11:37:31,368 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:37:31,514 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:31,524 INFO ]: Computing forward predicates... [2018-06-22 11:37:31,635 INFO ]: Checked inductivity of 324 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-06-22 11:37:31,654 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:37:31,654 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-22 11:37:31,655 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:37:31,655 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:37:31,655 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:37:31,655 INFO ]: Start difference. First operand 75 states and 145 transitions. Second operand 14 states. [2018-06-22 11:37:32,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:32,136 INFO ]: Finished difference Result 98 states and 215 transitions. [2018-06-22 11:37:32,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:37:32,137 INFO ]: Start accepts. Automaton has 14 states. Word has length 117 [2018-06-22 11:37:32,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:32,139 INFO ]: With dead ends: 98 [2018-06-22 11:37:32,139 INFO ]: Without dead ends: 98 [2018-06-22 11:37:32,139 INFO ]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:37:32,139 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 11:37:32,159 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 86. [2018-06-22 11:37:32,159 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 11:37:32,160 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 176 transitions. [2018-06-22 11:37:32,161 INFO ]: Start accepts. Automaton has 86 states and 176 transitions. Word has length 117 [2018-06-22 11:37:32,161 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:32,161 INFO ]: Abstraction has 86 states and 176 transitions. [2018-06-22 11:37:32,161 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:37:32,161 INFO ]: Start isEmpty. Operand 86 states and 176 transitions. [2018-06-22 11:37:32,165 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 11:37:32,165 INFO ]: Found error trace [2018-06-22 11:37:32,165 INFO ]: trace histogram [13, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:32,165 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:32,165 INFO ]: Analyzing trace with hash -1384258971, now seen corresponding path program 1 times [2018-06-22 11:37:32,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:32,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:32,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:32,166 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:32,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:32,185 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:32,397 INFO ]: Checked inductivity of 324 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-06-22 11:37:32,397 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:32,397 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:37:32,405 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:32,542 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:32,551 INFO ]: Computing forward predicates... [2018-06-22 11:37:32,608 INFO ]: Checked inductivity of 324 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-06-22 11:37:32,644 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:37:32,644 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-22 11:37:32,645 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:37:32,645 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:37:32,645 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:37:32,645 INFO ]: Start difference. First operand 86 states and 176 transitions. Second operand 7 states. [2018-06-22 11:37:32,770 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:32,770 INFO ]: Finished difference Result 88 states and 177 transitions. [2018-06-22 11:37:32,771 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:37:32,771 INFO ]: Start accepts. Automaton has 7 states. Word has length 117 [2018-06-22 11:37:32,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:32,773 INFO ]: With dead ends: 88 [2018-06-22 11:37:32,773 INFO ]: Without dead ends: 84 [2018-06-22 11:37:32,774 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:37:32,774 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 11:37:32,797 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-06-22 11:37:32,843 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:37:32,844 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 169 transitions. [2018-06-22 11:37:32,845 INFO ]: Start accepts. Automaton has 84 states and 169 transitions. Word has length 117 [2018-06-22 11:37:32,845 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:32,845 INFO ]: Abstraction has 84 states and 169 transitions. [2018-06-22 11:37:32,845 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:37:32,845 INFO ]: Start isEmpty. Operand 84 states and 169 transitions. [2018-06-22 11:37:32,847 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 11:37:32,847 INFO ]: Found error trace [2018-06-22 11:37:32,847 INFO ]: trace histogram [14, 7, 7, 7, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:32,848 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:32,848 INFO ]: Analyzing trace with hash -1745795921, now seen corresponding path program 2 times [2018-06-22 11:37:32,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:32,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:32,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:32,849 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:32,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:32,896 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:33,151 WARN ]: Spent 142.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-06-22 11:37:33,753 INFO ]: Checked inductivity of 369 backedges. 52 proven. 12 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-06-22 11:37:33,753 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:33,753 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:37:33,760 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:37:33,923 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:37:33,923 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:33,931 INFO ]: Computing forward predicates... [2018-06-22 11:37:34,143 INFO ]: Checked inductivity of 369 backedges. 52 proven. 12 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-06-22 11:37:34,165 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:37:34,165 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-06-22 11:37:34,166 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:37:34,166 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:37:34,166 INFO ]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:37:34,166 INFO ]: Start difference. First operand 84 states and 169 transitions. Second operand 18 states. [2018-06-22 11:37:34,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:34,797 INFO ]: Finished difference Result 98 states and 228 transitions. [2018-06-22 11:37:34,803 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:37:34,803 INFO ]: Start accepts. Automaton has 18 states. Word has length 121 [2018-06-22 11:37:34,803 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:34,805 INFO ]: With dead ends: 98 [2018-06-22 11:37:34,805 INFO ]: Without dead ends: 98 [2018-06-22 11:37:34,807 INFO ]: 0 DeclaredPredicates, 138 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:37:34,807 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 11:37:34,831 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 86. [2018-06-22 11:37:34,847 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 11:37:34,848 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 180 transitions. [2018-06-22 11:37:34,848 INFO ]: Start accepts. Automaton has 86 states and 180 transitions. Word has length 121 [2018-06-22 11:37:34,849 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:34,849 INFO ]: Abstraction has 86 states and 180 transitions. [2018-06-22 11:37:34,849 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:37:34,849 INFO ]: Start isEmpty. Operand 86 states and 180 transitions. [2018-06-22 11:37:34,852 INFO ]: Finished isEmpty. Found accepting run of length 150 [2018-06-22 11:37:34,852 INFO ]: Found error trace [2018-06-22 11:37:34,852 INFO ]: trace histogram [17, 8, 8, 8, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:34,852 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:34,852 INFO ]: Analyzing trace with hash -1949049214, now seen corresponding path program 1 times [2018-06-22 11:37:34,852 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:34,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:34,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:34,853 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:37:34,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:34,899 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:35,204 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-06-22 11:37:36,305 INFO ]: Checked inductivity of 579 backedges. 46 proven. 41 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2018-06-22 11:37:36,305 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:36,305 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:37:36,314 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:36,500 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:36,511 INFO ]: Computing forward predicates... [2018-06-22 11:37:36,821 INFO ]: Checked inductivity of 579 backedges. 309 proven. 2 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-06-22 11:37:36,840 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:37:36,840 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-06-22 11:37:36,841 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:37:36,841 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:37:36,841 INFO ]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:37:36,841 INFO ]: Start difference. First operand 86 states and 180 transitions. Second operand 19 states. [2018-06-22 11:37:37,424 WARN ]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 11:37:39,396 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:39,396 INFO ]: Finished difference Result 155 states and 472 transitions. [2018-06-22 11:37:39,396 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 11:37:39,397 INFO ]: Start accepts. Automaton has 19 states. Word has length 149 [2018-06-22 11:37:39,397 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:39,401 INFO ]: With dead ends: 155 [2018-06-22 11:37:39,401 INFO ]: Without dead ends: 155 [2018-06-22 11:37:39,402 INFO ]: 0 DeclaredPredicates, 191 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=226, Invalid=1496, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:37:39,402 INFO ]: Start minimizeSevpa. Operand 155 states. [2018-06-22 11:37:39,435 INFO ]: Finished minimizeSevpa. Reduced states from 155 to 137. [2018-06-22 11:37:39,435 INFO ]: Start removeUnreachable. Operand 137 states. [2018-06-22 11:37:39,439 INFO ]: Finished removeUnreachable. Reduced from 137 states to 137 states and 404 transitions. [2018-06-22 11:37:39,439 INFO ]: Start accepts. Automaton has 137 states and 404 transitions. Word has length 149 [2018-06-22 11:37:39,440 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:39,440 INFO ]: Abstraction has 137 states and 404 transitions. [2018-06-22 11:37:39,440 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:37:39,440 INFO ]: Start isEmpty. Operand 137 states and 404 transitions. [2018-06-22 11:37:39,444 INFO ]: Finished isEmpty. Found accepting run of length 138 [2018-06-22 11:37:39,444 INFO ]: Found error trace [2018-06-22 11:37:39,444 INFO ]: trace histogram [18, 11, 11, 11, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:39,445 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:39,446 INFO ]: Analyzing trace with hash -1967444793, now seen corresponding path program 3 times [2018-06-22 11:37:39,446 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:39,446 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:39,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:39,446 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:39,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:39,534 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:39,864 INFO ]: Checked inductivity of 589 backedges. 110 proven. 79 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-06-22 11:37:39,864 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:39,864 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:37:39,872 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:37:40,027 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 11:37:40,027 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:40,036 INFO ]: Computing forward predicates... [2018-06-22 11:37:40,172 INFO ]: Checked inductivity of 589 backedges. 324 proven. 12 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-06-22 11:37:40,192 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:37:40,192 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-06-22 11:37:40,192 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:37:40,193 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:37:40,193 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:37:40,193 INFO ]: Start difference. First operand 137 states and 404 transitions. Second operand 18 states. [2018-06-22 11:37:42,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:42,569 INFO ]: Finished difference Result 369 states and 1837 transitions. [2018-06-22 11:37:42,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:37:42,569 INFO ]: Start accepts. Automaton has 18 states. Word has length 137 [2018-06-22 11:37:42,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:42,593 INFO ]: With dead ends: 369 [2018-06-22 11:37:42,593 INFO ]: Without dead ends: 349 [2018-06-22 11:37:42,594 INFO ]: 0 DeclaredPredicates, 167 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:37:42,594 INFO ]: Start minimizeSevpa. Operand 349 states. [2018-06-22 11:37:42,705 INFO ]: Finished minimizeSevpa. Reduced states from 349 to 266. [2018-06-22 11:37:42,705 INFO ]: Start removeUnreachable. Operand 266 states. [2018-06-22 11:37:42,712 INFO ]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1145 transitions. [2018-06-22 11:37:42,712 INFO ]: Start accepts. Automaton has 266 states and 1145 transitions. Word has length 137 [2018-06-22 11:37:42,715 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:42,715 INFO ]: Abstraction has 266 states and 1145 transitions. [2018-06-22 11:37:42,715 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:37:42,715 INFO ]: Start isEmpty. Operand 266 states and 1145 transitions. [2018-06-22 11:37:42,727 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 11:37:42,727 INFO ]: Found error trace [2018-06-22 11:37:42,727 INFO ]: trace histogram [20, 11, 11, 11, 7, 7, 7, 7, 7, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:42,727 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:42,727 INFO ]: Analyzing trace with hash 1653539975, now seen corresponding path program 1 times [2018-06-22 11:37:42,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:42,727 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:42,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:42,728 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:37:42,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:42,759 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:42,953 INFO ]: Checked inductivity of 739 backedges. 132 proven. 12 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-06-22 11:37:42,953 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:42,953 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:37:42,959 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:43,140 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:43,147 INFO ]: Computing forward predicates... [2018-06-22 11:37:43,233 INFO ]: Checked inductivity of 739 backedges. 201 proven. 10 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-06-22 11:37:43,254 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:37:43,254 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-22 11:37:43,254 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:37:43,254 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:37:43,254 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:37:43,255 INFO ]: Start difference. First operand 266 states and 1145 transitions. Second operand 13 states. [2018-06-22 11:37:44,087 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:44,088 INFO ]: Finished difference Result 429 states and 2152 transitions. [2018-06-22 11:37:44,090 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:37:44,090 INFO ]: Start accepts. Automaton has 13 states. Word has length 157 [2018-06-22 11:37:44,090 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:44,107 INFO ]: With dead ends: 429 [2018-06-22 11:37:44,107 INFO ]: Without dead ends: 348 [2018-06-22 11:37:44,107 INFO ]: 0 DeclaredPredicates, 165 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:37:44,107 INFO ]: Start minimizeSevpa. Operand 348 states. [2018-06-22 11:37:44,204 INFO ]: Finished minimizeSevpa. Reduced states from 348 to 312. [2018-06-22 11:37:44,204 INFO ]: Start removeUnreachable. Operand 312 states. [2018-06-22 11:37:44,215 INFO ]: Finished removeUnreachable. Reduced from 312 states to 312 states and 1547 transitions. [2018-06-22 11:37:44,215 INFO ]: Start accepts. Automaton has 312 states and 1547 transitions. Word has length 157 [2018-06-22 11:37:44,216 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:44,216 INFO ]: Abstraction has 312 states and 1547 transitions. [2018-06-22 11:37:44,216 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:37:44,216 INFO ]: Start isEmpty. Operand 312 states and 1547 transitions. [2018-06-22 11:37:44,234 INFO ]: Finished isEmpty. Found accepting run of length 154 [2018-06-22 11:37:44,234 INFO ]: Found error trace [2018-06-22 11:37:44,235 INFO ]: trace histogram [19, 10, 10, 10, 7, 7, 7, 7, 7, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:44,235 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:44,235 INFO ]: Analyzing trace with hash 852011915, now seen corresponding path program 1 times [2018-06-22 11:37:44,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:44,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:44,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:44,235 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:44,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:44,285 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:44,523 WARN ]: Spent 123.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 4 [2018-06-22 11:37:45,443 INFO ]: Checked inductivity of 673 backedges. 98 proven. 99 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2018-06-22 11:37:45,443 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:45,443 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:37:45,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:45,622 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:45,628 INFO ]: Computing forward predicates... [2018-06-22 11:37:45,840 INFO ]: Checked inductivity of 673 backedges. 92 proven. 95 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2018-06-22 11:37:45,860 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:37:45,860 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2018-06-22 11:37:45,860 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:37:45,860 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:37:45,861 INFO ]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:37:45,861 INFO ]: Start difference. First operand 312 states and 1547 transitions. Second operand 22 states. [2018-06-22 11:37:48,713 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:48,713 INFO ]: Finished difference Result 471 states and 3036 transitions. [2018-06-22 11:37:48,714 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:37:48,714 INFO ]: Start accepts. Automaton has 22 states. Word has length 153 [2018-06-22 11:37:48,714 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:48,732 INFO ]: With dead ends: 471 [2018-06-22 11:37:48,732 INFO ]: Without dead ends: 458 [2018-06-22 11:37:48,733 INFO ]: 0 DeclaredPredicates, 183 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:37:48,733 INFO ]: Start minimizeSevpa. Operand 458 states. [2018-06-22 11:37:48,904 INFO ]: Finished minimizeSevpa. Reduced states from 458 to 392. [2018-06-22 11:37:48,904 INFO ]: Start removeUnreachable. Operand 392 states. [2018-06-22 11:37:48,915 INFO ]: Finished removeUnreachable. Reduced from 392 states to 392 states and 2316 transitions. [2018-06-22 11:37:48,915 INFO ]: Start accepts. Automaton has 392 states and 2316 transitions. Word has length 153 [2018-06-22 11:37:48,916 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:48,916 INFO ]: Abstraction has 392 states and 2316 transitions. [2018-06-22 11:37:48,916 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:37:48,916 INFO ]: Start isEmpty. Operand 392 states and 2316 transitions. [2018-06-22 11:37:48,939 INFO ]: Finished isEmpty. Found accepting run of length 222 [2018-06-22 11:37:48,939 INFO ]: Found error trace [2018-06-22 11:37:48,939 INFO ]: trace histogram [30, 17, 17, 17, 9, 9, 9, 9, 9, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:48,939 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:48,939 INFO ]: Analyzing trace with hash 1283264393, now seen corresponding path program 2 times [2018-06-22 11:37:48,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:48,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:48,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:48,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:37:48,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:48,963 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:49,381 INFO ]: Checked inductivity of 1678 backedges. 185 proven. 62 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-06-22 11:37:49,381 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:49,381 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) [2018-06-22 11:37:49,394 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:37:49,777 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:37:49,777 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:49,789 INFO ]: Computing forward predicates... [2018-06-22 11:37:50,208 INFO ]: Checked inductivity of 1678 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 1031 trivial. 0 not checked. [2018-06-22 11:37:50,244 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:37:50,244 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-06-22 11:37:50,244 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:37:50,245 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:37:50,245 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:37:50,245 INFO ]: Start difference. First operand 392 states and 2316 transitions. Second operand 10 states. [2018-06-22 11:37:50,595 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:50,595 INFO ]: Finished difference Result 515 states and 3464 transitions. [2018-06-22 11:37:50,595 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:37:50,595 INFO ]: Start accepts. Automaton has 10 states. Word has length 221 [2018-06-22 11:37:50,595 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:50,615 INFO ]: With dead ends: 515 [2018-06-22 11:37:50,615 INFO ]: Without dead ends: 495 [2018-06-22 11:37:50,615 INFO ]: 0 DeclaredPredicates, 233 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:37:50,619 INFO ]: Start minimizeSevpa. Operand 495 states. [2018-06-22 11:37:50,769 INFO ]: Finished minimizeSevpa. Reduced states from 495 to 362. [2018-06-22 11:37:50,769 INFO ]: Start removeUnreachable. Operand 362 states. [2018-06-22 11:37:50,780 INFO ]: Finished removeUnreachable. Reduced from 362 states to 362 states and 2042 transitions. [2018-06-22 11:37:50,780 INFO ]: Start accepts. Automaton has 362 states and 2042 transitions. Word has length 221 [2018-06-22 11:37:50,780 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:50,780 INFO ]: Abstraction has 362 states and 2042 transitions. [2018-06-22 11:37:50,780 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:37:50,780 INFO ]: Start isEmpty. Operand 362 states and 2042 transitions. [2018-06-22 11:37:50,801 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 11:37:50,801 INFO ]: Found error trace [2018-06-22 11:37:50,802 INFO ]: trace histogram [26, 13, 13, 13, 9, 9, 9, 9, 9, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:50,802 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:50,802 INFO ]: Analyzing trace with hash 1366425457, now seen corresponding path program 3 times [2018-06-22 11:37:50,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:50,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:50,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:50,803 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:37:50,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:50,858 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:51,121 INFO ]: Checked inductivity of 1290 backedges. 268 proven. 87 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-06-22 11:37:51,121 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:51,121 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:37:51,127 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:37:51,319 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 11:37:51,319 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:51,327 INFO ]: Computing forward predicates... [2018-06-22 11:37:51,824 INFO ]: Checked inductivity of 1290 backedges. 263 proven. 4 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2018-06-22 11:37:51,934 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:37:51,934 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-06-22 11:37:51,935 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:37:51,935 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:37:51,935 INFO ]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:37:51,935 INFO ]: Start difference. First operand 362 states and 2042 transitions. Second operand 11 states. [2018-06-22 11:37:52,796 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:52,797 INFO ]: Finished difference Result 637 states and 5227 transitions. [2018-06-22 11:37:52,798 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:37:52,798 INFO ]: Start accepts. Automaton has 11 states. Word has length 205 [2018-06-22 11:37:52,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:52,829 INFO ]: With dead ends: 637 [2018-06-22 11:37:52,839 INFO ]: Without dead ends: 633 [2018-06-22 11:37:52,839 INFO ]: 0 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:37:52,840 INFO ]: Start minimizeSevpa. Operand 633 states. [2018-06-22 11:37:53,088 INFO ]: Finished minimizeSevpa. Reduced states from 633 to 426. [2018-06-22 11:37:53,088 INFO ]: Start removeUnreachable. Operand 426 states. [2018-06-22 11:37:53,118 INFO ]: Finished removeUnreachable. Reduced from 426 states to 426 states and 2747 transitions. [2018-06-22 11:37:53,118 INFO ]: Start accepts. Automaton has 426 states and 2747 transitions. Word has length 205 [2018-06-22 11:37:53,118 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:53,118 INFO ]: Abstraction has 426 states and 2747 transitions. [2018-06-22 11:37:53,119 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:37:53,119 INFO ]: Start isEmpty. Operand 426 states and 2747 transitions. [2018-06-22 11:37:53,143 INFO ]: Finished isEmpty. Found accepting run of length 202 [2018-06-22 11:37:53,143 INFO ]: Found error trace [2018-06-22 11:37:53,143 INFO ]: trace histogram [25, 12, 12, 12, 9, 9, 9, 9, 9, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:53,143 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:53,143 INFO ]: Analyzing trace with hash 1431467233, now seen corresponding path program 2 times [2018-06-22 11:37:53,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:53,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:53,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:53,144 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:37:53,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:53,192 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:53,559 INFO ]: Checked inductivity of 1200 backedges. 197 proven. 11 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-06-22 11:37:53,560 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:53,560 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) [2018-06-22 11:37:53,576 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:37:53,858 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:37:53,858 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:53,869 INFO ]: Computing forward predicates... [2018-06-22 11:37:54,160 INFO ]: Checked inductivity of 1200 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2018-06-22 11:37:54,195 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:37:54,195 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-22 11:37:54,195 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:37:54,196 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:37:54,196 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:37:54,196 INFO ]: Start difference. First operand 426 states and 2747 transitions. Second operand 7 states. [2018-06-22 11:37:54,648 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:54,649 INFO ]: Finished difference Result 416 states and 2652 transitions. [2018-06-22 11:37:54,649 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:37:54,649 INFO ]: Start accepts. Automaton has 7 states. Word has length 201 [2018-06-22 11:37:54,649 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:54,663 INFO ]: With dead ends: 416 [2018-06-22 11:37:54,663 INFO ]: Without dead ends: 415 [2018-06-22 11:37:54,663 INFO ]: 0 DeclaredPredicates, 208 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:37:54,663 INFO ]: Start minimizeSevpa. Operand 415 states. [2018-06-22 11:37:54,771 INFO ]: Finished minimizeSevpa. Reduced states from 415 to 415. [2018-06-22 11:37:54,771 INFO ]: Start removeUnreachable. Operand 415 states. [2018-06-22 11:37:54,785 INFO ]: Finished removeUnreachable. Reduced from 415 states to 415 states and 2650 transitions. [2018-06-22 11:37:54,785 INFO ]: Start accepts. Automaton has 415 states and 2650 transitions. Word has length 201 [2018-06-22 11:37:54,785 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:54,785 INFO ]: Abstraction has 415 states and 2650 transitions. [2018-06-22 11:37:54,785 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:37:54,785 INFO ]: Start isEmpty. Operand 415 states and 2650 transitions. [2018-06-22 11:37:54,805 INFO ]: Finished isEmpty. Found accepting run of length 202 [2018-06-22 11:37:54,805 INFO ]: Found error trace [2018-06-22 11:37:54,805 INFO ]: trace histogram [25, 12, 12, 12, 9, 9, 9, 9, 9, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:54,806 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:54,806 INFO ]: Analyzing trace with hash 1010531243, now seen corresponding path program 4 times [2018-06-22 11:37:54,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:54,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:54,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:54,806 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:37:54,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:54,873 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:55,197 WARN ]: Spent 117.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 4 [2018-06-22 11:37:55,655 INFO ]: Checked inductivity of 1203 backedges. 197 proven. 135 refuted. 0 times theorem prover too weak. 871 trivial. 0 not checked. [2018-06-22 11:37:55,655 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:55,655 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:37:55,661 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:37:55,916 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:37:55,916 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:55,926 INFO ]: Computing forward predicates... [2018-06-22 11:37:56,288 INFO ]: Checked inductivity of 1203 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 1034 trivial. 0 not checked. [2018-06-22 11:37:56,313 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:37:56,313 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 22 [2018-06-22 11:37:56,314 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:37:56,314 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:37:56,314 INFO ]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:37:56,314 INFO ]: Start difference. First operand 415 states and 2650 transitions. Second operand 22 states. [2018-06-22 11:37:57,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:57,873 INFO ]: Finished difference Result 590 states and 3094 transitions. [2018-06-22 11:37:57,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 11:37:57,873 INFO ]: Start accepts. Automaton has 22 states. Word has length 201 [2018-06-22 11:37:57,874 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:57,899 INFO ]: With dead ends: 590 [2018-06-22 11:37:57,899 INFO ]: Without dead ends: 582 [2018-06-22 11:37:57,900 INFO ]: 0 DeclaredPredicates, 251 GetRequests, 210 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=137, Invalid=1345, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:37:57,900 INFO ]: Start minimizeSevpa. Operand 582 states. [2018-06-22 11:37:58,029 INFO ]: Finished minimizeSevpa. Reduced states from 582 to 476. [2018-06-22 11:37:58,029 INFO ]: Start removeUnreachable. Operand 476 states. [2018-06-22 11:37:58,038 INFO ]: Finished removeUnreachable. Reduced from 476 states to 476 states and 2141 transitions. [2018-06-22 11:37:58,038 INFO ]: Start accepts. Automaton has 476 states and 2141 transitions. Word has length 201 [2018-06-22 11:37:58,039 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:58,039 INFO ]: Abstraction has 476 states and 2141 transitions. [2018-06-22 11:37:58,039 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:37:58,039 INFO ]: Start isEmpty. Operand 476 states and 2141 transitions. [2018-06-22 11:37:58,057 INFO ]: Finished isEmpty. Found accepting run of length 354 [2018-06-22 11:37:58,057 INFO ]: Found error trace [2018-06-22 11:37:58,058 INFO ]: trace histogram [44, 21, 21, 21, 16, 16, 16, 16, 16, 11, 11, 11, 11, 8, 8, 8, 8, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:58,058 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:58,058 INFO ]: Analyzing trace with hash 934338152, now seen corresponding path program 5 times [2018-06-22 11:37:58,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:58,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:58,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:58,059 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:37:58,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:58,099 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:58,509 INFO ]: Checked inductivity of 3912 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 3757 trivial. 0 not checked. [2018-06-22 11:37:58,509 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:37:58,509 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:37:58,516 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:37:58,908 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-22 11:37:58,908 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:37:58,924 INFO ]: Computing forward predicates... [2018-06-22 11:37:59,268 INFO ]: Checked inductivity of 3912 backedges. 1389 proven. 24 refuted. 0 times theorem prover too weak. 2499 trivial. 0 not checked. [2018-06-22 11:37:59,292 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:37:59,292 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-06-22 11:37:59,293 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:37:59,293 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:37:59,293 INFO ]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:37:59,294 INFO ]: Start difference. First operand 476 states and 2141 transitions. Second operand 17 states. [2018-06-22 11:37:59,546 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:37:59,546 INFO ]: Finished difference Result 559 states and 2523 transitions. [2018-06-22 11:37:59,547 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:37:59,547 INFO ]: Start accepts. Automaton has 17 states. Word has length 353 [2018-06-22 11:37:59,548 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:37:59,565 INFO ]: With dead ends: 559 [2018-06-22 11:37:59,565 INFO ]: Without dead ends: 530 [2018-06-22 11:37:59,566 INFO ]: 0 DeclaredPredicates, 368 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:37:59,566 INFO ]: Start minimizeSevpa. Operand 530 states. [2018-06-22 11:37:59,665 INFO ]: Finished minimizeSevpa. Reduced states from 530 to 495. [2018-06-22 11:37:59,665 INFO ]: Start removeUnreachable. Operand 495 states. [2018-06-22 11:37:59,674 INFO ]: Finished removeUnreachable. Reduced from 495 states to 495 states and 2288 transitions. [2018-06-22 11:37:59,674 INFO ]: Start accepts. Automaton has 495 states and 2288 transitions. Word has length 353 [2018-06-22 11:37:59,675 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:37:59,675 INFO ]: Abstraction has 495 states and 2288 transitions. [2018-06-22 11:37:59,675 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:37:59,675 INFO ]: Start isEmpty. Operand 495 states and 2288 transitions. [2018-06-22 11:37:59,704 INFO ]: Finished isEmpty. Found accepting run of length 754 [2018-06-22 11:37:59,704 INFO ]: Found error trace [2018-06-22 11:37:59,704 INFO ]: trace histogram [89, 39, 39, 39, 39, 39, 38, 38, 38, 20, 20, 20, 20, 13, 13, 13, 13, 13, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:37:59,704 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:37:59,704 INFO ]: Analyzing trace with hash 1503367669, now seen corresponding path program 1 times [2018-06-22 11:37:59,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:37:59,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:37:59,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:59,705 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:37:59,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:37:59,896 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:38:00,933 INFO ]: Checked inductivity of 16993 backedges. 415 proven. 133 refuted. 0 times theorem prover too weak. 16445 trivial. 0 not checked. [2018-06-22 11:38:00,934 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:38:00,934 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:38:00,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:38:01,942 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:38:02,146 INFO ]: Computing forward predicates... [2018-06-22 11:38:02,701 INFO ]: Checked inductivity of 16993 backedges. 5277 proven. 315 refuted. 0 times theorem prover too weak. 11401 trivial. 0 not checked. [2018-06-22 11:38:02,725 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:38:02,725 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 20 [2018-06-22 11:38:02,726 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:38:02,726 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:38:02,727 INFO ]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:38:02,727 INFO ]: Start difference. First operand 495 states and 2288 transitions. Second operand 20 states. [2018-06-22 11:38:04,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:38:04,658 INFO ]: Finished difference Result 805 states and 4241 transitions. [2018-06-22 11:38:04,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:38:04,658 INFO ]: Start accepts. Automaton has 20 states. Word has length 753 [2018-06-22 11:38:04,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:38:04,692 INFO ]: With dead ends: 805 [2018-06-22 11:38:04,692 INFO ]: Without dead ends: 788 [2018-06-22 11:38:04,692 INFO ]: 0 DeclaredPredicates, 778 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:38:04,693 INFO ]: Start minimizeSevpa. Operand 788 states. [2018-06-22 11:38:04,899 INFO ]: Finished minimizeSevpa. Reduced states from 788 to 625. [2018-06-22 11:38:04,899 INFO ]: Start removeUnreachable. Operand 625 states. [2018-06-22 11:38:04,915 INFO ]: Finished removeUnreachable. Reduced from 625 states to 625 states and 3125 transitions. [2018-06-22 11:38:04,915 INFO ]: Start accepts. Automaton has 625 states and 3125 transitions. Word has length 753 [2018-06-22 11:38:04,917 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:38:04,917 INFO ]: Abstraction has 625 states and 3125 transitions. [2018-06-22 11:38:04,917 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:38:04,918 INFO ]: Start isEmpty. Operand 625 states and 3125 transitions. [2018-06-22 11:38:04,953 INFO ]: Finished isEmpty. Found accepting run of length 702 [2018-06-22 11:38:04,953 INFO ]: Found error trace [2018-06-22 11:38:04,954 INFO ]: trace histogram [97, 56, 56, 56, 30, 30, 30, 30, 30, 17, 17, 17, 17, 12, 12, 12, 12, 9, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:38:04,954 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:38:04,954 INFO ]: Analyzing trace with hash -758522333, now seen corresponding path program 2 times [2018-06-22 11:38:04,954 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:38:04,954 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:38:04,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:38:04,955 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:38:04,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:38:05,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:38:06,324 INFO ]: Checked inductivity of 18310 backedges. 426 proven. 179 refuted. 0 times theorem prover too weak. 17705 trivial. 0 not checked. [2018-06-22 11:38:06,324 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:38:06,324 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:38:06,331 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:38:07,124 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:38:07,125 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:38:07,150 INFO ]: Computing forward predicates... [2018-06-22 11:38:08,349 INFO ]: Checked inductivity of 18310 backedges. 8433 proven. 605 refuted. 0 times theorem prover too weak. 9272 trivial. 0 not checked. [2018-06-22 11:38:08,389 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:38:08,389 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 32 [2018-06-22 11:38:08,390 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:38:08,390 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:38:08,390 INFO ]: CoverageRelationStatistics Valid=65, Invalid=927, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:38:08,390 INFO ]: Start difference. First operand 625 states and 3125 transitions. Second operand 32 states. [2018-06-22 11:38:14,713 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:38:14,713 INFO ]: Finished difference Result 859 states and 4991 transitions. [2018-06-22 11:38:14,714 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-06-22 11:38:14,714 INFO ]: Start accepts. Automaton has 32 states. Word has length 701 [2018-06-22 11:38:14,715 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:38:14,762 INFO ]: With dead ends: 859 [2018-06-22 11:38:14,931 INFO ]: Without dead ends: 805 [2018-06-22 11:38:14,933 INFO ]: 0 DeclaredPredicates, 787 GetRequests, 698 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1687 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=618, Invalid=7214, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 11:38:14,934 INFO ]: Start minimizeSevpa. Operand 805 states. [2018-06-22 11:38:15,092 INFO ]: Finished minimizeSevpa. Reduced states from 805 to 592. [2018-06-22 11:38:15,092 INFO ]: Start removeUnreachable. Operand 592 states. [2018-06-22 11:38:15,103 INFO ]: Finished removeUnreachable. Reduced from 592 states to 592 states and 2611 transitions. [2018-06-22 11:38:15,103 INFO ]: Start accepts. Automaton has 592 states and 2611 transitions. Word has length 701 [2018-06-22 11:38:15,103 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:38:15,103 INFO ]: Abstraction has 592 states and 2611 transitions. [2018-06-22 11:38:15,103 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:38:15,103 INFO ]: Start isEmpty. Operand 592 states and 2611 transitions. [2018-06-22 11:38:15,118 INFO ]: Finished isEmpty. Found accepting run of length 694 [2018-06-22 11:38:15,118 INFO ]: Found error trace [2018-06-22 11:38:15,119 INFO ]: trace histogram [95, 54, 54, 54, 30, 30, 30, 30, 30, 17, 17, 17, 17, 12, 12, 12, 12, 9, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:38:15,119 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:38:15,119 INFO ]: Analyzing trace with hash -1634540777, now seen corresponding path program 3 times [2018-06-22 11:38:15,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:38:15,119 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:38:15,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:38:15,120 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:38:15,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:38:15,296 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:38:15,781 WARN ]: Spent 141.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-06-22 11:38:16,039 INFO ]: Checked inductivity of 17628 backedges. 245 proven. 97 refuted. 0 times theorem prover too weak. 17286 trivial. 0 not checked. [2018-06-22 11:38:16,039 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:38:16,039 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:38:16,051 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:38:16,444 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 11:38:16,444 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:38:16,462 INFO ]: Computing forward predicates... [2018-06-22 11:38:16,699 WARN ]: expecting exponential blowup for input size 6 [2018-06-22 11:38:17,186 INFO ]: Checked inductivity of 17628 backedges. 484 proven. 47 refuted. 0 times theorem prover too weak. 17097 trivial. 0 not checked. [2018-06-22 11:38:17,242 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:38:17,242 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2018-06-22 11:38:17,242 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:38:17,243 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:38:17,243 INFO ]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:38:17,243 INFO ]: Start difference. First operand 592 states and 2611 transitions. Second operand 26 states. Received shutdown request... [2018-06-22 11:38:17,627 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:38:17,627 WARN ]: Verification canceled [2018-06-22 11:38:17,635 WARN ]: Timeout [2018-06-22 11:38:17,635 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:38:17 BoogieIcfgContainer [2018-06-22 11:38:17,635 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:38:17,636 INFO ]: Toolchain (without parser) took 53120.93 ms. Allocated memory was 308.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 236.9 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 94.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:38:17,637 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:38:17,638 INFO ]: ChcToBoogie took 86.49 ms. Allocated memory is still 308.3 MB. Free memory was 236.9 MB in the beginning and 232.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:38:17,638 INFO ]: Boogie Preprocessor took 84.76 ms. Allocated memory is still 308.3 MB. Free memory was 232.8 MB in the beginning and 230.8 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:38:17,638 INFO ]: RCFGBuilder took 906.86 ms. Allocated memory was 308.3 MB in the beginning and 323.5 MB in the end (delta: 15.2 MB). Free memory was 230.8 MB in the beginning and 292.1 MB in the end (delta: -61.2 MB). Peak memory consumption was 49.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:38:17,639 INFO ]: TraceAbstraction took 52028.13 ms. Allocated memory was 323.5 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 292.1 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 134.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:38:17,640 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 86.49 ms. Allocated memory is still 308.3 MB. Free memory was 236.9 MB in the beginning and 232.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 84.76 ms. Allocated memory is still 308.3 MB. Free memory was 232.8 MB in the beginning and 230.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 906.86 ms. Allocated memory was 308.3 MB in the beginning and 323.5 MB in the end (delta: 15.2 MB). Free memory was 230.8 MB in the beginning and 292.1 MB in the end (delta: -61.2 MB). Peak memory consumption was 49.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 52028.13 ms. Allocated memory was 323.5 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 292.1 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 134.5 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 (592states) and interpolant automaton (currently 14 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 70 locations, 1 error locations. TIMEOUT Result, 51.9s OverallTime, 22 OverallIterations, 97 TraceHistogramMax, 25.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1589 SDtfs, 239 SDslu, 13135 SDs, 0 SdLazy, 19470 SolverSat, 1484 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4870 GetRequests, 4408 SyntacticMatches, 36 SemanticMatches, 426 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2738 ImplicationChecksByTransitivity, 16.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=625occurred in iteration=20, 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: 1.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 1096 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 8940 NumberOfCodeBlocks, 8311 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 8900 ConstructedInterpolants, 0 QuantifiedInterpolants, 4551032 SizeOfPredicates, 173 NumberOfNonLiveVariables, 37658 ConjunctsInSsa, 329 ConjunctsInUnsatCore, 40 InterpolantComputations, 8 PerfectInterpolantSequences, 129700/131894 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/Ackermann06.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-38-17-662.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann06.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-38-17-662.csv Completed graceful shutdown