java -Xss4m -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_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/enc-rev_append.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:25:56,016 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:25:56,018 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:25:56,029 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:25:56,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:25:56,031 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:25:56,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:25:56,033 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:25:56,035 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:25:56,035 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:25:56,036 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:25:56,037 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:25:56,037 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:25:56,039 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:25:56,039 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:25:56,040 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:25:56,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:25:56,044 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:25:56,045 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:25:56,046 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:25:56,048 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:25:56,050 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:25:56,050 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:25:56,051 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:25:56,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:25:56,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:25:56,053 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:25:56,054 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:25:56,055 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:25:56,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:25:56,056 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:25:56,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:25:56,057 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:25:56,058 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:25:56,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:25:56,059 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:25:56,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:25:56,074 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:25:56,074 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:25:56,075 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:25:56,076 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:25:56,076 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:25:56,076 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:25:56,076 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:25:56,077 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:25:56,077 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:25:56,077 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:25:56,077 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:25:56,077 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:25:56,078 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:25:56,078 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:25:56,078 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:25:56,078 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:25:56,079 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:25:56,079 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:25:56,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:25:56,079 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:25:56,080 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:25:56,081 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:25:56,123 INFO ]: Repository-Root is: /tmp [2018-06-25 09:25:56,141 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:25:56,144 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:25:56,146 INFO ]: Initializing SmtParser... [2018-06-25 09:25:56,146 INFO ]: SmtParser initialized [2018-06-25 09:25:56,147 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/enc-rev_append.smt2 [2018-06-25 09:25:56,148 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-25 09:25:56,241 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/enc-rev_append.smt2 unknown [2018-06-25 09:25:56,433 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/enc-rev_append.smt2 [2018-06-25 09:25:56,442 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:25:56,450 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:25:56,451 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:25:56,451 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:25:56,451 INFO ]: ChcToBoogie initialized [2018-06-25 09:25:56,454 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:25:56" (1/1) ... [2018-06-25 09:25:56,509 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:25:56 Unit [2018-06-25 09:25:56,510 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:25:56,510 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:25:56,510 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:25:56,510 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:25:56,531 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:25:56" (1/1) ... [2018-06-25 09:25:56,531 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:25:56" (1/1) ... [2018-06-25 09:25:56,538 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:25:56" (1/1) ... [2018-06-25 09:25:56,538 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:25:56" (1/1) ... [2018-06-25 09:25:56,541 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:25:56" (1/1) ... [2018-06-25 09:25:56,544 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:25:56" (1/1) ... [2018-06-25 09:25:56,545 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:25:56" (1/1) ... [2018-06-25 09:25:56,546 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:25:56,548 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:25:56,549 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:25:56,549 INFO ]: RCFGBuilder initialized [2018-06-25 09:25:56,550 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:25:56" (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-25 09:25:56,561 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:25:56,561 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:25:56,561 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:25:56,561 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:25:56,561 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:25:56,561 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 09:25:56,862 INFO ]: Using library mode [2018-06-25 09:25:56,862 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:25:56 BoogieIcfgContainer [2018-06-25 09:25:56,868 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:25:56,870 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:25:56,870 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:25:56,874 INFO ]: TraceAbstraction initialized [2018-06-25 09:25:56,874 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:25:56" (1/3) ... [2018-06-25 09:25:56,875 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ea01c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:25:56, skipping insertion in model container [2018-06-25 09:25:56,875 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:25:56" (2/3) ... [2018-06-25 09:25:56,875 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ea01c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:25:56, skipping insertion in model container [2018-06-25 09:25:56,875 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:25:56" (3/3) ... [2018-06-25 09:25:56,879 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:25:56,886 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:25:56,892 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:25:56,933 INFO ]: Using default assertion order modulation [2018-06-25 09:25:56,933 INFO ]: Interprodecural is true [2018-06-25 09:25:56,933 INFO ]: Hoare is false [2018-06-25 09:25:56,933 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:25:56,933 INFO ]: Backedges is TWOTRACK [2018-06-25 09:25:56,933 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:25:56,933 INFO ]: Difference is false [2018-06-25 09:25:56,933 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:25:56,933 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:25:56,944 INFO ]: Start isEmpty. Operand 16 states. [2018-06-25 09:25:56,954 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:25:56,954 INFO ]: Found error trace [2018-06-25 09:25:56,955 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:25:56,955 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:56,960 INFO ]: Analyzing trace with hash 1999380130, now seen corresponding path program 1 times [2018-06-25 09:25:56,963 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:56,963 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:56,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:56,998 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:56,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:57,029 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:57,130 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:25:57,132 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:25:57,132 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:25:57,133 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:25:57,143 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:25:57,144 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:25:57,146 INFO ]: Start difference. First operand 16 states. Second operand 4 states. [2018-06-25 09:25:57,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:57,288 INFO ]: Finished difference Result 25 states and 35 transitions. [2018-06-25 09:25:57,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:25:57,289 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-25 09:25:57,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:57,296 INFO ]: With dead ends: 25 [2018-06-25 09:25:57,297 INFO ]: Without dead ends: 25 [2018-06-25 09:25:57,299 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:25:57,316 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:25:57,339 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-25 09:25:57,341 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 09:25:57,342 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-06-25 09:25:57,344 INFO ]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 7 [2018-06-25 09:25:57,345 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:57,345 INFO ]: Abstraction has 25 states and 35 transitions. [2018-06-25 09:25:57,345 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:25:57,345 INFO ]: Start isEmpty. Operand 25 states and 35 transitions. [2018-06-25 09:25:57,346 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:25:57,346 INFO ]: Found error trace [2018-06-25 09:25:57,346 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:25:57,346 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:57,347 INFO ]: Analyzing trace with hash 1892761210, now seen corresponding path program 1 times [2018-06-25 09:25:57,347 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:57,347 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:57,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:57,348 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:57,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:57,361 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:57,408 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:25:57,408 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:25:57,408 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:25:57,410 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:25:57,410 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:25:57,410 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:25:57,410 INFO ]: Start difference. First operand 25 states and 35 transitions. Second operand 3 states. [2018-06-25 09:25:57,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:57,447 INFO ]: Finished difference Result 34 states and 50 transitions. [2018-06-25 09:25:57,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:25:57,447 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:25:57,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:57,450 INFO ]: With dead ends: 34 [2018-06-25 09:25:57,450 INFO ]: Without dead ends: 34 [2018-06-25 09:25:57,450 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:25:57,451 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:25:57,456 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 26. [2018-06-25 09:25:57,456 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 09:25:57,459 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2018-06-25 09:25:57,459 INFO ]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 8 [2018-06-25 09:25:57,459 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:57,459 INFO ]: Abstraction has 26 states and 35 transitions. [2018-06-25 09:25:57,459 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:25:57,459 INFO ]: Start isEmpty. Operand 26 states and 35 transitions. [2018-06-25 09:25:57,460 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:25:57,460 INFO ]: Found error trace [2018-06-25 09:25:57,460 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:25:57,461 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:57,461 INFO ]: Analyzing trace with hash -198346446, now seen corresponding path program 1 times [2018-06-25 09:25:57,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:57,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:57,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:57,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:57,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:57,477 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:57,742 WARN ]: Spent 195.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-06-25 09:25:57,917 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:25:57,917 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:25:57,917 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-25 09:25:57,917 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:25:57,917 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:25:57,917 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:25:57,918 INFO ]: Start difference. First operand 26 states and 35 transitions. Second operand 7 states. [2018-06-25 09:25:58,354 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:58,354 INFO ]: Finished difference Result 41 states and 65 transitions. [2018-06-25 09:25:58,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:25:58,354 INFO ]: Start accepts. Automaton has 7 states. Word has length 15 [2018-06-25 09:25:58,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:58,356 INFO ]: With dead ends: 41 [2018-06-25 09:25:58,356 INFO ]: Without dead ends: 37 [2018-06-25 09:25:58,357 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:25:58,357 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:25:58,364 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-06-25 09:25:58,364 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:25:58,365 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2018-06-25 09:25:58,365 INFO ]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 15 [2018-06-25 09:25:58,365 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:58,365 INFO ]: Abstraction has 32 states and 43 transitions. [2018-06-25 09:25:58,365 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:25:58,365 INFO ]: Start isEmpty. Operand 32 states and 43 transitions. [2018-06-25 09:25:58,366 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:25:58,366 INFO ]: Found error trace [2018-06-25 09:25:58,366 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:25:58,366 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:58,367 INFO ]: Analyzing trace with hash -2123667352, now seen corresponding path program 1 times [2018-06-25 09:25:58,367 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:58,367 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:58,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:58,368 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:58,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:58,389 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:58,502 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:25:58,502 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:25:58,502 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-25 09:25:58,530 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:58,555 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:58,562 INFO ]: Computing forward predicates... [2018-06-25 09:25:59,018 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:25:59,040 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:25:59,040 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-25 09:25:59,040 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:25:59,041 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:25:59,041 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:25:59,041 INFO ]: Start difference. First operand 32 states and 43 transitions. Second operand 11 states. [2018-06-25 09:25:59,300 WARN ]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-25 09:25:59,907 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:59,907 INFO ]: Finished difference Result 47 states and 71 transitions. [2018-06-25 09:25:59,908 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:25:59,908 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-25 09:25:59,908 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:59,909 INFO ]: With dead ends: 47 [2018-06-25 09:25:59,909 INFO ]: Without dead ends: 47 [2018-06-25 09:25:59,910 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:25:59,910 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-25 09:25:59,916 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 35. [2018-06-25 09:25:59,916 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 09:25:59,917 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2018-06-25 09:25:59,918 INFO ]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 16 [2018-06-25 09:25:59,918 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:59,918 INFO ]: Abstraction has 35 states and 48 transitions. [2018-06-25 09:25:59,918 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:25:59,918 INFO ]: Start isEmpty. Operand 35 states and 48 transitions. [2018-06-25 09:25:59,919 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:25:59,919 INFO ]: Found error trace [2018-06-25 09:25:59,919 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:25:59,919 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:59,919 INFO ]: Analyzing trace with hash -1853156249, now seen corresponding path program 1 times [2018-06-25 09:25:59,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:59,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:59,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:59,920 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:59,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:59,931 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:00,058 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:26:00,058 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:00,058 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-25 09:26:00,063 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:00,079 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:00,080 INFO ]: Computing forward predicates... [2018-06-25 09:26:00,186 INFO ]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:26:00,208 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:26:00,208 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-06-25 09:26:00,208 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:26:00,209 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:26:00,209 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:26:00,209 INFO ]: Start difference. First operand 35 states and 48 transitions. Second operand 13 states. [2018-06-25 09:26:00,581 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:00,581 INFO ]: Finished difference Result 43 states and 61 transitions. [2018-06-25 09:26:00,582 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:26:00,582 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-25 09:26:00,582 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:00,583 INFO ]: With dead ends: 43 [2018-06-25 09:26:00,583 INFO ]: Without dead ends: 37 [2018-06-25 09:26:00,583 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:26:00,583 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:26:00,588 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-06-25 09:26:00,588 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 09:26:00,589 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-06-25 09:26:00,589 INFO ]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 16 [2018-06-25 09:26:00,589 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:00,589 INFO ]: Abstraction has 33 states and 44 transitions. [2018-06-25 09:26:00,589 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:26:00,589 INFO ]: Start isEmpty. Operand 33 states and 44 transitions. [2018-06-25 09:26:00,591 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:26:00,591 INFO ]: Found error trace [2018-06-25 09:26:00,591 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:00,591 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:00,591 INFO ]: Analyzing trace with hash -1408562191, now seen corresponding path program 1 times [2018-06-25 09:26:00,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:00,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:00,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:00,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:00,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:00,609 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:00,650 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:26:00,650 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:26:00,650 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-25 09:26:00,650 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:26:00,651 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:26:00,651 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:26:00,651 INFO ]: Start difference. First operand 33 states and 44 transitions. Second operand 6 states. [2018-06-25 09:26:00,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:00,827 INFO ]: Finished difference Result 39 states and 53 transitions. [2018-06-25 09:26:00,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:26:00,828 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-25 09:26:00,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:00,829 INFO ]: With dead ends: 39 [2018-06-25 09:26:00,829 INFO ]: Without dead ends: 35 [2018-06-25 09:26:00,829 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:26:00,829 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-25 09:26:00,835 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-06-25 09:26:00,835 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-25 09:26:00,836 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2018-06-25 09:26:00,836 INFO ]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 17 [2018-06-25 09:26:00,836 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:00,837 INFO ]: Abstraction has 31 states and 40 transitions. [2018-06-25 09:26:00,837 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:26:00,837 INFO ]: Start isEmpty. Operand 31 states and 40 transitions. [2018-06-25 09:26:00,838 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:26:00,838 INFO ]: Found error trace [2018-06-25 09:26:00,838 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:00,838 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:00,838 INFO ]: Analyzing trace with hash -635135456, now seen corresponding path program 1 times [2018-06-25 09:26:00,838 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:00,838 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:00,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:00,839 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:00,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:00,869 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:00,947 INFO ]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:26:00,947 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:00,947 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-25 09:26:00,955 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:00,983 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:00,985 INFO ]: Computing forward predicates... [2018-06-25 09:26:01,089 INFO ]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:26:01,117 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:01,117 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-25 09:26:01,118 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:26:01,118 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:26:01,118 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:26:01,118 INFO ]: Start difference. First operand 31 states and 40 transitions. Second operand 12 states. [2018-06-25 09:26:01,582 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:01,582 INFO ]: Finished difference Result 47 states and 66 transitions. [2018-06-25 09:26:01,582 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:26:01,583 INFO ]: Start accepts. Automaton has 12 states. Word has length 23 [2018-06-25 09:26:01,583 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:01,584 INFO ]: With dead ends: 47 [2018-06-25 09:26:01,584 INFO ]: Without dead ends: 47 [2018-06-25 09:26:01,584 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:26:01,584 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-25 09:26:01,593 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 39. [2018-06-25 09:26:01,593 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 09:26:01,594 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2018-06-25 09:26:01,594 INFO ]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 23 [2018-06-25 09:26:01,594 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:01,594 INFO ]: Abstraction has 39 states and 53 transitions. [2018-06-25 09:26:01,594 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:26:01,594 INFO ]: Start isEmpty. Operand 39 states and 53 transitions. [2018-06-25 09:26:01,595 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:26:01,595 INFO ]: Found error trace [2018-06-25 09:26:01,596 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:01,596 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:01,596 INFO ]: Analyzing trace with hash 85642326, now seen corresponding path program 2 times [2018-06-25 09:26:01,596 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:01,596 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:01,597 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:01,597 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:01,597 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:01,607 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:01,673 INFO ]: Checked inductivity of 18 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:26:01,673 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:01,673 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-25 09:26:01,685 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:26:01,707 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:26:01,707 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:01,709 INFO ]: Computing forward predicates... [2018-06-25 09:26:01,867 INFO ]: Checked inductivity of 18 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:26:01,886 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:01,886 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-25 09:26:01,886 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:26:01,886 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:26:01,886 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:26:01,886 INFO ]: Start difference. First operand 39 states and 53 transitions. Second operand 14 states. [2018-06-25 09:26:02,107 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:02,107 INFO ]: Finished difference Result 48 states and 67 transitions. [2018-06-25 09:26:02,107 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:26:02,108 INFO ]: Start accepts. Automaton has 14 states. Word has length 24 [2018-06-25 09:26:02,108 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:02,109 INFO ]: With dead ends: 48 [2018-06-25 09:26:02,109 INFO ]: Without dead ends: 48 [2018-06-25 09:26:02,110 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:26:02,110 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 09:26:02,115 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 43. [2018-06-25 09:26:02,115 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-25 09:26:02,116 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2018-06-25 09:26:02,116 INFO ]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 24 [2018-06-25 09:26:02,117 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:02,117 INFO ]: Abstraction has 43 states and 57 transitions. [2018-06-25 09:26:02,117 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:26:02,117 INFO ]: Start isEmpty. Operand 43 states and 57 transitions. [2018-06-25 09:26:02,118 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:26:02,118 INFO ]: Found error trace [2018-06-25 09:26:02,118 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:02,118 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:02,118 INFO ]: Analyzing trace with hash 1786253625, now seen corresponding path program 1 times [2018-06-25 09:26:02,118 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:02,118 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:02,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:02,119 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:02,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:02,134 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:02,240 INFO ]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:26:02,240 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:02,240 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-25 09:26:02,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:02,279 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:02,282 INFO ]: Computing forward predicates... [2018-06-25 09:26:02,357 INFO ]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:26:02,376 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:02,376 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 12 [2018-06-25 09:26:02,376 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:26:02,376 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:26:02,376 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:26:02,376 INFO ]: Start difference. First operand 43 states and 57 transitions. Second operand 12 states. [2018-06-25 09:26:02,731 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:02,731 INFO ]: Finished difference Result 57 states and 75 transitions. [2018-06-25 09:26:02,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 09:26:02,731 INFO ]: Start accepts. Automaton has 12 states. Word has length 24 [2018-06-25 09:26:02,731 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:02,732 INFO ]: With dead ends: 57 [2018-06-25 09:26:02,732 INFO ]: Without dead ends: 57 [2018-06-25 09:26:02,733 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:26:02,733 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-25 09:26:02,738 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 43. [2018-06-25 09:26:02,738 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-25 09:26:02,739 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2018-06-25 09:26:02,739 INFO ]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 24 [2018-06-25 09:26:02,739 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:02,739 INFO ]: Abstraction has 43 states and 57 transitions. [2018-06-25 09:26:02,739 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:26:02,739 INFO ]: Start isEmpty. Operand 43 states and 57 transitions. [2018-06-25 09:26:02,740 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:26:02,740 INFO ]: Found error trace [2018-06-25 09:26:02,740 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:02,741 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:02,741 INFO ]: Analyzing trace with hash -1639438909, now seen corresponding path program 2 times [2018-06-25 09:26:02,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:02,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:02,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:02,741 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:02,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:02,767 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:03,040 INFO ]: Checked inductivity of 20 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:26:03,040 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:03,040 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-25 09:26:03,046 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:26:03,060 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:26:03,060 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:03,062 INFO ]: Computing forward predicates... [2018-06-25 09:26:03,260 INFO ]: Checked inductivity of 20 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:26:03,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:03,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-25 09:26:03,291 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:26:03,291 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:26:03,291 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:26:03,291 INFO ]: Start difference. First operand 43 states and 57 transitions. Second operand 15 states. [2018-06-25 09:26:03,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:03,660 INFO ]: Finished difference Result 59 states and 83 transitions. [2018-06-25 09:26:03,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 09:26:03,660 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-25 09:26:03,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:03,661 INFO ]: With dead ends: 59 [2018-06-25 09:26:03,661 INFO ]: Without dead ends: 59 [2018-06-25 09:26:03,662 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:26:03,662 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-25 09:26:03,668 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 47. [2018-06-25 09:26:03,668 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-25 09:26:03,669 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2018-06-25 09:26:03,669 INFO ]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 25 [2018-06-25 09:26:03,669 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:03,670 INFO ]: Abstraction has 47 states and 65 transitions. [2018-06-25 09:26:03,670 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:26:03,670 INFO ]: Start isEmpty. Operand 47 states and 65 transitions. [2018-06-25 09:26:03,671 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:26:03,671 INFO ]: Found error trace [2018-06-25 09:26:03,671 INFO ]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:03,671 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:03,671 INFO ]: Analyzing trace with hash -460096192, now seen corresponding path program 2 times [2018-06-25 09:26:03,671 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:03,671 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:03,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:03,672 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:03,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:03,682 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:04,017 INFO ]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:26:04,018 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:04,018 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-25 09:26:04,028 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:26:04,044 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:26:04,044 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:04,046 INFO ]: Computing forward predicates... [2018-06-25 09:26:04,193 INFO ]: Checked inductivity of 19 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:26:04,212 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:04,212 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-06-25 09:26:04,212 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:26:04,212 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:26:04,212 INFO ]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:26:04,212 INFO ]: Start difference. First operand 47 states and 65 transitions. Second operand 17 states. [2018-06-25 09:26:04,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:04,652 INFO ]: Finished difference Result 58 states and 81 transitions. [2018-06-25 09:26:04,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 09:26:04,652 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-25 09:26:04,653 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:04,653 INFO ]: With dead ends: 58 [2018-06-25 09:26:04,653 INFO ]: Without dead ends: 50 [2018-06-25 09:26:04,654 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=884, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:26:04,654 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-25 09:26:04,658 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-25 09:26:04,658 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-25 09:26:04,659 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2018-06-25 09:26:04,659 INFO ]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 25 [2018-06-25 09:26:04,659 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:04,659 INFO ]: Abstraction has 50 states and 69 transitions. [2018-06-25 09:26:04,659 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:26:04,659 INFO ]: Start isEmpty. Operand 50 states and 69 transitions. [2018-06-25 09:26:04,660 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:26:04,660 INFO ]: Found error trace [2018-06-25 09:26:04,660 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:04,660 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:04,661 INFO ]: Analyzing trace with hash 717617654, now seen corresponding path program 3 times [2018-06-25 09:26:04,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:04,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:04,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:04,661 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:04,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:04,669 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:04,729 INFO ]: Checked inductivity of 23 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:26:04,729 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:04,729 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:26:04,736 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:26:04,752 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:26:04,752 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:04,754 INFO ]: Computing forward predicates... [2018-06-25 09:26:04,816 INFO ]: Checked inductivity of 23 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:26:04,838 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:04,838 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-06-25 09:26:04,838 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:26:04,838 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:26:04,838 INFO ]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:26:04,838 INFO ]: Start difference. First operand 50 states and 69 transitions. Second operand 16 states. [2018-06-25 09:26:05,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:05,089 INFO ]: Finished difference Result 63 states and 80 transitions. [2018-06-25 09:26:05,089 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:26:05,089 INFO ]: Start accepts. Automaton has 16 states. Word has length 26 [2018-06-25 09:26:05,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:05,090 INFO ]: With dead ends: 63 [2018-06-25 09:26:05,090 INFO ]: Without dead ends: 57 [2018-06-25 09:26:05,090 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:26:05,091 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-25 09:26:05,096 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-06-25 09:26:05,096 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-25 09:26:05,098 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2018-06-25 09:26:05,098 INFO ]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 26 [2018-06-25 09:26:05,099 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:05,099 INFO ]: Abstraction has 57 states and 74 transitions. [2018-06-25 09:26:05,099 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:26:05,099 INFO ]: Start isEmpty. Operand 57 states and 74 transitions. [2018-06-25 09:26:05,100 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 09:26:05,100 INFO ]: Found error trace [2018-06-25 09:26:05,100 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:05,100 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:05,100 INFO ]: Analyzing trace with hash -1972230138, now seen corresponding path program 4 times [2018-06-25 09:26:05,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:05,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:05,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:05,101 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:05,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:05,112 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:05,187 INFO ]: Checked inductivity of 46 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-25 09:26:05,187 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:05,187 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-25 09:26:05,193 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:26:05,213 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:26:05,213 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:05,216 INFO ]: Computing forward predicates... [2018-06-25 09:26:05,329 INFO ]: Checked inductivity of 46 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-25 09:26:05,350 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:05,350 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-25 09:26:05,350 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:26:05,350 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:26:05,350 INFO ]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:26:05,350 INFO ]: Start difference. First operand 57 states and 74 transitions. Second operand 16 states. [2018-06-25 09:26:05,515 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:05,515 INFO ]: Finished difference Result 62 states and 79 transitions. [2018-06-25 09:26:05,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:26:05,516 INFO ]: Start accepts. Automaton has 16 states. Word has length 34 [2018-06-25 09:26:05,516 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:05,517 INFO ]: With dead ends: 62 [2018-06-25 09:26:05,517 INFO ]: Without dead ends: 62 [2018-06-25 09:26:05,517 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:26:05,517 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-25 09:26:05,522 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-06-25 09:26:05,522 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-25 09:26:05,522 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2018-06-25 09:26:05,522 INFO ]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 34 [2018-06-25 09:26:05,523 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:05,523 INFO ]: Abstraction has 58 states and 75 transitions. [2018-06-25 09:26:05,523 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:26:05,523 INFO ]: Start isEmpty. Operand 58 states and 75 transitions. [2018-06-25 09:26:05,524 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 09:26:05,524 INFO ]: Found error trace [2018-06-25 09:26:05,524 INFO ]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:05,524 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:05,524 INFO ]: Analyzing trace with hash 800993047, now seen corresponding path program 3 times [2018-06-25 09:26:05,524 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:05,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:05,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:05,525 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:05,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:05,545 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:05,661 INFO ]: Checked inductivity of 44 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:26:05,661 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:05,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-25 09:26:05,667 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:26:05,683 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:26:05,683 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:05,685 INFO ]: Computing forward predicates... [2018-06-25 09:26:05,713 INFO ]: Checked inductivity of 44 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-25 09:26:05,732 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:26:05,732 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-06-25 09:26:05,732 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:26:05,732 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:26:05,732 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:26:05,732 INFO ]: Start difference. First operand 58 states and 75 transitions. Second operand 14 states. [2018-06-25 09:26:05,974 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:05,974 INFO ]: Finished difference Result 75 states and 97 transitions. [2018-06-25 09:26:05,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:26:05,974 INFO ]: Start accepts. Automaton has 14 states. Word has length 34 [2018-06-25 09:26:05,974 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:05,975 INFO ]: With dead ends: 75 [2018-06-25 09:26:05,975 INFO ]: Without dead ends: 57 [2018-06-25 09:26:05,975 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:26:05,976 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-25 09:26:05,979 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-06-25 09:26:05,979 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-25 09:26:05,979 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-06-25 09:26:05,979 INFO ]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 34 [2018-06-25 09:26:05,980 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:05,980 INFO ]: Abstraction has 54 states and 65 transitions. [2018-06-25 09:26:05,980 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:26:05,980 INFO ]: Start isEmpty. Operand 54 states and 65 transitions. [2018-06-25 09:26:05,980 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 09:26:05,980 INFO ]: Found error trace [2018-06-25 09:26:05,980 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:05,980 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:05,981 INFO ]: Analyzing trace with hash -1008975853, now seen corresponding path program 5 times [2018-06-25 09:26:05,981 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:05,981 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:05,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:05,981 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:05,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:05,995 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:06,238 INFO ]: Checked inductivity of 51 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-25 09:26:06,238 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:06,238 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-25 09:26:06,244 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:26:06,266 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 09:26:06,266 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:06,269 INFO ]: Computing forward predicates... [2018-06-25 09:26:06,621 INFO ]: Checked inductivity of 51 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-25 09:26:06,640 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:06,640 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-25 09:26:06,640 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:26:06,640 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:26:06,641 INFO ]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:26:06,641 INFO ]: Start difference. First operand 54 states and 65 transitions. Second operand 18 states. [2018-06-25 09:26:07,107 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:07,108 INFO ]: Finished difference Result 67 states and 80 transitions. [2018-06-25 09:26:07,108 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:26:07,108 INFO ]: Start accepts. Automaton has 18 states. Word has length 35 [2018-06-25 09:26:07,108 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:07,108 INFO ]: With dead ends: 67 [2018-06-25 09:26:07,108 INFO ]: Without dead ends: 67 [2018-06-25 09:26:07,109 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=1382, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:26:07,109 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-25 09:26:07,113 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-06-25 09:26:07,113 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-25 09:26:07,114 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2018-06-25 09:26:07,114 INFO ]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 35 [2018-06-25 09:26:07,114 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:07,114 INFO ]: Abstraction has 63 states and 76 transitions. [2018-06-25 09:26:07,114 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:26:07,114 INFO ]: Start isEmpty. Operand 63 states and 76 transitions. [2018-06-25 09:26:07,115 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 09:26:07,115 INFO ]: Found error trace [2018-06-25 09:26:07,115 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:07,115 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:07,115 INFO ]: Analyzing trace with hash -1212864090, now seen corresponding path program 6 times [2018-06-25 09:26:07,115 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:07,115 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:07,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:07,116 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:07,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:07,131 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:07,253 INFO ]: Checked inductivity of 57 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-25 09:26:07,253 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:07,253 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-25 09:26:07,259 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:26:07,305 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 09:26:07,305 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:07,308 INFO ]: Computing forward predicates... [2018-06-25 09:26:07,450 INFO ]: Checked inductivity of 57 backedges. 25 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-25 09:26:07,469 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:07,469 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-06-25 09:26:07,469 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:26:07,470 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:26:07,470 INFO ]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:26:07,470 INFO ]: Start difference. First operand 63 states and 76 transitions. Second operand 20 states. [2018-06-25 09:26:07,860 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:07,860 INFO ]: Finished difference Result 82 states and 96 transitions. [2018-06-25 09:26:07,860 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 09:26:07,860 INFO ]: Start accepts. Automaton has 20 states. Word has length 36 [2018-06-25 09:26:07,860 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:07,861 INFO ]: With dead ends: 82 [2018-06-25 09:26:07,861 INFO ]: Without dead ends: 74 [2018-06-25 09:26:07,862 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=1332, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:26:07,862 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-25 09:26:07,866 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-06-25 09:26:07,866 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-25 09:26:07,867 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-06-25 09:26:07,867 INFO ]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 36 [2018-06-25 09:26:07,867 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:07,867 INFO ]: Abstraction has 70 states and 84 transitions. [2018-06-25 09:26:07,867 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:26:07,867 INFO ]: Start isEmpty. Operand 70 states and 84 transitions. [2018-06-25 09:26:07,868 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-25 09:26:07,868 INFO ]: Found error trace [2018-06-25 09:26:07,868 INFO ]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:07,868 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:07,868 INFO ]: Analyzing trace with hash -658299613, now seen corresponding path program 7 times [2018-06-25 09:26:07,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:07,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:07,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:07,869 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:07,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:07,889 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:08,623 INFO ]: Checked inductivity of 98 backedges. 38 proven. 21 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-25 09:26:08,623 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:08,623 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-25 09:26:08,630 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:08,665 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:08,669 INFO ]: Computing forward predicates... [2018-06-25 09:26:08,815 INFO ]: Checked inductivity of 98 backedges. 41 proven. 18 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-25 09:26:08,834 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:08,834 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-25 09:26:08,834 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:26:08,834 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:26:08,834 INFO ]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:26:08,834 INFO ]: Start difference. First operand 70 states and 84 transitions. Second operand 19 states. [2018-06-25 09:26:09,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:09,138 INFO ]: Finished difference Result 73 states and 87 transitions. [2018-06-25 09:26:09,139 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:26:09,139 INFO ]: Start accepts. Automaton has 19 states. Word has length 45 [2018-06-25 09:26:09,139 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:09,139 INFO ]: With dead ends: 73 [2018-06-25 09:26:09,139 INFO ]: Without dead ends: 73 [2018-06-25 09:26:09,140 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:26:09,140 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-25 09:26:09,144 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-06-25 09:26:09,144 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-25 09:26:09,147 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2018-06-25 09:26:09,148 INFO ]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 45 [2018-06-25 09:26:09,148 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:09,148 INFO ]: Abstraction has 73 states and 87 transitions. [2018-06-25 09:26:09,148 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:26:09,148 INFO ]: Start isEmpty. Operand 73 states and 87 transitions. [2018-06-25 09:26:09,149 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-25 09:26:09,149 INFO ]: Found error trace [2018-06-25 09:26:09,149 INFO ]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:09,149 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:09,149 INFO ]: Analyzing trace with hash 1068164758, now seen corresponding path program 8 times [2018-06-25 09:26:09,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:09,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:09,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:09,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:09,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:09,165 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:09,564 INFO ]: Checked inductivity of 107 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-25 09:26:09,565 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:09,565 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-25 09:26:09,570 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:26:09,600 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:26:09,600 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:09,605 INFO ]: Computing forward predicates... [2018-06-25 09:26:09,758 INFO ]: Checked inductivity of 107 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-25 09:26:09,777 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:09,777 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-06-25 09:26:09,777 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:26:09,777 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:26:09,777 INFO ]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:26:09,777 INFO ]: Start difference. First operand 73 states and 87 transitions. Second operand 21 states. [2018-06-25 09:26:10,432 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:10,432 INFO ]: Finished difference Result 89 states and 105 transitions. [2018-06-25 09:26:10,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 09:26:10,432 INFO ]: Start accepts. Automaton has 21 states. Word has length 46 [2018-06-25 09:26:10,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:10,433 INFO ]: With dead ends: 89 [2018-06-25 09:26:10,433 INFO ]: Without dead ends: 89 [2018-06-25 09:26:10,434 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=2033, Unknown=0, NotChecked=0, Total=2256 [2018-06-25 09:26:10,434 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-25 09:26:10,440 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-06-25 09:26:10,440 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-25 09:26:10,441 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2018-06-25 09:26:10,441 INFO ]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 46 [2018-06-25 09:26:10,441 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:10,441 INFO ]: Abstraction has 83 states and 99 transitions. [2018-06-25 09:26:10,441 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:26:10,442 INFO ]: Start isEmpty. Operand 83 states and 99 transitions. [2018-06-25 09:26:10,442 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-25 09:26:10,442 INFO ]: Found error trace [2018-06-25 09:26:10,442 INFO ]: trace histogram [7, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:10,442 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:10,442 INFO ]: Analyzing trace with hash -1246014589, now seen corresponding path program 9 times [2018-06-25 09:26:10,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:10,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:10,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:10,444 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:10,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:10,457 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:10,669 INFO ]: Checked inductivity of 117 backedges. 47 proven. 31 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-25 09:26:10,669 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:10,669 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-25 09:26:10,681 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:26:10,740 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 09:26:10,740 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:10,744 INFO ]: Computing forward predicates... [2018-06-25 09:26:10,871 INFO ]: Checked inductivity of 117 backedges. 44 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-25 09:26:10,890 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:10,890 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-06-25 09:26:10,890 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:26:10,890 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:26:10,891 INFO ]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:26:10,891 INFO ]: Start difference. First operand 83 states and 99 transitions. Second operand 25 states. [2018-06-25 09:26:11,328 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:11,328 INFO ]: Finished difference Result 111 states and 128 transitions. [2018-06-25 09:26:11,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-25 09:26:11,328 INFO ]: Start accepts. Automaton has 25 states. Word has length 47 [2018-06-25 09:26:11,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:11,329 INFO ]: With dead ends: 111 [2018-06-25 09:26:11,329 INFO ]: Without dead ends: 101 [2018-06-25 09:26:11,329 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=2211, Unknown=0, NotChecked=0, Total=2550 [2018-06-25 09:26:11,329 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-25 09:26:11,335 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 91. [2018-06-25 09:26:11,335 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-25 09:26:11,336 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2018-06-25 09:26:11,336 INFO ]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 47 [2018-06-25 09:26:11,336 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:11,336 INFO ]: Abstraction has 91 states and 108 transitions. [2018-06-25 09:26:11,336 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:26:11,336 INFO ]: Start isEmpty. Operand 91 states and 108 transitions. [2018-06-25 09:26:11,337 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-25 09:26:11,337 INFO ]: Found error trace [2018-06-25 09:26:11,337 INFO ]: trace histogram [9, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:11,337 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:11,337 INFO ]: Analyzing trace with hash 1879753333, now seen corresponding path program 10 times [2018-06-25 09:26:11,337 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:11,338 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:11,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:11,338 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:11,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:11,353 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:11,585 INFO ]: Checked inductivity of 186 backedges. 75 proven. 35 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-25 09:26:11,585 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:11,585 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-25 09:26:11,595 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:26:11,631 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:26:11,631 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:11,634 INFO ]: Computing forward predicates... [2018-06-25 09:26:11,763 INFO ]: Checked inductivity of 186 backedges. 80 proven. 30 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-25 09:26:11,781 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:11,781 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-06-25 09:26:11,781 INFO ]: Interpolant automaton has 22 states [2018-06-25 09:26:11,782 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-25 09:26:11,782 INFO ]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:26:11,782 INFO ]: Start difference. First operand 91 states and 108 transitions. Second operand 22 states. [2018-06-25 09:26:12,239 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:12,240 INFO ]: Finished difference Result 94 states and 111 transitions. [2018-06-25 09:26:12,240 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:26:12,240 INFO ]: Start accepts. Automaton has 22 states. Word has length 57 [2018-06-25 09:26:12,240 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:12,241 INFO ]: With dead ends: 94 [2018-06-25 09:26:12,241 INFO ]: Without dead ends: 94 [2018-06-25 09:26:12,241 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:26:12,241 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-25 09:26:12,246 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-06-25 09:26:12,247 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-25 09:26:12,248 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2018-06-25 09:26:12,248 INFO ]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 57 [2018-06-25 09:26:12,248 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:12,248 INFO ]: Abstraction has 94 states and 111 transitions. [2018-06-25 09:26:12,248 INFO ]: Interpolant automaton has 22 states. [2018-06-25 09:26:12,248 INFO ]: Start isEmpty. Operand 94 states and 111 transitions. [2018-06-25 09:26:12,252 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-25 09:26:12,252 INFO ]: Found error trace [2018-06-25 09:26:12,252 INFO ]: trace histogram [10, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:12,252 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:12,252 INFO ]: Analyzing trace with hash -1856572540, now seen corresponding path program 11 times [2018-06-25 09:26:12,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:12,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:12,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:12,253 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:12,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:12,277 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:12,720 INFO ]: Checked inductivity of 200 backedges. 10 proven. 134 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-25 09:26:12,720 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:12,720 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-25 09:26:12,728 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:26:12,852 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-25 09:26:12,852 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:12,856 INFO ]: Computing forward predicates... [2018-06-25 09:26:13,082 INFO ]: Checked inductivity of 200 backedges. 10 proven. 134 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-25 09:26:13,101 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:13,102 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-06-25 09:26:13,102 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:26:13,102 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:26:13,102 INFO ]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:26:13,102 INFO ]: Start difference. First operand 94 states and 111 transitions. Second operand 24 states. [2018-06-25 09:26:14,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:14,473 INFO ]: Finished difference Result 113 states and 132 transitions. [2018-06-25 09:26:14,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-25 09:26:14,473 INFO ]: Start accepts. Automaton has 24 states. Word has length 58 [2018-06-25 09:26:14,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:14,474 INFO ]: With dead ends: 113 [2018-06-25 09:26:14,474 INFO ]: Without dead ends: 113 [2018-06-25 09:26:14,475 INFO ]: 0 DeclaredPredicates, 113 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=270, Invalid=2810, Unknown=0, NotChecked=0, Total=3080 [2018-06-25 09:26:14,475 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-25 09:26:14,480 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 105. [2018-06-25 09:26:14,480 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-25 09:26:14,481 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2018-06-25 09:26:14,483 INFO ]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 58 [2018-06-25 09:26:14,483 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:14,483 INFO ]: Abstraction has 105 states and 124 transitions. [2018-06-25 09:26:14,483 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:26:14,483 INFO ]: Start isEmpty. Operand 105 states and 124 transitions. [2018-06-25 09:26:14,484 INFO ]: Finished isEmpty. Found accepting run of length 60 [2018-06-25 09:26:14,484 INFO ]: Found error trace [2018-06-25 09:26:14,484 INFO ]: trace histogram [11, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:14,484 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:14,484 INFO ]: Analyzing trace with hash -1718557611, now seen corresponding path program 12 times [2018-06-25 09:26:14,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:14,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:14,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:14,485 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:14,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:14,504 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:14,638 INFO ]: Checked inductivity of 215 backedges. 92 proven. 47 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-25 09:26:14,638 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:14,638 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-25 09:26:14,644 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:26:14,684 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-25 09:26:14,684 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:14,687 INFO ]: Computing forward predicates... [2018-06-25 09:26:14,914 INFO ]: Checked inductivity of 215 backedges. 86 proven. 53 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-25 09:26:14,934 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:14,934 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-06-25 09:26:14,934 INFO ]: Interpolant automaton has 29 states [2018-06-25 09:26:14,934 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-25 09:26:14,934 INFO ]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:26:14,935 INFO ]: Start difference. First operand 105 states and 124 transitions. Second operand 29 states. [2018-06-25 09:26:15,799 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:15,799 INFO ]: Finished difference Result 144 states and 164 transitions. [2018-06-25 09:26:15,800 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-25 09:26:15,800 INFO ]: Start accepts. Automaton has 29 states. Word has length 59 [2018-06-25 09:26:15,800 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:15,801 INFO ]: With dead ends: 144 [2018-06-25 09:26:15,801 INFO ]: Without dead ends: 132 [2018-06-25 09:26:15,802 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=462, Invalid=3198, Unknown=0, NotChecked=0, Total=3660 [2018-06-25 09:26:15,802 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-25 09:26:15,807 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-06-25 09:26:15,807 INFO ]: Start removeUnreachable. Operand 114 states. [2018-06-25 09:26:15,808 INFO ]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2018-06-25 09:26:15,808 INFO ]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 59 [2018-06-25 09:26:15,808 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:15,808 INFO ]: Abstraction has 114 states and 134 transitions. [2018-06-25 09:26:15,808 INFO ]: Interpolant automaton has 29 states. [2018-06-25 09:26:15,808 INFO ]: Start isEmpty. Operand 114 states and 134 transitions. [2018-06-25 09:26:15,810 INFO ]: Finished isEmpty. Found accepting run of length 71 [2018-06-25 09:26:15,811 INFO ]: Found error trace [2018-06-25 09:26:15,811 INFO ]: trace histogram [14, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:15,811 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:15,811 INFO ]: Analyzing trace with hash -362167310, now seen corresponding path program 13 times [2018-06-25 09:26:15,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:15,811 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:15,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:15,811 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:15,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:15,843 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:15,991 INFO ]: Checked inductivity of 325 backedges. 135 proven. 52 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-06-25 09:26:15,991 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:15,991 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-25 09:26:16,000 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:16,045 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:16,048 INFO ]: Computing forward predicates... [2018-06-25 09:26:16,594 INFO ]: Checked inductivity of 325 backedges. 142 proven. 45 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-06-25 09:26:16,613 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:16,613 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-06-25 09:26:16,613 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:26:16,613 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:26:16,613 INFO ]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:26:16,613 INFO ]: Start difference. First operand 114 states and 134 transitions. Second operand 25 states. [2018-06-25 09:26:16,947 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:16,947 INFO ]: Finished difference Result 117 states and 137 transitions. [2018-06-25 09:26:16,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:26:16,947 INFO ]: Start accepts. Automaton has 25 states. Word has length 70 [2018-06-25 09:26:16,948 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:16,948 INFO ]: With dead ends: 117 [2018-06-25 09:26:16,948 INFO ]: Without dead ends: 117 [2018-06-25 09:26:16,949 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=316, Invalid=1406, Unknown=0, NotChecked=0, Total=1722 [2018-06-25 09:26:16,949 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-25 09:26:16,954 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-06-25 09:26:16,954 INFO ]: Start removeUnreachable. Operand 117 states. [2018-06-25 09:26:16,955 INFO ]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2018-06-25 09:26:16,955 INFO ]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 70 [2018-06-25 09:26:16,955 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:16,955 INFO ]: Abstraction has 117 states and 137 transitions. [2018-06-25 09:26:16,955 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:26:16,955 INFO ]: Start isEmpty. Operand 117 states and 137 transitions. [2018-06-25 09:26:16,957 INFO ]: Finished isEmpty. Found accepting run of length 72 [2018-06-25 09:26:16,957 INFO ]: Found error trace [2018-06-25 09:26:16,957 INFO ]: trace histogram [15, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:16,957 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:16,957 INFO ]: Analyzing trace with hash 1658331559, now seen corresponding path program 14 times [2018-06-25 09:26:16,957 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:16,957 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:16,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:16,958 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:16,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:16,978 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:17,397 INFO ]: Checked inductivity of 345 backedges. 12 proven. 246 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-25 09:26:17,397 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:17,397 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-25 09:26:17,407 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:26:17,455 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:26:17,455 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:17,458 INFO ]: Computing forward predicates... [2018-06-25 09:26:17,674 INFO ]: Checked inductivity of 345 backedges. 12 proven. 246 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-25 09:26:17,694 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:17,694 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-06-25 09:26:17,695 INFO ]: Interpolant automaton has 27 states [2018-06-25 09:26:17,695 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-25 09:26:17,695 INFO ]: CoverageRelationStatistics Valid=59, Invalid=643, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:26:17,695 INFO ]: Start difference. First operand 117 states and 137 transitions. Second operand 27 states. [2018-06-25 09:26:18,575 WARN ]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-25 09:26:19,049 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:19,049 INFO ]: Finished difference Result 139 states and 161 transitions. [2018-06-25 09:26:19,050 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-25 09:26:19,050 INFO ]: Start accepts. Automaton has 27 states. Word has length 71 [2018-06-25 09:26:19,050 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:19,051 INFO ]: With dead ends: 139 [2018-06-25 09:26:19,051 INFO ]: Without dead ends: 139 [2018-06-25 09:26:19,052 INFO ]: 0 DeclaredPredicates, 135 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=319, Invalid=3713, Unknown=0, NotChecked=0, Total=4032 [2018-06-25 09:26:19,052 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-25 09:26:19,056 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 129. [2018-06-25 09:26:19,056 INFO ]: Start removeUnreachable. Operand 129 states. [2018-06-25 09:26:19,057 INFO ]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2018-06-25 09:26:19,057 INFO ]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 71 [2018-06-25 09:26:19,057 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:19,057 INFO ]: Abstraction has 129 states and 151 transitions. [2018-06-25 09:26:19,057 INFO ]: Interpolant automaton has 27 states. [2018-06-25 09:26:19,057 INFO ]: Start isEmpty. Operand 129 states and 151 transitions. [2018-06-25 09:26:19,058 INFO ]: Finished isEmpty. Found accepting run of length 73 [2018-06-25 09:26:19,058 INFO ]: Found error trace [2018-06-25 09:26:19,058 INFO ]: trace histogram [16, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:19,058 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:19,058 INFO ]: Analyzing trace with hash -130712942, now seen corresponding path program 15 times [2018-06-25 09:26:19,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:19,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:19,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:19,059 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:19,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:19,080 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:19,259 INFO ]: Checked inductivity of 366 backedges. 162 proven. 66 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-06-25 09:26:19,259 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:19,259 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-25 09:26:19,265 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:26:19,319 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-25 09:26:19,319 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:19,322 INFO ]: Computing forward predicates... [2018-06-25 09:26:19,572 INFO ]: Checked inductivity of 366 backedges. 152 proven. 76 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-06-25 09:26:19,591 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:19,591 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-06-25 09:26:19,592 INFO ]: Interpolant automaton has 33 states [2018-06-25 09:26:19,592 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-25 09:26:19,592 INFO ]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:26:19,592 INFO ]: Start difference. First operand 129 states and 151 transitions. Second operand 33 states. [2018-06-25 09:26:21,232 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:21,232 INFO ]: Finished difference Result 181 states and 204 transitions. [2018-06-25 09:26:21,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-06-25 09:26:21,232 INFO ]: Start accepts. Automaton has 33 states. Word has length 72 [2018-06-25 09:26:21,232 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:21,233 INFO ]: With dead ends: 181 [2018-06-25 09:26:21,233 INFO ]: Without dead ends: 167 [2018-06-25 09:26:21,234 INFO ]: 0 DeclaredPredicates, 127 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1459 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=603, Invalid=4367, Unknown=0, NotChecked=0, Total=4970 [2018-06-25 09:26:21,234 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-25 09:26:21,239 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 139. [2018-06-25 09:26:21,239 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-25 09:26:21,240 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 162 transitions. [2018-06-25 09:26:21,240 INFO ]: Start accepts. Automaton has 139 states and 162 transitions. Word has length 72 [2018-06-25 09:26:21,240 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:21,240 INFO ]: Abstraction has 139 states and 162 transitions. [2018-06-25 09:26:21,240 INFO ]: Interpolant automaton has 33 states. [2018-06-25 09:26:21,240 INFO ]: Start isEmpty. Operand 139 states and 162 transitions. [2018-06-25 09:26:21,242 INFO ]: Finished isEmpty. Found accepting run of length 85 [2018-06-25 09:26:21,242 INFO ]: Found error trace [2018-06-25 09:26:21,242 INFO ]: trace histogram [20, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:21,242 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:21,243 INFO ]: Analyzing trace with hash -12665438, now seen corresponding path program 16 times [2018-06-25 09:26:21,243 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:21,243 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:21,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:21,243 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:21,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:21,263 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:22,133 INFO ]: Checked inductivity of 533 backedges. 224 proven. 72 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-06-25 09:26:22,133 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:22,133 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-25 09:26:22,138 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:26:22,214 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:26:22,214 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:22,218 INFO ]: Computing forward predicates... [2018-06-25 09:26:22,661 INFO ]: Checked inductivity of 533 backedges. 233 proven. 63 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-06-25 09:26:22,679 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:22,679 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 28 [2018-06-25 09:26:22,680 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:26:22,680 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:26:22,680 INFO ]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:26:22,680 INFO ]: Start difference. First operand 139 states and 162 transitions. Second operand 28 states. [2018-06-25 09:26:23,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:23,093 INFO ]: Finished difference Result 142 states and 165 transitions. [2018-06-25 09:26:23,093 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 09:26:23,093 INFO ]: Start accepts. Automaton has 28 states. Word has length 84 [2018-06-25 09:26:23,093 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:23,094 INFO ]: With dead ends: 142 [2018-06-25 09:26:23,094 INFO ]: Without dead ends: 142 [2018-06-25 09:26:23,095 INFO ]: 0 DeclaredPredicates, 121 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=418, Invalid=1838, Unknown=0, NotChecked=0, Total=2256 [2018-06-25 09:26:23,095 INFO ]: Start minimizeSevpa. Operand 142 states. [2018-06-25 09:26:23,101 INFO ]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-06-25 09:26:23,101 INFO ]: Start removeUnreachable. Operand 142 states. [2018-06-25 09:26:23,103 INFO ]: Finished removeUnreachable. Reduced from 142 states to 142 states and 165 transitions. [2018-06-25 09:26:23,103 INFO ]: Start accepts. Automaton has 142 states and 165 transitions. Word has length 84 [2018-06-25 09:26:23,103 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:23,103 INFO ]: Abstraction has 142 states and 165 transitions. [2018-06-25 09:26:23,103 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:26:23,103 INFO ]: Start isEmpty. Operand 142 states and 165 transitions. [2018-06-25 09:26:23,104 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-25 09:26:23,104 INFO ]: Found error trace [2018-06-25 09:26:23,104 INFO ]: trace histogram [21, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:23,104 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:23,104 INFO ]: Analyzing trace with hash -392012297, now seen corresponding path program 17 times [2018-06-25 09:26:23,104 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:23,104 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:23,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:23,105 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:23,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:23,128 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:23,403 INFO ]: Checked inductivity of 560 backedges. 14 proven. 419 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-06-25 09:26:23,404 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:23,404 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-25 09:26:23,409 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:26:23,491 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-25 09:26:23,492 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:23,497 INFO ]: Computing forward predicates... [2018-06-25 09:26:23,779 INFO ]: Checked inductivity of 560 backedges. 14 proven. 419 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-06-25 09:26:23,798 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:23,798 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2018-06-25 09:26:23,798 INFO ]: Interpolant automaton has 30 states [2018-06-25 09:26:23,798 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-25 09:26:23,798 INFO ]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:26:23,799 INFO ]: Start difference. First operand 142 states and 165 transitions. Second operand 30 states. [2018-06-25 09:26:25,394 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:25,394 INFO ]: Finished difference Result 167 states and 192 transitions. [2018-06-25 09:26:25,395 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-25 09:26:25,395 INFO ]: Start accepts. Automaton has 30 states. Word has length 85 [2018-06-25 09:26:25,395 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:25,396 INFO ]: With dead ends: 167 [2018-06-25 09:26:25,396 INFO ]: Without dead ends: 167 [2018-06-25 09:26:25,397 INFO ]: 0 DeclaredPredicates, 158 GetRequests, 81 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=370, Invalid=4742, Unknown=0, NotChecked=0, Total=5112 [2018-06-25 09:26:25,397 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-25 09:26:25,402 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 155. [2018-06-25 09:26:25,402 INFO ]: Start removeUnreachable. Operand 155 states. [2018-06-25 09:26:25,403 INFO ]: Finished removeUnreachable. Reduced from 155 states to 155 states and 180 transitions. [2018-06-25 09:26:25,404 INFO ]: Start accepts. Automaton has 155 states and 180 transitions. Word has length 85 [2018-06-25 09:26:25,404 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:25,404 INFO ]: Abstraction has 155 states and 180 transitions. [2018-06-25 09:26:25,404 INFO ]: Interpolant automaton has 30 states. [2018-06-25 09:26:25,404 INFO ]: Start isEmpty. Operand 155 states and 180 transitions. [2018-06-25 09:26:25,405 INFO ]: Finished isEmpty. Found accepting run of length 87 [2018-06-25 09:26:25,405 INFO ]: Found error trace [2018-06-25 09:26:25,405 INFO ]: trace histogram [22, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:25,405 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:25,405 INFO ]: Analyzing trace with hash 733136962, now seen corresponding path program 18 times [2018-06-25 09:26:25,405 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:25,405 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:25,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:25,406 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:25,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:25,425 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:25,893 INFO ]: Checked inductivity of 588 backedges. 263 proven. 88 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-06-25 09:26:25,893 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:25,893 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-25 09:26:25,898 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:26:25,967 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-25 09:26:25,967 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:25,970 INFO ]: Computing forward predicates... [2018-06-25 09:26:26,140 INFO ]: Checked inductivity of 588 backedges. 276 proven. 75 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-06-25 09:26:26,159 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:26,159 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2018-06-25 09:26:26,159 INFO ]: Interpolant automaton has 30 states [2018-06-25 09:26:26,159 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-25 09:26:26,159 INFO ]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:26:26,159 INFO ]: Start difference. First operand 155 states and 180 transitions. Second operand 30 states. [2018-06-25 09:26:26,773 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:26,773 INFO ]: Finished difference Result 225 states and 256 transitions. [2018-06-25 09:26:26,774 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-25 09:26:26,774 INFO ]: Start accepts. Automaton has 30 states. Word has length 86 [2018-06-25 09:26:26,774 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:26,775 INFO ]: With dead ends: 225 [2018-06-25 09:26:26,775 INFO ]: Without dead ends: 206 [2018-06-25 09:26:26,777 INFO ]: 0 DeclaredPredicates, 137 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=718, Invalid=3064, Unknown=0, NotChecked=0, Total=3782 [2018-06-25 09:26:26,777 INFO ]: Start minimizeSevpa. Operand 206 states. [2018-06-25 09:26:26,784 INFO ]: Finished minimizeSevpa. Reduced states from 206 to 166. [2018-06-25 09:26:26,784 INFO ]: Start removeUnreachable. Operand 166 states. [2018-06-25 09:26:26,785 INFO ]: Finished removeUnreachable. Reduced from 166 states to 166 states and 192 transitions. [2018-06-25 09:26:26,785 INFO ]: Start accepts. Automaton has 166 states and 192 transitions. Word has length 86 [2018-06-25 09:26:26,785 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:26,785 INFO ]: Abstraction has 166 states and 192 transitions. [2018-06-25 09:26:26,785 INFO ]: Interpolant automaton has 30 states. [2018-06-25 09:26:26,785 INFO ]: Start isEmpty. Operand 166 states and 192 transitions. [2018-06-25 09:26:26,786 INFO ]: Finished isEmpty. Found accepting run of length 100 [2018-06-25 09:26:26,786 INFO ]: Found error trace [2018-06-25 09:26:26,787 INFO ]: trace histogram [27, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:26,788 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:26,788 INFO ]: Analyzing trace with hash 1513417863, now seen corresponding path program 19 times [2018-06-25 09:26:26,788 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:26,788 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:26,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:26,788 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:26,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:26,808 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:27,162 INFO ]: Checked inductivity of 831 backedges. 348 proven. 95 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-06-25 09:26:27,163 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:27,163 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-25 09:26:27,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:27,243 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:27,247 INFO ]: Computing forward predicates... [2018-06-25 09:26:27,582 INFO ]: Checked inductivity of 831 backedges. 359 proven. 84 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-06-25 09:26:27,601 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:27,601 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2018-06-25 09:26:27,601 INFO ]: Interpolant automaton has 31 states [2018-06-25 09:26:27,601 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-25 09:26:27,601 INFO ]: CoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:26:27,601 INFO ]: Start difference. First operand 166 states and 192 transitions. Second operand 31 states. [2018-06-25 09:26:28,004 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:28,004 INFO ]: Finished difference Result 169 states and 195 transitions. [2018-06-25 09:26:28,004 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 09:26:28,004 INFO ]: Start accepts. Automaton has 31 states. Word has length 99 [2018-06-25 09:26:28,005 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:28,005 INFO ]: With dead ends: 169 [2018-06-25 09:26:28,005 INFO ]: Without dead ends: 169 [2018-06-25 09:26:28,006 INFO ]: 0 DeclaredPredicates, 141 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=536, Invalid=2326, Unknown=0, NotChecked=0, Total=2862 [2018-06-25 09:26:28,006 INFO ]: Start minimizeSevpa. Operand 169 states. [2018-06-25 09:26:28,014 INFO ]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-06-25 09:26:28,014 INFO ]: Start removeUnreachable. Operand 169 states. [2018-06-25 09:26:28,015 INFO ]: Finished removeUnreachable. Reduced from 169 states to 169 states and 195 transitions. [2018-06-25 09:26:28,015 INFO ]: Start accepts. Automaton has 169 states and 195 transitions. Word has length 99 [2018-06-25 09:26:28,015 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:28,015 INFO ]: Abstraction has 169 states and 195 transitions. [2018-06-25 09:26:28,015 INFO ]: Interpolant automaton has 31 states. [2018-06-25 09:26:28,015 INFO ]: Start isEmpty. Operand 169 states and 195 transitions. [2018-06-25 09:26:28,016 INFO ]: Finished isEmpty. Found accepting run of length 101 [2018-06-25 09:26:28,016 INFO ]: Found error trace [2018-06-25 09:26:28,016 INFO ]: trace histogram [28, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:28,016 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:28,017 INFO ]: Analyzing trace with hash -328070222, now seen corresponding path program 20 times [2018-06-25 09:26:28,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:28,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:28,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:28,017 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:28,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:28,044 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:28,730 INFO ]: Checked inductivity of 866 backedges. 16 proven. 673 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-06-25 09:26:28,730 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:28,730 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:26:28,736 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:26:28,806 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:26:28,806 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:28,810 INFO ]: Computing forward predicates... [2018-06-25 09:26:29,109 INFO ]: Checked inductivity of 866 backedges. 16 proven. 673 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-06-25 09:26:29,128 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:29,128 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2018-06-25 09:26:29,128 INFO ]: Interpolant automaton has 33 states [2018-06-25 09:26:29,128 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-25 09:26:29,129 INFO ]: CoverageRelationStatistics Valid=73, Invalid=983, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:26:29,129 INFO ]: Start difference. First operand 169 states and 195 transitions. Second operand 33 states. [2018-06-25 09:26:30,934 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:30,934 INFO ]: Finished difference Result 197 states and 225 transitions. [2018-06-25 09:26:30,934 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-25 09:26:30,934 INFO ]: Start accepts. Automaton has 33 states. Word has length 100 [2018-06-25 09:26:30,935 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:30,935 INFO ]: With dead ends: 197 [2018-06-25 09:26:30,935 INFO ]: Without dead ends: 197 [2018-06-25 09:26:30,937 INFO ]: 0 DeclaredPredicates, 182 GetRequests, 96 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=423, Invalid=5897, Unknown=0, NotChecked=0, Total=6320 [2018-06-25 09:26:30,937 INFO ]: Start minimizeSevpa. Operand 197 states. [2018-06-25 09:26:30,946 INFO ]: Finished minimizeSevpa. Reduced states from 197 to 183. [2018-06-25 09:26:30,946 INFO ]: Start removeUnreachable. Operand 183 states. [2018-06-25 09:26:30,948 INFO ]: Finished removeUnreachable. Reduced from 183 states to 183 states and 211 transitions. [2018-06-25 09:26:30,948 INFO ]: Start accepts. Automaton has 183 states and 211 transitions. Word has length 100 [2018-06-25 09:26:30,948 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:30,948 INFO ]: Abstraction has 183 states and 211 transitions. [2018-06-25 09:26:30,948 INFO ]: Interpolant automaton has 33 states. [2018-06-25 09:26:30,948 INFO ]: Start isEmpty. Operand 183 states and 211 transitions. [2018-06-25 09:26:30,951 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-25 09:26:30,951 INFO ]: Found error trace [2018-06-25 09:26:30,951 INFO ]: trace histogram [29, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:30,951 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:30,951 INFO ]: Analyzing trace with hash -1579626009, now seen corresponding path program 21 times [2018-06-25 09:26:30,952 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:30,952 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:30,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:30,952 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:30,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:30,973 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:31,506 INFO ]: Checked inductivity of 902 backedges. 401 proven. 113 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-06-25 09:26:31,506 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:31,506 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-25 09:26:31,512 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:26:31,584 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-25 09:26:31,585 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:31,588 INFO ]: Computing forward predicates... [2018-06-25 09:26:31,773 INFO ]: Checked inductivity of 902 backedges. 416 proven. 98 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-06-25 09:26:31,792 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:31,792 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 33 [2018-06-25 09:26:31,792 INFO ]: Interpolant automaton has 33 states [2018-06-25 09:26:31,792 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-25 09:26:31,793 INFO ]: CoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:26:31,793 INFO ]: Start difference. First operand 183 states and 211 transitions. Second operand 33 states. [2018-06-25 09:26:32,532 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:32,532 INFO ]: Finished difference Result 270 states and 304 transitions. [2018-06-25 09:26:32,536 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-25 09:26:32,536 INFO ]: Start accepts. Automaton has 33 states. Word has length 101 [2018-06-25 09:26:32,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:32,537 INFO ]: With dead ends: 270 [2018-06-25 09:26:32,537 INFO ]: Without dead ends: 249 [2018-06-25 09:26:32,538 INFO ]: 0 DeclaredPredicates, 158 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=901, Invalid=3791, Unknown=0, NotChecked=0, Total=4692 [2018-06-25 09:26:32,538 INFO ]: Start minimizeSevpa. Operand 249 states. [2018-06-25 09:26:32,545 INFO ]: Finished minimizeSevpa. Reduced states from 249 to 195. [2018-06-25 09:26:32,545 INFO ]: Start removeUnreachable. Operand 195 states. [2018-06-25 09:26:32,546 INFO ]: Finished removeUnreachable. Reduced from 195 states to 195 states and 224 transitions. [2018-06-25 09:26:32,546 INFO ]: Start accepts. Automaton has 195 states and 224 transitions. Word has length 101 [2018-06-25 09:26:32,546 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:32,546 INFO ]: Abstraction has 195 states and 224 transitions. [2018-06-25 09:26:32,546 INFO ]: Interpolant automaton has 33 states. [2018-06-25 09:26:32,546 INFO ]: Start isEmpty. Operand 195 states and 224 transitions. [2018-06-25 09:26:32,548 INFO ]: Finished isEmpty. Found accepting run of length 116 [2018-06-25 09:26:32,548 INFO ]: Found error trace [2018-06-25 09:26:32,548 INFO ]: trace histogram [35, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:32,548 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:32,548 INFO ]: Analyzing trace with hash 491622617, now seen corresponding path program 22 times [2018-06-25 09:26:32,548 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:32,548 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:32,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:32,549 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:32,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:32,577 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:33,209 INFO ]: Checked inductivity of 1243 backedges. 513 proven. 121 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-06-25 09:26:33,209 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:33,209 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-25 09:26:33,215 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:26:33,293 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:26:33,293 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:33,297 INFO ]: Computing forward predicates... [2018-06-25 09:26:33,524 INFO ]: Checked inductivity of 1243 backedges. 526 proven. 108 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-06-25 09:26:33,543 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:33,543 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2018-06-25 09:26:33,543 INFO ]: Interpolant automaton has 34 states [2018-06-25 09:26:33,544 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-25 09:26:33,544 INFO ]: CoverageRelationStatistics Valid=183, Invalid=939, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:26:33,544 INFO ]: Start difference. First operand 195 states and 224 transitions. Second operand 34 states. [2018-06-25 09:26:34,062 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:34,062 INFO ]: Finished difference Result 198 states and 227 transitions. [2018-06-25 09:26:34,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-25 09:26:34,067 INFO ]: Start accepts. Automaton has 34 states. Word has length 115 [2018-06-25 09:26:34,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:34,068 INFO ]: With dead ends: 198 [2018-06-25 09:26:34,068 INFO ]: Without dead ends: 198 [2018-06-25 09:26:34,069 INFO ]: 0 DeclaredPredicates, 162 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=670, Invalid=2870, Unknown=0, NotChecked=0, Total=3540 [2018-06-25 09:26:34,069 INFO ]: Start minimizeSevpa. Operand 198 states. [2018-06-25 09:26:34,077 INFO ]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-06-25 09:26:34,077 INFO ]: Start removeUnreachable. Operand 198 states. [2018-06-25 09:26:34,078 INFO ]: Finished removeUnreachable. Reduced from 198 states to 198 states and 227 transitions. [2018-06-25 09:26:34,079 INFO ]: Start accepts. Automaton has 198 states and 227 transitions. Word has length 115 [2018-06-25 09:26:34,079 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:34,079 INFO ]: Abstraction has 198 states and 227 transitions. [2018-06-25 09:26:34,079 INFO ]: Interpolant automaton has 34 states. [2018-06-25 09:26:34,079 INFO ]: Start isEmpty. Operand 198 states and 227 transitions. [2018-06-25 09:26:34,080 INFO ]: Finished isEmpty. Found accepting run of length 117 [2018-06-25 09:26:34,080 INFO ]: Found error trace [2018-06-25 09:26:34,080 INFO ]: trace histogram [36, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:34,080 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:34,080 INFO ]: Analyzing trace with hash -1938951776, now seen corresponding path program 23 times [2018-06-25 09:26:34,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:34,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:34,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:34,081 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:34,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:34,110 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:34,496 INFO ]: Checked inductivity of 1287 backedges. 18 proven. 1031 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-06-25 09:26:34,496 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:34,496 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-25 09:26:34,501 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:26:34,601 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-25 09:26:34,601 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:34,606 INFO ]: Computing forward predicates... [2018-06-25 09:26:35,396 INFO ]: Checked inductivity of 1287 backedges. 18 proven. 1031 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-06-25 09:26:35,415 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:35,415 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2018-06-25 09:26:35,416 INFO ]: Interpolant automaton has 36 states [2018-06-25 09:26:35,416 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 09:26:35,416 INFO ]: CoverageRelationStatistics Valid=80, Invalid=1180, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:26:35,416 INFO ]: Start difference. First operand 198 states and 227 transitions. Second operand 36 states. [2018-06-25 09:26:37,009 WARN ]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-06-25 09:26:38,141 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:38,141 INFO ]: Finished difference Result 229 states and 260 transitions. [2018-06-25 09:26:38,142 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-06-25 09:26:38,142 INFO ]: Start accepts. Automaton has 36 states. Word has length 116 [2018-06-25 09:26:38,142 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:38,143 INFO ]: With dead ends: 229 [2018-06-25 09:26:38,143 INFO ]: Without dead ends: 229 [2018-06-25 09:26:38,143 INFO ]: 0 DeclaredPredicates, 207 GetRequests, 112 SyntacticMatches, 9 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1809 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=478, Invalid=7178, Unknown=0, NotChecked=0, Total=7656 [2018-06-25 09:26:38,144 INFO ]: Start minimizeSevpa. Operand 229 states. [2018-06-25 09:26:38,148 INFO ]: Finished minimizeSevpa. Reduced states from 229 to 213. [2018-06-25 09:26:38,148 INFO ]: Start removeUnreachable. Operand 213 states. [2018-06-25 09:26:38,148 INFO ]: Finished removeUnreachable. Reduced from 213 states to 213 states and 244 transitions. [2018-06-25 09:26:38,149 INFO ]: Start accepts. Automaton has 213 states and 244 transitions. Word has length 116 [2018-06-25 09:26:38,149 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:38,149 INFO ]: Abstraction has 213 states and 244 transitions. [2018-06-25 09:26:38,149 INFO ]: Interpolant automaton has 36 states. [2018-06-25 09:26:38,149 INFO ]: Start isEmpty. Operand 213 states and 244 transitions. [2018-06-25 09:26:38,150 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-25 09:26:38,150 INFO ]: Found error trace [2018-06-25 09:26:38,150 INFO ]: trace histogram [37, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:38,150 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:38,150 INFO ]: Analyzing trace with hash 22653369, now seen corresponding path program 24 times [2018-06-25 09:26:38,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:38,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:38,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:38,151 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:38,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:38,174 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:38,919 INFO ]: Checked inductivity of 1332 backedges. 582 proven. 141 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-06-25 09:26:38,919 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:38,919 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-25 09:26:38,926 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:26:39,023 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-25 09:26:39,023 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:39,029 INFO ]: Computing forward predicates... [2018-06-25 09:26:39,545 INFO ]: Checked inductivity of 1332 backedges. 554 proven. 169 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-06-25 09:26:39,565 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:39,565 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2018-06-25 09:26:39,565 INFO ]: Interpolant automaton has 45 states [2018-06-25 09:26:39,565 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-25 09:26:39,565 INFO ]: CoverageRelationStatistics Valid=254, Invalid=1726, Unknown=0, NotChecked=0, Total=1980 [2018-06-25 09:26:39,565 INFO ]: Start difference. First operand 213 states and 244 transitions. Second operand 45 states. [2018-06-25 09:26:40,823 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 09:26:41,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:41,697 INFO ]: Finished difference Result 316 states and 348 transitions. [2018-06-25 09:26:41,697 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-06-25 09:26:41,697 INFO ]: Start accepts. Automaton has 45 states. Word has length 117 [2018-06-25 09:26:41,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:41,699 INFO ]: With dead ends: 316 [2018-06-25 09:26:41,699 INFO ]: Without dead ends: 296 [2018-06-25 09:26:41,700 INFO ]: 0 DeclaredPredicates, 196 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3169 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1134, Invalid=8966, Unknown=0, NotChecked=0, Total=10100 [2018-06-25 09:26:41,700 INFO ]: Start minimizeSevpa. Operand 296 states. [2018-06-25 09:26:41,709 INFO ]: Finished minimizeSevpa. Reduced states from 296 to 226. [2018-06-25 09:26:41,709 INFO ]: Start removeUnreachable. Operand 226 states. [2018-06-25 09:26:41,711 INFO ]: Finished removeUnreachable. Reduced from 226 states to 226 states and 258 transitions. [2018-06-25 09:26:41,711 INFO ]: Start accepts. Automaton has 226 states and 258 transitions. Word has length 117 [2018-06-25 09:26:41,711 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:41,711 INFO ]: Abstraction has 226 states and 258 transitions. [2018-06-25 09:26:41,711 INFO ]: Interpolant automaton has 45 states. [2018-06-25 09:26:41,711 INFO ]: Start isEmpty. Operand 226 states and 258 transitions. [2018-06-25 09:26:41,712 INFO ]: Finished isEmpty. Found accepting run of length 133 [2018-06-25 09:26:41,712 INFO ]: Found error trace [2018-06-25 09:26:41,712 INFO ]: trace histogram [44, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:41,712 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:41,712 INFO ]: Analyzing trace with hash 2009080974, now seen corresponding path program 25 times [2018-06-25 09:26:41,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:41,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:41,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:41,713 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:41,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:41,745 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:42,123 INFO ]: Checked inductivity of 1796 backedges. 725 proven. 150 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2018-06-25 09:26:42,123 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:42,123 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-25 09:26:42,130 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:42,257 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:42,264 INFO ]: Computing forward predicates... [2018-06-25 09:26:42,575 INFO ]: Checked inductivity of 1796 backedges. 740 proven. 135 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2018-06-25 09:26:42,595 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:42,595 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 37 [2018-06-25 09:26:42,654 INFO ]: Interpolant automaton has 37 states [2018-06-25 09:26:42,654 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-25 09:26:42,654 INFO ]: CoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:26:42,655 INFO ]: Start difference. First operand 226 states and 258 transitions. Second operand 37 states. [2018-06-25 09:26:43,237 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:43,237 INFO ]: Finished difference Result 229 states and 261 transitions. [2018-06-25 09:26:43,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-25 09:26:43,238 INFO ]: Start accepts. Automaton has 37 states. Word has length 132 [2018-06-25 09:26:43,238 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:43,239 INFO ]: With dead ends: 229 [2018-06-25 09:26:43,239 INFO ]: Without dead ends: 229 [2018-06-25 09:26:43,239 INFO ]: 0 DeclaredPredicates, 184 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=820, Invalid=3470, Unknown=0, NotChecked=0, Total=4290 [2018-06-25 09:26:43,239 INFO ]: Start minimizeSevpa. Operand 229 states. [2018-06-25 09:26:43,248 INFO ]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-06-25 09:26:43,248 INFO ]: Start removeUnreachable. Operand 229 states. [2018-06-25 09:26:43,249 INFO ]: Finished removeUnreachable. Reduced from 229 states to 229 states and 261 transitions. [2018-06-25 09:26:43,249 INFO ]: Start accepts. Automaton has 229 states and 261 transitions. Word has length 132 [2018-06-25 09:26:43,250 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:43,250 INFO ]: Abstraction has 229 states and 261 transitions. [2018-06-25 09:26:43,250 INFO ]: Interpolant automaton has 37 states. [2018-06-25 09:26:43,250 INFO ]: Start isEmpty. Operand 229 states and 261 transitions. [2018-06-25 09:26:43,251 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-25 09:26:43,251 INFO ]: Found error trace [2018-06-25 09:26:43,251 INFO ]: trace histogram [45, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:43,251 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:43,251 INFO ]: Analyzing trace with hash -2142382965, now seen corresponding path program 26 times [2018-06-25 09:26:43,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:43,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:43,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:43,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:26:43,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:43,284 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:44,143 INFO ]: Checked inductivity of 1850 backedges. 20 proven. 1519 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-06-25 09:26:44,143 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:44,143 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-25 09:26:44,150 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:26:44,270 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:26:44,270 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:44,278 INFO ]: Computing forward predicates... [2018-06-25 09:26:45,974 INFO ]: Checked inductivity of 1850 backedges. 20 proven. 1519 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-06-25 09:26:45,993 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:45,993 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 39 [2018-06-25 09:26:45,993 INFO ]: Interpolant automaton has 39 states [2018-06-25 09:26:45,994 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-25 09:26:45,994 INFO ]: CoverageRelationStatistics Valid=87, Invalid=1395, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:26:45,994 INFO ]: Start difference. First operand 229 states and 261 transitions. Second operand 39 states. [2018-06-25 09:26:48,301 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:48,301 INFO ]: Finished difference Result 263 states and 297 transitions. [2018-06-25 09:26:48,302 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-06-25 09:26:48,302 INFO ]: Start accepts. Automaton has 39 states. Word has length 133 [2018-06-25 09:26:48,302 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:48,302 INFO ]: With dead ends: 263 [2018-06-25 09:26:48,302 INFO ]: Without dead ends: 263 [2018-06-25 09:26:48,303 INFO ]: 0 DeclaredPredicates, 233 GetRequests, 129 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2177 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=535, Invalid=8585, Unknown=0, NotChecked=0, Total=9120 [2018-06-25 09:26:48,304 INFO ]: Start minimizeSevpa. Operand 263 states. [2018-06-25 09:26:48,311 INFO ]: Finished minimizeSevpa. Reduced states from 263 to 245. [2018-06-25 09:26:48,311 INFO ]: Start removeUnreachable. Operand 245 states. [2018-06-25 09:26:48,312 INFO ]: Finished removeUnreachable. Reduced from 245 states to 245 states and 279 transitions. [2018-06-25 09:26:48,312 INFO ]: Start accepts. Automaton has 245 states and 279 transitions. Word has length 133 [2018-06-25 09:26:48,312 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:48,312 INFO ]: Abstraction has 245 states and 279 transitions. [2018-06-25 09:26:48,312 INFO ]: Interpolant automaton has 39 states. [2018-06-25 09:26:48,312 INFO ]: Start isEmpty. Operand 245 states and 279 transitions. [2018-06-25 09:26:48,313 INFO ]: Finished isEmpty. Found accepting run of length 135 [2018-06-25 09:26:48,313 INFO ]: Found error trace [2018-06-25 09:26:48,314 INFO ]: trace histogram [46, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:48,314 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:48,314 INFO ]: Analyzing trace with hash -1988746194, now seen corresponding path program 27 times [2018-06-25 09:26:48,314 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:48,314 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:48,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:48,314 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:48,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:48,340 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:49,074 INFO ]: Checked inductivity of 1905 backedges. 812 proven. 172 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2018-06-25 09:26:49,074 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:49,074 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-25 09:26:49,079 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:26:49,163 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-25 09:26:49,164 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:49,169 INFO ]: Computing forward predicates... [2018-06-25 09:26:49,593 INFO ]: Checked inductivity of 1905 backedges. 776 proven. 208 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2018-06-25 09:26:49,628 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:49,628 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2018-06-25 09:26:49,628 INFO ]: Interpolant automaton has 49 states [2018-06-25 09:26:49,628 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-25 09:26:49,628 INFO ]: CoverageRelationStatistics Valid=300, Invalid=2052, Unknown=0, NotChecked=0, Total=2352 [2018-06-25 09:26:49,629 INFO ]: Start difference. First operand 245 states and 279 transitions. Second operand 49 states. [2018-06-25 09:26:51,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:51,033 INFO ]: Finished difference Result 369 states and 404 transitions. [2018-06-25 09:26:51,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-06-25 09:26:51,033 INFO ]: Start accepts. Automaton has 49 states. Word has length 134 [2018-06-25 09:26:51,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:51,035 INFO ]: With dead ends: 369 [2018-06-25 09:26:51,035 INFO ]: Without dead ends: 347 [2018-06-25 09:26:51,036 INFO ]: 0 DeclaredPredicates, 221 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1347, Invalid=10863, Unknown=0, NotChecked=0, Total=12210 [2018-06-25 09:26:51,036 INFO ]: Start minimizeSevpa. Operand 347 states. [2018-06-25 09:26:51,044 INFO ]: Finished minimizeSevpa. Reduced states from 347 to 259. [2018-06-25 09:26:51,044 INFO ]: Start removeUnreachable. Operand 259 states. [2018-06-25 09:26:51,045 INFO ]: Finished removeUnreachable. Reduced from 259 states to 259 states and 294 transitions. [2018-06-25 09:26:51,045 INFO ]: Start accepts. Automaton has 259 states and 294 transitions. Word has length 134 [2018-06-25 09:26:51,045 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:51,046 INFO ]: Abstraction has 259 states and 294 transitions. [2018-06-25 09:26:51,046 INFO ]: Interpolant automaton has 49 states. [2018-06-25 09:26:51,046 INFO ]: Start isEmpty. Operand 259 states and 294 transitions. [2018-06-25 09:26:51,047 INFO ]: Finished isEmpty. Found accepting run of length 151 [2018-06-25 09:26:51,047 INFO ]: Found error trace [2018-06-25 09:26:51,047 INFO ]: trace histogram [54, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:51,047 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:51,047 INFO ]: Analyzing trace with hash -284200386, now seen corresponding path program 28 times [2018-06-25 09:26:51,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:51,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:51,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:51,047 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:51,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:51,076 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:51,429 INFO ]: Checked inductivity of 2520 backedges. 990 proven. 182 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2018-06-25 09:26:51,429 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:26:51,429 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-25 09:26:51,434 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:26:51,549 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:26:51,549 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:26:51,554 INFO ]: Computing forward predicates... [2018-06-25 09:26:51,889 INFO ]: Checked inductivity of 2520 backedges. 1007 proven. 165 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2018-06-25 09:26:51,909 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:26:51,909 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 40 [2018-06-25 09:26:51,909 INFO ]: Interpolant automaton has 40 states [2018-06-25 09:26:51,910 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-25 09:26:51,910 INFO ]: CoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:26:51,910 INFO ]: Start difference. First operand 259 states and 294 transitions. Second operand 40 states. [2018-06-25 09:26:52,536 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:26:52,537 INFO ]: Finished difference Result 262 states and 297 transitions. [2018-06-25 09:26:52,537 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-25 09:26:52,537 INFO ]: Start accepts. Automaton has 40 states. Word has length 150 [2018-06-25 09:26:52,537 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:26:52,538 INFO ]: With dead ends: 262 [2018-06-25 09:26:52,538 INFO ]: Without dead ends: 262 [2018-06-25 09:26:52,538 INFO ]: 0 DeclaredPredicates, 207 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=986, Invalid=4126, Unknown=0, NotChecked=0, Total=5112 [2018-06-25 09:26:52,538 INFO ]: Start minimizeSevpa. Operand 262 states. [2018-06-25 09:26:52,544 INFO ]: Finished minimizeSevpa. Reduced states from 262 to 262. [2018-06-25 09:26:52,544 INFO ]: Start removeUnreachable. Operand 262 states. [2018-06-25 09:26:52,545 INFO ]: Finished removeUnreachable. Reduced from 262 states to 262 states and 297 transitions. [2018-06-25 09:26:52,545 INFO ]: Start accepts. Automaton has 262 states and 297 transitions. Word has length 150 [2018-06-25 09:26:52,546 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:26:52,546 INFO ]: Abstraction has 262 states and 297 transitions. [2018-06-25 09:26:52,546 INFO ]: Interpolant automaton has 40 states. [2018-06-25 09:26:52,546 INFO ]: Start isEmpty. Operand 262 states and 297 transitions. [2018-06-25 09:26:52,547 INFO ]: Finished isEmpty. Found accepting run of length 152 [2018-06-25 09:26:52,547 INFO ]: Found error trace [2018-06-25 09:26:52,547 INFO ]: trace histogram [55, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-06-25 09:26:52,547 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:26:52,547 INFO ]: Analyzing trace with hash -219661093, now seen corresponding path program 29 times [2018-06-25 09:26:52,547 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:26:52,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:26:52,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:52,548 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:26:52,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:26:52,583 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-25 09:26:52,869 WARN ]: Removed 3 from assertion stack [2018-06-25 09:26:52,870 WARN ]: Verification canceled [2018-06-25 09:26:52,875 WARN ]: Timeout [2018-06-25 09:26:52,875 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:26:52 BoogieIcfgContainer [2018-06-25 09:26:52,875 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:26:52,876 INFO ]: Toolchain (without parser) took 56432.48 ms. Allocated memory was 302.5 MB in the beginning and 851.4 MB in the end (delta: 548.9 MB). Free memory was 259.0 MB in the beginning and 503.5 MB in the end (delta: -244.5 MB). Peak memory consumption was 304.5 MB. Max. memory is 3.6 GB. [2018-06-25 09:26:52,876 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 302.5 MB. Free memory is still 267.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:26:52,876 INFO ]: ChcToBoogie took 59.23 ms. Allocated memory is still 302.5 MB. Free memory was 257.0 MB in the beginning and 255.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:26:52,879 INFO ]: Boogie Preprocessor took 35.92 ms. Allocated memory is still 302.5 MB. Free memory is still 255.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:26:52,879 INFO ]: RCFGBuilder took 319.90 ms. Allocated memory is still 302.5 MB. Free memory was 255.0 MB in the beginning and 245.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:26:52,879 INFO ]: TraceAbstraction took 56005.10 ms. Allocated memory was 302.5 MB in the beginning and 851.4 MB in the end (delta: 548.9 MB). Free memory was 245.1 MB in the beginning and 503.5 MB in the end (delta: -258.4 MB). Peak memory consumption was 290.5 MB. Max. memory is 3.6 GB. [2018-06-25 09:26:52,881 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 302.5 MB. Free memory is still 267.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.23 ms. Allocated memory is still 302.5 MB. Free memory was 257.0 MB in the beginning and 255.0 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 302.5 MB. Free memory is still 255.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 319.90 ms. Allocated memory is still 302.5 MB. Free memory was 255.0 MB in the beginning and 245.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56005.10 ms. Allocated memory was 302.5 MB in the beginning and 851.4 MB in the end (delta: 548.9 MB). Free memory was 245.1 MB in the beginning and 503.5 MB in the end (delta: -258.4 MB). Peak memory consumption was 290.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 152 with TraceHistMax 55, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 5. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. TIMEOUT Result, 55.9s OverallTime, 39 OverallIterations, 55 TraceHistogramMax, 28.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 810 SDtfs, 2148 SDslu, 7731 SDs, 0 SdLazy, 18835 SolverSat, 1919 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3849 GetRequests, 2067 SyntacticMatches, 56 SemanticMatches, 1726 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26610 ImplicationChecksByTransitivity, 35.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=38, 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, 38 MinimizatonAttempts, 479 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 4637 NumberOfCodeBlocks, 4576 NumberOfCodeBlocksAsserted, 163 NumberOfCheckSat, 4565 ConstructedInterpolants, 0 QuantifiedInterpolants, 1271626 SizeOfPredicates, 280 NumberOfNonLiveVariables, 14887 ConjunctsInSsa, 1721 ConjunctsInUnsatCore, 72 InterpolantComputations, 6 PerfectInterpolantSequences, 25887/36990 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_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-26-52-893.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-rev_append.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-26-52-893.csv Completed graceful shutdown