java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:21:23,120 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:21:23,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:21:23,138 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:21:23,138 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:21:23,140 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:21:23,143 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:21:23,145 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:21:23,147 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:21:23,149 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:21:23,149 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:21:23,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:21:23,151 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:21:23,152 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:21:23,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:21:23,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:21:23,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:21:23,167 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:21:23,168 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:21:23,169 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:21:23,172 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:21:23,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:21:23,175 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:21:23,175 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:21:23,179 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:21:23,180 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:21:23,180 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:21:23,181 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:21:23,186 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:21:23,186 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:21:23,187 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:21:23,187 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:21:23,188 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:21:23,188 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:21:23,190 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:21:23,190 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:21:23,214 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:21:23,214 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:21:23,214 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:21:23,214 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:21:23,215 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:21:23,216 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:21:23,216 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:21:23,216 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:21:23,216 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:21:23,216 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:21:23,217 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:21:23,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:21:23,220 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:21:23,220 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:21:23,220 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:21:23,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:21:23,220 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:21:23,222 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:21:23,222 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:21:23,276 INFO ]: Repository-Root is: /tmp [2018-06-22 01:21:23,293 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:21:23,297 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:21:23,298 INFO ]: Initializing SmtParser... [2018-06-22 01:21:23,299 INFO ]: SmtParser initialized [2018-06-22 01:21:23,299 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 [2018-06-22 01:21:23,301 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:21:23,382 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 unknown [2018-06-22 01:21:23,574 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 [2018-06-22 01:21:23,579 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:21:23,587 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:21:23,588 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:21:23,588 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:21:23,588 INFO ]: ChcToBoogie initialized [2018-06-22 01:21:23,591 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:21:23" (1/1) ... [2018-06-22 01:21:23,664 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:23 Unit [2018-06-22 01:21:23,664 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:21:23,665 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:21:23,665 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:21:23,665 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:21:23,684 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:23" (1/1) ... [2018-06-22 01:21:23,684 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:23" (1/1) ... [2018-06-22 01:21:23,691 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:23" (1/1) ... [2018-06-22 01:21:23,691 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:23" (1/1) ... [2018-06-22 01:21:23,703 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:23" (1/1) ... [2018-06-22 01:21:23,705 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:23" (1/1) ... [2018-06-22 01:21:23,706 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:23" (1/1) ... [2018-06-22 01:21:23,708 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:21:23,708 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:21:23,708 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:21:23,708 INFO ]: RCFGBuilder initialized [2018-06-22 01:21:23,709 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:23" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:21:23,735 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:21:23,735 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:21:23,735 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:21:23,735 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:21:23,735 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:21:23,735 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:21:24,107 INFO ]: Using library mode [2018-06-22 01:21:24,112 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:21:24 BoogieIcfgContainer [2018-06-22 01:21:24,112 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:21:24,113 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:21:24,113 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:21:24,120 INFO ]: TraceAbstraction initialized [2018-06-22 01:21:24,120 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:21:23" (1/3) ... [2018-06-22 01:21:24,121 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8e1358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:21:24, skipping insertion in model container [2018-06-22 01:21:24,121 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:23" (2/3) ... [2018-06-22 01:21:24,122 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8e1358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:21:24, skipping insertion in model container [2018-06-22 01:21:24,122 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:21:24" (3/3) ... [2018-06-22 01:21:24,125 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:21:24,134 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:21:24,144 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:21:24,178 INFO ]: Using default assertion order modulation [2018-06-22 01:21:24,179 INFO ]: Interprodecural is true [2018-06-22 01:21:24,179 INFO ]: Hoare is false [2018-06-22 01:21:24,179 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:21:24,179 INFO ]: Backedges is TWOTRACK [2018-06-22 01:21:24,179 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:21:24,179 INFO ]: Difference is false [2018-06-22 01:21:24,179 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:21:24,179 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:21:24,193 INFO ]: Start isEmpty. Operand 20 states. [2018-06-22 01:21:24,202 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:21:24,202 INFO ]: Found error trace [2018-06-22 01:21:24,203 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:24,203 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:24,208 INFO ]: Analyzing trace with hash 794948722, now seen corresponding path program 1 times [2018-06-22 01:21:24,210 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:24,210 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:24,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:24,243 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:24,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:24,283 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:24,347 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:21:24,348 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:21:24,348 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:21:24,349 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:21:24,361 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:21:24,361 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:21:24,364 INFO ]: Start difference. First operand 20 states. Second operand 4 states. [2018-06-22 01:21:24,811 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:24,811 INFO ]: Finished difference Result 33 states and 53 transitions. [2018-06-22 01:21:24,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:21:24,813 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-22 01:21:24,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:24,826 INFO ]: With dead ends: 33 [2018-06-22 01:21:24,826 INFO ]: Without dead ends: 33 [2018-06-22 01:21:24,828 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:21:24,856 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:21:24,886 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 01:21:24,888 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:21:24,891 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 53 transitions. [2018-06-22 01:21:24,892 INFO ]: Start accepts. Automaton has 33 states and 53 transitions. Word has length 7 [2018-06-22 01:21:24,895 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:24,895 INFO ]: Abstraction has 33 states and 53 transitions. [2018-06-22 01:21:24,895 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:21:24,895 INFO ]: Start isEmpty. Operand 33 states and 53 transitions. [2018-06-22 01:21:24,897 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:21:24,897 INFO ]: Found error trace [2018-06-22 01:21:24,897 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:24,897 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:24,898 INFO ]: Analyzing trace with hash -829160496, now seen corresponding path program 1 times [2018-06-22 01:21:24,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:24,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:24,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:24,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:24,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:24,931 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:25,101 INFO ]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:21:25,101 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:21:25,101 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:21:25,105 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:21:25,105 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:21:25,105 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:21:25,105 INFO ]: Start difference. First operand 33 states and 53 transitions. Second operand 5 states. [2018-06-22 01:21:25,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:25,454 INFO ]: Finished difference Result 55 states and 110 transitions. [2018-06-22 01:21:25,459 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:21:25,459 INFO ]: Start accepts. Automaton has 5 states. Word has length 16 [2018-06-22 01:21:25,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:25,464 INFO ]: With dead ends: 55 [2018-06-22 01:21:25,464 INFO ]: Without dead ends: 55 [2018-06-22 01:21:25,465 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:21:25,465 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 01:21:25,480 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 37. [2018-06-22 01:21:25,480 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:21:25,482 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 67 transitions. [2018-06-22 01:21:25,482 INFO ]: Start accepts. Automaton has 37 states and 67 transitions. Word has length 16 [2018-06-22 01:21:25,483 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:25,483 INFO ]: Abstraction has 37 states and 67 transitions. [2018-06-22 01:21:25,483 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:21:25,483 INFO ]: Start isEmpty. Operand 37 states and 67 transitions. [2018-06-22 01:21:25,484 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:21:25,484 INFO ]: Found error trace [2018-06-22 01:21:25,484 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:25,485 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:25,485 INFO ]: Analyzing trace with hash 58337823, now seen corresponding path program 1 times [2018-06-22 01:21:25,485 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:25,485 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:25,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:25,486 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:25,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:25,511 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:25,731 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:21:25,731 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:25,731 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:25,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:25,776 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:25,797 INFO ]: Computing forward predicates... [2018-06-22 01:21:25,830 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:21:25,855 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:25,855 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:21:25,855 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:21:25,855 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:21:25,855 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:21:25,855 INFO ]: Start difference. First operand 37 states and 67 transitions. Second operand 6 states. [2018-06-22 01:21:26,024 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:26,024 INFO ]: Finished difference Result 55 states and 116 transitions. [2018-06-22 01:21:26,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:21:26,024 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 01:21:26,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:26,026 INFO ]: With dead ends: 55 [2018-06-22 01:21:26,026 INFO ]: Without dead ends: 53 [2018-06-22 01:21:26,026 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:21:26,027 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 01:21:26,035 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 41. [2018-06-22 01:21:26,035 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:21:26,037 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 75 transitions. [2018-06-22 01:21:26,037 INFO ]: Start accepts. Automaton has 41 states and 75 transitions. Word has length 17 [2018-06-22 01:21:26,037 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:26,037 INFO ]: Abstraction has 41 states and 75 transitions. [2018-06-22 01:21:26,037 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:21:26,037 INFO ]: Start isEmpty. Operand 41 states and 75 transitions. [2018-06-22 01:21:26,038 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:21:26,038 INFO ]: Found error trace [2018-06-22 01:21:26,038 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:26,038 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:26,038 INFO ]: Analyzing trace with hash 62031907, now seen corresponding path program 1 times [2018-06-22 01:21:26,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:26,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:26,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:26,039 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:26,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:26,056 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:26,349 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:21:26,349 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:26,349 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:26,359 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:26,405 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:26,410 INFO ]: Computing forward predicates... [2018-06-22 01:21:26,461 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:21:26,480 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:26,480 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:21:26,480 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:21:26,481 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:21:26,481 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:21:26,481 INFO ]: Start difference. First operand 41 states and 75 transitions. Second operand 6 states. [2018-06-22 01:21:26,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:26,617 INFO ]: Finished difference Result 61 states and 126 transitions. [2018-06-22 01:21:26,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:21:26,619 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 01:21:26,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:26,621 INFO ]: With dead ends: 61 [2018-06-22 01:21:26,621 INFO ]: Without dead ends: 55 [2018-06-22 01:21:26,621 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:21:26,621 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 01:21:26,630 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 43. [2018-06-22 01:21:26,630 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:21:26,631 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 83 transitions. [2018-06-22 01:21:26,631 INFO ]: Start accepts. Automaton has 43 states and 83 transitions. Word has length 17 [2018-06-22 01:21:26,631 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:26,631 INFO ]: Abstraction has 43 states and 83 transitions. [2018-06-22 01:21:26,631 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:21:26,631 INFO ]: Start isEmpty. Operand 43 states and 83 transitions. [2018-06-22 01:21:26,634 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:21:26,634 INFO ]: Found error trace [2018-06-22 01:21:26,634 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:26,634 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:26,634 INFO ]: Analyzing trace with hash 2064283049, now seen corresponding path program 1 times [2018-06-22 01:21:26,634 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:26,634 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:26,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:26,635 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:26,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:26,658 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:26,730 INFO ]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:21:26,731 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:21:26,731 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:21:26,731 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:21:26,731 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:21:26,731 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:21:26,731 INFO ]: Start difference. First operand 43 states and 83 transitions. Second operand 5 states. [2018-06-22 01:21:26,878 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:26,878 INFO ]: Finished difference Result 58 states and 118 transitions. [2018-06-22 01:21:26,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:21:26,879 INFO ]: Start accepts. Automaton has 5 states. Word has length 24 [2018-06-22 01:21:26,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:26,882 INFO ]: With dead ends: 58 [2018-06-22 01:21:26,882 INFO ]: Without dead ends: 58 [2018-06-22 01:21:26,883 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:21:26,883 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 01:21:26,892 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 45. [2018-06-22 01:21:26,892 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:21:26,894 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 87 transitions. [2018-06-22 01:21:26,894 INFO ]: Start accepts. Automaton has 45 states and 87 transitions. Word has length 24 [2018-06-22 01:21:26,894 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:26,894 INFO ]: Abstraction has 45 states and 87 transitions. [2018-06-22 01:21:26,894 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:21:26,894 INFO ]: Start isEmpty. Operand 45 states and 87 transitions. [2018-06-22 01:21:26,896 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:21:26,896 INFO ]: Found error trace [2018-06-22 01:21:26,896 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:26,896 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:26,897 INFO ]: Analyzing trace with hash -1786154583, now seen corresponding path program 1 times [2018-06-22 01:21:26,897 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:26,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:26,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:26,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:26,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:26,917 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:27,033 INFO ]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:21:27,033 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:27,033 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:27,040 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:27,088 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:27,091 INFO ]: Computing forward predicates... [2018-06-22 01:21:27,234 INFO ]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:21:27,262 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:27,262 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 01:21:27,262 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:21:27,263 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:21:27,263 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:21:27,263 INFO ]: Start difference. First operand 45 states and 87 transitions. Second operand 10 states. [2018-06-22 01:21:27,501 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:27,501 INFO ]: Finished difference Result 79 states and 160 transitions. [2018-06-22 01:21:27,501 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:21:27,501 INFO ]: Start accepts. Automaton has 10 states. Word has length 24 [2018-06-22 01:21:27,502 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:27,503 INFO ]: With dead ends: 79 [2018-06-22 01:21:27,503 INFO ]: Without dead ends: 79 [2018-06-22 01:21:27,504 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:21:27,504 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 01:21:27,516 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 53. [2018-06-22 01:21:27,516 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 01:21:27,517 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 103 transitions. [2018-06-22 01:21:27,517 INFO ]: Start accepts. Automaton has 53 states and 103 transitions. Word has length 24 [2018-06-22 01:21:27,517 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:27,517 INFO ]: Abstraction has 53 states and 103 transitions. [2018-06-22 01:21:27,517 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:21:27,517 INFO ]: Start isEmpty. Operand 53 states and 103 transitions. [2018-06-22 01:21:27,520 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:21:27,520 INFO ]: Found error trace [2018-06-22 01:21:27,520 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:27,520 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:27,520 INFO ]: Analyzing trace with hash 1619753385, now seen corresponding path program 1 times [2018-06-22 01:21:27,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:27,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:27,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:27,521 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:27,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:27,535 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:27,625 INFO ]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:21:27,625 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:21:27,625 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:21:27,625 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:21:27,625 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:21:27,625 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:21:27,625 INFO ]: Start difference. First operand 53 states and 103 transitions. Second operand 5 states. [2018-06-22 01:21:27,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:27,807 INFO ]: Finished difference Result 67 states and 132 transitions. [2018-06-22 01:21:27,807 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:21:27,807 INFO ]: Start accepts. Automaton has 5 states. Word has length 24 [2018-06-22 01:21:27,807 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:27,809 INFO ]: With dead ends: 67 [2018-06-22 01:21:27,809 INFO ]: Without dead ends: 67 [2018-06-22 01:21:27,809 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:21:27,809 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 01:21:27,821 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-06-22 01:21:27,821 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 01:21:27,823 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 103 transitions. [2018-06-22 01:21:27,823 INFO ]: Start accepts. Automaton has 55 states and 103 transitions. Word has length 24 [2018-06-22 01:21:27,823 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:27,823 INFO ]: Abstraction has 55 states and 103 transitions. [2018-06-22 01:21:27,823 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:21:27,823 INFO ]: Start isEmpty. Operand 55 states and 103 transitions. [2018-06-22 01:21:27,826 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:21:27,826 INFO ]: Found error trace [2018-06-22 01:21:27,826 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:27,826 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:27,827 INFO ]: Analyzing trace with hash -435531414, now seen corresponding path program 1 times [2018-06-22 01:21:27,827 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:27,827 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:27,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:27,827 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:27,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:27,863 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:27,953 INFO ]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 01:21:27,953 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:21:27,953 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:21:27,953 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:21:27,954 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:21:27,954 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:21:27,954 INFO ]: Start difference. First operand 55 states and 103 transitions. Second operand 3 states. [2018-06-22 01:21:27,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:27,991 INFO ]: Finished difference Result 57 states and 105 transitions. [2018-06-22 01:21:27,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:21:27,992 INFO ]: Start accepts. Automaton has 3 states. Word has length 25 [2018-06-22 01:21:27,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:27,993 INFO ]: With dead ends: 57 [2018-06-22 01:21:27,993 INFO ]: Without dead ends: 51 [2018-06-22 01:21:27,996 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-22 01:21:27,996 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:21:28,004 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-06-22 01:21:28,004 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 01:21:28,006 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 91 transitions. [2018-06-22 01:21:28,006 INFO ]: Start accepts. Automaton has 51 states and 91 transitions. Word has length 25 [2018-06-22 01:21:28,006 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:28,006 INFO ]: Abstraction has 51 states and 91 transitions. [2018-06-22 01:21:28,006 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:21:28,006 INFO ]: Start isEmpty. Operand 51 states and 91 transitions. [2018-06-22 01:21:28,007 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:21:28,007 INFO ]: Found error trace [2018-06-22 01:21:28,007 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:28,007 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:28,007 INFO ]: Analyzing trace with hash -430913809, now seen corresponding path program 1 times [2018-06-22 01:21:28,007 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:28,007 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:28,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:28,008 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:28,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:28,037 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:28,345 INFO ]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:21:28,345 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:28,345 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:28,354 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:28,396 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:28,399 INFO ]: Computing forward predicates... [2018-06-22 01:21:28,667 INFO ]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:21:28,686 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:28,687 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-06-22 01:21:28,687 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:21:28,687 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:21:28,687 INFO ]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:21:28,687 INFO ]: Start difference. First operand 51 states and 91 transitions. Second operand 17 states. [2018-06-22 01:21:30,499 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:30,500 INFO ]: Finished difference Result 138 states and 309 transitions. [2018-06-22 01:21:30,500 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 01:21:30,501 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-22 01:21:30,501 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:30,503 INFO ]: With dead ends: 138 [2018-06-22 01:21:30,503 INFO ]: Without dead ends: 88 [2018-06-22 01:21:30,504 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=362, Invalid=2394, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:21:30,504 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 01:21:30,516 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 76. [2018-06-22 01:21:30,516 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 01:21:30,518 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 144 transitions. [2018-06-22 01:21:30,518 INFO ]: Start accepts. Automaton has 76 states and 144 transitions. Word has length 25 [2018-06-22 01:21:30,518 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:30,518 INFO ]: Abstraction has 76 states and 144 transitions. [2018-06-22 01:21:30,518 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:21:30,518 INFO ]: Start isEmpty. Operand 76 states and 144 transitions. [2018-06-22 01:21:30,520 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:21:30,520 INFO ]: Found error trace [2018-06-22 01:21:30,520 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:30,520 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:30,520 INFO ]: Analyzing trace with hash 456292198, now seen corresponding path program 1 times [2018-06-22 01:21:30,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:30,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:30,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:30,521 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:30,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:30,533 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:30,595 INFO ]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 01:21:30,595 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:21:30,595 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:21:30,596 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:21:30,596 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:21:30,596 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:21:30,596 INFO ]: Start difference. First operand 76 states and 144 transitions. Second operand 3 states. [2018-06-22 01:21:30,649 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:30,649 INFO ]: Finished difference Result 82 states and 154 transitions. [2018-06-22 01:21:30,649 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:21:30,649 INFO ]: Start accepts. Automaton has 3 states. Word has length 25 [2018-06-22 01:21:30,649 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:30,650 INFO ]: With dead ends: 82 [2018-06-22 01:21:30,650 INFO ]: Without dead ends: 74 [2018-06-22 01:21:30,650 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-22 01:21:30,650 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 01:21:30,661 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-22 01:21:30,661 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 01:21:30,663 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 131 transitions. [2018-06-22 01:21:30,663 INFO ]: Start accepts. Automaton has 74 states and 131 transitions. Word has length 25 [2018-06-22 01:21:30,663 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:30,663 INFO ]: Abstraction has 74 states and 131 transitions. [2018-06-22 01:21:30,663 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:21:30,663 INFO ]: Start isEmpty. Operand 74 states and 131 transitions. [2018-06-22 01:21:30,665 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:21:30,665 INFO ]: Found error trace [2018-06-22 01:21:30,665 INFO ]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:30,665 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:30,666 INFO ]: Analyzing trace with hash 1757673090, now seen corresponding path program 2 times [2018-06-22 01:21:30,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:30,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:30,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:30,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:30,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:30,678 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:30,855 INFO ]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:21:30,855 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:21:30,855 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 01:21:30,856 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:21:30,856 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:21:30,856 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:21:30,856 INFO ]: Start difference. First operand 74 states and 131 transitions. Second operand 7 states. [2018-06-22 01:21:30,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:30,913 INFO ]: Finished difference Result 90 states and 157 transitions. [2018-06-22 01:21:30,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:21:30,916 INFO ]: Start accepts. Automaton has 7 states. Word has length 32 [2018-06-22 01:21:30,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:30,917 INFO ]: With dead ends: 90 [2018-06-22 01:21:30,917 INFO ]: Without dead ends: 68 [2018-06-22 01:21:30,918 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:21:30,918 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 01:21:30,924 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 50. [2018-06-22 01:21:30,924 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 01:21:30,925 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-06-22 01:21:30,925 INFO ]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 32 [2018-06-22 01:21:30,925 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:30,925 INFO ]: Abstraction has 50 states and 83 transitions. [2018-06-22 01:21:30,925 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:21:30,925 INFO ]: Start isEmpty. Operand 50 states and 83 transitions. [2018-06-22 01:21:30,926 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:21:30,926 INFO ]: Found error trace [2018-06-22 01:21:30,926 INFO ]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:30,926 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:30,926 INFO ]: Analyzing trace with hash -1322909108, now seen corresponding path program 2 times [2018-06-22 01:21:30,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:30,927 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:30,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:30,927 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:21:30,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:30,943 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:31,102 INFO ]: Checked inductivity of 44 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:21:31,102 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:31,102 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:31,108 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:21:31,154 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:21:31,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:31,157 INFO ]: Computing forward predicates... [2018-06-22 01:21:31,333 INFO ]: Checked inductivity of 44 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 01:21:31,353 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:31,353 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-22 01:21:31,353 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:21:31,353 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:21:31,353 INFO ]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:21:31,354 INFO ]: Start difference. First operand 50 states and 83 transitions. Second operand 20 states. [2018-06-22 01:21:35,920 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:35,920 INFO ]: Finished difference Result 271 states and 597 transitions. [2018-06-22 01:21:35,956 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-06-22 01:21:35,956 INFO ]: Start accepts. Automaton has 20 states. Word has length 34 [2018-06-22 01:21:35,956 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:35,959 INFO ]: With dead ends: 271 [2018-06-22 01:21:35,959 INFO ]: Without dead ends: 157 [2018-06-22 01:21:35,961 INFO ]: 0 DeclaredPredicates, 111 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=714, Invalid=4986, Unknown=0, NotChecked=0, Total=5700 [2018-06-22 01:21:35,961 INFO ]: Start minimizeSevpa. Operand 157 states. [2018-06-22 01:21:35,985 INFO ]: Finished minimizeSevpa. Reduced states from 157 to 126. [2018-06-22 01:21:35,985 INFO ]: Start removeUnreachable. Operand 126 states. [2018-06-22 01:21:35,993 INFO ]: Finished removeUnreachable. Reduced from 126 states to 126 states and 239 transitions. [2018-06-22 01:21:35,994 INFO ]: Start accepts. Automaton has 126 states and 239 transitions. Word has length 34 [2018-06-22 01:21:35,994 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:35,994 INFO ]: Abstraction has 126 states and 239 transitions. [2018-06-22 01:21:35,994 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:21:35,994 INFO ]: Start isEmpty. Operand 126 states and 239 transitions. [2018-06-22 01:21:35,995 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:21:35,995 INFO ]: Found error trace [2018-06-22 01:21:35,995 INFO ]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:35,995 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:35,995 INFO ]: Analyzing trace with hash -1130577238, now seen corresponding path program 1 times [2018-06-22 01:21:35,995 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:35,995 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:35,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:35,999 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:21:35,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:36,021 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:36,913 INFO ]: Checked inductivity of 48 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:21:36,913 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:36,913 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:36,919 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:36,961 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:36,964 INFO ]: Computing forward predicates... [2018-06-22 01:21:37,127 INFO ]: Checked inductivity of 48 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:21:37,147 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:37,147 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-22 01:21:37,147 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:21:37,147 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:21:37,147 INFO ]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:21:37,148 INFO ]: Start difference. First operand 126 states and 239 transitions. Second operand 20 states. [2018-06-22 01:21:39,049 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:39,049 INFO ]: Finished difference Result 202 states and 407 transitions. [2018-06-22 01:21:39,049 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 01:21:39,050 INFO ]: Start accepts. Automaton has 20 states. Word has length 35 [2018-06-22 01:21:39,050 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:39,052 INFO ]: With dead ends: 202 [2018-06-22 01:21:39,052 INFO ]: Without dead ends: 139 [2018-06-22 01:21:39,053 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=301, Invalid=2669, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:21:39,053 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-22 01:21:39,064 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 126. [2018-06-22 01:21:39,065 INFO ]: Start removeUnreachable. Operand 126 states. [2018-06-22 01:21:39,066 INFO ]: Finished removeUnreachable. Reduced from 126 states to 126 states and 233 transitions. [2018-06-22 01:21:39,066 INFO ]: Start accepts. Automaton has 126 states and 233 transitions. Word has length 35 [2018-06-22 01:21:39,066 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:39,066 INFO ]: Abstraction has 126 states and 233 transitions. [2018-06-22 01:21:39,066 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:21:39,067 INFO ]: Start isEmpty. Operand 126 states and 233 transitions. [2018-06-22 01:21:39,068 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:21:39,068 INFO ]: Found error trace [2018-06-22 01:21:39,068 INFO ]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:39,068 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:39,068 INFO ]: Analyzing trace with hash 1470439454, now seen corresponding path program 3 times [2018-06-22 01:21:39,068 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:39,068 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:39,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:39,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:39,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:39,088 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:39,245 INFO ]: Checked inductivity of 57 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 01:21:39,245 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:39,245 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:39,254 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:21:39,297 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:21:39,297 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:39,301 INFO ]: Computing forward predicates... [2018-06-22 01:21:39,491 INFO ]: Checked inductivity of 57 backedges. 31 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 01:21:39,510 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:39,510 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 17 [2018-06-22 01:21:39,510 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:21:39,510 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:21:39,510 INFO ]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:21:39,511 INFO ]: Start difference. First operand 126 states and 233 transitions. Second operand 17 states. [2018-06-22 01:21:40,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:40,658 INFO ]: Finished difference Result 243 states and 515 transitions. [2018-06-22 01:21:40,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 01:21:40,658 INFO ]: Start accepts. Automaton has 17 states. Word has length 36 [2018-06-22 01:21:40,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:40,663 INFO ]: With dead ends: 243 [2018-06-22 01:21:40,663 INFO ]: Without dead ends: 115 [2018-06-22 01:21:40,664 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=396, Invalid=2466, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:21:40,664 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-22 01:21:40,672 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 97. [2018-06-22 01:21:40,672 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-22 01:21:40,674 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 171 transitions. [2018-06-22 01:21:40,674 INFO ]: Start accepts. Automaton has 97 states and 171 transitions. Word has length 36 [2018-06-22 01:21:40,674 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:40,674 INFO ]: Abstraction has 97 states and 171 transitions. [2018-06-22 01:21:40,674 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:21:40,674 INFO ]: Start isEmpty. Operand 97 states and 171 transitions. [2018-06-22 01:21:40,675 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:21:40,675 INFO ]: Found error trace [2018-06-22 01:21:40,675 INFO ]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:40,675 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:40,675 INFO ]: Analyzing trace with hash -1093625066, now seen corresponding path program 2 times [2018-06-22 01:21:40,675 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:40,675 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:40,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:40,676 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:21:40,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:40,707 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:40,858 INFO ]: Checked inductivity of 55 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 01:21:40,858 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:40,858 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:40,866 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:21:40,911 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:21:40,911 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:40,915 INFO ]: Computing forward predicates... [2018-06-22 01:21:40,968 INFO ]: Checked inductivity of 55 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 01:21:40,990 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:41,000 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 01:21:41,000 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:21:41,000 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:21:41,000 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:21:41,000 INFO ]: Start difference. First operand 97 states and 171 transitions. Second operand 9 states. [2018-06-22 01:21:41,104 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:41,104 INFO ]: Finished difference Result 169 states and 324 transitions. [2018-06-22 01:21:41,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:21:41,104 INFO ]: Start accepts. Automaton has 9 states. Word has length 36 [2018-06-22 01:21:41,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:41,106 INFO ]: With dead ends: 169 [2018-06-22 01:21:41,106 INFO ]: Without dead ends: 157 [2018-06-22 01:21:41,107 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:21:41,107 INFO ]: Start minimizeSevpa. Operand 157 states. [2018-06-22 01:21:41,118 INFO ]: Finished minimizeSevpa. Reduced states from 157 to 133. [2018-06-22 01:21:41,118 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-22 01:21:41,120 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 249 transitions. [2018-06-22 01:21:41,120 INFO ]: Start accepts. Automaton has 133 states and 249 transitions. Word has length 36 [2018-06-22 01:21:41,120 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:41,120 INFO ]: Abstraction has 133 states and 249 transitions. [2018-06-22 01:21:41,120 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:21:41,120 INFO ]: Start isEmpty. Operand 133 states and 249 transitions. [2018-06-22 01:21:41,122 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 01:21:41,122 INFO ]: Found error trace [2018-06-22 01:21:41,122 INFO ]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:41,122 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:41,122 INFO ]: Analyzing trace with hash 1744416689, now seen corresponding path program 3 times [2018-06-22 01:21:41,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:41,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:41,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:41,123 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:21:41,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:41,143 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:41,517 INFO ]: Checked inductivity of 93 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-22 01:21:41,517 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:41,517 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:41,528 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:21:41,589 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:21:41,589 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:41,594 INFO ]: Computing forward predicates... [2018-06-22 01:21:42,199 INFO ]: Checked inductivity of 93 backedges. 46 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 01:21:42,233 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:42,234 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 18 [2018-06-22 01:21:42,234 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:21:42,234 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:21:42,234 INFO ]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:21:42,234 INFO ]: Start difference. First operand 133 states and 249 transitions. Second operand 18 states. [2018-06-22 01:21:43,371 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:43,371 INFO ]: Finished difference Result 187 states and 348 transitions. [2018-06-22 01:21:43,374 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:21:43,374 INFO ]: Start accepts. Automaton has 18 states. Word has length 45 [2018-06-22 01:21:43,374 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:43,375 INFO ]: With dead ends: 187 [2018-06-22 01:21:43,375 INFO ]: Without dead ends: 101 [2018-06-22 01:21:43,376 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=254, Invalid=1306, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:21:43,376 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-22 01:21:43,383 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-06-22 01:21:43,383 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 01:21:43,384 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 165 transitions. [2018-06-22 01:21:43,384 INFO ]: Start accepts. Automaton has 100 states and 165 transitions. Word has length 45 [2018-06-22 01:21:43,384 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:43,384 INFO ]: Abstraction has 100 states and 165 transitions. [2018-06-22 01:21:43,384 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:21:43,384 INFO ]: Start isEmpty. Operand 100 states and 165 transitions. [2018-06-22 01:21:43,385 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-22 01:21:43,385 INFO ]: Found error trace [2018-06-22 01:21:43,385 INFO ]: trace histogram [6, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:43,385 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:43,385 INFO ]: Analyzing trace with hash -1392057891, now seen corresponding path program 4 times [2018-06-22 01:21:43,385 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:43,385 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:43,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:43,387 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:21:43,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:43,412 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:44,027 INFO ]: Checked inductivity of 103 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-22 01:21:44,028 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:44,028 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:44,042 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:21:44,099 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:21:44,099 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:44,103 INFO ]: Computing forward predicates... [2018-06-22 01:21:44,283 INFO ]: Checked inductivity of 103 backedges. 49 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 01:21:44,305 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:44,305 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2018-06-22 01:21:44,305 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:21:44,305 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:21:44,305 INFO ]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:21:44,305 INFO ]: Start difference. First operand 100 states and 165 transitions. Second operand 18 states. [2018-06-22 01:21:45,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:45,845 INFO ]: Finished difference Result 169 states and 307 transitions. [2018-06-22 01:21:45,845 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 01:21:45,845 INFO ]: Start accepts. Automaton has 18 states. Word has length 46 [2018-06-22 01:21:45,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:45,848 INFO ]: With dead ends: 169 [2018-06-22 01:21:45,848 INFO ]: Without dead ends: 169 [2018-06-22 01:21:45,849 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=2221, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 01:21:45,849 INFO ]: Start minimizeSevpa. Operand 169 states. [2018-06-22 01:21:45,862 INFO ]: Finished minimizeSevpa. Reduced states from 169 to 136. [2018-06-22 01:21:45,862 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-22 01:21:45,864 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 219 transitions. [2018-06-22 01:21:45,864 INFO ]: Start accepts. Automaton has 136 states and 219 transitions. Word has length 46 [2018-06-22 01:21:45,864 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:45,864 INFO ]: Abstraction has 136 states and 219 transitions. [2018-06-22 01:21:45,864 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:21:45,864 INFO ]: Start isEmpty. Operand 136 states and 219 transitions. [2018-06-22 01:21:45,866 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:21:45,866 INFO ]: Found error trace [2018-06-22 01:21:45,866 INFO ]: trace histogram [8, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:45,866 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:45,866 INFO ]: Analyzing trace with hash -537072687, now seen corresponding path program 5 times [2018-06-22 01:21:45,866 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:45,866 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:45,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:45,867 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:21:45,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:45,888 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:46,697 INFO ]: Checked inductivity of 126 backedges. 31 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 01:21:46,697 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:46,697 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:46,709 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:21:46,759 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:21:46,759 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:46,763 INFO ]: Computing forward predicates... [2018-06-22 01:21:46,922 INFO ]: Checked inductivity of 126 backedges. 68 proven. 11 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-22 01:21:46,943 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:46,943 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2018-06-22 01:21:46,943 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:21:46,944 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:21:46,944 INFO ]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:21:46,944 INFO ]: Start difference. First operand 136 states and 219 transitions. Second operand 25 states. [2018-06-22 01:21:49,128 WARN ]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-22 01:21:49,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:49,439 INFO ]: Finished difference Result 335 states and 568 transitions. [2018-06-22 01:21:49,439 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-06-22 01:21:49,439 INFO ]: Start accepts. Automaton has 25 states. Word has length 48 [2018-06-22 01:21:49,439 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:49,443 INFO ]: With dead ends: 335 [2018-06-22 01:21:49,443 INFO ]: Without dead ends: 223 [2018-06-22 01:21:49,445 INFO ]: 0 DeclaredPredicates, 134 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1820 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=700, Invalid=6440, Unknown=0, NotChecked=0, Total=7140 [2018-06-22 01:21:49,445 INFO ]: Start minimizeSevpa. Operand 223 states. [2018-06-22 01:21:49,458 INFO ]: Finished minimizeSevpa. Reduced states from 223 to 202. [2018-06-22 01:21:49,458 INFO ]: Start removeUnreachable. Operand 202 states. [2018-06-22 01:21:49,460 INFO ]: Finished removeUnreachable. Reduced from 202 states to 202 states and 313 transitions. [2018-06-22 01:21:49,460 INFO ]: Start accepts. Automaton has 202 states and 313 transitions. Word has length 48 [2018-06-22 01:21:49,460 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:49,460 INFO ]: Abstraction has 202 states and 313 transitions. [2018-06-22 01:21:49,460 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:21:49,460 INFO ]: Start isEmpty. Operand 202 states and 313 transitions. [2018-06-22 01:21:49,462 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 01:21:49,462 INFO ]: Found error trace [2018-06-22 01:21:49,462 INFO ]: trace histogram [9, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:49,462 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:49,462 INFO ]: Analyzing trace with hash 94289873, now seen corresponding path program 6 times [2018-06-22 01:21:49,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:49,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:49,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:49,463 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:21:49,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:49,486 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:49,732 INFO ]: Checked inductivity of 139 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 01:21:49,732 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:49,732 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:49,763 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:21:49,910 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:21:49,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:49,915 INFO ]: Computing forward predicates... [2018-06-22 01:21:50,181 INFO ]: Checked inductivity of 139 backedges. 88 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 01:21:50,202 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:50,202 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-06-22 01:21:50,203 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:21:50,203 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:21:50,203 INFO ]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:21:50,203 INFO ]: Start difference. First operand 202 states and 313 transitions. Second operand 24 states. [2018-06-22 01:21:50,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:50,997 INFO ]: Finished difference Result 278 states and 413 transitions. [2018-06-22 01:21:50,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:21:50,997 INFO ]: Start accepts. Automaton has 24 states. Word has length 49 [2018-06-22 01:21:50,998 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:50,999 INFO ]: With dead ends: 278 [2018-06-22 01:21:50,999 INFO ]: Without dead ends: 180 [2018-06-22 01:21:50,999 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 01:21:51,000 INFO ]: Start minimizeSevpa. Operand 180 states. [2018-06-22 01:21:51,010 INFO ]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-06-22 01:21:51,010 INFO ]: Start removeUnreachable. Operand 180 states. [2018-06-22 01:21:51,012 INFO ]: Finished removeUnreachable. Reduced from 180 states to 180 states and 267 transitions. [2018-06-22 01:21:51,012 INFO ]: Start accepts. Automaton has 180 states and 267 transitions. Word has length 49 [2018-06-22 01:21:51,012 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:51,012 INFO ]: Abstraction has 180 states and 267 transitions. [2018-06-22 01:21:51,012 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:21:51,012 INFO ]: Start isEmpty. Operand 180 states and 267 transitions. [2018-06-22 01:21:51,014 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-22 01:21:51,014 INFO ]: Found error trace [2018-06-22 01:21:51,014 INFO ]: trace histogram [10, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:51,014 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:51,014 INFO ]: Analyzing trace with hash -2125652197, now seen corresponding path program 7 times [2018-06-22 01:21:51,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:51,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:51,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:51,015 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:21:51,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:51,047 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:51,211 INFO ]: Checked inductivity of 153 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-06-22 01:21:51,211 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:51,211 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:51,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:51,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:51,289 INFO ]: Computing forward predicates... [2018-06-22 01:21:51,415 INFO ]: Checked inductivity of 153 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-06-22 01:21:51,435 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:51,435 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 01:21:51,435 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:21:51,435 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:21:51,435 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:21:51,435 INFO ]: Start difference. First operand 180 states and 267 transitions. Second operand 11 states. [2018-06-22 01:21:51,559 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:51,559 INFO ]: Finished difference Result 252 states and 391 transitions. [2018-06-22 01:21:51,559 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:21:51,559 INFO ]: Start accepts. Automaton has 11 states. Word has length 50 [2018-06-22 01:21:51,559 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:51,561 INFO ]: With dead ends: 252 [2018-06-22 01:21:51,561 INFO ]: Without dead ends: 240 [2018-06-22 01:21:51,561 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:21:51,561 INFO ]: Start minimizeSevpa. Operand 240 states. [2018-06-22 01:21:51,577 INFO ]: Finished minimizeSevpa. Reduced states from 240 to 216. [2018-06-22 01:21:51,577 INFO ]: Start removeUnreachable. Operand 216 states. [2018-06-22 01:21:51,599 INFO ]: Finished removeUnreachable. Reduced from 216 states to 216 states and 323 transitions. [2018-06-22 01:21:51,599 INFO ]: Start accepts. Automaton has 216 states and 323 transitions. Word has length 50 [2018-06-22 01:21:51,599 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:51,599 INFO ]: Abstraction has 216 states and 323 transitions. [2018-06-22 01:21:51,599 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:21:51,599 INFO ]: Start isEmpty. Operand 216 states and 323 transitions. [2018-06-22 01:21:51,601 INFO ]: Finished isEmpty. Found accepting run of length 61 [2018-06-22 01:21:51,601 INFO ]: Found error trace [2018-06-22 01:21:51,601 INFO ]: trace histogram [12, 6, 6, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:51,601 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:51,601 INFO ]: Analyzing trace with hash -2137338380, now seen corresponding path program 8 times [2018-06-22 01:21:51,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:51,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:51,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:51,602 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:51,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:51,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:51,895 INFO ]: Checked inductivity of 229 backedges. 55 proven. 64 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-22 01:21:51,895 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:51,913 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:51,920 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:21:52,006 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:21:52,006 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:52,011 INFO ]: Computing forward predicates... [2018-06-22 01:21:52,452 INFO ]: Checked inductivity of 229 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-06-22 01:21:52,471 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:52,471 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2018-06-22 01:21:52,472 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:21:52,472 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:21:52,472 INFO ]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:21:52,472 INFO ]: Start difference. First operand 216 states and 323 transitions. Second operand 26 states. [2018-06-22 01:21:54,569 WARN ]: Spent 224.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-06-22 01:21:54,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:54,990 INFO ]: Finished difference Result 327 states and 562 transitions. [2018-06-22 01:21:54,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-22 01:21:54,991 INFO ]: Start accepts. Automaton has 26 states. Word has length 60 [2018-06-22 01:21:54,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:54,992 INFO ]: With dead ends: 327 [2018-06-22 01:21:54,992 INFO ]: Without dead ends: 139 [2018-06-22 01:21:54,993 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=671, Invalid=4159, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 01:21:54,993 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-22 01:21:55,002 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 125. [2018-06-22 01:21:55,003 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-22 01:21:55,004 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 211 transitions. [2018-06-22 01:21:55,004 INFO ]: Start accepts. Automaton has 125 states and 211 transitions. Word has length 60 [2018-06-22 01:21:55,004 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:55,004 INFO ]: Abstraction has 125 states and 211 transitions. [2018-06-22 01:21:55,004 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:21:55,004 INFO ]: Start isEmpty. Operand 125 states and 211 transitions. [2018-06-22 01:21:55,006 INFO ]: Finished isEmpty. Found accepting run of length 63 [2018-06-22 01:21:55,006 INFO ]: Found error trace [2018-06-22 01:21:55,006 INFO ]: trace histogram [14, 6, 6, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:55,006 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:55,006 INFO ]: Analyzing trace with hash -329432038, now seen corresponding path program 9 times [2018-06-22 01:21:55,006 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:55,006 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:55,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:55,006 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:21:55,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:55,037 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:56,099 INFO ]: Checked inductivity of 266 backedges. 69 proven. 110 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-22 01:21:56,099 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:56,099 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:56,105 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:21:56,162 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:21:56,162 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:56,165 INFO ]: Computing forward predicates... [2018-06-22 01:21:56,360 INFO ]: Checked inductivity of 266 backedges. 114 proven. 29 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-06-22 01:21:56,379 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:56,379 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 30 [2018-06-22 01:21:56,379 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:21:56,379 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:21:56,380 INFO ]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:21:56,380 INFO ]: Start difference. First operand 125 states and 211 transitions. Second operand 30 states. [2018-06-22 01:21:56,754 WARN ]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-22 01:21:57,571 WARN ]: Spent 431.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-06-22 01:21:58,926 WARN ]: Spent 449.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-06-22 01:21:59,117 WARN ]: Spent 167.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-06-22 01:22:00,334 WARN ]: Spent 248.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-06-22 01:22:00,989 WARN ]: Spent 294.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-06-22 01:22:01,596 WARN ]: Spent 311.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-06-22 01:22:02,111 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:02,111 INFO ]: Finished difference Result 257 states and 418 transitions. [2018-06-22 01:22:02,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-06-22 01:22:02,113 INFO ]: Start accepts. Automaton has 30 states. Word has length 62 [2018-06-22 01:22:02,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:02,115 INFO ]: With dead ends: 257 [2018-06-22 01:22:02,115 INFO ]: Without dead ends: 123 [2018-06-22 01:22:02,117 INFO ]: 0 DeclaredPredicates, 154 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2686 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1298, Invalid=7632, Unknown=0, NotChecked=0, Total=8930 [2018-06-22 01:22:02,117 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-22 01:22:02,124 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-06-22 01:22:02,124 INFO ]: Start removeUnreachable. Operand 123 states. [2018-06-22 01:22:02,125 INFO ]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2018-06-22 01:22:02,125 INFO ]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 62 [2018-06-22 01:22:02,125 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:02,125 INFO ]: Abstraction has 123 states and 185 transitions. [2018-06-22 01:22:02,125 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:22:02,126 INFO ]: Start isEmpty. Operand 123 states and 185 transitions. [2018-06-22 01:22:02,127 INFO ]: Finished isEmpty. Found accepting run of length 67 [2018-06-22 01:22:02,127 INFO ]: Found error trace [2018-06-22 01:22:02,127 INFO ]: trace histogram [18, 6, 6, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:02,127 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:02,127 INFO ]: Analyzing trace with hash -2031339082, now seen corresponding path program 10 times [2018-06-22 01:22:02,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:02,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:02,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:02,128 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:02,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:02,172 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:03,971 INFO ]: Checked inductivity of 352 backedges. 90 proven. 16 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-06-22 01:22:03,971 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:03,971 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:22:03,982 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:22:04,076 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:22:04,076 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:04,081 INFO ]: Computing forward predicates... [2018-06-22 01:22:04,280 INFO ]: Checked inductivity of 352 backedges. 90 proven. 16 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-06-22 01:22:04,300 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:04,300 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 01:22:04,300 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:22:04,300 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:22:04,300 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:22:04,300 INFO ]: Start difference. First operand 123 states and 185 transitions. Second operand 13 states. [2018-06-22 01:22:04,583 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:04,583 INFO ]: Finished difference Result 165 states and 257 transitions. [2018-06-22 01:22:04,583 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:22:04,583 INFO ]: Start accepts. Automaton has 13 states. Word has length 66 [2018-06-22 01:22:04,583 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:04,585 INFO ]: With dead ends: 165 [2018-06-22 01:22:04,585 INFO ]: Without dead ends: 153 [2018-06-22 01:22:04,585 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:22:04,586 INFO ]: Start minimizeSevpa. Operand 153 states. [2018-06-22 01:22:04,593 INFO ]: Finished minimizeSevpa. Reduced states from 153 to 141. [2018-06-22 01:22:04,593 INFO ]: Start removeUnreachable. Operand 141 states. [2018-06-22 01:22:04,595 INFO ]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2018-06-22 01:22:04,595 INFO ]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 66 [2018-06-22 01:22:04,595 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:04,595 INFO ]: Abstraction has 141 states and 215 transitions. [2018-06-22 01:22:04,595 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:22:04,595 INFO ]: Start isEmpty. Operand 141 states and 215 transitions. [2018-06-22 01:22:04,598 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 01:22:04,598 INFO ]: Found error trace [2018-06-22 01:22:04,598 INFO ]: trace histogram [21, 7, 7, 7, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:04,598 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:04,598 INFO ]: Analyzing trace with hash -1871786791, now seen corresponding path program 11 times [2018-06-22 01:22:04,598 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:04,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:04,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:04,598 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:04,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:04,635 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:05,148 INFO ]: Checked inductivity of 489 backedges. 110 proven. 123 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-06-22 01:22:05,148 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:05,148 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) [2018-06-22 01:22:05,162 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:22:05,293 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 01:22:05,293 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:05,299 INFO ]: Computing forward predicates... [2018-06-22 01:22:05,498 INFO ]: Checked inductivity of 489 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2018-06-22 01:22:05,518 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:05,518 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 32 [2018-06-22 01:22:05,518 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:22:05,518 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:22:05,519 INFO ]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:22:05,519 INFO ]: Start difference. First operand 141 states and 215 transitions. Second operand 32 states. [2018-06-22 01:22:07,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:07,161 INFO ]: Finished difference Result 231 states and 413 transitions. [2018-06-22 01:22:07,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-06-22 01:22:07,181 INFO ]: Start accepts. Automaton has 32 states. Word has length 77 [2018-06-22 01:22:07,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:07,183 INFO ]: With dead ends: 231 [2018-06-22 01:22:07,183 INFO ]: Without dead ends: 159 [2018-06-22 01:22:07,185 INFO ]: 0 DeclaredPredicates, 154 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1922 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1020, Invalid=6290, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 01:22:07,185 INFO ]: Start minimizeSevpa. Operand 159 states. [2018-06-22 01:22:07,195 INFO ]: Finished minimizeSevpa. Reduced states from 159 to 147. [2018-06-22 01:22:07,196 INFO ]: Start removeUnreachable. Operand 147 states. [2018-06-22 01:22:07,197 INFO ]: Finished removeUnreachable. Reduced from 147 states to 147 states and 251 transitions. [2018-06-22 01:22:07,198 INFO ]: Start accepts. Automaton has 147 states and 251 transitions. Word has length 77 [2018-06-22 01:22:07,198 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:07,198 INFO ]: Abstraction has 147 states and 251 transitions. [2018-06-22 01:22:07,198 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:22:07,198 INFO ]: Start isEmpty. Operand 147 states and 251 transitions. [2018-06-22 01:22:07,199 INFO ]: Finished isEmpty. Found accepting run of length 80 [2018-06-22 01:22:07,199 INFO ]: Found error trace [2018-06-22 01:22:07,199 INFO ]: trace histogram [23, 7, 7, 7, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:07,200 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:07,200 INFO ]: Analyzing trace with hash 2092988521, now seen corresponding path program 12 times [2018-06-22 01:22:07,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:07,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:07,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:07,200 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:07,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:07,238 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:07,558 INFO ]: Checked inductivity of 546 backedges. 132 proven. 216 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-06-22 01:22:07,558 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:07,558 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:22:07,565 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:22:07,702 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-22 01:22:07,702 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:07,708 INFO ]: Computing forward predicates... [2018-06-22 01:22:08,091 INFO ]: Checked inductivity of 546 backedges. 217 proven. 47 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-06-22 01:22:08,113 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:08,113 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 40 [2018-06-22 01:22:08,114 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:22:08,114 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:22:08,114 INFO ]: CoverageRelationStatistics Valid=122, Invalid=1438, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:22:08,114 INFO ]: Start difference. First operand 147 states and 251 transitions. Second operand 40 states. [2018-06-22 01:22:11,468 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:11,468 INFO ]: Finished difference Result 321 states and 582 transitions. [2018-06-22 01:22:11,470 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-06-22 01:22:11,470 INFO ]: Start accepts. Automaton has 40 states. Word has length 79 [2018-06-22 01:22:11,470 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:11,471 INFO ]: With dead ends: 321 [2018-06-22 01:22:11,471 INFO ]: Without dead ends: 174 [2018-06-22 01:22:11,473 INFO ]: 0 DeclaredPredicates, 192 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3451 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1759, Invalid=10231, Unknown=0, NotChecked=0, Total=11990 [2018-06-22 01:22:11,473 INFO ]: Start minimizeSevpa. Operand 174 states. [2018-06-22 01:22:11,484 INFO ]: Finished minimizeSevpa. Reduced states from 174 to 153. [2018-06-22 01:22:11,484 INFO ]: Start removeUnreachable. Operand 153 states. [2018-06-22 01:22:11,486 INFO ]: Finished removeUnreachable. Reduced from 153 states to 153 states and 245 transitions. [2018-06-22 01:22:11,486 INFO ]: Start accepts. Automaton has 153 states and 245 transitions. Word has length 79 [2018-06-22 01:22:11,486 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:11,486 INFO ]: Abstraction has 153 states and 245 transitions. [2018-06-22 01:22:11,486 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:22:11,486 INFO ]: Start isEmpty. Operand 153 states and 245 transitions. [2018-06-22 01:22:11,488 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 01:22:11,488 INFO ]: Found error trace [2018-06-22 01:22:11,488 INFO ]: trace histogram [25, 7, 7, 7, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:11,488 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:11,488 INFO ]: Analyzing trace with hash -1370884577, now seen corresponding path program 13 times [2018-06-22 01:22:11,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:11,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:11,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:11,489 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:11,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:11,533 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:12,264 INFO ]: Checked inductivity of 607 backedges. 149 proven. 226 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-06-22 01:22:12,264 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:12,264 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:22:12,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:12,403 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:12,411 INFO ]: Computing forward predicates... [2018-06-22 01:22:12,688 INFO ]: Checked inductivity of 607 backedges. 343 proven. 55 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-06-22 01:22:12,708 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:12,708 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2018-06-22 01:22:12,708 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:22:12,709 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:22:12,709 INFO ]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:22:12,709 INFO ]: Start difference. First operand 153 states and 245 transitions. Second operand 34 states. [2018-06-22 01:22:16,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:16,667 INFO ]: Finished difference Result 555 states and 1119 transitions. [2018-06-22 01:22:16,668 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-06-22 01:22:16,668 INFO ]: Start accepts. Automaton has 34 states. Word has length 81 [2018-06-22 01:22:16,668 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:16,672 INFO ]: With dead ends: 555 [2018-06-22 01:22:16,672 INFO ]: Without dead ends: 397 [2018-06-22 01:22:16,673 INFO ]: 0 DeclaredPredicates, 212 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4182 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1484, Invalid=12796, Unknown=0, NotChecked=0, Total=14280 [2018-06-22 01:22:16,673 INFO ]: Start minimizeSevpa. Operand 397 states. [2018-06-22 01:22:16,698 INFO ]: Finished minimizeSevpa. Reduced states from 397 to 240. [2018-06-22 01:22:16,698 INFO ]: Start removeUnreachable. Operand 240 states. [2018-06-22 01:22:16,700 INFO ]: Finished removeUnreachable. Reduced from 240 states to 240 states and 375 transitions. [2018-06-22 01:22:16,700 INFO ]: Start accepts. Automaton has 240 states and 375 transitions. Word has length 81 [2018-06-22 01:22:16,700 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:16,700 INFO ]: Abstraction has 240 states and 375 transitions. [2018-06-22 01:22:16,700 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:22:16,700 INFO ]: Start isEmpty. Operand 240 states and 375 transitions. [2018-06-22 01:22:16,702 INFO ]: Finished isEmpty. Found accepting run of length 85 [2018-06-22 01:22:16,702 INFO ]: Found error trace [2018-06-22 01:22:16,702 INFO ]: trace histogram [28, 7, 7, 7, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:16,702 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:16,703 INFO ]: Analyzing trace with hash 40109069, now seen corresponding path program 14 times [2018-06-22 01:22:16,703 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:16,703 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:16,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:16,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:16,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:16,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:17,230 INFO ]: Checked inductivity of 706 backedges. 162 proven. 27 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-06-22 01:22:17,230 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:17,230 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:22:17,237 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:22:17,385 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:22:17,385 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:17,393 INFO ]: Computing forward predicates... [2018-06-22 01:22:17,506 INFO ]: Checked inductivity of 706 backedges. 162 proven. 27 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-06-22 01:22:17,528 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:17,528 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-22 01:22:17,528 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:22:17,528 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:22:17,528 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:22:17,528 INFO ]: Start difference. First operand 240 states and 375 transitions. Second operand 15 states. [2018-06-22 01:22:17,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:17,758 INFO ]: Finished difference Result 312 states and 495 transitions. [2018-06-22 01:22:17,759 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:22:17,759 INFO ]: Start accepts. Automaton has 15 states. Word has length 84 [2018-06-22 01:22:17,759 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:17,762 INFO ]: With dead ends: 312 [2018-06-22 01:22:17,762 INFO ]: Without dead ends: 190 [2018-06-22 01:22:17,762 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:22:17,762 INFO ]: Start minimizeSevpa. Operand 190 states. [2018-06-22 01:22:17,782 INFO ]: Finished minimizeSevpa. Reduced states from 190 to 175. [2018-06-22 01:22:17,782 INFO ]: Start removeUnreachable. Operand 175 states. [2018-06-22 01:22:17,784 INFO ]: Finished removeUnreachable. Reduced from 175 states to 175 states and 264 transitions. [2018-06-22 01:22:17,784 INFO ]: Start accepts. Automaton has 175 states and 264 transitions. Word has length 84 [2018-06-22 01:22:17,784 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:17,784 INFO ]: Abstraction has 175 states and 264 transitions. [2018-06-22 01:22:17,784 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:22:17,784 INFO ]: Start isEmpty. Operand 175 states and 264 transitions. [2018-06-22 01:22:17,786 INFO ]: Finished isEmpty. Found accepting run of length 97 [2018-06-22 01:22:17,786 INFO ]: Found error trace [2018-06-22 01:22:17,786 INFO ]: trace histogram [32, 8, 8, 8, 7, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:17,786 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:17,786 INFO ]: Analyzing trace with hash 1974767590, now seen corresponding path program 15 times [2018-06-22 01:22:17,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:17,786 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:17,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:17,787 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:17,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:17,835 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 01:22:18,013 WARN ]: Verification canceled [2018-06-22 01:22:18,018 WARN ]: Timeout [2018-06-22 01:22:18,018 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:22:18 BoogieIcfgContainer [2018-06-22 01:22:18,018 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:22:18,019 INFO ]: Toolchain (without parser) took 54439.37 ms. Allocated memory was 306.7 MB in the beginning and 821.6 MB in the end (delta: 514.9 MB). Free memory was 261.1 MB in the beginning and 454.0 MB in the end (delta: -192.9 MB). Peak memory consumption was 322.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:22:18,019 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 306.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:22:18,020 INFO ]: ChcToBoogie took 76.93 ms. Allocated memory is still 306.7 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:22:18,020 INFO ]: Boogie Preprocessor took 42.89 ms. Allocated memory is still 306.7 MB. Free memory is still 257.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:22:18,020 INFO ]: RCFGBuilder took 403.80 ms. Allocated memory is still 306.7 MB. Free memory was 257.1 MB in the beginning and 243.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:22:18,021 INFO ]: TraceAbstraction took 53904.90 ms. Allocated memory was 306.7 MB in the beginning and 821.6 MB in the end (delta: 514.9 MB). Free memory was 243.2 MB in the beginning and 454.0 MB in the end (delta: -210.8 MB). Peak memory consumption was 304.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:22:18,022 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 306.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 76.93 ms. Allocated memory is still 306.7 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 42.89 ms. Allocated memory is still 306.7 MB. Free memory is still 257.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 403.80 ms. Allocated memory is still 306.7 MB. Free memory was 257.1 MB in the beginning and 243.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 53904.90 ms. Allocated memory was 306.7 MB in the beginning and 821.6 MB in the end (delta: 514.9 MB). Free memory was 243.2 MB in the beginning and 454.0 MB in the end (delta: -210.8 MB). Peak memory consumption was 304.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 32, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. TIMEOUT Result, 53.8s OverallTime, 28 OverallIterations, 32 TraceHistogramMax, 35.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1068 SDtfs, 1316 SDslu, 6669 SDs, 0 SdLazy, 17834 SolverSat, 4132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2035 GetRequests, 993 SyntacticMatches, 20 SemanticMatches, 1022 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20014 ImplicationChecksByTransitivity, 28.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=26, 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.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 519 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 2095 NumberOfCodeBlocks, 2048 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 2048 ConstructedInterpolants, 0 QuantifiedInterpolants, 357951 SizeOfPredicates, 198 NumberOfNonLiveVariables, 12431 ConjunctsInSsa, 734 ConjunctsInUnsatCore, 47 InterpolantComputations, 7 PerfectInterpolantSequences, 7026/8234 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/005b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-22-18-030.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/005b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-22-18-030.csv Completed graceful shutdown