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/025d-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:34:56,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:34:56,164 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:34:56,177 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:34:56,177 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:34:56,180 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:34:56,181 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:34:56,183 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:34:56,184 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:34:56,185 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:34:56,187 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:34:56,187 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:34:56,188 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:34:56,189 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:34:56,189 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:34:56,190 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:34:56,194 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:34:56,195 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:34:56,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:34:56,206 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:34:56,207 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:34:56,209 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:34:56,209 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:34:56,209 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:34:56,212 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:34:56,213 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:34:56,214 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:34:56,214 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:34:56,219 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:34:56,220 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:34:56,220 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:34:56,221 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:34:56,221 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:34:56,222 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:34:56,222 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:34:56,223 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:34:56,242 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:34:56,242 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:34:56,243 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:34:56,243 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:34:56,244 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:34:56,244 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:34:56,244 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:34:56,244 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:34:56,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:34:56,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:34:56,245 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:34:56,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:34:56,246 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:34:56,246 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:34:56,246 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:34:56,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:34:56,246 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:34:56,248 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:34:56,248 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:34:56,301 INFO ]: Repository-Root is: /tmp [2018-06-22 01:34:56,316 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:34:56,323 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:34:56,324 INFO ]: Initializing SmtParser... [2018-06-22 01:34:56,324 INFO ]: SmtParser initialized [2018-06-22 01:34:56,325 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/025d-horn.smt2 [2018-06-22 01:34:56,326 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:34:56,413 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025d-horn.smt2 unknown [2018-06-22 01:34:56,649 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025d-horn.smt2 [2018-06-22 01:34:56,660 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:34:56,665 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:34:56,666 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:34:56,666 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:34:56,666 INFO ]: ChcToBoogie initialized [2018-06-22 01:34:56,669 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:34:56" (1/1) ... [2018-06-22 01:34:56,724 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:56 Unit [2018-06-22 01:34:56,724 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:34:56,724 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:34:56,724 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:34:56,724 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:34:56,744 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:56" (1/1) ... [2018-06-22 01:34:56,744 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:56" (1/1) ... [2018-06-22 01:34:56,751 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:56" (1/1) ... [2018-06-22 01:34:56,751 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:56" (1/1) ... [2018-06-22 01:34:56,755 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:56" (1/1) ... [2018-06-22 01:34:56,763 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:56" (1/1) ... [2018-06-22 01:34:56,764 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:56" (1/1) ... [2018-06-22 01:34:56,766 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:34:56,766 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:34:56,766 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:34:56,766 INFO ]: RCFGBuilder initialized [2018-06-22 01:34:56,767 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:56" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:34:56,783 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:34:56,783 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:34:56,783 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:34:56,783 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:34:56,783 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:34:56,783 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:34:57,136 INFO ]: Using library mode [2018-06-22 01:34:57,137 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:34:57 BoogieIcfgContainer [2018-06-22 01:34:57,137 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:34:57,138 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:34:57,138 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:34:57,142 INFO ]: TraceAbstraction initialized [2018-06-22 01:34:57,142 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:34:56" (1/3) ... [2018-06-22 01:34:57,143 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b026f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:34:57, skipping insertion in model container [2018-06-22 01:34:57,143 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:56" (2/3) ... [2018-06-22 01:34:57,143 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b026f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:34:57, skipping insertion in model container [2018-06-22 01:34:57,143 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:34:57" (3/3) ... [2018-06-22 01:34:57,145 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:34:57,154 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:34:57,166 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:34:57,201 INFO ]: Using default assertion order modulation [2018-06-22 01:34:57,201 INFO ]: Interprodecural is true [2018-06-22 01:34:57,201 INFO ]: Hoare is false [2018-06-22 01:34:57,201 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:34:57,201 INFO ]: Backedges is TWOTRACK [2018-06-22 01:34:57,201 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:34:57,201 INFO ]: Difference is false [2018-06-22 01:34:57,202 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:34:57,202 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:34:57,214 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:34:57,223 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:34:57,226 INFO ]: Found error trace [2018-06-22 01:34:57,227 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:57,227 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:57,231 INFO ]: Analyzing trace with hash -838748078, now seen corresponding path program 1 times [2018-06-22 01:34:57,233 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:57,233 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:57,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:57,266 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:57,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:57,306 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:57,408 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:57,410 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:34:57,410 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:34:57,411 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:34:57,421 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:34:57,422 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:57,423 INFO ]: Start difference. First operand 12 states. Second operand 3 states. [2018-06-22 01:34:57,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:57,533 INFO ]: Finished difference Result 15 states and 37 transitions. [2018-06-22 01:34:57,534 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:34:57,535 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:34:57,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:57,544 INFO ]: With dead ends: 15 [2018-06-22 01:34:57,545 INFO ]: Without dead ends: 15 [2018-06-22 01:34:57,547 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:34:57,563 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:34:57,580 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-22 01:34:57,582 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:34:57,583 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2018-06-22 01:34:57,584 INFO ]: Start accepts. Automaton has 11 states and 29 transitions. Word has length 7 [2018-06-22 01:34:57,586 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:57,586 INFO ]: Abstraction has 11 states and 29 transitions. [2018-06-22 01:34:57,586 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:34:57,586 INFO ]: Start isEmpty. Operand 11 states and 29 transitions. [2018-06-22 01:34:57,586 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:34:57,586 INFO ]: Found error trace [2018-06-22 01:34:57,586 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:57,586 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:57,587 INFO ]: Analyzing trace with hash -229366439, now seen corresponding path program 1 times [2018-06-22 01:34:57,587 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:57,587 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:57,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:57,588 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:57,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:57,610 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:57,755 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:57,755 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:57,755 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:34:57,769 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:57,809 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:57,818 INFO ]: Computing forward predicates... [2018-06-22 01:34:58,046 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:58,081 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:58,081 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:34:58,082 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:34:58,082 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:34:58,082 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:34:58,082 INFO ]: Start difference. First operand 11 states and 29 transitions. Second operand 5 states. [2018-06-22 01:34:58,392 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:58,392 INFO ]: Finished difference Result 17 states and 49 transitions. [2018-06-22 01:34:58,392 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:34:58,392 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 01:34:58,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:58,393 INFO ]: With dead ends: 17 [2018-06-22 01:34:58,393 INFO ]: Without dead ends: 17 [2018-06-22 01:34:58,394 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:34:58,394 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:34:58,396 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-06-22 01:34:58,396 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:34:58,397 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2018-06-22 01:34:58,397 INFO ]: Start accepts. Automaton has 12 states and 33 transitions. Word has length 8 [2018-06-22 01:34:58,397 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:58,397 INFO ]: Abstraction has 12 states and 33 transitions. [2018-06-22 01:34:58,397 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:34:58,397 INFO ]: Start isEmpty. Operand 12 states and 33 transitions. [2018-06-22 01:34:58,398 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:34:58,398 INFO ]: Found error trace [2018-06-22 01:34:58,398 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:58,398 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:58,398 INFO ]: Analyzing trace with hash -254301506, now seen corresponding path program 1 times [2018-06-22 01:34:58,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:58,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:58,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:58,399 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:58,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:58,408 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:58,465 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:58,465 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:34:58,465 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:34:58,465 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:34:58,465 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:34:58,465 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:58,465 INFO ]: Start difference. First operand 12 states and 33 transitions. Second operand 3 states. [2018-06-22 01:34:58,578 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:58,578 INFO ]: Finished difference Result 16 states and 44 transitions. [2018-06-22 01:34:58,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:34:58,579 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:34:58,579 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:58,580 INFO ]: With dead ends: 16 [2018-06-22 01:34:58,580 INFO ]: Without dead ends: 16 [2018-06-22 01:34:58,580 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:34:58,580 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:34:58,583 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-22 01:34:58,583 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:34:58,583 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 39 transitions. [2018-06-22 01:34:58,583 INFO ]: Start accepts. Automaton has 13 states and 39 transitions. Word has length 8 [2018-06-22 01:34:58,584 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:58,584 INFO ]: Abstraction has 13 states and 39 transitions. [2018-06-22 01:34:58,584 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:34:58,584 INFO ]: Start isEmpty. Operand 13 states and 39 transitions. [2018-06-22 01:34:58,584 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:34:58,584 INFO ]: Found error trace [2018-06-22 01:34:58,584 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:58,584 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:58,584 INFO ]: Analyzing trace with hash 1481595186, now seen corresponding path program 2 times [2018-06-22 01:34:58,584 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:58,584 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:58,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:58,585 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:58,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:58,604 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:58,793 WARN ]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:34:58,906 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:58,907 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:58,907 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:34:58,914 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:34:58,983 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:34:58,983 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:58,985 INFO ]: Computing forward predicates... [2018-06-22 01:34:59,101 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:59,137 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:59,137 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-22 01:34:59,137 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:34:59,137 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:34:59,137 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:34:59,137 INFO ]: Start difference. First operand 13 states and 39 transitions. Second operand 7 states. [2018-06-22 01:34:59,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:59,712 INFO ]: Finished difference Result 25 states and 81 transitions. [2018-06-22 01:34:59,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:34:59,712 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-22 01:34:59,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:59,713 INFO ]: With dead ends: 25 [2018-06-22 01:34:59,713 INFO ]: Without dead ends: 25 [2018-06-22 01:34:59,714 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:34:59,714 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:34:59,716 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 15. [2018-06-22 01:34:59,716 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:34:59,717 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 51 transitions. [2018-06-22 01:34:59,717 INFO ]: Start accepts. Automaton has 15 states and 51 transitions. Word has length 9 [2018-06-22 01:34:59,717 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:59,717 INFO ]: Abstraction has 15 states and 51 transitions. [2018-06-22 01:34:59,717 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:34:59,717 INFO ]: Start isEmpty. Operand 15 states and 51 transitions. [2018-06-22 01:34:59,717 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:34:59,717 INFO ]: Found error trace [2018-06-22 01:34:59,717 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:59,718 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:59,718 INFO ]: Analyzing trace with hash 1471436455, now seen corresponding path program 1 times [2018-06-22 01:34:59,718 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:59,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:59,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:59,719 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:59,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:59,729 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:59,883 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:59,884 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:59,884 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:34:59,892 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:59,917 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:59,919 INFO ]: Computing forward predicates... [2018-06-22 01:34:59,962 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:59,987 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:59,987 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 01:34:59,987 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:34:59,987 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:34:59,987 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:34:59,987 INFO ]: Start difference. First operand 15 states and 51 transitions. Second operand 8 states. [2018-06-22 01:35:00,156 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:00,157 INFO ]: Finished difference Result 23 states and 78 transitions. [2018-06-22 01:35:00,157 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:35:00,157 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-22 01:35:00,158 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:00,158 INFO ]: With dead ends: 23 [2018-06-22 01:35:00,158 INFO ]: Without dead ends: 23 [2018-06-22 01:35:00,159 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:35:00,159 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:35:00,162 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-06-22 01:35:00,162 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:35:00,163 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2018-06-22 01:35:00,163 INFO ]: Start accepts. Automaton has 18 states and 65 transitions. Word has length 9 [2018-06-22 01:35:00,163 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:00,163 INFO ]: Abstraction has 18 states and 65 transitions. [2018-06-22 01:35:00,163 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:35:00,163 INFO ]: Start isEmpty. Operand 18 states and 65 transitions. [2018-06-22 01:35:00,163 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:35:00,163 INFO ]: Found error trace [2018-06-22 01:35:00,163 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:00,163 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:00,164 INFO ]: Analyzing trace with hash 708608109, now seen corresponding path program 1 times [2018-06-22 01:35:00,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:00,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:00,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:00,164 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:35:00,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:00,175 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:00,206 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:00,206 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:00,206 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:35:00,214 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:35:00,240 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:00,241 INFO ]: Computing forward predicates... [2018-06-22 01:35:00,288 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:00,308 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:00,308 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:35:00,308 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:35:00,308 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:35:00,308 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:35:00,308 INFO ]: Start difference. First operand 18 states and 65 transitions. Second operand 4 states. [2018-06-22 01:35:00,363 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:00,363 INFO ]: Finished difference Result 28 states and 93 transitions. [2018-06-22 01:35:00,363 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:35:00,363 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:35:00,363 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:00,364 INFO ]: With dead ends: 28 [2018-06-22 01:35:00,364 INFO ]: Without dead ends: 28 [2018-06-22 01:35:00,365 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 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:35:00,365 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:35:00,368 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 21. [2018-06-22 01:35:00,368 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:35:00,392 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 79 transitions. [2018-06-22 01:35:00,392 INFO ]: Start accepts. Automaton has 21 states and 79 transitions. Word has length 9 [2018-06-22 01:35:00,392 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:00,392 INFO ]: Abstraction has 21 states and 79 transitions. [2018-06-22 01:35:00,392 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:35:00,392 INFO ]: Start isEmpty. Operand 21 states and 79 transitions. [2018-06-22 01:35:00,393 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:35:00,393 INFO ]: Found error trace [2018-06-22 01:35:00,393 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:00,393 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:00,393 INFO ]: Analyzing trace with hash 695291532, now seen corresponding path program 1 times [2018-06-22 01:35:00,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:00,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:00,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:00,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:35:00,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:00,401 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:00,439 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:00,440 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:00,440 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:35:00,448 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:35:00,474 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:00,475 INFO ]: Computing forward predicates... [2018-06-22 01:35:00,479 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:35:00,509 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:35:00,509 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-06-22 01:35:00,509 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:35:00,509 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:35:00,509 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:35:00,510 INFO ]: Start difference. First operand 21 states and 79 transitions. Second operand 4 states. [2018-06-22 01:35:00,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:00,521 INFO ]: Finished difference Result 19 states and 55 transitions. [2018-06-22 01:35:00,521 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:35:00,521 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:35:00,521 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:00,522 INFO ]: With dead ends: 19 [2018-06-22 01:35:00,522 INFO ]: Without dead ends: 19 [2018-06-22 01:35:00,522 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:35:00,522 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:35:00,524 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-22 01:35:00,524 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:35:00,524 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2018-06-22 01:35:00,524 INFO ]: Start accepts. Automaton has 14 states and 35 transitions. Word has length 9 [2018-06-22 01:35:00,524 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:00,524 INFO ]: Abstraction has 14 states and 35 transitions. [2018-06-22 01:35:00,524 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:35:00,525 INFO ]: Start isEmpty. Operand 14 states and 35 transitions. [2018-06-22 01:35:00,525 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:35:00,525 INFO ]: Found error trace [2018-06-22 01:35:00,525 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:00,525 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:00,525 INFO ]: Analyzing trace with hash 1166674525, now seen corresponding path program 2 times [2018-06-22 01:35:00,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:00,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:00,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:00,526 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:35:00,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:00,534 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:00,596 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:00,596 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:00,596 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:35:00,604 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:35:00,621 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:35:00,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:00,622 INFO ]: Computing forward predicates... [2018-06-22 01:35:00,662 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:00,680 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:00,680 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 01:35:00,680 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:35:00,680 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:35:00,680 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:35:00,681 INFO ]: Start difference. First operand 14 states and 35 transitions. Second operand 8 states. [2018-06-22 01:35:00,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:00,911 INFO ]: Finished difference Result 18 states and 51 transitions. [2018-06-22 01:35:00,912 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:35:00,912 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-22 01:35:00,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:00,912 INFO ]: With dead ends: 18 [2018-06-22 01:35:00,912 INFO ]: Without dead ends: 18 [2018-06-22 01:35:00,913 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:35:00,913 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:35:00,914 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-22 01:35:00,914 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:35:00,915 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2018-06-22 01:35:00,915 INFO ]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 9 [2018-06-22 01:35:00,915 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:00,915 INFO ]: Abstraction has 13 states and 31 transitions. [2018-06-22 01:35:00,915 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:35:00,915 INFO ]: Start isEmpty. Operand 13 states and 31 transitions. [2018-06-22 01:35:00,915 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:35:00,915 INFO ]: Found error trace [2018-06-22 01:35:00,915 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:00,915 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:00,915 INFO ]: Analyzing trace with hash -1323328018, now seen corresponding path program 3 times [2018-06-22 01:35:00,915 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:00,915 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:00,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:00,919 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:35:00,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:00,944 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:00,997 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:00,998 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:00,998 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:35:01,004 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:35:01,033 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:35:01,033 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:01,034 INFO ]: Computing forward predicates... [2018-06-22 01:35:01,248 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:01,268 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:01,268 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 01:35:01,269 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:35:01,269 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:35:01,269 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:35:01,277 INFO ]: Start difference. First operand 13 states and 31 transitions. Second operand 10 states. [2018-06-22 01:35:01,461 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:01,461 INFO ]: Finished difference Result 22 states and 67 transitions. [2018-06-22 01:35:01,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:35:01,462 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-22 01:35:01,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:01,462 INFO ]: With dead ends: 22 [2018-06-22 01:35:01,462 INFO ]: Without dead ends: 22 [2018-06-22 01:35:01,463 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:35:01,463 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:35:01,465 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-06-22 01:35:01,465 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:35:01,465 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2018-06-22 01:35:01,465 INFO ]: Start accepts. Automaton has 14 states and 35 transitions. Word has length 10 [2018-06-22 01:35:01,465 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:01,465 INFO ]: Abstraction has 14 states and 35 transitions. [2018-06-22 01:35:01,465 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:35:01,465 INFO ]: Start isEmpty. Operand 14 states and 35 transitions. [2018-06-22 01:35:01,466 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:35:01,466 INFO ]: Found error trace [2018-06-22 01:35:01,466 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:01,466 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:01,466 INFO ]: Analyzing trace with hash -1628089948, now seen corresponding path program 4 times [2018-06-22 01:35:01,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:01,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:01,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:01,467 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:35:01,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:01,476 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:01,513 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:01,514 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:01,514 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:35:01,522 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:35:01,535 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:35:01,535 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:01,536 INFO ]: Computing forward predicates... [2018-06-22 01:35:01,579 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:01,599 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:01,599 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 01:35:01,599 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:35:01,599 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:35:01,599 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:35:01,599 INFO ]: Start difference. First operand 14 states and 35 transitions. Second operand 10 states. [2018-06-22 01:35:01,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:01,769 INFO ]: Finished difference Result 21 states and 63 transitions. [2018-06-22 01:35:01,769 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:35:01,769 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-22 01:35:01,769 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:01,770 INFO ]: With dead ends: 21 [2018-06-22 01:35:01,770 INFO ]: Without dead ends: 21 [2018-06-22 01:35:01,770 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:35:01,770 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:35:01,772 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-06-22 01:35:01,772 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:35:01,772 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2018-06-22 01:35:01,772 INFO ]: Start accepts. Automaton has 14 states and 35 transitions. Word has length 10 [2018-06-22 01:35:01,772 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:01,772 INFO ]: Abstraction has 14 states and 35 transitions. [2018-06-22 01:35:01,772 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:35:01,773 INFO ]: Start isEmpty. Operand 14 states and 35 transitions. [2018-06-22 01:35:01,773 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:35:01,773 INFO ]: Found error trace [2018-06-22 01:35:01,773 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:01,773 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:01,773 INFO ]: Analyzing trace with hash 494035102, now seen corresponding path program 2 times [2018-06-22 01:35:01,773 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:01,773 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:01,774 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:01,774 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:35:01,774 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:01,783 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:01,825 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:01,825 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:01,825 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:35:01,831 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:35:01,844 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:35:01,844 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:01,846 INFO ]: Computing forward predicates... [2018-06-22 01:35:01,899 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:01,918 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:01,918 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 01:35:01,918 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:35:01,918 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:35:01,918 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:35:01,918 INFO ]: Start difference. First operand 14 states and 35 transitions. Second operand 5 states. [2018-06-22 01:35:02,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:02,003 INFO ]: Finished difference Result 21 states and 63 transitions. [2018-06-22 01:35:02,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:35:02,004 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:35:02,004 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:02,004 INFO ]: With dead ends: 21 [2018-06-22 01:35:02,004 INFO ]: Without dead ends: 21 [2018-06-22 01:35:02,004 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:35:02,004 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:35:02,006 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-06-22 01:35:02,006 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:35:02,006 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2018-06-22 01:35:02,006 INFO ]: Start accepts. Automaton has 14 states and 35 transitions. Word has length 10 [2018-06-22 01:35:02,006 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:02,006 INFO ]: Abstraction has 14 states and 35 transitions. [2018-06-22 01:35:02,006 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:35:02,007 INFO ]: Start isEmpty. Operand 14 states and 35 transitions. [2018-06-22 01:35:02,007 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:35:02,007 INFO ]: Found error trace [2018-06-22 01:35:02,007 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:02,007 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:02,007 INFO ]: Analyzing trace with hash 1809192110, now seen corresponding path program 5 times [2018-06-22 01:35:02,007 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:02,007 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:02,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:02,008 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:35:02,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:02,016 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:02,096 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:02,096 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:02,096 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:35:02,102 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:35:02,123 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:35:02,123 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:02,124 INFO ]: Computing forward predicates... [2018-06-22 01:35:02,161 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:02,187 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:02,187 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-06-22 01:35:02,187 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:35:02,187 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:35:02,187 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:35:02,187 INFO ]: Start difference. First operand 14 states and 35 transitions. Second operand 8 states. [2018-06-22 01:35:02,394 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:02,394 INFO ]: Finished difference Result 22 states and 61 transitions. [2018-06-22 01:35:02,394 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:35:02,395 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-22 01:35:02,395 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:02,395 INFO ]: With dead ends: 22 [2018-06-22 01:35:02,395 INFO ]: Without dead ends: 22 [2018-06-22 01:35:02,395 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:35:02,395 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:35:02,397 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-06-22 01:35:02,397 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:35:02,397 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 35 transitions. [2018-06-22 01:35:02,397 INFO ]: Start accepts. Automaton has 15 states and 35 transitions. Word has length 10 [2018-06-22 01:35:02,398 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:02,398 INFO ]: Abstraction has 15 states and 35 transitions. [2018-06-22 01:35:02,398 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:35:02,398 INFO ]: Start isEmpty. Operand 15 states and 35 transitions. [2018-06-22 01:35:02,398 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:35:02,398 INFO ]: Found error trace [2018-06-22 01:35:02,398 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:02,398 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:02,398 INFO ]: Analyzing trace with hash -2051522030, now seen corresponding path program 3 times [2018-06-22 01:35:02,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:02,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:02,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:02,399 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:35:02,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:02,413 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:02,725 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:02,725 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:02,725 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:35:02,731 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:35:02,748 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:35:02,748 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:02,750 INFO ]: Computing forward predicates... [2018-06-22 01:35:04,918 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:04,951 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:04,951 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-22 01:35:04,951 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:35:04,952 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:35:04,952 INFO ]: CoverageRelationStatistics Valid=32, Invalid=77, Unknown=1, NotChecked=0, Total=110 [2018-06-22 01:35:04,952 INFO ]: Start difference. First operand 15 states and 35 transitions. Second operand 11 states. [2018-06-22 01:35:05,608 WARN ]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-06-22 01:35:18,742 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:18,743 INFO ]: Finished difference Result 23 states and 67 transitions. [2018-06-22 01:35:18,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:35:18,743 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-22 01:35:18,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:18,743 INFO ]: With dead ends: 23 [2018-06-22 01:35:18,743 INFO ]: Without dead ends: 23 [2018-06-22 01:35:18,743 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=74, Invalid=165, Unknown=1, NotChecked=0, Total=240 [2018-06-22 01:35:18,744 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:35:18,745 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-06-22 01:35:18,745 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:35:18,746 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2018-06-22 01:35:18,746 INFO ]: Start accepts. Automaton has 20 states and 55 transitions. Word has length 11 [2018-06-22 01:35:18,746 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:18,746 INFO ]: Abstraction has 20 states and 55 transitions. [2018-06-22 01:35:18,746 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:35:18,746 INFO ]: Start isEmpty. Operand 20 states and 55 transitions. [2018-06-22 01:35:18,746 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:35:18,746 INFO ]: Found error trace [2018-06-22 01:35:18,746 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:18,747 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:18,756 INFO ]: Analyzing trace with hash -2061680761, now seen corresponding path program 6 times [2018-06-22 01:35:18,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:18,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:18,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:18,756 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:35:18,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:18,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:18,882 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:18,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:18,882 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:35:18,890 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:35:18,907 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-22 01:35:18,907 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:18,908 INFO ]: Computing forward predicates... [2018-06-22 01:35:19,155 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:19,173 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:19,173 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 01:35:19,174 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:35:19,174 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:35:19,174 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:35:19,174 INFO ]: Start difference. First operand 20 states and 55 transitions. Second operand 12 states. [2018-06-22 01:35:19,513 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:19,513 INFO ]: Finished difference Result 35 states and 115 transitions. [2018-06-22 01:35:19,513 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:35:19,513 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-22 01:35:19,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:19,514 INFO ]: With dead ends: 35 [2018-06-22 01:35:19,514 INFO ]: Without dead ends: 35 [2018-06-22 01:35:19,514 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:35:19,514 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 01:35:19,516 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-06-22 01:35:19,516 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:35:19,518 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2018-06-22 01:35:19,518 INFO ]: Start accepts. Automaton has 23 states and 67 transitions. Word has length 11 [2018-06-22 01:35:19,518 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:19,518 INFO ]: Abstraction has 23 states and 67 transitions. [2018-06-22 01:35:19,518 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:35:19,518 INFO ]: Start isEmpty. Operand 23 states and 67 transitions. [2018-06-22 01:35:19,518 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:35:19,518 INFO ]: Found error trace [2018-06-22 01:35:19,518 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:19,518 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:19,519 INFO ]: Analyzing trace with hash 1928524605, now seen corresponding path program 7 times [2018-06-22 01:35:19,519 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:19,519 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:19,519 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:19,519 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:35:19,519 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:19,527 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:19,608 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:19,608 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:19,608 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:35:19,614 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:35:19,627 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:19,628 INFO ]: Computing forward predicates... [2018-06-22 01:35:19,710 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:19,730 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:19,730 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 01:35:19,730 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:35:19,730 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:35:19,730 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:35:19,731 INFO ]: Start difference. First operand 23 states and 67 transitions. Second operand 12 states. [2018-06-22 01:35:20,051 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:20,051 INFO ]: Finished difference Result 34 states and 111 transitions. [2018-06-22 01:35:20,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:35:20,051 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-22 01:35:20,051 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:20,052 INFO ]: With dead ends: 34 [2018-06-22 01:35:20,052 INFO ]: Without dead ends: 34 [2018-06-22 01:35:20,052 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:35:20,052 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:35:20,054 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 22. [2018-06-22 01:35:20,054 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:35:20,057 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2018-06-22 01:35:20,057 INFO ]: Start accepts. Automaton has 22 states and 65 transitions. Word has length 11 [2018-06-22 01:35:20,057 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:20,057 INFO ]: Abstraction has 22 states and 65 transitions. [2018-06-22 01:35:20,057 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:35:20,057 INFO ]: Start isEmpty. Operand 22 states and 65 transitions. [2018-06-22 01:35:20,057 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:35:20,057 INFO ]: Found error trace [2018-06-22 01:35:20,057 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:20,058 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:20,058 INFO ]: Analyzing trace with hash 1070839367, now seen corresponding path program 8 times [2018-06-22 01:35:20,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:20,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:20,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:20,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:35:20,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:20,068 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:20,227 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:20,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:20,227 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:35:20,233 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:35:20,262 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:35:20,262 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:20,263 INFO ]: Computing forward predicates... [2018-06-22 01:35:20,312 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:20,332 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:20,332 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 01:35:20,332 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:35:20,332 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:35:20,332 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:35:20,332 INFO ]: Start difference. First operand 22 states and 65 transitions. Second operand 12 states. [2018-06-22 01:35:20,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:20,637 INFO ]: Finished difference Result 31 states and 101 transitions. [2018-06-22 01:35:20,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:35:20,637 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-22 01:35:20,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:20,638 INFO ]: With dead ends: 31 [2018-06-22 01:35:20,638 INFO ]: Without dead ends: 31 [2018-06-22 01:35:20,638 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:35:20,638 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:35:20,640 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-06-22 01:35:20,640 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:35:20,641 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2018-06-22 01:35:20,641 INFO ]: Start accepts. Automaton has 22 states and 65 transitions. Word has length 11 [2018-06-22 01:35:20,641 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:20,641 INFO ]: Abstraction has 22 states and 65 transitions. [2018-06-22 01:35:20,641 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:35:20,641 INFO ]: Start isEmpty. Operand 22 states and 65 transitions. [2018-06-22 01:35:20,641 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:35:20,641 INFO ]: Found error trace [2018-06-22 01:35:20,641 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:20,641 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:20,641 INFO ]: Analyzing trace with hash -1862760819, now seen corresponding path program 3 times [2018-06-22 01:35:20,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:20,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:20,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:20,642 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:35:20,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:20,649 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:20,740 INFO ]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:20,740 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:20,740 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:35:20,748 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:35:20,762 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:35:20,762 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:20,763 INFO ]: Computing forward predicates... [2018-06-22 01:35:20,805 INFO ]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:20,825 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:20,825 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:35:20,825 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:35:20,825 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:35:20,825 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:35:20,826 INFO ]: Start difference. First operand 22 states and 65 transitions. Second operand 6 states. [2018-06-22 01:35:20,898 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:20,898 INFO ]: Finished difference Result 32 states and 101 transitions. [2018-06-22 01:35:20,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:35:20,898 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-22 01:35:20,898 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:20,899 INFO ]: With dead ends: 32 [2018-06-22 01:35:20,899 INFO ]: Without dead ends: 32 [2018-06-22 01:35:20,899 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:35:20,899 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:35:20,901 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 21. [2018-06-22 01:35:20,901 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:35:20,901 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2018-06-22 01:35:20,901 INFO ]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 11 [2018-06-22 01:35:20,901 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:20,901 INFO ]: Abstraction has 21 states and 59 transitions. [2018-06-22 01:35:20,901 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:35:20,901 INFO ]: Start isEmpty. Operand 21 states and 59 transitions. [2018-06-22 01:35:20,902 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:35:20,902 INFO ]: Found error trace [2018-06-22 01:35:20,902 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:20,902 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:20,902 INFO ]: Analyzing trace with hash 819187982, now seen corresponding path program 9 times [2018-06-22 01:35:20,902 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:20,902 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:20,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:20,903 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:35:20,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:20,911 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:20,981 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:20,981 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:20,981 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:35:20,987 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:35:21,022 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:35:21,022 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:21,023 INFO ]: Computing forward predicates... [2018-06-22 01:35:21,143 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:21,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:21,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 01:35:21,162 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:35:21,162 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:35:21,162 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:35:21,163 INFO ]: Start difference. First operand 21 states and 59 transitions. Second operand 14 states. [2018-06-22 01:35:21,664 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:21,664 INFO ]: Finished difference Result 45 states and 155 transitions. [2018-06-22 01:35:21,665 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:35:21,665 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-22 01:35:21,665 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:21,665 INFO ]: With dead ends: 45 [2018-06-22 01:35:21,665 INFO ]: Without dead ends: 45 [2018-06-22 01:35:21,665 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:35:21,665 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:35:21,668 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 25. [2018-06-22 01:35:21,668 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:35:21,668 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 75 transitions. [2018-06-22 01:35:21,668 INFO ]: Start accepts. Automaton has 25 states and 75 transitions. Word has length 12 [2018-06-22 01:35:21,668 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:21,668 INFO ]: Abstraction has 25 states and 75 transitions. [2018-06-22 01:35:21,668 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:35:21,668 INFO ]: Start isEmpty. Operand 25 states and 75 transitions. [2018-06-22 01:35:21,669 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:35:21,669 INFO ]: Found error trace [2018-06-22 01:35:21,669 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:21,669 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:21,669 INFO ]: Analyzing trace with hash 514426052, now seen corresponding path program 10 times [2018-06-22 01:35:21,669 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:21,669 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:21,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:21,670 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:35:21,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:21,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:21,975 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:21,975 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:21,975 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:35:21,981 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:35:22,000 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:35:22,000 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:22,002 INFO ]: Computing forward predicates... [2018-06-22 01:35:22,123 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:22,142 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:22,142 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 01:35:22,143 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:35:22,143 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:35:22,143 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:35:22,143 INFO ]: Start difference. First operand 25 states and 75 transitions. Second operand 14 states. [2018-06-22 01:35:22,475 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:22,475 INFO ]: Finished difference Result 46 states and 159 transitions. [2018-06-22 01:35:22,475 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:35:22,475 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-22 01:35:22,475 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:22,476 INFO ]: With dead ends: 46 [2018-06-22 01:35:22,476 INFO ]: Without dead ends: 46 [2018-06-22 01:35:22,476 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:35:22,476 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 01:35:22,478 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 25. [2018-06-22 01:35:22,478 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:35:22,479 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 75 transitions. [2018-06-22 01:35:22,479 INFO ]: Start accepts. Automaton has 25 states and 75 transitions. Word has length 12 [2018-06-22 01:35:22,479 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:22,479 INFO ]: Abstraction has 25 states and 75 transitions. [2018-06-22 01:35:22,479 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:35:22,479 INFO ]: Start isEmpty. Operand 25 states and 75 transitions. [2018-06-22 01:35:22,479 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:35:22,479 INFO ]: Found error trace [2018-06-22 01:35:22,479 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:22,479 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:22,479 INFO ]: Analyzing trace with hash -343259186, now seen corresponding path program 11 times [2018-06-22 01:35:22,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:22,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:22,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:22,481 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:35:22,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:22,487 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:22,567 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:22,568 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:22,568 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:35:22,574 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:35:22,590 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:35:22,590 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:22,591 INFO ]: Computing forward predicates... [2018-06-22 01:35:22,607 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:22,626 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:22,626 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:35:22,627 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:35:22,627 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:35:22,627 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:35:22,627 INFO ]: Start difference. First operand 25 states and 75 transitions. Second operand 8 states. [2018-06-22 01:35:23,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:23,065 INFO ]: Finished difference Result 42 states and 143 transitions. [2018-06-22 01:35:23,066 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:35:23,066 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-22 01:35:23,066 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:23,066 INFO ]: With dead ends: 42 [2018-06-22 01:35:23,066 INFO ]: Without dead ends: 42 [2018-06-22 01:35:23,066 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:35:23,066 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:35:23,070 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 24. [2018-06-22 01:35:23,070 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:35:23,071 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 73 transitions. [2018-06-22 01:35:23,071 INFO ]: Start accepts. Automaton has 24 states and 73 transitions. Word has length 12 [2018-06-22 01:35:23,071 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:23,071 INFO ]: Abstraction has 24 states and 73 transitions. [2018-06-22 01:35:23,071 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:35:23,071 INFO ]: Start isEmpty. Operand 24 states and 73 transitions. [2018-06-22 01:35:23,071 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:35:23,071 INFO ]: Found error trace [2018-06-22 01:35:23,071 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:23,071 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:23,071 INFO ]: Analyzing trace with hash -1161697788, now seen corresponding path program 12 times [2018-06-22 01:35:23,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:23,071 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:23,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:23,072 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:35:23,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:23,079 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:23,149 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:23,149 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:23,149 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:35:23,155 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:35:23,172 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:35:23,173 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:23,174 INFO ]: Computing forward predicates... [2018-06-22 01:35:23,261 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:23,279 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:23,280 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 01:35:23,280 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:35:23,280 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:35:23,280 INFO ]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:35:23,280 INFO ]: Start difference. First operand 24 states and 73 transitions. Second operand 14 states. [2018-06-22 01:35:23,978 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:23,978 INFO ]: Finished difference Result 38 states and 129 transitions. [2018-06-22 01:35:23,978 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:35:23,978 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-22 01:35:23,978 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:23,979 INFO ]: With dead ends: 38 [2018-06-22 01:35:23,979 INFO ]: Without dead ends: 38 [2018-06-22 01:35:23,979 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:35:23,979 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:35:23,981 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 24. [2018-06-22 01:35:23,981 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:35:23,982 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 73 transitions. [2018-06-22 01:35:23,982 INFO ]: Start accepts. Automaton has 24 states and 73 transitions. Word has length 12 [2018-06-22 01:35:23,982 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:23,982 INFO ]: Abstraction has 24 states and 73 transitions. [2018-06-22 01:35:23,982 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:35:23,982 INFO ]: Start isEmpty. Operand 24 states and 73 transitions. [2018-06-22 01:35:23,982 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:35:23,982 INFO ]: Found error trace [2018-06-22 01:35:23,982 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:23,982 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:23,982 INFO ]: Analyzing trace with hash -1908990338, now seen corresponding path program 4 times [2018-06-22 01:35:23,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:23,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:23,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:23,983 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:35:23,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:23,991 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:24,049 INFO ]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:24,049 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:24,049 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:35:24,055 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:35:24,071 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:35:24,071 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:24,072 INFO ]: Computing forward predicates... [2018-06-22 01:35:24,127 INFO ]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:24,146 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:24,146 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:35:24,146 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:35:24,146 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:35:24,146 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:35:24,146 INFO ]: Start difference. First operand 24 states and 73 transitions. Second operand 7 states. [2018-06-22 01:35:24,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:24,215 INFO ]: Finished difference Result 36 states and 117 transitions. [2018-06-22 01:35:24,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:35:24,218 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-22 01:35:24,218 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:24,218 INFO ]: With dead ends: 36 [2018-06-22 01:35:24,218 INFO ]: Without dead ends: 36 [2018-06-22 01:35:24,218 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:35:24,218 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:35:24,220 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 22. [2018-06-22 01:35:24,220 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:35:24,220 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2018-06-22 01:35:24,221 INFO ]: Start accepts. Automaton has 22 states and 63 transitions. Word has length 12 [2018-06-22 01:35:24,221 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:24,221 INFO ]: Abstraction has 22 states and 63 transitions. [2018-06-22 01:35:24,221 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:35:24,221 INFO ]: Start isEmpty. Operand 22 states and 63 transitions. [2018-06-22 01:35:24,221 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:35:24,221 INFO ]: Found error trace [2018-06-22 01:35:24,221 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:24,221 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:24,221 INFO ]: Analyzing trace with hash -68194201, now seen corresponding path program 13 times [2018-06-22 01:35:24,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:24,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:24,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:24,222 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:35:24,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:24,229 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:24,576 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:24,576 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:35:24,576 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:35:24,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:35:24,608 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:35:24,610 INFO ]: Computing forward predicates... [2018-06-22 01:35:24,819 INFO ]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:35:24,838 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:35:24,838 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 01:35:24,838 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:35:24,838 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:35:24,838 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:35:24,838 INFO ]: Start difference. First operand 22 states and 63 transitions. Second operand 14 states. [2018-06-22 01:35:25,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:35:25,935 INFO ]: Finished difference Result 50 states and 125 transitions. [2018-06-22 01:35:25,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:35:25,935 INFO ]: Start accepts. Automaton has 14 states. Word has length 13 [2018-06-22 01:35:25,935 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:35:25,936 INFO ]: With dead ends: 50 [2018-06-22 01:35:25,936 INFO ]: Without dead ends: 33 [2018-06-22 01:35:25,936 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=476, Invalid=1416, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:35:25,936 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:35:25,938 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-06-22 01:35:25,938 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:35:25,938 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 67 transitions. [2018-06-22 01:35:25,938 INFO ]: Start accepts. Automaton has 24 states and 67 transitions. Word has length 13 [2018-06-22 01:35:25,938 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:35:25,938 INFO ]: Abstraction has 24 states and 67 transitions. [2018-06-22 01:35:25,938 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:35:25,938 INFO ]: Start isEmpty. Operand 24 states and 67 transitions. [2018-06-22 01:35:25,939 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:35:25,939 INFO ]: Found error trace [2018-06-22 01:35:25,939 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:35:25,939 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:35:25,939 INFO ]: Analyzing trace with hash -219744030, now seen corresponding path program 1 times [2018-06-22 01:35:25,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:35:25,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:35:25,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:25,940 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:35:25,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:35:25,959 INFO ]: Conjunction of SSA is sat [2018-06-22 01:35:25,960 INFO ]: Counterexample might be feasible [2018-06-22 01:35:25,973 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:35:25 BoogieIcfgContainer [2018-06-22 01:35:25,973 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:35:25,974 INFO ]: Toolchain (without parser) took 29313.21 ms. Allocated memory was 303.0 MB in the beginning and 432.5 MB in the end (delta: 129.5 MB). Free memory was 255.4 MB in the beginning and 401.6 MB in the end (delta: -146.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:35:25,975 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 266.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:35:25,975 INFO ]: ChcToBoogie took 58.40 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 253.4 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:35:25,975 INFO ]: Boogie Preprocessor took 41.25 ms. Allocated memory is still 303.0 MB. Free memory was 253.4 MB in the beginning and 251.4 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:35:25,976 INFO ]: RCFGBuilder took 370.89 ms. Allocated memory is still 303.0 MB. Free memory was 251.4 MB in the beginning and 240.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:35:25,976 INFO ]: TraceAbstraction took 28835.68 ms. Allocated memory was 303.0 MB in the beginning and 432.5 MB in the end (delta: 129.5 MB). Free memory was 239.4 MB in the beginning and 401.6 MB in the end (delta: -162.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:35:25,978 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 266.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.40 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 41.25 ms. Allocated memory is still 303.0 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 370.89 ms. Allocated memory is still 303.0 MB. Free memory was 251.4 MB in the beginning and 240.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 28835.68 ms. Allocated memory was 303.0 MB in the beginning and 432.5 MB in the end (delta: 129.5 MB). Free memory was 239.4 MB in the beginning and 401.6 MB in the end (delta: -162.2 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] assume (-1 * hbv_False_3_Int == 0 && !(hbv_False_4_Int == hbv_False_5_Int)) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_False_1_Int, hbv_False_4_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_5_Int; [L0] havoc hbv_False_3_Int, hbv_False_2_Int, hbv_False_5_Int, hbv_False_1_Int, hbv_False_4_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -32 == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int) && hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int; [L0] assume ((((((hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hbv_REC_f_f_2_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -31 == hbv_REC_f_f_3_Int) && hbv_REC_f_f_2_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_3_Int; [L0] assume ((hhv_REC_f_f_4_Int == hhv_REC_f_f_3_Int && hhv_REC_f_f_2_Int <= 0) && hhv_REC_f_f_0_Int <= 0) && -1 * hhv_REC_f_f_1_Int == 0; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. UNSAFE Result, 28.7s OverallTime, 24 OverallIterations, 5 TraceHistogramMax, 20.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 249 SDtfs, 105 SDslu, 844 SDs, 0 SdLazy, 2003 SolverSat, 583 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 446 GetRequests, 168 SyntacticMatches, 15 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=18, 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.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 216 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 470 NumberOfCodeBlocks, 470 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 413 ConstructedInterpolants, 22 QuantifiedInterpolants, 15810 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2498 ConjunctsInSsa, 507 ConjunctsInUnsatCore, 44 InterpolantComputations, 3 PerfectInterpolantSequences, 46/369 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-35-25-987.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-35-25-987.csv Received shutdown request...