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/mochi/enc-rev_append.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:29:43,772 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:29:43,776 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:29:43,791 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:29:43,791 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:29:43,792 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:29:43,793 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:29:43,795 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:29:43,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:29:43,797 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:29:43,798 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:29:43,799 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:29:43,799 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:29:43,800 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:29:43,801 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:29:43,805 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:29:43,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:29:43,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:29:43,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:29:43,822 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:29:43,823 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:29:43,825 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:29:43,826 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:29:43,826 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:29:43,827 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:29:43,827 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:29:43,828 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:29:43,829 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:29:43,835 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:29:43,835 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:29:43,835 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:29:43,836 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:29:43,836 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:29:43,837 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:29:43,837 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:29:43,840 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:29:43,858 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:29:43,858 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:29:43,858 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:29:43,858 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:29:43,859 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:29:43,859 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:29:43,860 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:29:43,860 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:29:43,860 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:29:43,860 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:29:43,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:29:43,861 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:29:43,861 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:29:43,862 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:29:43,862 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:29:43,862 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:29:43,862 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:29:43,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:29:43,862 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:29:43,864 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:29:43,864 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:29:43,906 INFO ]: Repository-Root is: /tmp [2018-06-22 11:29:43,923 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:29:43,927 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:29:43,928 INFO ]: Initializing SmtParser... [2018-06-22 11:29:43,929 INFO ]: SmtParser initialized [2018-06-22 11:29:43,929 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/enc-rev_append.smt2 [2018-06-22 11:29:43,930 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:29:44,027 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/enc-rev_append.smt2 unknown [2018-06-22 11:29:44,217 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/enc-rev_append.smt2 [2018-06-22 11:29:44,222 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:29:44,227 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:29:44,228 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:29:44,228 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:29:44,228 INFO ]: ChcToBoogie initialized [2018-06-22 11:29:44,234 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:29:44" (1/1) ... [2018-06-22 11:29:44,264 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:44 Unit [2018-06-22 11:29:44,265 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:29:44,265 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:29:44,265 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:29:44,265 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:29:44,286 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:44" (1/1) ... [2018-06-22 11:29:44,287 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:44" (1/1) ... [2018-06-22 11:29:44,294 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:44" (1/1) ... [2018-06-22 11:29:44,294 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:44" (1/1) ... [2018-06-22 11:29:44,296 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:44" (1/1) ... [2018-06-22 11:29:44,299 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:44" (1/1) ... [2018-06-22 11:29:44,300 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:44" (1/1) ... [2018-06-22 11:29:44,301 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:29:44,301 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:29:44,301 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:29:44,302 INFO ]: RCFGBuilder initialized [2018-06-22 11:29:44,302 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:44" (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:29:44,312 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:29:44,312 INFO ]: Found specification of procedure False [2018-06-22 11:29:44,312 INFO ]: Found implementation of procedure False [2018-06-22 11:29:44,312 INFO ]: Specification and implementation of procedure appendDLRunknownCLN3 given in one single declaration [2018-06-22 11:29:44,312 INFO ]: Found specification of procedure appendDLRunknownCLN3 [2018-06-22 11:29:44,312 INFO ]: Found implementation of procedure appendDLRunknownCLN3 [2018-06-22 11:29:44,312 INFO ]: Specification and implementation of procedure revDLRunknownCLN5 given in one single declaration [2018-06-22 11:29:44,312 INFO ]: Found specification of procedure revDLRunknownCLN5 [2018-06-22 11:29:44,312 INFO ]: Found implementation of procedure revDLRunknownCLN5 [2018-06-22 11:29:44,312 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:29:44,312 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:29:44,312 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:29:44,599 INFO ]: Using library mode [2018-06-22 11:29:44,600 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:29:44 BoogieIcfgContainer [2018-06-22 11:29:44,600 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:29:44,601 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:29:44,601 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:29:44,604 INFO ]: TraceAbstraction initialized [2018-06-22 11:29:44,605 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:29:44" (1/3) ... [2018-06-22 11:29:44,606 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5064f8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:29:44, skipping insertion in model container [2018-06-22 11:29:44,606 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:29:44" (2/3) ... [2018-06-22 11:29:44,606 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5064f8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:29:44, skipping insertion in model container [2018-06-22 11:29:44,606 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:29:44" (3/3) ... [2018-06-22 11:29:44,608 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:29:44,617 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:29:44,627 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:29:44,672 INFO ]: Using default assertion order modulation [2018-06-22 11:29:44,673 INFO ]: Interprodecural is true [2018-06-22 11:29:44,673 INFO ]: Hoare is false [2018-06-22 11:29:44,673 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:29:44,673 INFO ]: Backedges is TWOTRACK [2018-06-22 11:29:44,673 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:29:44,673 INFO ]: Difference is false [2018-06-22 11:29:44,673 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:29:44,673 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:29:44,685 INFO ]: Start isEmpty. Operand 20 states. [2018-06-22 11:29:44,695 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:29:44,695 INFO ]: Found error trace [2018-06-22 11:29:44,696 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:29:44,696 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:44,700 INFO ]: Analyzing trace with hash 90170763, now seen corresponding path program 1 times [2018-06-22 11:29:44,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:44,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:44,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:44,732 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:44,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:44,746 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:44,768 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:29:44,770 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:29:44,770 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:29:44,772 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:29:44,783 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:29:44,783 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:29:44,785 INFO ]: Start difference. First operand 20 states. Second operand 2 states. [2018-06-22 11:29:44,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:44,804 INFO ]: Finished difference Result 18 states and 24 transitions. [2018-06-22 11:29:44,804 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:29:44,805 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:29:44,805 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:44,827 INFO ]: With dead ends: 18 [2018-06-22 11:29:44,827 INFO ]: Without dead ends: 18 [2018-06-22 11:29:44,828 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:29:44,840 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 11:29:44,859 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 11:29:44,860 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:29:44,861 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-06-22 11:29:44,862 INFO ]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 5 [2018-06-22 11:29:44,862 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:44,863 INFO ]: Abstraction has 18 states and 24 transitions. [2018-06-22 11:29:44,863 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:29:44,863 INFO ]: Start isEmpty. Operand 18 states and 24 transitions. [2018-06-22 11:29:44,864 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:29:44,864 INFO ]: Found error trace [2018-06-22 11:29:44,864 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:44,864 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:44,864 INFO ]: Analyzing trace with hash -1034040885, now seen corresponding path program 1 times [2018-06-22 11:29:44,864 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:44,864 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:44,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:44,865 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:44,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:44,882 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:44,930 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:29:44,930 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:29:44,930 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:29:44,931 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:29:44,931 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:29:44,931 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:29:44,931 INFO ]: Start difference. First operand 18 states and 24 transitions. Second operand 4 states. [2018-06-22 11:29:44,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:44,989 INFO ]: Finished difference Result 22 states and 29 transitions. [2018-06-22 11:29:44,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:29:44,990 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:29:44,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:44,990 INFO ]: With dead ends: 22 [2018-06-22 11:29:44,990 INFO ]: Without dead ends: 22 [2018-06-22 11:29:44,991 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:29:44,991 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:29:44,998 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-22 11:29:44,998 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:29:44,999 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-22 11:29:44,999 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 9 [2018-06-22 11:29:44,999 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:44,999 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-22 11:29:44,999 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:29:44,999 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-22 11:29:45,000 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:29:45,000 INFO ]: Found error trace [2018-06-22 11:29:45,000 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:45,000 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:45,001 INFO ]: Analyzing trace with hash -246949530, now seen corresponding path program 1 times [2018-06-22 11:29:45,001 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:45,001 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:45,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:45,002 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:45,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:45,013 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:45,380 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:29:45,380 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:29:45,380 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:29:45,380 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:29:45,380 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:29:45,380 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:29:45,383 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 6 states. [2018-06-22 11:29:45,527 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:45,527 INFO ]: Finished difference Result 27 states and 37 transitions. [2018-06-22 11:29:45,527 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:29:45,527 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:29:45,527 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:45,528 INFO ]: With dead ends: 27 [2018-06-22 11:29:45,528 INFO ]: Without dead ends: 27 [2018-06-22 11:29:45,529 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:29:45,529 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:29:45,539 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-06-22 11:29:45,539 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:29:45,541 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2018-06-22 11:29:45,541 INFO ]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 13 [2018-06-22 11:29:45,541 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:45,541 INFO ]: Abstraction has 23 states and 33 transitions. [2018-06-22 11:29:45,541 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:29:45,541 INFO ]: Start isEmpty. Operand 23 states and 33 transitions. [2018-06-22 11:29:45,542 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:29:45,542 INFO ]: Found error trace [2018-06-22 11:29:45,542 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:45,542 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:45,543 INFO ]: Analyzing trace with hash -384562606, now seen corresponding path program 1 times [2018-06-22 11:29:45,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:45,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:45,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:45,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:45,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:45,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:45,687 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:29:45,687 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:45,687 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:29:45,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:45,725 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:45,733 INFO ]: Computing forward predicates... [2018-06-22 11:29:46,385 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:29:46,415 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:46,415 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:29:46,416 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:29:46,416 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:29:46,416 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:29:46,416 INFO ]: Start difference. First operand 23 states and 33 transitions. Second operand 11 states. [2018-06-22 11:29:46,654 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 11:29:47,102 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:47,102 INFO ]: Finished difference Result 30 states and 45 transitions. [2018-06-22 11:29:47,103 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:29:47,103 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:29:47,103 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:47,104 INFO ]: With dead ends: 30 [2018-06-22 11:29:47,104 INFO ]: Without dead ends: 30 [2018-06-22 11:29:47,105 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:29:47,105 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:29:47,111 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-06-22 11:29:47,111 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:29:47,113 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2018-06-22 11:29:47,113 INFO ]: Start accepts. Automaton has 26 states and 39 transitions. Word has length 17 [2018-06-22 11:29:47,113 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:47,113 INFO ]: Abstraction has 26 states and 39 transitions. [2018-06-22 11:29:47,113 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:29:47,113 INFO ]: Start isEmpty. Operand 26 states and 39 transitions. [2018-06-22 11:29:47,114 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:29:47,114 INFO ]: Found error trace [2018-06-22 11:29:47,114 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:47,114 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:47,114 INFO ]: Analyzing trace with hash 1485217704, now seen corresponding path program 1 times [2018-06-22 11:29:47,114 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:47,114 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:47,115 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:47,115 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:47,115 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:47,125 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:47,193 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:29:47,193 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:29:47,193 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:29:47,193 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:29:47,193 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:29:47,193 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:29:47,193 INFO ]: Start difference. First operand 26 states and 39 transitions. Second operand 8 states. [2018-06-22 11:29:47,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:47,424 INFO ]: Finished difference Result 30 states and 45 transitions. [2018-06-22 11:29:47,424 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:29:47,424 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:29:47,424 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:47,425 INFO ]: With dead ends: 30 [2018-06-22 11:29:47,425 INFO ]: Without dead ends: 27 [2018-06-22 11:29:47,425 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:29:47,425 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:29:47,431 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:29:47,432 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:29:47,432 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2018-06-22 11:29:47,432 INFO ]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 17 [2018-06-22 11:29:47,433 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:47,433 INFO ]: Abstraction has 25 states and 36 transitions. [2018-06-22 11:29:47,433 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:29:47,433 INFO ]: Start isEmpty. Operand 25 states and 36 transitions. [2018-06-22 11:29:47,434 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:29:47,434 INFO ]: Found error trace [2018-06-22 11:29:47,434 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:47,435 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:47,435 INFO ]: Analyzing trace with hash -1421240979, now seen corresponding path program 1 times [2018-06-22 11:29:47,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:47,435 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:47,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:47,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:47,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:47,446 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:47,497 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:29:47,497 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:29:47,497 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:29:47,497 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:29:47,497 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:29:47,497 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:29:47,497 INFO ]: Start difference. First operand 25 states and 36 transitions. Second operand 5 states. [2018-06-22 11:29:47,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:47,569 INFO ]: Finished difference Result 27 states and 37 transitions. [2018-06-22 11:29:47,570 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:29:47,570 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 11:29:47,570 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:47,571 INFO ]: With dead ends: 27 [2018-06-22 11:29:47,571 INFO ]: Without dead ends: 27 [2018-06-22 11:29:47,571 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:29:47,571 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:29:47,576 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:29:47,576 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:29:47,577 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-06-22 11:29:47,577 INFO ]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 21 [2018-06-22 11:29:47,577 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:47,577 INFO ]: Abstraction has 25 states and 35 transitions. [2018-06-22 11:29:47,577 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:29:47,577 INFO ]: Start isEmpty. Operand 25 states and 35 transitions. [2018-06-22 11:29:47,578 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:29:47,578 INFO ]: Found error trace [2018-06-22 11:29:47,578 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:47,578 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:47,578 INFO ]: Analyzing trace with hash -1684542223, now seen corresponding path program 1 times [2018-06-22 11:29:47,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:47,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:47,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:47,579 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:47,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:47,595 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:47,704 INFO ]: Checked inductivity of 22 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:29:47,704 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:47,704 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:29:47,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:47,741 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:47,744 INFO ]: Computing forward predicates... [2018-06-22 11:29:47,796 INFO ]: Checked inductivity of 22 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:29:47,818 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:47,818 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-22 11:29:47,819 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:29:47,819 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:29:47,819 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:29:47,819 INFO ]: Start difference. First operand 25 states and 35 transitions. Second operand 12 states. [2018-06-22 11:29:48,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:48,113 INFO ]: Finished difference Result 32 states and 48 transitions. [2018-06-22 11:29:48,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:29:48,113 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 11:29:48,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:48,116 INFO ]: With dead ends: 32 [2018-06-22 11:29:48,116 INFO ]: Without dead ends: 32 [2018-06-22 11:29:48,116 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:29:48,116 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:29:48,124 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-22 11:29:48,124 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:29:48,125 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2018-06-22 11:29:48,125 INFO ]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 29 [2018-06-22 11:29:48,125 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:48,125 INFO ]: Abstraction has 30 states and 46 transitions. [2018-06-22 11:29:48,125 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:29:48,125 INFO ]: Start isEmpty. Operand 30 states and 46 transitions. [2018-06-22 11:29:48,126 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:29:48,126 INFO ]: Found error trace [2018-06-22 11:29:48,126 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:48,126 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:48,126 INFO ]: Analyzing trace with hash -315220716, now seen corresponding path program 1 times [2018-06-22 11:29:48,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:48,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:48,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:48,127 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:48,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:48,135 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:48,167 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:29:48,167 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:29:48,167 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:29:48,167 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:29:48,167 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:29:48,167 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:29:48,167 INFO ]: Start difference. First operand 30 states and 46 transitions. Second operand 5 states. [2018-06-22 11:29:48,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:48,196 INFO ]: Finished difference Result 28 states and 40 transitions. [2018-06-22 11:29:48,197 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:29:48,197 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 11:29:48,197 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:48,198 INFO ]: With dead ends: 28 [2018-06-22 11:29:48,198 INFO ]: Without dead ends: 28 [2018-06-22 11:29:48,198 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:29:48,198 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:29:48,203 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 11:29:48,203 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:29:48,206 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-06-22 11:29:48,206 INFO ]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 21 [2018-06-22 11:29:48,207 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:48,207 INFO ]: Abstraction has 28 states and 40 transitions. [2018-06-22 11:29:48,207 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:29:48,207 INFO ]: Start isEmpty. Operand 28 states and 40 transitions. [2018-06-22 11:29:48,208 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:29:48,208 INFO ]: Found error trace [2018-06-22 11:29:48,208 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:48,208 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:48,208 INFO ]: Analyzing trace with hash -2085814225, now seen corresponding path program 2 times [2018-06-22 11:29:48,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:48,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:48,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:48,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:48,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:48,219 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:48,467 INFO ]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:29:48,467 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:48,467 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:29:48,473 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:29:48,489 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:29:48,489 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:48,491 INFO ]: Computing forward predicates... [2018-06-22 11:29:48,584 INFO ]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:29:48,603 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:48,603 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 13 [2018-06-22 11:29:48,603 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:29:48,603 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:29:48,604 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:29:48,604 INFO ]: Start difference. First operand 28 states and 40 transitions. Second operand 13 states. [2018-06-22 11:29:48,874 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:48,874 INFO ]: Finished difference Result 30 states and 40 transitions. [2018-06-22 11:29:48,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:29:48,875 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 11:29:48,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:48,876 INFO ]: With dead ends: 30 [2018-06-22 11:29:48,876 INFO ]: Without dead ends: 29 [2018-06-22 11:29:48,876 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:29:48,876 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:29:48,881 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 11:29:48,882 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:29:48,882 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-06-22 11:29:48,882 INFO ]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 25 [2018-06-22 11:29:48,883 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:48,883 INFO ]: Abstraction has 27 states and 36 transitions. [2018-06-22 11:29:48,883 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:29:48,883 INFO ]: Start isEmpty. Operand 27 states and 36 transitions. [2018-06-22 11:29:48,884 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:29:48,884 INFO ]: Found error trace [2018-06-22 11:29:48,884 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:48,884 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:48,884 INFO ]: Analyzing trace with hash 1575258777, now seen corresponding path program 2 times [2018-06-22 11:29:48,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:48,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:48,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:48,885 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:29:48,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:48,891 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:49,172 INFO ]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:29:49,172 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:49,172 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:29:49,178 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:29:49,195 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:29:49,195 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:49,197 INFO ]: Computing forward predicates... [2018-06-22 11:29:49,231 INFO ]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:29:49,262 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:49,262 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-22 11:29:49,262 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:29:49,262 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:29:49,262 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:29:49,262 INFO ]: Start difference. First operand 27 states and 36 transitions. Second operand 11 states. [2018-06-22 11:29:49,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:49,448 INFO ]: Finished difference Result 32 states and 47 transitions. [2018-06-22 11:29:49,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:29:49,448 INFO ]: Start accepts. Automaton has 11 states. Word has length 25 [2018-06-22 11:29:49,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:49,449 INFO ]: With dead ends: 32 [2018-06-22 11:29:49,449 INFO ]: Without dead ends: 32 [2018-06-22 11:29:49,449 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:29:49,450 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:29:49,454 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-22 11:29:49,454 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:29:49,455 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-06-22 11:29:49,455 INFO ]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 25 [2018-06-22 11:29:49,455 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:49,455 INFO ]: Abstraction has 30 states and 43 transitions. [2018-06-22 11:29:49,455 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:29:49,455 INFO ]: Start isEmpty. Operand 30 states and 43 transitions. [2018-06-22 11:29:49,456 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:29:49,456 INFO ]: Found error trace [2018-06-22 11:29:49,456 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:49,456 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:49,456 INFO ]: Analyzing trace with hash -1347011811, now seen corresponding path program 2 times [2018-06-22 11:29:49,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:49,456 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:49,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:49,457 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:29:49,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:49,466 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:49,539 INFO ]: Checked inductivity of 30 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:29:49,539 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:49,539 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:29:49,545 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:29:49,561 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:29:49,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:49,563 INFO ]: Computing forward predicates... [2018-06-22 11:29:49,713 INFO ]: Checked inductivity of 30 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:29:49,733 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:49,733 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-22 11:29:49,733 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:29:49,733 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:29:49,733 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:29:49,733 INFO ]: Start difference. First operand 30 states and 43 transitions. Second operand 13 states. [2018-06-22 11:29:49,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:49,958 INFO ]: Finished difference Result 32 states and 46 transitions. [2018-06-22 11:29:49,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:29:49,958 INFO ]: Start accepts. Automaton has 13 states. Word has length 33 [2018-06-22 11:29:49,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:49,960 INFO ]: With dead ends: 32 [2018-06-22 11:29:49,960 INFO ]: Without dead ends: 32 [2018-06-22 11:29:49,962 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:29:49,962 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:29:49,974 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-22 11:29:49,974 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:29:49,975 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-06-22 11:29:49,975 INFO ]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 33 [2018-06-22 11:29:49,975 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:49,975 INFO ]: Abstraction has 30 states and 42 transitions. [2018-06-22 11:29:49,975 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:29:49,975 INFO ]: Start isEmpty. Operand 30 states and 42 transitions. [2018-06-22 11:29:49,976 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:29:49,977 INFO ]: Found error trace [2018-06-22 11:29:49,977 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:49,977 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:49,977 INFO ]: Analyzing trace with hash -1985011237, now seen corresponding path program 3 times [2018-06-22 11:29:49,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:49,977 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:49,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:49,978 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:29:49,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:49,990 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:50,156 INFO ]: Checked inductivity of 20 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:29:50,156 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:50,156 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:29:50,164 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:29:50,191 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:29:50,192 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:50,194 INFO ]: Computing forward predicates... [2018-06-22 11:29:50,317 INFO ]: Checked inductivity of 20 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:29:50,338 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:50,338 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-22 11:29:50,338 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:29:50,338 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:29:50,338 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:29:50,338 INFO ]: Start difference. First operand 30 states and 42 transitions. Second operand 15 states. [2018-06-22 11:29:50,526 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:50,526 INFO ]: Finished difference Result 35 states and 49 transitions. [2018-06-22 11:29:50,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:29:50,526 INFO ]: Start accepts. Automaton has 15 states. Word has length 29 [2018-06-22 11:29:50,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:50,527 INFO ]: With dead ends: 35 [2018-06-22 11:29:50,527 INFO ]: Without dead ends: 35 [2018-06-22 11:29:50,527 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:29:50,527 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:29:50,532 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:29:50,532 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:29:50,533 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-06-22 11:29:50,533 INFO ]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 29 [2018-06-22 11:29:50,533 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:50,533 INFO ]: Abstraction has 33 states and 47 transitions. [2018-06-22 11:29:50,533 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:29:50,533 INFO ]: Start isEmpty. Operand 33 states and 47 transitions. [2018-06-22 11:29:50,534 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:29:50,534 INFO ]: Found error trace [2018-06-22 11:29:50,534 INFO ]: trace histogram [6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:50,534 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:50,534 INFO ]: Analyzing trace with hash 1299906938, now seen corresponding path program 3 times [2018-06-22 11:29:50,534 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:50,534 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:50,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:50,535 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:29:50,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:50,548 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:50,687 INFO ]: Checked inductivity of 59 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 11:29:50,687 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:50,687 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:29:50,693 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:29:50,752 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:29:50,752 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:50,755 INFO ]: Computing forward predicates... [2018-06-22 11:29:51,108 INFO ]: Checked inductivity of 59 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 11:29:51,126 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:51,126 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 11:29:51,127 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:29:51,127 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:29:51,127 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:29:51,127 INFO ]: Start difference. First operand 33 states and 47 transitions. Second operand 12 states. [2018-06-22 11:29:51,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:51,389 INFO ]: Finished difference Result 40 states and 57 transitions. [2018-06-22 11:29:51,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:29:51,390 INFO ]: Start accepts. Automaton has 12 states. Word has length 41 [2018-06-22 11:29:51,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:51,391 INFO ]: With dead ends: 40 [2018-06-22 11:29:51,391 INFO ]: Without dead ends: 40 [2018-06-22 11:29:51,391 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:29:51,391 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:29:51,409 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-06-22 11:29:51,409 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:29:51,409 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2018-06-22 11:29:51,409 INFO ]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 41 [2018-06-22 11:29:51,413 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:51,413 INFO ]: Abstraction has 36 states and 53 transitions. [2018-06-22 11:29:51,413 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:29:51,413 INFO ]: Start isEmpty. Operand 36 states and 53 transitions. [2018-06-22 11:29:51,414 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:29:51,414 INFO ]: Found error trace [2018-06-22 11:29:51,414 INFO ]: trace histogram [7, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:51,414 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:51,415 INFO ]: Analyzing trace with hash 2086421436, now seen corresponding path program 4 times [2018-06-22 11:29:51,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:51,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:51,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:51,415 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:29:51,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:51,429 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:51,504 INFO ]: Checked inductivity of 80 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:29:51,504 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:51,504 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) [2018-06-22 11:29:51,518 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:29:51,552 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:29:51,552 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:51,555 INFO ]: Computing forward predicates... [2018-06-22 11:29:51,604 INFO ]: Checked inductivity of 80 backedges. 33 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:29:51,623 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:51,623 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-06-22 11:29:51,623 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:29:51,624 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:29:51,624 INFO ]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:29:51,624 INFO ]: Start difference. First operand 36 states and 53 transitions. Second operand 14 states. [2018-06-22 11:29:51,741 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:51,741 INFO ]: Finished difference Result 36 states and 52 transitions. [2018-06-22 11:29:51,741 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:29:51,741 INFO ]: Start accepts. Automaton has 14 states. Word has length 45 [2018-06-22 11:29:51,742 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:51,742 INFO ]: With dead ends: 36 [2018-06-22 11:29:51,742 INFO ]: Without dead ends: 35 [2018-06-22 11:29:51,743 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:29:51,743 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:29:51,747 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:29:51,748 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:29:51,748 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2018-06-22 11:29:51,748 INFO ]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 45 [2018-06-22 11:29:51,748 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:51,748 INFO ]: Abstraction has 33 states and 46 transitions. [2018-06-22 11:29:51,748 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:29:51,748 INFO ]: Start isEmpty. Operand 33 states and 46 transitions. [2018-06-22 11:29:51,749 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:29:51,749 INFO ]: Found error trace [2018-06-22 11:29:51,749 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:51,750 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:51,750 INFO ]: Analyzing trace with hash 354007266, now seen corresponding path program 4 times [2018-06-22 11:29:51,750 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:51,750 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:51,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:51,750 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:29:51,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:51,758 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:51,905 INFO ]: Checked inductivity of 42 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:29:51,905 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:51,905 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:29:51,912 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:29:51,925 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:29:51,925 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:51,927 INFO ]: Computing forward predicates... [2018-06-22 11:29:52,342 INFO ]: Checked inductivity of 42 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:29:52,362 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:52,362 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-06-22 11:29:52,362 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:29:52,362 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:29:52,362 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:29:52,363 INFO ]: Start difference. First operand 33 states and 46 transitions. Second operand 14 states. [2018-06-22 11:29:52,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:52,549 INFO ]: Finished difference Result 30 states and 39 transitions. [2018-06-22 11:29:52,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:29:52,549 INFO ]: Start accepts. Automaton has 14 states. Word has length 37 [2018-06-22 11:29:52,550 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:52,550 INFO ]: With dead ends: 30 [2018-06-22 11:29:52,550 INFO ]: Without dead ends: 30 [2018-06-22 11:29:52,551 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:29:52,551 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:29:52,554 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 11:29:52,554 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:29:52,554 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2018-06-22 11:29:52,554 INFO ]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 37 [2018-06-22 11:29:52,555 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:52,555 INFO ]: Abstraction has 30 states and 39 transitions. [2018-06-22 11:29:52,555 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:29:52,555 INFO ]: Start isEmpty. Operand 30 states and 39 transitions. [2018-06-22 11:29:52,555 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:29:52,555 INFO ]: Found error trace [2018-06-22 11:29:52,555 INFO ]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:52,555 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:52,556 INFO ]: Analyzing trace with hash 715260836, now seen corresponding path program 5 times [2018-06-22 11:29:52,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:52,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:52,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:52,556 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:29:52,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:52,564 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:52,660 INFO ]: Checked inductivity of 55 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:29:52,661 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:52,661 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:29:52,667 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:29:52,685 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 11:29:52,685 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:52,687 INFO ]: Computing forward predicates... [2018-06-22 11:29:52,750 INFO ]: Checked inductivity of 55 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:29:52,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:52,769 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-22 11:29:52,769 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:29:52,769 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:29:52,769 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:29:52,770 INFO ]: Start difference. First operand 30 states and 39 transitions. Second operand 14 states. [2018-06-22 11:29:52,999 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:52,999 INFO ]: Finished difference Result 30 states and 38 transitions. [2018-06-22 11:29:52,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:29:52,999 INFO ]: Start accepts. Automaton has 14 states. Word has length 41 [2018-06-22 11:29:52,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:53,000 INFO ]: With dead ends: 30 [2018-06-22 11:29:53,000 INFO ]: Without dead ends: 30 [2018-06-22 11:29:53,000 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:29:53,000 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:29:53,002 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 11:29:53,002 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:29:53,003 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-06-22 11:29:53,003 INFO ]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 41 [2018-06-22 11:29:53,003 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:53,003 INFO ]: Abstraction has 30 states and 38 transitions. [2018-06-22 11:29:53,003 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:29:53,003 INFO ]: Start isEmpty. Operand 30 states and 38 transitions. [2018-06-22 11:29:53,004 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:29:53,004 INFO ]: Found error trace [2018-06-22 11:29:53,004 INFO ]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:53,004 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:53,004 INFO ]: Analyzing trace with hash -178188186, now seen corresponding path program 6 times [2018-06-22 11:29:53,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:53,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:53,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:53,004 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:29:53,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:53,015 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:53,480 INFO ]: Checked inductivity of 72 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 11:29:53,480 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:53,480 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:29:53,488 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:29:53,513 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 11:29:53,513 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:53,516 INFO ]: Computing forward predicates... [2018-06-22 11:29:53,751 INFO ]: Checked inductivity of 72 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 11:29:53,770 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:53,770 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-06-22 11:29:53,771 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:29:53,771 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:29:53,771 INFO ]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:29:53,771 INFO ]: Start difference. First operand 30 states and 38 transitions. Second operand 17 states. [2018-06-22 11:29:54,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:54,095 INFO ]: Finished difference Result 39 states and 54 transitions. [2018-06-22 11:29:54,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:29:54,095 INFO ]: Start accepts. Automaton has 17 states. Word has length 45 [2018-06-22 11:29:54,095 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:54,096 INFO ]: With dead ends: 39 [2018-06-22 11:29:54,096 INFO ]: Without dead ends: 39 [2018-06-22 11:29:54,096 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:29:54,096 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:29:54,100 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-06-22 11:29:54,100 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:29:54,101 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2018-06-22 11:29:54,101 INFO ]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 45 [2018-06-22 11:29:54,101 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:54,101 INFO ]: Abstraction has 35 states and 48 transitions. [2018-06-22 11:29:54,101 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:29:54,101 INFO ]: Start isEmpty. Operand 35 states and 48 transitions. [2018-06-22 11:29:54,104 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:29:54,104 INFO ]: Found error trace [2018-06-22 11:29:54,104 INFO ]: trace histogram [7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:54,105 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:54,105 INFO ]: Analyzing trace with hash -1602937048, now seen corresponding path program 7 times [2018-06-22 11:29:54,105 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:54,105 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:54,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:54,105 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:29:54,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:54,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:54,350 INFO ]: Checked inductivity of 93 backedges. 37 proven. 23 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 11:29:54,350 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:54,350 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:29:54,363 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:54,382 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:54,385 INFO ]: Computing forward predicates... [2018-06-22 11:29:54,474 INFO ]: Checked inductivity of 93 backedges. 31 proven. 29 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 11:29:54,493 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:54,493 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-22 11:29:54,494 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:29:54,494 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:29:54,494 INFO ]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:29:54,494 INFO ]: Start difference. First operand 35 states and 48 transitions. Second operand 16 states. [2018-06-22 11:29:54,680 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:54,680 INFO ]: Finished difference Result 35 states and 47 transitions. [2018-06-22 11:29:54,680 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:29:54,681 INFO ]: Start accepts. Automaton has 16 states. Word has length 49 [2018-06-22 11:29:54,681 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:54,681 INFO ]: With dead ends: 35 [2018-06-22 11:29:54,681 INFO ]: Without dead ends: 35 [2018-06-22 11:29:54,681 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:29:54,681 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:29:54,685 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 11:29:54,685 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:29:54,685 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-06-22 11:29:54,685 INFO ]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 49 [2018-06-22 11:29:54,686 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:54,686 INFO ]: Abstraction has 35 states and 47 transitions. [2018-06-22 11:29:54,686 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:29:54,686 INFO ]: Start isEmpty. Operand 35 states and 47 transitions. [2018-06-22 11:29:54,686 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:29:54,686 INFO ]: Found error trace [2018-06-22 11:29:54,687 INFO ]: trace histogram [10, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:54,687 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:54,690 INFO ]: Analyzing trace with hash -781653433, now seen corresponding path program 5 times [2018-06-22 11:29:54,690 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:54,690 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:54,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:54,691 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:54,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:54,703 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:54,855 INFO ]: Checked inductivity of 174 backedges. 57 proven. 27 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-06-22 11:29:54,856 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:54,856 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:29:54,861 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:29:54,898 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 11:29:54,898 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:54,901 INFO ]: Computing forward predicates... [2018-06-22 11:29:55,031 INFO ]: Checked inductivity of 174 backedges. 57 proven. 27 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-06-22 11:29:55,058 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:55,058 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-22 11:29:55,059 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:29:55,059 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:29:55,059 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:29:55,059 INFO ]: Start difference. First operand 35 states and 47 transitions. Second operand 14 states. [2018-06-22 11:29:55,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:55,518 INFO ]: Finished difference Result 42 states and 58 transitions. [2018-06-22 11:29:55,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:29:55,518 INFO ]: Start accepts. Automaton has 14 states. Word has length 61 [2018-06-22 11:29:55,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:55,518 INFO ]: With dead ends: 42 [2018-06-22 11:29:55,518 INFO ]: Without dead ends: 42 [2018-06-22 11:29:55,519 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:29:55,519 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:29:55,526 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-06-22 11:29:55,526 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:29:55,527 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2018-06-22 11:29:55,527 INFO ]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 61 [2018-06-22 11:29:55,527 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:55,527 INFO ]: Abstraction has 38 states and 54 transitions. [2018-06-22 11:29:55,527 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:29:55,527 INFO ]: Start isEmpty. Operand 38 states and 54 transitions. [2018-06-22 11:29:55,528 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:29:55,528 INFO ]: Found error trace [2018-06-22 11:29:55,528 INFO ]: trace histogram [11, 7, 7, 7, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:55,528 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:55,528 INFO ]: Analyzing trace with hash -1234423543, now seen corresponding path program 6 times [2018-06-22 11:29:55,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:55,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:55,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:55,529 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:29:55,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:55,540 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:56,265 INFO ]: Checked inductivity of 210 backedges. 92 proven. 15 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-06-22 11:29:56,266 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:56,266 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:29:56,272 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:29:56,307 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:29:56,307 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:56,310 INFO ]: Computing forward predicates... [2018-06-22 11:29:56,480 INFO ]: Checked inductivity of 210 backedges. 68 proven. 30 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-06-22 11:29:56,501 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:56,501 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-06-22 11:29:56,502 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:29:56,502 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:29:56,502 INFO ]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:29:56,502 INFO ]: Start difference. First operand 38 states and 54 transitions. Second operand 25 states. [2018-06-22 11:29:56,847 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:56,847 INFO ]: Finished difference Result 45 states and 72 transitions. [2018-06-22 11:29:56,847 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:29:56,847 INFO ]: Start accepts. Automaton has 25 states. Word has length 65 [2018-06-22 11:29:56,847 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:56,848 INFO ]: With dead ends: 45 [2018-06-22 11:29:56,848 INFO ]: Without dead ends: 37 [2018-06-22 11:29:56,848 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:29:56,849 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:29:56,852 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-06-22 11:29:56,852 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:29:56,853 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2018-06-22 11:29:56,853 INFO ]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 65 [2018-06-22 11:29:56,853 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:56,853 INFO ]: Abstraction has 35 states and 46 transitions. [2018-06-22 11:29:56,853 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:29:56,853 INFO ]: Start isEmpty. Operand 35 states and 46 transitions. [2018-06-22 11:29:56,854 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:29:56,854 INFO ]: Found error trace [2018-06-22 11:29:56,854 INFO ]: trace histogram [10, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:56,854 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:56,854 INFO ]: Analyzing trace with hash 1744020211, now seen corresponding path program 8 times [2018-06-22 11:29:56,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:56,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:56,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:56,855 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:29:56,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:56,868 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:57,161 INFO ]: Checked inductivity of 192 backedges. 57 proven. 41 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-06-22 11:29:57,161 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:57,161 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:29:57,168 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:29:57,192 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:29:57,192 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:57,195 INFO ]: Computing forward predicates... [2018-06-22 11:29:57,394 INFO ]: Checked inductivity of 192 backedges. 57 proven. 41 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-06-22 11:29:57,413 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:57,413 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 19 [2018-06-22 11:29:57,413 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:29:57,414 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:29:57,414 INFO ]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:29:57,414 INFO ]: Start difference. First operand 35 states and 46 transitions. Second operand 19 states. [2018-06-22 11:29:58,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:58,045 INFO ]: Finished difference Result 44 states and 63 transitions. [2018-06-22 11:29:58,045 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:29:58,045 INFO ]: Start accepts. Automaton has 19 states. Word has length 65 [2018-06-22 11:29:58,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:58,046 INFO ]: With dead ends: 44 [2018-06-22 11:29:58,046 INFO ]: Without dead ends: 44 [2018-06-22 11:29:58,046 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:29:58,046 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:29:58,050 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-06-22 11:29:58,050 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:29:58,051 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2018-06-22 11:29:58,051 INFO ]: Start accepts. Automaton has 40 states and 57 transitions. Word has length 65 [2018-06-22 11:29:58,051 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:58,051 INFO ]: Abstraction has 40 states and 57 transitions. [2018-06-22 11:29:58,051 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:29:58,052 INFO ]: Start isEmpty. Operand 40 states and 57 transitions. [2018-06-22 11:29:58,052 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:29:58,052 INFO ]: Found error trace [2018-06-22 11:29:58,052 INFO ]: trace histogram [11, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:58,053 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:58,053 INFO ]: Analyzing trace with hash 1623070261, now seen corresponding path program 9 times [2018-06-22 11:29:58,053 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:58,053 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:58,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:58,053 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:29:58,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:58,065 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:58,275 INFO ]: Checked inductivity of 228 backedges. 93 proven. 48 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-22 11:29:58,275 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:58,275 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:29:58,281 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:29:58,310 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 11:29:58,310 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:58,313 INFO ]: Computing forward predicates... [2018-06-22 11:29:58,364 INFO ]: Checked inductivity of 228 backedges. 85 proven. 55 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-22 11:29:58,384 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:58,384 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 18 [2018-06-22 11:29:58,385 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:29:58,385 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:29:58,385 INFO ]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:29:58,385 INFO ]: Start difference. First operand 40 states and 57 transitions. Second operand 18 states. [2018-06-22 11:29:58,627 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:58,628 INFO ]: Finished difference Result 47 states and 71 transitions. [2018-06-22 11:29:58,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:29:58,629 INFO ]: Start accepts. Automaton has 18 states. Word has length 69 [2018-06-22 11:29:58,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:58,630 INFO ]: With dead ends: 47 [2018-06-22 11:29:58,630 INFO ]: Without dead ends: 47 [2018-06-22 11:29:58,631 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:29:58,631 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:29:58,638 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:29:58,638 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:29:58,639 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-06-22 11:29:58,639 INFO ]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 69 [2018-06-22 11:29:58,639 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:58,639 INFO ]: Abstraction has 43 states and 63 transitions. [2018-06-22 11:29:58,639 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:29:58,639 INFO ]: Start isEmpty. Operand 43 states and 63 transitions. [2018-06-22 11:29:58,640 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:29:58,640 INFO ]: Found error trace [2018-06-22 11:29:58,640 INFO ]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:58,640 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:58,640 INFO ]: Analyzing trace with hash -2101923407, now seen corresponding path program 10 times [2018-06-22 11:29:58,640 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:58,640 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:58,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:58,641 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:29:58,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:58,653 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:58,842 INFO ]: Checked inductivity of 160 backedges. 65 proven. 32 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-22 11:29:58,842 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:58,842 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:29:58,848 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:29:58,868 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:29:58,868 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:58,870 INFO ]: Computing forward predicates... [2018-06-22 11:29:58,918 INFO ]: Checked inductivity of 160 backedges. 65 proven. 31 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 11:29:58,937 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:58,937 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2018-06-22 11:29:58,938 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:29:58,938 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:29:58,938 INFO ]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:29:58,938 INFO ]: Start difference. First operand 43 states and 63 transitions. Second operand 16 states. [2018-06-22 11:29:59,129 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:59,129 INFO ]: Finished difference Result 40 states and 54 transitions. [2018-06-22 11:29:59,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:29:59,130 INFO ]: Start accepts. Automaton has 16 states. Word has length 61 [2018-06-22 11:29:59,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:59,130 INFO ]: With dead ends: 40 [2018-06-22 11:29:59,130 INFO ]: Without dead ends: 40 [2018-06-22 11:29:59,130 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:29:59,130 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:29:59,133 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-22 11:29:59,133 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:29:59,133 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2018-06-22 11:29:59,133 INFO ]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 61 [2018-06-22 11:29:59,134 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:59,134 INFO ]: Abstraction has 40 states and 54 transitions. [2018-06-22 11:29:59,134 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:29:59,134 INFO ]: Start isEmpty. Operand 40 states and 54 transitions. [2018-06-22 11:29:59,135 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:29:59,135 INFO ]: Found error trace [2018-06-22 11:29:59,135 INFO ]: trace histogram [14, 9, 9, 9, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:59,135 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:59,135 INFO ]: Analyzing trace with hash -1300669356, now seen corresponding path program 7 times [2018-06-22 11:29:59,135 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:59,135 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:59,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:59,135 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:29:59,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:59,148 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:59,275 INFO ]: Checked inductivity of 351 backedges. 124 proven. 12 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-06-22 11:29:59,275 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:59,275 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:29:59,283 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:59,312 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:59,314 INFO ]: Computing forward predicates... [2018-06-22 11:29:59,400 INFO ]: Checked inductivity of 351 backedges. 116 proven. 20 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-06-22 11:29:59,419 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:59,419 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2018-06-22 11:29:59,420 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:29:59,420 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:29:59,420 INFO ]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:29:59,420 INFO ]: Start difference. First operand 40 states and 54 transitions. Second operand 16 states. [2018-06-22 11:29:59,571 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:29:59,571 INFO ]: Finished difference Result 42 states and 54 transitions. [2018-06-22 11:29:59,577 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:29:59,577 INFO ]: Start accepts. Automaton has 16 states. Word has length 81 [2018-06-22 11:29:59,577 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:29:59,577 INFO ]: With dead ends: 42 [2018-06-22 11:29:59,578 INFO ]: Without dead ends: 42 [2018-06-22 11:29:59,578 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:29:59,578 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:29:59,581 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-06-22 11:29:59,581 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:29:59,581 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2018-06-22 11:29:59,582 INFO ]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 81 [2018-06-22 11:29:59,582 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:29:59,582 INFO ]: Abstraction has 40 states and 52 transitions. [2018-06-22 11:29:59,582 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:29:59,582 INFO ]: Start isEmpty. Operand 40 states and 52 transitions. [2018-06-22 11:29:59,583 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:29:59,583 INFO ]: Found error trace [2018-06-22 11:29:59,583 INFO ]: trace histogram [15, 10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:29:59,583 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:29:59,583 INFO ]: Analyzing trace with hash -693447530, now seen corresponding path program 8 times [2018-06-22 11:29:59,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:29:59,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:29:59,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:59,584 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:29:59,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:29:59,599 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:59,832 INFO ]: Checked inductivity of 402 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-06-22 11:29:59,832 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:29:59,832 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:29:59,839 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:29:59,873 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:29:59,873 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:29:59,876 INFO ]: Computing forward predicates... [2018-06-22 11:29:59,966 INFO ]: Checked inductivity of 402 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-06-22 11:29:59,985 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:29:59,985 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-22 11:29:59,985 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:29:59,985 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:29:59,986 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:29:59,986 INFO ]: Start difference. First operand 40 states and 52 transitions. Second operand 16 states. [2018-06-22 11:30:00,345 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:00,345 INFO ]: Finished difference Result 47 states and 62 transitions. [2018-06-22 11:30:00,345 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:30:00,345 INFO ]: Start accepts. Automaton has 16 states. Word has length 85 [2018-06-22 11:30:00,345 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:00,346 INFO ]: With dead ends: 47 [2018-06-22 11:30:00,346 INFO ]: Without dead ends: 47 [2018-06-22 11:30:00,346 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 81 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:30:00,346 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:30:00,351 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:30:00,351 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:30:00,352 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2018-06-22 11:30:00,352 INFO ]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 85 [2018-06-22 11:30:00,352 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:00,352 INFO ]: Abstraction has 43 states and 58 transitions. [2018-06-22 11:30:00,352 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:30:00,352 INFO ]: Start isEmpty. Operand 43 states and 58 transitions. [2018-06-22 11:30:00,353 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:30:00,353 INFO ]: Found error trace [2018-06-22 11:30:00,353 INFO ]: trace histogram [16, 11, 11, 11, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:00,353 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:00,353 INFO ]: Analyzing trace with hash -292630824, now seen corresponding path program 9 times [2018-06-22 11:30:00,354 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:00,354 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:00,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:00,357 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:00,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:00,371 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:00,504 INFO ]: Checked inductivity of 457 backedges. 180 proven. 26 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-06-22 11:30:00,504 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:00,504 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:00,509 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:30:00,550 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 11:30:00,550 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:00,554 INFO ]: Computing forward predicates... [2018-06-22 11:30:00,881 INFO ]: Checked inductivity of 457 backedges. 142 proven. 128 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-06-22 11:30:00,901 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:00,901 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22] total 36 [2018-06-22 11:30:00,901 INFO ]: Interpolant automaton has 36 states [2018-06-22 11:30:00,901 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 11:30:00,902 INFO ]: CoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:30:00,902 INFO ]: Start difference. First operand 43 states and 58 transitions. Second operand 36 states. [2018-06-22 11:30:02,404 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:02,404 INFO ]: Finished difference Result 52 states and 85 transitions. [2018-06-22 11:30:02,404 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:30:02,404 INFO ]: Start accepts. Automaton has 36 states. Word has length 89 [2018-06-22 11:30:02,404 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:02,405 INFO ]: With dead ends: 52 [2018-06-22 11:30:02,405 INFO ]: Without dead ends: 42 [2018-06-22 11:30:02,406 INFO ]: 0 DeclaredPredicates, 126 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=310, Invalid=2240, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:30:02,406 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:30:02,408 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-06-22 11:30:02,409 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:30:02,409 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2018-06-22 11:30:02,409 INFO ]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 89 [2018-06-22 11:30:02,409 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:02,409 INFO ]: Abstraction has 40 states and 51 transitions. [2018-06-22 11:30:02,409 INFO ]: Interpolant automaton has 36 states. [2018-06-22 11:30:02,409 INFO ]: Start isEmpty. Operand 40 states and 51 transitions. [2018-06-22 11:30:02,410 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:30:02,410 INFO ]: Found error trace [2018-06-22 11:30:02,410 INFO ]: trace histogram [15, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:02,410 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:02,410 INFO ]: Analyzing trace with hash 2145842050, now seen corresponding path program 11 times [2018-06-22 11:30:02,410 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:02,410 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:02,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:02,411 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:02,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:02,423 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:03,361 INFO ]: Checked inductivity of 425 backedges. 124 proven. 64 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-06-22 11:30:03,361 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:03,361 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:03,367 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:30:03,408 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 11:30:03,408 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:03,412 INFO ]: Computing forward predicates... [2018-06-22 11:30:03,625 INFO ]: Checked inductivity of 425 backedges. 124 proven. 64 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-06-22 11:30:03,644 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:03,644 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 21 [2018-06-22 11:30:03,644 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:30:03,644 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:30:03,644 INFO ]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:30:03,644 INFO ]: Start difference. First operand 40 states and 51 transitions. Second operand 21 states. [2018-06-22 11:30:04,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:04,492 INFO ]: Finished difference Result 49 states and 68 transitions. [2018-06-22 11:30:04,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:30:04,492 INFO ]: Start accepts. Automaton has 21 states. Word has length 89 [2018-06-22 11:30:04,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:04,493 INFO ]: With dead ends: 49 [2018-06-22 11:30:04,493 INFO ]: Without dead ends: 49 [2018-06-22 11:30:04,493 INFO ]: 0 DeclaredPredicates, 127 GetRequests, 79 SyntacticMatches, 14 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:30:04,493 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:30:04,498 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-06-22 11:30:04,498 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:30:04,499 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2018-06-22 11:30:04,499 INFO ]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 89 [2018-06-22 11:30:04,500 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:04,500 INFO ]: Abstraction has 45 states and 62 transitions. [2018-06-22 11:30:04,500 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:30:04,500 INFO ]: Start isEmpty. Operand 45 states and 62 transitions. [2018-06-22 11:30:04,501 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:30:04,501 INFO ]: Found error trace [2018-06-22 11:30:04,501 INFO ]: trace histogram [16, 11, 11, 11, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:04,501 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:04,501 INFO ]: Analyzing trace with hash 1520712260, now seen corresponding path program 12 times [2018-06-22 11:30:04,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:04,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:04,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:04,502 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:04,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:04,515 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:04,901 INFO ]: Checked inductivity of 480 backedges. 199 proven. 81 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-06-22 11:30:04,901 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:04,901 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:04,909 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:30:04,950 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:30:04,950 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:04,953 INFO ]: Computing forward predicates... [2018-06-22 11:30:05,121 INFO ]: Checked inductivity of 480 backedges. 189 proven. 89 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-06-22 11:30:05,141 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:05,141 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 20 [2018-06-22 11:30:05,141 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:30:05,141 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:30:05,141 INFO ]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:30:05,141 INFO ]: Start difference. First operand 45 states and 62 transitions. Second operand 20 states. [2018-06-22 11:30:05,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:05,434 INFO ]: Finished difference Result 52 states and 76 transitions. [2018-06-22 11:30:05,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:30:05,434 INFO ]: Start accepts. Automaton has 20 states. Word has length 93 [2018-06-22 11:30:05,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:05,435 INFO ]: With dead ends: 52 [2018-06-22 11:30:05,435 INFO ]: Without dead ends: 52 [2018-06-22 11:30:05,435 INFO ]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:30:05,435 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:30:05,439 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-06-22 11:30:05,439 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:30:05,439 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2018-06-22 11:30:05,440 INFO ]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 93 [2018-06-22 11:30:05,440 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:05,440 INFO ]: Abstraction has 48 states and 68 transitions. [2018-06-22 11:30:05,440 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:30:05,440 INFO ]: Start isEmpty. Operand 48 states and 68 transitions. [2018-06-22 11:30:05,441 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:30:05,441 INFO ]: Found error trace [2018-06-22 11:30:05,441 INFO ]: trace histogram [14, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:05,441 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:05,441 INFO ]: Analyzing trace with hash -342806848, now seen corresponding path program 13 times [2018-06-22 11:30:05,441 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:05,441 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:05,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:05,442 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:05,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:05,455 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:05,565 INFO ]: Checked inductivity of 374 backedges. 151 proven. 59 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-06-22 11:30:05,565 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:05,565 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:05,570 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:05,600 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:05,603 INFO ]: Computing forward predicates... [2018-06-22 11:30:05,649 INFO ]: Checked inductivity of 374 backedges. 151 proven. 57 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-06-22 11:30:05,670 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:05,670 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 18 [2018-06-22 11:30:05,670 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:30:05,670 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:30:05,670 INFO ]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:30:05,670 INFO ]: Start difference. First operand 48 states and 68 transitions. Second operand 18 states. [2018-06-22 11:30:06,354 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:06,354 INFO ]: Finished difference Result 45 states and 59 transitions. [2018-06-22 11:30:06,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:30:06,354 INFO ]: Start accepts. Automaton has 18 states. Word has length 85 [2018-06-22 11:30:06,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:06,355 INFO ]: With dead ends: 45 [2018-06-22 11:30:06,355 INFO ]: Without dead ends: 45 [2018-06-22 11:30:06,355 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:30:06,355 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:30:06,358 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-22 11:30:06,358 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:30:06,358 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2018-06-22 11:30:06,358 INFO ]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 85 [2018-06-22 11:30:06,359 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:06,359 INFO ]: Abstraction has 45 states and 59 transitions. [2018-06-22 11:30:06,359 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:30:06,359 INFO ]: Start isEmpty. Operand 45 states and 59 transitions. [2018-06-22 11:30:06,360 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 11:30:06,360 INFO ]: Found error trace [2018-06-22 11:30:06,360 INFO ]: trace histogram [20, 14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:06,360 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:06,360 INFO ]: Analyzing trace with hash -445870939, now seen corresponding path program 10 times [2018-06-22 11:30:06,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:06,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:06,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:06,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:06,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:06,380 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:06,846 INFO ]: Checked inductivity of 726 backedges. 230 proven. 20 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2018-06-22 11:30:06,846 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:06,846 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:06,851 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:30:06,891 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:30:06,892 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:06,894 INFO ]: Computing forward predicates... [2018-06-22 11:30:07,166 INFO ]: Checked inductivity of 726 backedges. 220 proven. 30 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2018-06-22 11:30:07,193 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:07,193 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2018-06-22 11:30:07,193 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:30:07,193 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:30:07,194 INFO ]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:30:07,194 INFO ]: Start difference. First operand 45 states and 59 transitions. Second operand 18 states. [2018-06-22 11:30:07,634 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:07,634 INFO ]: Finished difference Result 47 states and 60 transitions. [2018-06-22 11:30:07,635 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:30:07,635 INFO ]: Start accepts. Automaton has 18 states. Word has length 109 [2018-06-22 11:30:07,635 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:07,635 INFO ]: With dead ends: 47 [2018-06-22 11:30:07,635 INFO ]: Without dead ends: 47 [2018-06-22 11:30:07,636 INFO ]: 0 DeclaredPredicates, 140 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:30:07,636 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:30:07,638 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-06-22 11:30:07,638 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:30:07,639 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2018-06-22 11:30:07,639 INFO ]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 109 [2018-06-22 11:30:07,639 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:07,639 INFO ]: Abstraction has 45 states and 58 transitions. [2018-06-22 11:30:07,639 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:30:07,639 INFO ]: Start isEmpty. Operand 45 states and 58 transitions. [2018-06-22 11:30:07,640 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 11:30:07,640 INFO ]: Found error trace [2018-06-22 11:30:07,640 INFO ]: trace histogram [21, 15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:07,640 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:07,640 INFO ]: Analyzing trace with hash -695736473, now seen corresponding path program 11 times [2018-06-22 11:30:07,640 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:07,640 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:07,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:07,641 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:07,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:07,657 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:07,895 INFO ]: Checked inductivity of 800 backedges. 230 proven. 70 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2018-06-22 11:30:07,895 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:07,895 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:07,901 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:30:08,007 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 11:30:08,007 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:08,013 INFO ]: Computing forward predicates... [2018-06-22 11:30:08,198 INFO ]: Checked inductivity of 800 backedges. 230 proven. 70 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2018-06-22 11:30:08,218 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:08,218 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-22 11:30:08,218 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:30:08,218 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:30:08,218 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:30:08,218 INFO ]: Start difference. First operand 45 states and 58 transitions. Second operand 18 states. [2018-06-22 11:30:08,665 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:08,665 INFO ]: Finished difference Result 52 states and 68 transitions. [2018-06-22 11:30:08,665 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:30:08,665 INFO ]: Start accepts. Automaton has 18 states. Word has length 113 [2018-06-22 11:30:08,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:08,666 INFO ]: With dead ends: 52 [2018-06-22 11:30:08,666 INFO ]: Without dead ends: 52 [2018-06-22 11:30:08,666 INFO ]: 0 DeclaredPredicates, 149 GetRequests, 109 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:30:08,666 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:30:08,669 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-06-22 11:30:08,669 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:30:08,670 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2018-06-22 11:30:08,670 INFO ]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 113 [2018-06-22 11:30:08,670 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:08,670 INFO ]: Abstraction has 48 states and 64 transitions. [2018-06-22 11:30:08,670 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:30:08,670 INFO ]: Start isEmpty. Operand 48 states and 64 transitions. [2018-06-22 11:30:08,671 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 11:30:08,671 INFO ]: Found error trace [2018-06-22 11:30:08,671 INFO ]: trace histogram [22, 16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:08,671 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:08,671 INFO ]: Analyzing trace with hash 1699726377, now seen corresponding path program 12 times [2018-06-22 11:30:08,671 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:08,671 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:08,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:08,672 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:08,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:08,685 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:08,868 INFO ]: Checked inductivity of 878 backedges. 312 proven. 40 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-06-22 11:30:08,868 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:08,868 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:30:08,882 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:08,937 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:30:08,937 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:08,942 INFO ]: Computing forward predicates... [2018-06-22 11:30:09,620 INFO ]: Checked inductivity of 878 backedges. 292 proven. 193 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-06-22 11:30:09,650 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:09,650 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 41 [2018-06-22 11:30:09,650 INFO ]: Interpolant automaton has 41 states [2018-06-22 11:30:09,651 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 11:30:09,651 INFO ]: CoverageRelationStatistics Valid=163, Invalid=1477, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:30:09,651 INFO ]: Start difference. First operand 48 states and 64 transitions. Second operand 41 states. [2018-06-22 11:30:10,597 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:10,597 INFO ]: Finished difference Result 59 states and 100 transitions. [2018-06-22 11:30:10,597 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:30:10,597 INFO ]: Start accepts. Automaton has 41 states. Word has length 117 [2018-06-22 11:30:10,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:10,598 INFO ]: With dead ends: 59 [2018-06-22 11:30:10,598 INFO ]: Without dead ends: 47 [2018-06-22 11:30:10,599 INFO ]: 0 DeclaredPredicates, 161 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=403, Invalid=3019, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 11:30:10,599 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:30:10,601 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-06-22 11:30:10,601 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:30:10,602 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-06-22 11:30:10,602 INFO ]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 117 [2018-06-22 11:30:10,602 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:10,602 INFO ]: Abstraction has 45 states and 57 transitions. [2018-06-22 11:30:10,602 INFO ]: Interpolant automaton has 41 states. [2018-06-22 11:30:10,603 INFO ]: Start isEmpty. Operand 45 states and 57 transitions. [2018-06-22 11:30:10,603 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 11:30:10,603 INFO ]: Found error trace [2018-06-22 11:30:10,603 INFO ]: trace histogram [20, 14, 14, 14, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:10,603 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:10,603 INFO ]: Analyzing trace with hash -1084759599, now seen corresponding path program 14 times [2018-06-22 11:30:10,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:10,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:10,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:10,606 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:10,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:10,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:10,869 INFO ]: Checked inductivity of 754 backedges. 299 proven. 94 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-06-22 11:30:10,869 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:10,869 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:10,875 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:30:10,916 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:30:10,916 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:10,919 INFO ]: Computing forward predicates... [2018-06-22 11:30:10,959 INFO ]: Checked inductivity of 754 backedges. 299 proven. 91 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-06-22 11:30:10,978 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:10,978 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 20 [2018-06-22 11:30:10,978 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:30:10,978 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:30:10,978 INFO ]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:30:10,979 INFO ]: Start difference. First operand 45 states and 57 transitions. Second operand 20 states. [2018-06-22 11:30:11,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:11,190 INFO ]: Finished difference Result 45 states and 56 transitions. [2018-06-22 11:30:11,190 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:30:11,190 INFO ]: Start accepts. Automaton has 20 states. Word has length 113 [2018-06-22 11:30:11,190 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:11,191 INFO ]: With dead ends: 45 [2018-06-22 11:30:11,191 INFO ]: Without dead ends: 45 [2018-06-22 11:30:11,191 INFO ]: 0 DeclaredPredicates, 145 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:30:11,191 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:30:11,194 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-22 11:30:11,194 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:30:11,195 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2018-06-22 11:30:11,195 INFO ]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 113 [2018-06-22 11:30:11,195 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:11,195 INFO ]: Abstraction has 45 states and 56 transitions. [2018-06-22 11:30:11,195 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:30:11,195 INFO ]: Start isEmpty. Operand 45 states and 56 transitions. [2018-06-22 11:30:11,195 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 11:30:11,195 INFO ]: Found error trace [2018-06-22 11:30:11,195 INFO ]: trace histogram [21, 15, 15, 15, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:11,196 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:11,196 INFO ]: Analyzing trace with hash -2142803693, now seen corresponding path program 15 times [2018-06-22 11:30:11,196 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:11,196 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:11,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:11,196 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:11,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:11,209 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:12,254 INFO ]: Checked inductivity of 828 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-06-22 11:30:12,254 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:12,254 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:12,260 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:30:12,314 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 11:30:12,314 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:12,318 INFO ]: Computing forward predicates... [2018-06-22 11:30:13,366 INFO ]: Checked inductivity of 828 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-06-22 11:30:13,385 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:13,385 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 23 [2018-06-22 11:30:13,386 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:30:13,386 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:30:13,386 INFO ]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:30:13,386 INFO ]: Start difference. First operand 45 states and 56 transitions. Second operand 23 states. [2018-06-22 11:30:13,959 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:13,959 INFO ]: Finished difference Result 54 states and 72 transitions. [2018-06-22 11:30:13,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:30:13,959 INFO ]: Start accepts. Automaton has 23 states. Word has length 117 [2018-06-22 11:30:13,960 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:13,960 INFO ]: With dead ends: 54 [2018-06-22 11:30:13,960 INFO ]: Without dead ends: 54 [2018-06-22 11:30:13,960 INFO ]: 0 DeclaredPredicates, 162 GetRequests, 106 SyntacticMatches, 17 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=158, Invalid=1482, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:30:13,960 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:30:13,963 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-06-22 11:30:13,963 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:30:13,963 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2018-06-22 11:30:13,963 INFO ]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 117 [2018-06-22 11:30:13,964 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:13,964 INFO ]: Abstraction has 50 states and 66 transitions. [2018-06-22 11:30:13,964 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:30:13,964 INFO ]: Start isEmpty. Operand 50 states and 66 transitions. [2018-06-22 11:30:13,965 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 11:30:13,965 INFO ]: Found error trace [2018-06-22 11:30:13,965 INFO ]: trace histogram [22, 16, 16, 16, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:13,965 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:13,965 INFO ]: Analyzing trace with hash 668496469, now seen corresponding path program 16 times [2018-06-22 11:30:13,965 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:13,965 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:13,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:13,966 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:13,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:13,978 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:14,202 INFO ]: Checked inductivity of 906 backedges. 373 proven. 122 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2018-06-22 11:30:14,202 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:14,202 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:14,208 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:30:14,250 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:30:14,250 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:14,254 INFO ]: Computing forward predicates... [2018-06-22 11:30:14,318 INFO ]: Checked inductivity of 906 backedges. 361 proven. 131 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2018-06-22 11:30:14,337 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:14,337 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 22 [2018-06-22 11:30:14,337 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:30:14,337 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:30:14,337 INFO ]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:30:14,338 INFO ]: Start difference. First operand 50 states and 66 transitions. Second operand 22 states. [2018-06-22 11:30:14,584 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:14,584 INFO ]: Finished difference Result 50 states and 65 transitions. [2018-06-22 11:30:14,584 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:30:14,584 INFO ]: Start accepts. Automaton has 22 states. Word has length 121 [2018-06-22 11:30:14,584 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:14,585 INFO ]: With dead ends: 50 [2018-06-22 11:30:14,585 INFO ]: Without dead ends: 50 [2018-06-22 11:30:14,585 INFO ]: 0 DeclaredPredicates, 157 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:30:14,585 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:30:14,588 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-22 11:30:14,588 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:30:14,588 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2018-06-22 11:30:14,589 INFO ]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 121 [2018-06-22 11:30:14,589 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:14,589 INFO ]: Abstraction has 50 states and 65 transitions. [2018-06-22 11:30:14,589 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:30:14,589 INFO ]: Start isEmpty. Operand 50 states and 65 transitions. [2018-06-22 11:30:14,590 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 11:30:14,590 INFO ]: Found error trace [2018-06-22 11:30:14,590 INFO ]: trace histogram [27, 20, 20, 20, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:14,590 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:14,590 INFO ]: Analyzing trace with hash 281668216, now seen corresponding path program 13 times [2018-06-22 11:30:14,590 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:14,590 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:14,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:14,591 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:14,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:14,605 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:14,857 INFO ]: Checked inductivity of 1336 backedges. 384 proven. 30 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2018-06-22 11:30:14,858 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:14,858 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:14,863 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:14,936 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:14,942 INFO ]: Computing forward predicates... [2018-06-22 11:30:15,437 INFO ]: Checked inductivity of 1336 backedges. 372 proven. 42 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2018-06-22 11:30:15,467 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:15,467 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2018-06-22 11:30:15,468 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:30:15,468 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:30:15,468 INFO ]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:30:15,468 INFO ]: Start difference. First operand 50 states and 65 transitions. Second operand 20 states. [2018-06-22 11:30:16,125 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:16,125 INFO ]: Finished difference Result 52 states and 66 transitions. [2018-06-22 11:30:16,125 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:30:16,125 INFO ]: Start accepts. Automaton has 20 states. Word has length 141 [2018-06-22 11:30:16,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:16,126 INFO ]: With dead ends: 52 [2018-06-22 11:30:16,126 INFO ]: Without dead ends: 52 [2018-06-22 11:30:16,126 INFO ]: 0 DeclaredPredicates, 178 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:30:16,126 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:30:16,129 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-06-22 11:30:16,129 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:30:16,131 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2018-06-22 11:30:16,131 INFO ]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 141 [2018-06-22 11:30:16,131 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:16,131 INFO ]: Abstraction has 50 states and 64 transitions. [2018-06-22 11:30:16,131 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:30:16,131 INFO ]: Start isEmpty. Operand 50 states and 64 transitions. [2018-06-22 11:30:16,132 INFO ]: Finished isEmpty. Found accepting run of length 146 [2018-06-22 11:30:16,132 INFO ]: Found error trace [2018-06-22 11:30:16,132 INFO ]: trace histogram [28, 21, 21, 21, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:16,132 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:16,132 INFO ]: Analyzing trace with hash -641214790, now seen corresponding path program 14 times [2018-06-22 11:30:16,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:16,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:16,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:16,133 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:16,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:16,149 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:16,597 INFO ]: Checked inductivity of 1437 backedges. 384 proven. 99 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2018-06-22 11:30:16,597 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:16,597 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:16,602 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:30:16,662 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:30:16,662 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:16,666 INFO ]: Computing forward predicates... [2018-06-22 11:30:17,259 INFO ]: Checked inductivity of 1437 backedges. 384 proven. 99 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2018-06-22 11:30:17,279 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:17,279 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-22 11:30:17,279 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:30:17,279 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:30:17,279 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:30:17,279 INFO ]: Start difference. First operand 50 states and 64 transitions. Second operand 20 states. [2018-06-22 11:30:17,946 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:17,946 INFO ]: Finished difference Result 57 states and 74 transitions. [2018-06-22 11:30:17,946 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:30:17,946 INFO ]: Start accepts. Automaton has 20 states. Word has length 145 [2018-06-22 11:30:17,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:17,947 INFO ]: With dead ends: 57 [2018-06-22 11:30:17,947 INFO ]: Without dead ends: 57 [2018-06-22 11:30:17,947 INFO ]: 0 DeclaredPredicates, 187 GetRequests, 141 SyntacticMatches, 15 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=967, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:30:17,947 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:30:17,952 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-06-22 11:30:17,952 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:30:17,953 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2018-06-22 11:30:17,953 INFO ]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 145 [2018-06-22 11:30:17,953 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:17,953 INFO ]: Abstraction has 53 states and 70 transitions. [2018-06-22 11:30:17,953 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:30:17,953 INFO ]: Start isEmpty. Operand 53 states and 70 transitions. [2018-06-22 11:30:17,954 INFO ]: Finished isEmpty. Found accepting run of length 150 [2018-06-22 11:30:17,954 INFO ]: Found error trace [2018-06-22 11:30:17,954 INFO ]: trace histogram [29, 22, 22, 22, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:17,954 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:17,955 INFO ]: Analyzing trace with hash 1638712572, now seen corresponding path program 15 times [2018-06-22 11:30:17,955 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:17,955 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:17,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:17,955 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:17,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:17,973 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:18,202 INFO ]: Checked inductivity of 1542 backedges. 497 proven. 57 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2018-06-22 11:30:18,202 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:18,202 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:18,207 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:30:18,271 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 11:30:18,271 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:18,278 INFO ]: Computing forward predicates... [2018-06-22 11:30:19,911 INFO ]: Checked inductivity of 1542 backedges. 524 proven. 271 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2018-06-22 11:30:19,930 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:19,930 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 28] total 46 [2018-06-22 11:30:19,931 INFO ]: Interpolant automaton has 46 states [2018-06-22 11:30:19,931 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 11:30:19,931 INFO ]: CoverageRelationStatistics Valid=200, Invalid=1870, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:30:19,931 INFO ]: Start difference. First operand 53 states and 70 transitions. Second operand 46 states. [2018-06-22 11:30:20,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:20,987 INFO ]: Finished difference Result 66 states and 116 transitions. [2018-06-22 11:30:20,987 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 11:30:20,987 INFO ]: Start accepts. Automaton has 46 states. Word has length 149 [2018-06-22 11:30:20,987 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:20,988 INFO ]: With dead ends: 66 [2018-06-22 11:30:20,988 INFO ]: Without dead ends: 52 [2018-06-22 11:30:20,989 INFO ]: 0 DeclaredPredicates, 200 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=508, Invalid=3914, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 11:30:20,989 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:30:20,992 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-06-22 11:30:20,992 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:30:20,992 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2018-06-22 11:30:20,992 INFO ]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 149 [2018-06-22 11:30:20,992 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:20,993 INFO ]: Abstraction has 50 states and 63 transitions. [2018-06-22 11:30:20,993 INFO ]: Interpolant automaton has 46 states. [2018-06-22 11:30:20,993 INFO ]: Start isEmpty. Operand 50 states and 63 transitions. [2018-06-22 11:30:20,994 INFO ]: Finished isEmpty. Found accepting run of length 150 [2018-06-22 11:30:20,994 INFO ]: Found error trace [2018-06-22 11:30:20,994 INFO ]: trace histogram [28, 21, 21, 21, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:20,994 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:20,994 INFO ]: Analyzing trace with hash 1362835366, now seen corresponding path program 17 times [2018-06-22 11:30:20,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:20,995 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:20,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:20,995 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:20,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:21,010 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:21,515 INFO ]: Checked inductivity of 1470 backedges. 384 proven. 125 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2018-06-22 11:30:21,515 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:21,515 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:21,520 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:30:21,629 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 11:30:21,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:21,634 INFO ]: Computing forward predicates... [2018-06-22 11:30:22,108 INFO ]: Checked inductivity of 1470 backedges. 384 proven. 125 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2018-06-22 11:30:22,135 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:22,136 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 25 [2018-06-22 11:30:22,136 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:30:22,136 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:30:22,136 INFO ]: CoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:30:22,136 INFO ]: Start difference. First operand 50 states and 63 transitions. Second operand 25 states. [2018-06-22 11:30:22,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:22,749 INFO ]: Finished difference Result 59 states and 80 transitions. [2018-06-22 11:30:22,749 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:30:22,749 INFO ]: Start accepts. Automaton has 25 states. Word has length 149 [2018-06-22 11:30:22,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:22,750 INFO ]: With dead ends: 59 [2018-06-22 11:30:22,750 INFO ]: Without dead ends: 59 [2018-06-22 11:30:22,751 INFO ]: 0 DeclaredPredicates, 201 GetRequests, 137 SyntacticMatches, 20 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=180, Invalid=1890, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:30:22,751 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 11:30:22,753 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-06-22 11:30:22,753 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:30:22,754 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2018-06-22 11:30:22,754 INFO ]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 149 [2018-06-22 11:30:22,754 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:22,755 INFO ]: Abstraction has 55 states and 74 transitions. [2018-06-22 11:30:22,755 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:30:22,755 INFO ]: Start isEmpty. Operand 55 states and 74 transitions. [2018-06-22 11:30:22,755 INFO ]: Finished isEmpty. Found accepting run of length 154 [2018-06-22 11:30:22,755 INFO ]: Found error trace [2018-06-22 11:30:22,756 INFO ]: trace histogram [29, 22, 22, 22, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:22,756 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:22,756 INFO ]: Analyzing trace with hash -1888030104, now seen corresponding path program 18 times [2018-06-22 11:30:22,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:22,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:22,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:22,756 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:22,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:22,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:23,056 INFO ]: Checked inductivity of 1575 backedges. 633 proven. 171 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2018-06-22 11:30:23,056 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:23,158 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:23,163 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:30:23,229 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 11:30:23,229 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:23,234 INFO ]: Computing forward predicates... [2018-06-22 11:30:23,470 INFO ]: Checked inductivity of 1575 backedges. 619 proven. 181 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2018-06-22 11:30:23,504 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:23,504 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 24 [2018-06-22 11:30:23,504 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:30:23,504 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:30:23,504 INFO ]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:30:23,504 INFO ]: Start difference. First operand 55 states and 74 transitions. Second operand 24 states. [2018-06-22 11:30:23,937 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:23,937 INFO ]: Finished difference Result 62 states and 88 transitions. [2018-06-22 11:30:23,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:30:23,938 INFO ]: Start accepts. Automaton has 24 states. Word has length 153 [2018-06-22 11:30:23,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:23,938 INFO ]: With dead ends: 62 [2018-06-22 11:30:23,938 INFO ]: Without dead ends: 62 [2018-06-22 11:30:23,939 INFO ]: 0 DeclaredPredicates, 195 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:30:23,939 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:30:23,942 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-06-22 11:30:23,942 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:30:23,943 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2018-06-22 11:30:23,943 INFO ]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 153 [2018-06-22 11:30:23,943 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:23,943 INFO ]: Abstraction has 58 states and 80 transitions. [2018-06-22 11:30:23,943 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:30:23,943 INFO ]: Start isEmpty. Operand 58 states and 80 transitions. [2018-06-22 11:30:23,945 INFO ]: Finished isEmpty. Found accepting run of length 146 [2018-06-22 11:30:23,945 INFO ]: Found error trace [2018-06-22 11:30:23,945 INFO ]: trace histogram [27, 20, 20, 20, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:23,945 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:23,945 INFO ]: Analyzing trace with hash -1875149084, now seen corresponding path program 19 times [2018-06-22 11:30:23,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:23,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:23,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:23,945 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:23,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:23,961 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:25,013 INFO ]: Checked inductivity of 1369 backedges. 527 proven. 137 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2018-06-22 11:30:25,013 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:25,013 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:25,018 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:25,076 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:25,080 INFO ]: Computing forward predicates... [2018-06-22 11:30:25,135 INFO ]: Checked inductivity of 1369 backedges. 527 proven. 133 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2018-06-22 11:30:25,155 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:25,155 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 22 [2018-06-22 11:30:25,155 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:30:25,156 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:30:25,156 INFO ]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:30:25,156 INFO ]: Start difference. First operand 58 states and 80 transitions. Second operand 22 states. [2018-06-22 11:30:25,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:25,407 INFO ]: Finished difference Result 55 states and 71 transitions. [2018-06-22 11:30:25,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:30:25,407 INFO ]: Start accepts. Automaton has 22 states. Word has length 145 [2018-06-22 11:30:25,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:25,408 INFO ]: With dead ends: 55 [2018-06-22 11:30:25,408 INFO ]: Without dead ends: 55 [2018-06-22 11:30:25,408 INFO ]: 0 DeclaredPredicates, 182 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=866, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:30:25,408 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:30:25,411 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-22 11:30:25,411 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:30:25,412 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2018-06-22 11:30:25,412 INFO ]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 145 [2018-06-22 11:30:25,412 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:25,412 INFO ]: Abstraction has 55 states and 71 transitions. [2018-06-22 11:30:25,412 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:30:25,412 INFO ]: Start isEmpty. Operand 55 states and 71 transitions. [2018-06-22 11:30:25,413 INFO ]: Finished isEmpty. Found accepting run of length 178 [2018-06-22 11:30:25,413 INFO ]: Found error trace [2018-06-22 11:30:25,413 INFO ]: trace histogram [35, 27, 27, 27, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:25,413 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:25,414 INFO ]: Analyzing trace with hash -1032374579, now seen corresponding path program 16 times [2018-06-22 11:30:25,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:25,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:25,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:25,414 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:25,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:25,430 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:25,749 INFO ]: Checked inductivity of 2262 backedges. 595 proven. 42 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2018-06-22 11:30:25,749 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:25,749 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:25,754 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:30:25,832 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:30:25,832 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:25,838 INFO ]: Computing forward predicates... [2018-06-22 11:30:26,438 INFO ]: Checked inductivity of 2262 backedges. 581 proven. 56 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2018-06-22 11:30:26,457 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:26,457 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2018-06-22 11:30:26,458 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:30:26,458 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:30:26,458 INFO ]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:30:26,458 INFO ]: Start difference. First operand 55 states and 71 transitions. Second operand 22 states. [2018-06-22 11:30:26,719 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:26,719 INFO ]: Finished difference Result 57 states and 72 transitions. [2018-06-22 11:30:26,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:30:26,719 INFO ]: Start accepts. Automaton has 22 states. Word has length 177 [2018-06-22 11:30:26,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:26,719 INFO ]: With dead ends: 57 [2018-06-22 11:30:26,719 INFO ]: Without dead ends: 57 [2018-06-22 11:30:26,720 INFO ]: 0 DeclaredPredicates, 220 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=961, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:30:26,720 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:30:26,721 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-06-22 11:30:26,721 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:30:26,722 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2018-06-22 11:30:26,722 INFO ]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 177 [2018-06-22 11:30:26,722 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:26,722 INFO ]: Abstraction has 55 states and 70 transitions. [2018-06-22 11:30:26,722 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:30:26,722 INFO ]: Start isEmpty. Operand 55 states and 70 transitions. [2018-06-22 11:30:26,723 INFO ]: Finished isEmpty. Found accepting run of length 182 [2018-06-22 11:30:26,723 INFO ]: Found error trace [2018-06-22 11:30:26,723 INFO ]: trace histogram [36, 28, 28, 28, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:26,723 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:26,723 INFO ]: Analyzing trace with hash -1531452529, now seen corresponding path program 17 times [2018-06-22 11:30:26,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:26,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:26,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:26,726 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:26,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:26,744 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:27,156 INFO ]: Checked inductivity of 2394 backedges. 595 proven. 133 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2018-06-22 11:30:27,156 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:27,156 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:27,161 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:30:27,240 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 11:30:27,240 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:27,245 INFO ]: Computing forward predicates... [2018-06-22 11:30:27,523 INFO ]: Checked inductivity of 2394 backedges. 595 proven. 133 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2018-06-22 11:30:27,542 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:27,542 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-22 11:30:27,542 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:30:27,543 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:30:27,543 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:30:27,543 INFO ]: Start difference. First operand 55 states and 70 transitions. Second operand 22 states. [2018-06-22 11:30:28,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:28,463 INFO ]: Finished difference Result 62 states and 80 transitions. [2018-06-22 11:30:28,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:30:28,464 INFO ]: Start accepts. Automaton has 22 states. Word has length 181 [2018-06-22 11:30:28,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:28,464 INFO ]: With dead ends: 62 [2018-06-22 11:30:28,464 INFO ]: Without dead ends: 62 [2018-06-22 11:30:28,465 INFO ]: 0 DeclaredPredicates, 229 GetRequests, 177 SyntacticMatches, 17 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=1231, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:30:28,465 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:30:28,468 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-06-22 11:30:28,468 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:30:28,469 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2018-06-22 11:30:28,469 INFO ]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 181 [2018-06-22 11:30:28,469 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:28,469 INFO ]: Abstraction has 58 states and 76 transitions. [2018-06-22 11:30:28,469 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:30:28,469 INFO ]: Start isEmpty. Operand 58 states and 76 transitions. [2018-06-22 11:30:28,471 INFO ]: Finished isEmpty. Found accepting run of length 186 [2018-06-22 11:30:28,471 INFO ]: Found error trace [2018-06-22 11:30:28,471 INFO ]: trace histogram [37, 29, 29, 29, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:28,471 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:28,471 INFO ]: Analyzing trace with hash -761621935, now seen corresponding path program 18 times [2018-06-22 11:30:28,471 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:28,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:28,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:28,472 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:28,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:28,489 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:28,796 INFO ]: Checked inductivity of 2530 backedges. 744 proven. 77 refuted. 0 times theorem prover too weak. 1709 trivial. 0 not checked. [2018-06-22 11:30:28,796 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:28,796 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:28,802 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:30:28,879 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 11:30:28,879 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:28,884 INFO ]: Computing forward predicates... [2018-06-22 11:30:29,378 INFO ]: Checked inductivity of 2530 backedges. 856 proven. 362 refuted. 0 times theorem prover too weak. 1312 trivial. 0 not checked. [2018-06-22 11:30:29,398 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:29,398 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 31] total 51 [2018-06-22 11:30:29,398 INFO ]: Interpolant automaton has 51 states [2018-06-22 11:30:29,398 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-22 11:30:29,399 INFO ]: CoverageRelationStatistics Valid=241, Invalid=2309, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:30:29,399 INFO ]: Start difference. First operand 58 states and 76 transitions. Second operand 51 states. [2018-06-22 11:30:30,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:30,922 INFO ]: Finished difference Result 73 states and 133 transitions. [2018-06-22 11:30:30,923 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 11:30:30,923 INFO ]: Start accepts. Automaton has 51 states. Word has length 185 [2018-06-22 11:30:30,923 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:30,924 INFO ]: With dead ends: 73 [2018-06-22 11:30:30,924 INFO ]: Without dead ends: 57 [2018-06-22 11:30:30,925 INFO ]: 0 DeclaredPredicates, 243 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=625, Invalid=4925, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 11:30:30,925 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:30:30,928 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-06-22 11:30:30,928 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:30:30,929 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2018-06-22 11:30:30,929 INFO ]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 185 [2018-06-22 11:30:30,929 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:30,929 INFO ]: Abstraction has 55 states and 69 transitions. [2018-06-22 11:30:30,929 INFO ]: Interpolant automaton has 51 states. [2018-06-22 11:30:30,929 INFO ]: Start isEmpty. Operand 55 states and 69 transitions. [2018-06-22 11:30:30,930 INFO ]: Finished isEmpty. Found accepting run of length 182 [2018-06-22 11:30:30,930 INFO ]: Found error trace [2018-06-22 11:30:30,930 INFO ]: trace histogram [35, 27, 27, 27, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:30,930 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:30,931 INFO ]: Analyzing trace with hash 553223929, now seen corresponding path program 20 times [2018-06-22 11:30:30,931 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:30,931 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:30,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:30,931 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:30,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:30,947 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:31,259 INFO ]: Checked inductivity of 2300 backedges. 853 proven. 188 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2018-06-22 11:30:31,260 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:31,260 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:31,265 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:30:31,328 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:30:31,328 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:31,332 INFO ]: Computing forward predicates... [2018-06-22 11:30:31,415 INFO ]: Checked inductivity of 2300 backedges. 853 proven. 183 refuted. 0 times theorem prover too weak. 1264 trivial. 0 not checked. [2018-06-22 11:30:31,436 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:31,436 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 24 [2018-06-22 11:30:31,436 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:30:31,436 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:30:31,436 INFO ]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:30:31,437 INFO ]: Start difference. First operand 55 states and 69 transitions. Second operand 24 states. [2018-06-22 11:30:31,733 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:31,733 INFO ]: Finished difference Result 55 states and 68 transitions. [2018-06-22 11:30:31,733 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:30:31,733 INFO ]: Start accepts. Automaton has 24 states. Word has length 181 [2018-06-22 11:30:31,734 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:31,734 INFO ]: With dead ends: 55 [2018-06-22 11:30:31,734 INFO ]: Without dead ends: 55 [2018-06-22 11:30:31,735 INFO ]: 0 DeclaredPredicates, 223 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=1032, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:30:31,735 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:30:31,737 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-22 11:30:31,737 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:30:31,739 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2018-06-22 11:30:31,739 INFO ]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 181 [2018-06-22 11:30:31,739 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:31,739 INFO ]: Abstraction has 55 states and 68 transitions. [2018-06-22 11:30:31,739 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:30:31,740 INFO ]: Start isEmpty. Operand 55 states and 68 transitions. [2018-06-22 11:30:31,740 INFO ]: Finished isEmpty. Found accepting run of length 186 [2018-06-22 11:30:31,741 INFO ]: Found error trace [2018-06-22 11:30:31,741 INFO ]: trace histogram [36, 28, 28, 28, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:31,741 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:31,741 INFO ]: Analyzing trace with hash -1375248325, now seen corresponding path program 21 times [2018-06-22 11:30:31,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:31,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:31,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:31,741 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:31,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:31,762 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:32,329 INFO ]: Checked inductivity of 2432 backedges. 595 proven. 163 refuted. 0 times theorem prover too weak. 1674 trivial. 0 not checked. [2018-06-22 11:30:32,329 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:32,329 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:32,335 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:30:32,404 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 11:30:32,405 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:32,410 INFO ]: Computing forward predicates... [2018-06-22 11:30:32,748 INFO ]: Checked inductivity of 2432 backedges. 595 proven. 163 refuted. 0 times theorem prover too weak. 1674 trivial. 0 not checked. [2018-06-22 11:30:32,768 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:32,768 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 27 [2018-06-22 11:30:32,768 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:30:32,768 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:30:32,768 INFO ]: CoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:30:32,768 INFO ]: Start difference. First operand 55 states and 68 transitions. Second operand 27 states. [2018-06-22 11:30:33,546 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:33,547 INFO ]: Finished difference Result 64 states and 84 transitions. [2018-06-22 11:30:33,547 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:30:33,547 INFO ]: Start accepts. Automaton has 27 states. Word has length 185 [2018-06-22 11:30:33,547 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:33,547 INFO ]: With dead ends: 64 [2018-06-22 11:30:33,547 INFO ]: Without dead ends: 64 [2018-06-22 11:30:33,548 INFO ]: 0 DeclaredPredicates, 244 GetRequests, 172 SyntacticMatches, 23 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=202, Invalid=2348, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:30:33,548 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 11:30:33,551 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-06-22 11:30:33,551 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:30:33,551 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2018-06-22 11:30:33,551 INFO ]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 185 [2018-06-22 11:30:33,552 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:33,552 INFO ]: Abstraction has 60 states and 78 transitions. [2018-06-22 11:30:33,552 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:30:33,552 INFO ]: Start isEmpty. Operand 60 states and 78 transitions. [2018-06-22 11:30:33,553 INFO ]: Finished isEmpty. Found accepting run of length 190 [2018-06-22 11:30:33,553 INFO ]: Found error trace [2018-06-22 11:30:33,553 INFO ]: trace histogram [37, 29, 29, 29, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:33,553 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:33,553 INFO ]: Analyzing trace with hash 697056125, now seen corresponding path program 22 times [2018-06-22 11:30:33,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:33,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:33,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:33,554 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:33,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:33,570 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:33,884 INFO ]: Checked inductivity of 2568 backedges. 997 proven. 228 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2018-06-22 11:30:33,884 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:33,884 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:33,890 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:30:33,957 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:30:33,957 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:33,961 INFO ]: Computing forward predicates... [2018-06-22 11:30:34,020 INFO ]: Checked inductivity of 2568 backedges. 981 proven. 239 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2018-06-22 11:30:34,038 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:34,038 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 26 [2018-06-22 11:30:34,038 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:30:34,038 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:30:34,039 INFO ]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:30:34,039 INFO ]: Start difference. First operand 60 states and 78 transitions. Second operand 26 states. [2018-06-22 11:30:34,332 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:34,332 INFO ]: Finished difference Result 60 states and 77 transitions. [2018-06-22 11:30:34,332 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:30:34,332 INFO ]: Start accepts. Automaton has 26 states. Word has length 189 [2018-06-22 11:30:34,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:34,333 INFO ]: With dead ends: 60 [2018-06-22 11:30:34,333 INFO ]: Without dead ends: 60 [2018-06-22 11:30:34,333 INFO ]: 0 DeclaredPredicates, 235 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:30:34,333 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:30:34,335 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-22 11:30:34,335 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:30:34,335 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2018-06-22 11:30:34,335 INFO ]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 189 [2018-06-22 11:30:34,336 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:34,336 INFO ]: Abstraction has 60 states and 77 transitions. [2018-06-22 11:30:34,336 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:30:34,336 INFO ]: Start isEmpty. Operand 60 states and 77 transitions. [2018-06-22 11:30:34,337 INFO ]: Finished isEmpty. Found accepting run of length 222 [2018-06-22 11:30:34,337 INFO ]: Found error trace [2018-06-22 11:30:34,337 INFO ]: trace histogram [45, 36, 36, 36, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:34,337 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:34,337 INFO ]: Analyzing trace with hash 977755110, now seen corresponding path program 19 times [2018-06-22 11:30:34,337 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:34,337 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:34,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:34,338 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:34,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:34,361 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:35,207 INFO ]: Checked inductivity of 3764 backedges. 872 proven. 172 refuted. 0 times theorem prover too weak. 2720 trivial. 0 not checked. [2018-06-22 11:30:35,207 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:35,207 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:35,212 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:35,291 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:35,297 INFO ]: Computing forward predicates... [2018-06-22 11:30:35,674 INFO ]: Checked inductivity of 3764 backedges. 872 proven. 172 refuted. 0 times theorem prover too weak. 2720 trivial. 0 not checked. [2018-06-22 11:30:35,694 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:35,694 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-22 11:30:35,694 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:30:35,694 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:30:35,694 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:30:35,695 INFO ]: Start difference. First operand 60 states and 77 transitions. Second operand 24 states. [2018-06-22 11:30:36,378 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:36,378 INFO ]: Finished difference Result 67 states and 88 transitions. [2018-06-22 11:30:36,378 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:30:36,378 INFO ]: Start accepts. Automaton has 24 states. Word has length 221 [2018-06-22 11:30:36,379 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:36,379 INFO ]: With dead ends: 67 [2018-06-22 11:30:36,379 INFO ]: Without dead ends: 67 [2018-06-22 11:30:36,379 INFO ]: 0 DeclaredPredicates, 275 GetRequests, 217 SyntacticMatches, 19 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=113, Invalid=1527, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:30:36,379 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 11:30:36,383 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-06-22 11:30:36,384 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:30:36,384 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2018-06-22 11:30:36,384 INFO ]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 221 [2018-06-22 11:30:36,385 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:36,385 INFO ]: Abstraction has 63 states and 84 transitions. [2018-06-22 11:30:36,385 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:30:36,385 INFO ]: Start isEmpty. Operand 63 states and 84 transitions. [2018-06-22 11:30:36,386 INFO ]: Finished isEmpty. Found accepting run of length 226 [2018-06-22 11:30:36,386 INFO ]: Found error trace [2018-06-22 11:30:36,387 INFO ]: trace histogram [46, 37, 37, 37, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:36,387 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:36,387 INFO ]: Analyzing trace with hash -270435800, now seen corresponding path program 20 times [2018-06-22 11:30:36,387 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:36,387 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:36,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:36,387 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:30:36,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:36,406 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:38,195 INFO ]: Checked inductivity of 3935 backedges. 1062 proven. 100 refuted. 0 times theorem prover too weak. 2773 trivial. 0 not checked. [2018-06-22 11:30:38,195 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:30:38,196 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:30:38,215 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:30:38,307 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:30:38,307 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:30:38,311 INFO ]: Computing forward predicates... [2018-06-22 11:30:38,413 INFO ]: Checked inductivity of 3935 backedges. 1044 proven. 118 refuted. 0 times theorem prover too weak. 2773 trivial. 0 not checked. [2018-06-22 11:30:38,432 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:30:38,437 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2018-06-22 11:30:38,437 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:30:38,437 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:30:38,437 INFO ]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:30:38,437 INFO ]: Start difference. First operand 63 states and 84 transitions. Second operand 26 states. [2018-06-22 11:30:38,770 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:30:38,770 INFO ]: Finished difference Result 65 states and 85 transitions. [2018-06-22 11:30:38,770 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:30:38,770 INFO ]: Start accepts. Automaton has 26 states. Word has length 225 [2018-06-22 11:30:38,770 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:30:38,771 INFO ]: With dead ends: 65 [2018-06-22 11:30:38,771 INFO ]: Without dead ends: 65 [2018-06-22 11:30:38,771 INFO ]: 0 DeclaredPredicates, 280 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=345, Invalid=1461, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:30:38,771 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:30:38,774 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-06-22 11:30:38,774 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:30:38,774 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2018-06-22 11:30:38,774 INFO ]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 225 [2018-06-22 11:30:38,776 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:30:38,776 INFO ]: Abstraction has 61 states and 79 transitions. [2018-06-22 11:30:38,776 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:30:38,776 INFO ]: Start isEmpty. Operand 61 states and 79 transitions. [2018-06-22 11:30:38,778 INFO ]: Finished isEmpty. Found accepting run of length 218 [2018-06-22 11:30:38,778 INFO ]: Found error trace [2018-06-22 11:30:38,778 INFO ]: trace histogram [44, 35, 35, 35, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:30:38,778 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:30:38,778 INFO ]: Analyzing trace with hash -401948764, now seen corresponding path program 21 times [2018-06-22 11:30:38,778 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:30:38,778 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:30:38,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:38,778 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:30:38,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:30:38,797 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 11:30:38,995 WARN ]: Verification canceled [2018-06-22 11:30:39,100 WARN ]: Timeout [2018-06-22 11:30:39,100 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:30:39 BoogieIcfgContainer [2018-06-22 11:30:39,100 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:30:39,101 INFO ]: Toolchain (without parser) took 54878.93 ms. Allocated memory was 306.2 MB in the beginning and 800.1 MB in the end (delta: 493.9 MB). Free memory was 262.6 MB in the beginning and 770.7 MB in the end (delta: -508.2 MB). Peak memory consumption was 223.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:30:39,102 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:30:39,102 INFO ]: ChcToBoogie took 37.23 ms. Allocated memory is still 306.2 MB. Free memory was 261.6 MB in the beginning and 259.6 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:30:39,103 INFO ]: Boogie Preprocessor took 35.92 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 258.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 11:30:39,104 INFO ]: RCFGBuilder took 298.62 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 249.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:30:39,104 INFO ]: TraceAbstraction took 54499.27 ms. Allocated memory was 306.2 MB in the beginning and 800.1 MB in the end (delta: 493.9 MB). Free memory was 249.6 MB in the beginning and 770.7 MB in the end (delta: -521.2 MB). Peak memory consumption was 210.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:30:39,111 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 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 37.23 ms. Allocated memory is still 306.2 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.92 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 258.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 298.62 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 249.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54499.27 ms. Allocated memory was 306.2 MB in the beginning and 800.1 MB in the end (delta: 493.9 MB). Free memory was 249.6 MB in the beginning and 770.7 MB in the end (delta: -521.2 MB). Peak memory consumption was 210.0 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 analyzing trace of length 218 with TraceHistMax 44, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 54.4s OverallTime, 50 OverallIterations, 46 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1370 SDtfs, 707 SDslu, 13756 SDs, 0 SdLazy, 20098 SolverSat, 1301 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5823 GetRequests, 4321 SyntacticMatches, 192 SemanticMatches, 1310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8916 ImplicationChecksByTransitivity, 31.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 49 MinimizatonAttempts, 112 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 28.0s InterpolantComputationTime, 8836 NumberOfCodeBlocks, 8773 NumberOfCodeBlocksAsserted, 212 NumberOfCheckSat, 8744 ConstructedInterpolants, 0 QuantifiedInterpolants, 2953140 SizeOfPredicates, 567 NumberOfNonLiveVariables, 17138 ConjunctsInSsa, 1893 ConjunctsInUnsatCore, 92 InterpolantComputations, 6 PerfectInterpolantSequences, 73208/79537 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/enc-rev_append.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-30-39-122.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-rev_append.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-30-39-122.csv Completed graceful shutdown