java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:13:33,232 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:13:33,234 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:13:33,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:13:33,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:13:33,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:13:33,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:13:33,254 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:13:33,257 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:13:33,258 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:13:33,258 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:13:33,259 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:13:33,259 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:13:33,262 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:13:33,270 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:13:33,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:13:33,272 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:13:33,275 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:13:33,277 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:13:33,278 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:13:33,281 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:13:33,284 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:13:33,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:13:33,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:13:33,288 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:13:33,289 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:13:33,289 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:13:33,290 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:13:33,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:13:33,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:13:33,294 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:13:33,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:13:33,295 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:13:33,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:13:33,297 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:13:33,297 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:13:33,317 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:13:33,317 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:13:33,318 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:13:33,318 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:13:33,321 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:13:33,322 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:13:33,322 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:13:33,322 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:13:33,322 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:13:33,322 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:13:33,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:13:33,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:13:33,323 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:13:33,323 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:13:33,323 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:13:33,324 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:13:33,324 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:13:33,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:13:33,324 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:13:33,326 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:13:33,326 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:13:33,376 INFO ]: Repository-Root is: /tmp [2018-06-22 11:13:33,390 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:13:33,395 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:13:33,398 INFO ]: Initializing SmtParser... [2018-06-22 11:13:33,398 INFO ]: SmtParser initialized [2018-06-22 11:13:33,399 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 [2018-06-22 11:13:33,401 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:13:33,491 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 unknown [2018-06-22 11:13:33,769 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 [2018-06-22 11:13:33,774 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:13:33,781 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:13:33,781 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:13:33,781 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:13:33,781 INFO ]: ChcToBoogie initialized [2018-06-22 11:13:33,785 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:13:33" (1/1) ... [2018-06-22 11:13:33,839 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:33 Unit [2018-06-22 11:13:33,840 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:13:33,840 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:13:33,840 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:13:33,840 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:13:33,865 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:33" (1/1) ... [2018-06-22 11:13:33,866 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:33" (1/1) ... [2018-06-22 11:13:33,884 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:33" (1/1) ... [2018-06-22 11:13:33,885 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:33" (1/1) ... [2018-06-22 11:13:33,891 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:33" (1/1) ... [2018-06-22 11:13:33,903 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:33" (1/1) ... [2018-06-22 11:13:33,905 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:33" (1/1) ... [2018-06-22 11:13:33,907 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:13:33,908 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:13:33,908 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:13:33,908 INFO ]: RCFGBuilder initialized [2018-06-22 11:13:33,909 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:33" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:13:33,931 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:13:33,931 INFO ]: Found specification of procedure False [2018-06-22 11:13:33,931 INFO ]: Found implementation of procedure False [2018-06-22 11:13:33,931 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:13:33,931 INFO ]: Found specification of procedure REC__f [2018-06-22 11:13:33,932 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:13:33,932 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:13:33,932 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:13:33,932 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:13:33,932 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:13:33,932 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:13:33,932 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:13:33,932 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:13:33,932 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:13:33,932 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:13:34,571 INFO ]: Using library mode [2018-06-22 11:13:34,572 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:13:34 BoogieIcfgContainer [2018-06-22 11:13:34,572 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:13:34,573 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:13:34,573 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:13:34,576 INFO ]: TraceAbstraction initialized [2018-06-22 11:13:34,576 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:13:33" (1/3) ... [2018-06-22 11:13:34,577 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbbdc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:13:34, skipping insertion in model container [2018-06-22 11:13:34,577 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:33" (2/3) ... [2018-06-22 11:13:34,577 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbbdc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:13:34, skipping insertion in model container [2018-06-22 11:13:34,577 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:13:34" (3/3) ... [2018-06-22 11:13:34,580 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:13:34,589 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:13:34,600 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:13:34,651 INFO ]: Using default assertion order modulation [2018-06-22 11:13:34,652 INFO ]: Interprodecural is true [2018-06-22 11:13:34,652 INFO ]: Hoare is false [2018-06-22 11:13:34,652 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:13:34,652 INFO ]: Backedges is TWOTRACK [2018-06-22 11:13:34,652 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:13:34,652 INFO ]: Difference is false [2018-06-22 11:13:34,652 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:13:34,652 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:13:34,673 INFO ]: Start isEmpty. Operand 42 states. [2018-06-22 11:13:34,697 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:13:34,697 INFO ]: Found error trace [2018-06-22 11:13:34,698 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:13:34,698 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:34,703 INFO ]: Analyzing trace with hash 215063616, now seen corresponding path program 1 times [2018-06-22 11:13:34,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:34,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:34,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:34,745 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:34,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:34,760 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:34,787 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:13:34,790 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:34,790 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:13:34,791 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:13:34,802 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:13:34,803 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:13:34,805 INFO ]: Start difference. First operand 42 states. Second operand 2 states. [2018-06-22 11:13:34,838 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:34,838 INFO ]: Finished difference Result 36 states and 78 transitions. [2018-06-22 11:13:34,838 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:13:34,842 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:13:34,843 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:34,861 INFO ]: With dead ends: 36 [2018-06-22 11:13:34,861 INFO ]: Without dead ends: 36 [2018-06-22 11:13:34,864 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:13:34,882 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:13:34,926 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 11:13:34,927 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:13:34,929 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 78 transitions. [2018-06-22 11:13:34,931 INFO ]: Start accepts. Automaton has 36 states and 78 transitions. Word has length 5 [2018-06-22 11:13:34,931 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:34,931 INFO ]: Abstraction has 36 states and 78 transitions. [2018-06-22 11:13:34,931 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:13:34,931 INFO ]: Start isEmpty. Operand 36 states and 78 transitions. [2018-06-22 11:13:34,936 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:13:34,936 INFO ]: Found error trace [2018-06-22 11:13:34,936 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:34,936 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:34,937 INFO ]: Analyzing trace with hash 1655952842, now seen corresponding path program 1 times [2018-06-22 11:13:34,937 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:34,937 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:34,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:34,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:34,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:34,962 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:35,054 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:13:35,055 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:35,055 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:35,056 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:35,056 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:35,056 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:35,056 INFO ]: Start difference. First operand 36 states and 78 transitions. Second operand 4 states. [2018-06-22 11:13:35,484 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:35,484 INFO ]: Finished difference Result 36 states and 77 transitions. [2018-06-22 11:13:35,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:35,484 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:13:35,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:35,486 INFO ]: With dead ends: 36 [2018-06-22 11:13:35,486 INFO ]: Without dead ends: 35 [2018-06-22 11:13:35,487 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:35,487 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:13:35,495 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 11:13:35,495 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:13:35,497 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 75 transitions. [2018-06-22 11:13:35,497 INFO ]: Start accepts. Automaton has 35 states and 75 transitions. Word has length 9 [2018-06-22 11:13:35,497 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:35,497 INFO ]: Abstraction has 35 states and 75 transitions. [2018-06-22 11:13:35,497 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:35,497 INFO ]: Start isEmpty. Operand 35 states and 75 transitions. [2018-06-22 11:13:35,500 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:13:35,500 INFO ]: Found error trace [2018-06-22 11:13:35,500 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:35,500 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:35,500 INFO ]: Analyzing trace with hash -82209960, now seen corresponding path program 1 times [2018-06-22 11:13:35,500 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:35,500 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:35,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:35,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:35,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:35,508 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:35,539 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:13:35,539 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:35,539 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:35,539 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:35,540 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:35,540 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:35,540 INFO ]: Start difference. First operand 35 states and 75 transitions. Second operand 4 states. [2018-06-22 11:13:35,623 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:35,623 INFO ]: Finished difference Result 39 states and 82 transitions. [2018-06-22 11:13:35,623 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:35,623 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:13:35,623 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:35,625 INFO ]: With dead ends: 39 [2018-06-22 11:13:35,625 INFO ]: Without dead ends: 39 [2018-06-22 11:13:35,625 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:35,625 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:13:35,637 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-06-22 11:13:35,637 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:13:35,638 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 80 transitions. [2018-06-22 11:13:35,638 INFO ]: Start accepts. Automaton has 37 states and 80 transitions. Word has length 9 [2018-06-22 11:13:35,639 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:35,639 INFO ]: Abstraction has 37 states and 80 transitions. [2018-06-22 11:13:35,639 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:35,639 INFO ]: Start isEmpty. Operand 37 states and 80 transitions. [2018-06-22 11:13:35,641 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:13:35,641 INFO ]: Found error trace [2018-06-22 11:13:35,641 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:35,641 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:35,641 INFO ]: Analyzing trace with hash 1781048475, now seen corresponding path program 1 times [2018-06-22 11:13:35,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:35,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:35,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:35,642 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:35,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:35,646 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:35,684 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:13:35,684 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:35,684 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:35,685 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:35,685 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:35,685 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:35,685 INFO ]: Start difference. First operand 37 states and 80 transitions. Second operand 4 states. [2018-06-22 11:13:35,916 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:35,916 INFO ]: Finished difference Result 39 states and 81 transitions. [2018-06-22 11:13:35,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:35,916 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:13:35,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:35,918 INFO ]: With dead ends: 39 [2018-06-22 11:13:35,918 INFO ]: Without dead ends: 38 [2018-06-22 11:13:35,918 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:35,918 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:13:35,926 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-06-22 11:13:35,926 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:13:35,928 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 77 transitions. [2018-06-22 11:13:35,928 INFO ]: Start accepts. Automaton has 36 states and 77 transitions. Word has length 9 [2018-06-22 11:13:35,928 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:35,928 INFO ]: Abstraction has 36 states and 77 transitions. [2018-06-22 11:13:35,928 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:35,928 INFO ]: Start isEmpty. Operand 36 states and 77 transitions. [2018-06-22 11:13:35,929 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:13:35,929 INFO ]: Found error trace [2018-06-22 11:13:35,929 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:35,930 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:35,930 INFO ]: Analyzing trace with hash 1564940008, now seen corresponding path program 1 times [2018-06-22 11:13:35,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:35,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:35,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:35,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:35,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:35,936 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:35,968 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:13:35,968 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:35,968 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:35,968 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:35,968 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:35,968 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:35,968 INFO ]: Start difference. First operand 36 states and 77 transitions. Second operand 4 states. [2018-06-22 11:13:36,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:36,070 INFO ]: Finished difference Result 40 states and 86 transitions. [2018-06-22 11:13:36,070 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:36,070 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:13:36,070 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:36,071 INFO ]: With dead ends: 40 [2018-06-22 11:13:36,071 INFO ]: Without dead ends: 40 [2018-06-22 11:13:36,071 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:36,071 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:13:36,079 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-06-22 11:13:36,079 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:13:36,080 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 84 transitions. [2018-06-22 11:13:36,081 INFO ]: Start accepts. Automaton has 38 states and 84 transitions. Word has length 9 [2018-06-22 11:13:36,081 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:36,081 INFO ]: Abstraction has 38 states and 84 transitions. [2018-06-22 11:13:36,081 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:36,081 INFO ]: Start isEmpty. Operand 38 states and 84 transitions. [2018-06-22 11:13:36,082 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:13:36,082 INFO ]: Found error trace [2018-06-22 11:13:36,082 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:36,082 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:36,082 INFO ]: Analyzing trace with hash 1622198310, now seen corresponding path program 1 times [2018-06-22 11:13:36,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:36,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:36,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:36,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:36,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:36,089 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:36,234 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:13:36,234 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:36,234 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:36,235 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:36,235 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:36,235 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:36,235 INFO ]: Start difference. First operand 38 states and 84 transitions. Second operand 4 states. [2018-06-22 11:13:36,279 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:36,279 INFO ]: Finished difference Result 40 states and 91 transitions. [2018-06-22 11:13:36,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:36,282 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:13:36,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:36,283 INFO ]: With dead ends: 40 [2018-06-22 11:13:36,283 INFO ]: Without dead ends: 40 [2018-06-22 11:13:36,284 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:36,284 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:13:36,289 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-06-22 11:13:36,289 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:13:36,291 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 84 transitions. [2018-06-22 11:13:36,291 INFO ]: Start accepts. Automaton has 38 states and 84 transitions. Word has length 9 [2018-06-22 11:13:36,291 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:36,291 INFO ]: Abstraction has 38 states and 84 transitions. [2018-06-22 11:13:36,291 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:36,291 INFO ]: Start isEmpty. Operand 38 states and 84 transitions. [2018-06-22 11:13:36,292 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:36,292 INFO ]: Found error trace [2018-06-22 11:13:36,292 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:36,292 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:36,292 INFO ]: Analyzing trace with hash 1855136313, now seen corresponding path program 1 times [2018-06-22 11:13:36,293 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:36,293 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:36,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:36,293 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:36,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:36,300 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:36,322 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:13:36,322 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:36,323 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:36,323 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:36,323 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:36,323 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:36,323 INFO ]: Start difference. First operand 38 states and 84 transitions. Second operand 4 states. [2018-06-22 11:13:36,752 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:36,752 INFO ]: Finished difference Result 42 states and 94 transitions. [2018-06-22 11:13:36,754 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:36,754 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:13:36,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:36,755 INFO ]: With dead ends: 42 [2018-06-22 11:13:36,755 INFO ]: Without dead ends: 41 [2018-06-22 11:13:36,755 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:36,755 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:13:36,759 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-06-22 11:13:36,759 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:13:36,760 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 80 transitions. [2018-06-22 11:13:36,760 INFO ]: Start accepts. Automaton has 37 states and 80 transitions. Word has length 13 [2018-06-22 11:13:36,760 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:36,760 INFO ]: Abstraction has 37 states and 80 transitions. [2018-06-22 11:13:36,760 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:36,760 INFO ]: Start isEmpty. Operand 37 states and 80 transitions. [2018-06-22 11:13:36,761 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:36,761 INFO ]: Found error trace [2018-06-22 11:13:36,761 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:36,761 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:36,761 INFO ]: Analyzing trace with hash -402422825, now seen corresponding path program 1 times [2018-06-22 11:13:36,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:36,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:36,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:36,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:36,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:36,769 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:36,791 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:13:36,791 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:36,791 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:36,791 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:36,791 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:36,791 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:36,792 INFO ]: Start difference. First operand 37 states and 80 transitions. Second operand 4 states. [2018-06-22 11:13:36,882 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:36,882 INFO ]: Finished difference Result 43 states and 96 transitions. [2018-06-22 11:13:36,883 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:36,883 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:13:36,883 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:36,884 INFO ]: With dead ends: 43 [2018-06-22 11:13:36,884 INFO ]: Without dead ends: 43 [2018-06-22 11:13:36,884 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:36,884 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:13:36,892 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-06-22 11:13:36,892 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:13:36,893 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 84 transitions. [2018-06-22 11:13:36,893 INFO ]: Start accepts. Automaton has 39 states and 84 transitions. Word has length 13 [2018-06-22 11:13:36,893 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:36,893 INFO ]: Abstraction has 39 states and 84 transitions. [2018-06-22 11:13:36,893 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:36,893 INFO ]: Start isEmpty. Operand 39 states and 84 transitions. [2018-06-22 11:13:36,894 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:36,894 INFO ]: Found error trace [2018-06-22 11:13:36,894 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:36,894 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:36,895 INFO ]: Analyzing trace with hash -1211769451, now seen corresponding path program 1 times [2018-06-22 11:13:36,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:36,895 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:36,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:36,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:36,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:36,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:37,031 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:13:37,031 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:37,031 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:13:37,032 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:13:37,032 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:13:37,032 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:13:37,032 INFO ]: Start difference. First operand 39 states and 84 transitions. Second operand 6 states. [2018-06-22 11:13:37,495 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:37,495 INFO ]: Finished difference Result 51 states and 115 transitions. [2018-06-22 11:13:37,496 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:13:37,496 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:13:37,496 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:37,496 INFO ]: With dead ends: 51 [2018-06-22 11:13:37,496 INFO ]: Without dead ends: 51 [2018-06-22 11:13:37,497 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:13:37,497 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:13:37,504 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 43. [2018-06-22 11:13:37,504 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:13:37,505 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 96 transitions. [2018-06-22 11:13:37,505 INFO ]: Start accepts. Automaton has 43 states and 96 transitions. Word has length 13 [2018-06-22 11:13:37,505 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:37,505 INFO ]: Abstraction has 43 states and 96 transitions. [2018-06-22 11:13:37,505 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:13:37,505 INFO ]: Start isEmpty. Operand 43 states and 96 transitions. [2018-06-22 11:13:37,506 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:37,506 INFO ]: Found error trace [2018-06-22 11:13:37,506 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:37,506 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:37,506 INFO ]: Analyzing trace with hash -129019948, now seen corresponding path program 1 times [2018-06-22 11:13:37,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:37,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:37,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:37,507 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:37,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:37,517 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:37,546 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:13:37,546 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:37,547 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:37,547 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:37,547 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:37,547 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:37,547 INFO ]: Start difference. First operand 43 states and 96 transitions. Second operand 4 states. [2018-06-22 11:13:37,626 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:37,626 INFO ]: Finished difference Result 43 states and 94 transitions. [2018-06-22 11:13:37,627 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:37,627 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:13:37,627 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:37,627 INFO ]: With dead ends: 43 [2018-06-22 11:13:37,627 INFO ]: Without dead ends: 42 [2018-06-22 11:13:37,628 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:37,628 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:13:37,634 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-06-22 11:13:37,634 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:13:37,635 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 87 transitions. [2018-06-22 11:13:37,635 INFO ]: Start accepts. Automaton has 40 states and 87 transitions. Word has length 13 [2018-06-22 11:13:37,635 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:37,635 INFO ]: Abstraction has 40 states and 87 transitions. [2018-06-22 11:13:37,635 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:37,635 INFO ]: Start isEmpty. Operand 40 states and 87 transitions. [2018-06-22 11:13:37,636 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:37,636 INFO ]: Found error trace [2018-06-22 11:13:37,636 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:37,636 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:37,636 INFO ]: Analyzing trace with hash -114990997, now seen corresponding path program 1 times [2018-06-22 11:13:37,636 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:37,636 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:37,637 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:37,637 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:37,637 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:37,643 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:37,669 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:13:37,669 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:37,669 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:37,670 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:37,670 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:37,670 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:37,670 INFO ]: Start difference. First operand 40 states and 87 transitions. Second operand 4 states. [2018-06-22 11:13:37,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:37,895 INFO ]: Finished difference Result 40 states and 85 transitions. [2018-06-22 11:13:37,897 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:37,897 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:13:37,897 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:37,897 INFO ]: With dead ends: 40 [2018-06-22 11:13:37,897 INFO ]: Without dead ends: 39 [2018-06-22 11:13:37,898 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:37,898 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:13:37,903 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 11:13:37,903 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:13:37,904 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 83 transitions. [2018-06-22 11:13:37,904 INFO ]: Start accepts. Automaton has 39 states and 83 transitions. Word has length 13 [2018-06-22 11:13:37,904 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:37,904 INFO ]: Abstraction has 39 states and 83 transitions. [2018-06-22 11:13:37,904 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:37,904 INFO ]: Start isEmpty. Operand 39 states and 83 transitions. [2018-06-22 11:13:37,905 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:37,905 INFO ]: Found error trace [2018-06-22 11:13:37,905 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:37,905 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:37,905 INFO ]: Analyzing trace with hash -647673678, now seen corresponding path program 1 times [2018-06-22 11:13:37,905 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:37,905 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:37,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:37,906 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:37,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:37,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:37,958 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:13:37,958 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:37,958 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:37,958 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:37,959 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:37,959 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:37,959 INFO ]: Start difference. First operand 39 states and 83 transitions. Second operand 4 states. [2018-06-22 11:13:38,005 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:38,005 INFO ]: Finished difference Result 41 states and 83 transitions. [2018-06-22 11:13:38,005 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:38,005 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:13:38,005 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:38,006 INFO ]: With dead ends: 41 [2018-06-22 11:13:38,006 INFO ]: Without dead ends: 40 [2018-06-22 11:13:38,006 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:38,006 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:13:38,010 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-06-22 11:13:38,010 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:13:38,011 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 77 transitions. [2018-06-22 11:13:38,011 INFO ]: Start accepts. Automaton has 38 states and 77 transitions. Word has length 13 [2018-06-22 11:13:38,011 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:38,011 INFO ]: Abstraction has 38 states and 77 transitions. [2018-06-22 11:13:38,011 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:38,011 INFO ]: Start isEmpty. Operand 38 states and 77 transitions. [2018-06-22 11:13:38,012 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:38,012 INFO ]: Found error trace [2018-06-22 11:13:38,012 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:38,012 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:38,012 INFO ]: Analyzing trace with hash 310037128, now seen corresponding path program 1 times [2018-06-22 11:13:38,012 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:38,012 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:38,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:38,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:38,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:38,018 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:38,076 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:13:38,076 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:38,076 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:38,076 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:38,076 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:38,077 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:38,077 INFO ]: Start difference. First operand 38 states and 77 transitions. Second operand 4 states. [2018-06-22 11:13:38,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:38,254 INFO ]: Finished difference Result 42 states and 85 transitions. [2018-06-22 11:13:38,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:38,255 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:13:38,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:38,255 INFO ]: With dead ends: 42 [2018-06-22 11:13:38,255 INFO ]: Without dead ends: 42 [2018-06-22 11:13:38,256 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:38,256 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:13:38,262 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-06-22 11:13:38,262 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:13:38,262 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 77 transitions. [2018-06-22 11:13:38,263 INFO ]: Start accepts. Automaton has 38 states and 77 transitions. Word has length 13 [2018-06-22 11:13:38,263 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:38,263 INFO ]: Abstraction has 38 states and 77 transitions. [2018-06-22 11:13:38,263 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:38,263 INFO ]: Start isEmpty. Operand 38 states and 77 transitions. [2018-06-22 11:13:38,264 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:38,264 INFO ]: Found error trace [2018-06-22 11:13:38,264 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:38,264 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:38,264 INFO ]: Analyzing trace with hash -850743556, now seen corresponding path program 1 times [2018-06-22 11:13:38,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:38,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:38,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:38,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:38,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:38,271 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:38,373 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:13:38,373 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:38,373 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:38,373 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:38,373 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:38,373 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:38,374 INFO ]: Start difference. First operand 38 states and 77 transitions. Second operand 4 states. [2018-06-22 11:13:38,612 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:38,612 INFO ]: Finished difference Result 38 states and 73 transitions. [2018-06-22 11:13:38,612 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:38,612 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:13:38,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:38,613 INFO ]: With dead ends: 38 [2018-06-22 11:13:38,613 INFO ]: Without dead ends: 36 [2018-06-22 11:13:38,613 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:38,613 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:13:38,617 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 11:13:38,617 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:13:38,622 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 69 transitions. [2018-06-22 11:13:38,622 INFO ]: Start accepts. Automaton has 36 states and 69 transitions. Word has length 13 [2018-06-22 11:13:38,622 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:38,622 INFO ]: Abstraction has 36 states and 69 transitions. [2018-06-22 11:13:38,622 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:38,622 INFO ]: Start isEmpty. Operand 36 states and 69 transitions. [2018-06-22 11:13:38,622 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:38,622 INFO ]: Found error trace [2018-06-22 11:13:38,623 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:38,623 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:38,623 INFO ]: Analyzing trace with hash 105058268, now seen corresponding path program 1 times [2018-06-22 11:13:38,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:38,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:38,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:38,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:38,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:38,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:38,668 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:13:38,668 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:38,668 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:38,679 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:38,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:38,710 INFO ]: Computing forward predicates... [2018-06-22 11:13:38,800 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:13:38,832 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:38,832 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:13:38,833 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:13:38,833 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:13:38,833 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:13:38,833 INFO ]: Start difference. First operand 36 states and 69 transitions. Second operand 8 states. [2018-06-22 11:13:39,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:39,207 INFO ]: Finished difference Result 50 states and 84 transitions. [2018-06-22 11:13:39,208 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:13:39,208 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:13:39,208 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:39,208 INFO ]: With dead ends: 50 [2018-06-22 11:13:39,208 INFO ]: Without dead ends: 50 [2018-06-22 11:13:39,209 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:13:39,209 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:13:39,213 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 38. [2018-06-22 11:13:39,213 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:13:39,214 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 71 transitions. [2018-06-22 11:13:39,214 INFO ]: Start accepts. Automaton has 38 states and 71 transitions. Word has length 13 [2018-06-22 11:13:39,214 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:39,214 INFO ]: Abstraction has 38 states and 71 transitions. [2018-06-22 11:13:39,214 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:13:39,214 INFO ]: Start isEmpty. Operand 38 states and 71 transitions. [2018-06-22 11:13:39,215 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:39,215 INFO ]: Found error trace [2018-06-22 11:13:39,215 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:39,215 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:39,215 INFO ]: Analyzing trace with hash -1511949451, now seen corresponding path program 1 times [2018-06-22 11:13:39,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:39,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:39,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:39,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:39,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:39,220 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:39,253 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:13:39,254 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:39,254 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:39,254 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:39,254 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:39,254 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:39,254 INFO ]: Start difference. First operand 38 states and 71 transitions. Second operand 4 states. [2018-06-22 11:13:39,270 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:39,270 INFO ]: Finished difference Result 38 states and 69 transitions. [2018-06-22 11:13:39,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:39,270 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:13:39,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:39,270 INFO ]: With dead ends: 38 [2018-06-22 11:13:39,270 INFO ]: Without dead ends: 36 [2018-06-22 11:13:39,271 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:39,271 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:13:39,274 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 11:13:39,274 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:13:39,275 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 67 transitions. [2018-06-22 11:13:39,275 INFO ]: Start accepts. Automaton has 36 states and 67 transitions. Word has length 13 [2018-06-22 11:13:39,275 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:39,275 INFO ]: Abstraction has 36 states and 67 transitions. [2018-06-22 11:13:39,275 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:39,275 INFO ]: Start isEmpty. Operand 36 states and 67 transitions. [2018-06-22 11:13:39,276 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:39,276 INFO ]: Found error trace [2018-06-22 11:13:39,276 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:39,276 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:39,276 INFO ]: Analyzing trace with hash 1973671219, now seen corresponding path program 1 times [2018-06-22 11:13:39,276 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:39,276 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:39,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:39,277 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:39,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:39,280 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:39,317 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:13:39,317 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:39,317 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:39,317 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:39,317 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:39,317 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:39,318 INFO ]: Start difference. First operand 36 states and 67 transitions. Second operand 4 states. [2018-06-22 11:13:39,347 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:39,347 INFO ]: Finished difference Result 36 states and 66 transitions. [2018-06-22 11:13:39,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:39,348 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:13:39,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:39,348 INFO ]: With dead ends: 36 [2018-06-22 11:13:39,348 INFO ]: Without dead ends: 35 [2018-06-22 11:13:39,348 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:39,348 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:13:39,351 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:13:39,351 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:13:39,352 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 59 transitions. [2018-06-22 11:13:39,352 INFO ]: Start accepts. Automaton has 33 states and 59 transitions. Word has length 13 [2018-06-22 11:13:39,352 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:39,352 INFO ]: Abstraction has 33 states and 59 transitions. [2018-06-22 11:13:39,352 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:39,352 INFO ]: Start isEmpty. Operand 33 states and 59 transitions. [2018-06-22 11:13:39,352 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:39,352 INFO ]: Found error trace [2018-06-22 11:13:39,352 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:39,352 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:39,353 INFO ]: Analyzing trace with hash -1827455860, now seen corresponding path program 1 times [2018-06-22 11:13:39,353 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:39,353 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:39,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:39,353 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:39,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:39,359 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:39,433 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:13:39,433 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:39,433 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:39,433 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:39,433 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:39,433 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:39,433 INFO ]: Start difference. First operand 33 states and 59 transitions. Second operand 4 states. [2018-06-22 11:13:39,445 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:39,445 INFO ]: Finished difference Result 41 states and 66 transitions. [2018-06-22 11:13:39,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:39,448 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:13:39,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:39,449 INFO ]: With dead ends: 41 [2018-06-22 11:13:39,449 INFO ]: Without dead ends: 36 [2018-06-22 11:13:39,449 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:39,449 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:13:39,451 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-06-22 11:13:39,452 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:13:39,452 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 53 transitions. [2018-06-22 11:13:39,452 INFO ]: Start accepts. Automaton has 32 states and 53 transitions. Word has length 17 [2018-06-22 11:13:39,452 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:39,452 INFO ]: Abstraction has 32 states and 53 transitions. [2018-06-22 11:13:39,452 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:39,452 INFO ]: Start isEmpty. Operand 32 states and 53 transitions. [2018-06-22 11:13:39,453 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:39,453 INFO ]: Found error trace [2018-06-22 11:13:39,453 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:39,453 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:39,453 INFO ]: Analyzing trace with hash 300269657, now seen corresponding path program 1 times [2018-06-22 11:13:39,453 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:39,453 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:39,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:39,454 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:39,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:39,459 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:39,511 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:13:39,511 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:39,511 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:39,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:39,543 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:39,544 INFO ]: Computing forward predicates... [2018-06-22 11:13:39,629 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:13:39,649 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:39,649 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:13:39,649 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:13:39,649 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:13:39,649 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:13:39,649 INFO ]: Start difference. First operand 32 states and 53 transitions. Second operand 10 states. [2018-06-22 11:13:39,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:39,825 INFO ]: Finished difference Result 42 states and 64 transitions. [2018-06-22 11:13:39,826 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:13:39,826 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:13:39,826 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:39,826 INFO ]: With dead ends: 42 [2018-06-22 11:13:39,826 INFO ]: Without dead ends: 42 [2018-06-22 11:13:39,826 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:13:39,826 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:13:39,829 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-06-22 11:13:39,829 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:13:39,830 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 53 transitions. [2018-06-22 11:13:39,830 INFO ]: Start accepts. Automaton has 32 states and 53 transitions. Word has length 17 [2018-06-22 11:13:39,830 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:39,830 INFO ]: Abstraction has 32 states and 53 transitions. [2018-06-22 11:13:39,830 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:13:39,830 INFO ]: Start isEmpty. Operand 32 states and 53 transitions. [2018-06-22 11:13:39,830 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:39,830 INFO ]: Found error trace [2018-06-22 11:13:39,830 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:39,830 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:39,831 INFO ]: Analyzing trace with hash -1243644704, now seen corresponding path program 2 times [2018-06-22 11:13:39,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:39,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:39,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:39,831 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:39,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:39,838 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:39,896 INFO ]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:39,896 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:39,896 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:39,902 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:13:39,951 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:13:39,951 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:39,953 INFO ]: Computing forward predicates... [2018-06-22 11:13:40,012 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:40,032 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:40,032 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:13:40,036 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:13:40,036 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:13:40,036 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:13:40,036 INFO ]: Start difference. First operand 32 states and 53 transitions. Second operand 12 states. [2018-06-22 11:13:40,462 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:40,462 INFO ]: Finished difference Result 52 states and 74 transitions. [2018-06-22 11:13:40,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:13:40,463 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:13:40,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:40,463 INFO ]: With dead ends: 52 [2018-06-22 11:13:40,463 INFO ]: Without dead ends: 25 [2018-06-22 11:13:40,463 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:13:40,463 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:13:40,465 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:13:40,465 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:13:40,465 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-06-22 11:13:40,465 INFO ]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 17 [2018-06-22 11:13:40,465 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:40,465 INFO ]: Abstraction has 23 states and 30 transitions. [2018-06-22 11:13:40,465 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:13:40,466 INFO ]: Start isEmpty. Operand 23 states and 30 transitions. [2018-06-22 11:13:40,466 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:40,466 INFO ]: Found error trace [2018-06-22 11:13:40,466 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:40,466 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:40,466 INFO ]: Analyzing trace with hash 992796770, now seen corresponding path program 1 times [2018-06-22 11:13:40,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:40,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:40,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:40,467 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:40,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:40,473 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:40,545 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:13:40,545 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:40,545 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:40,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:40,567 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:40,569 INFO ]: Computing forward predicates... [2018-06-22 11:13:40,891 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:13:40,909 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:40,909 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:13:40,910 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:13:40,910 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:13:40,910 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:13:40,910 INFO ]: Start difference. First operand 23 states and 30 transitions. Second operand 13 states. [2018-06-22 11:13:41,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:41,140 INFO ]: Finished difference Result 31 states and 43 transitions. [2018-06-22 11:13:41,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:13:41,140 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:13:41,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:41,141 INFO ]: With dead ends: 31 [2018-06-22 11:13:41,141 INFO ]: Without dead ends: 31 [2018-06-22 11:13:41,141 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:13:41,141 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:13:41,143 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:13:41,143 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:13:41,143 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2018-06-22 11:13:41,143 INFO ]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 17 [2018-06-22 11:13:41,143 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:41,143 INFO ]: Abstraction has 27 states and 38 transitions. [2018-06-22 11:13:41,143 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:13:41,143 INFO ]: Start isEmpty. Operand 27 states and 38 transitions. [2018-06-22 11:13:41,144 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:41,144 INFO ]: Found error trace [2018-06-22 11:13:41,144 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:41,144 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:41,144 INFO ]: Analyzing trace with hash 1529928317, now seen corresponding path program 1 times [2018-06-22 11:13:41,144 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:41,144 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:41,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:41,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:41,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:41,149 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:41,167 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:13:41,168 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:41,168 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:41,168 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:41,168 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:41,168 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:41,168 INFO ]: Start difference. First operand 27 states and 38 transitions. Second operand 4 states. [2018-06-22 11:13:41,180 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:41,180 INFO ]: Finished difference Result 25 states and 31 transitions. [2018-06-22 11:13:41,182 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:41,182 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:13:41,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:41,182 INFO ]: With dead ends: 25 [2018-06-22 11:13:41,182 INFO ]: Without dead ends: 24 [2018-06-22 11:13:41,183 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:13:41,183 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:13:41,184 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 11:13:41,184 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:13:41,184 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-06-22 11:13:41,184 INFO ]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 17 [2018-06-22 11:13:41,184 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:41,184 INFO ]: Abstraction has 24 states and 29 transitions. [2018-06-22 11:13:41,184 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:41,184 INFO ]: Start isEmpty. Operand 24 states and 29 transitions. [2018-06-22 11:13:41,185 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:41,185 INFO ]: Found error trace [2018-06-22 11:13:41,185 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:41,185 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:41,185 INFO ]: Analyzing trace with hash -778353763, now seen corresponding path program 2 times [2018-06-22 11:13:41,185 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:41,185 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:41,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:41,186 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:41,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:41,192 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:41,382 INFO ]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:41,382 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:41,382 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:41,388 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:13:41,417 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:13:41,417 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:41,419 INFO ]: Computing forward predicates... [2018-06-22 11:13:41,495 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:41,513 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:41,513 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-22 11:13:41,513 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:13:41,513 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:13:41,513 INFO ]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:13:41,513 INFO ]: Start difference. First operand 24 states and 29 transitions. Second operand 14 states. [2018-06-22 11:13:41,664 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:41,664 INFO ]: Finished difference Result 32 states and 38 transitions. [2018-06-22 11:13:41,664 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:13:41,664 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:13:41,664 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:41,665 INFO ]: With dead ends: 32 [2018-06-22 11:13:41,665 INFO ]: Without dead ends: 24 [2018-06-22 11:13:41,665 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:13:41,665 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:13:41,666 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-06-22 11:13:41,666 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:13:41,666 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-06-22 11:13:41,666 INFO ]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 21 [2018-06-22 11:13:41,666 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:41,666 INFO ]: Abstraction has 22 states and 26 transitions. [2018-06-22 11:13:41,666 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:13:41,667 INFO ]: Start isEmpty. Operand 22 states and 26 transitions. [2018-06-22 11:13:41,667 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:41,667 INFO ]: Found error trace [2018-06-22 11:13:41,667 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:41,667 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:41,667 INFO ]: Analyzing trace with hash -979729050, now seen corresponding path program 1 times [2018-06-22 11:13:41,667 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:41,667 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:41,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:41,668 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:41,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:41,675 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:42,070 WARN ]: Spent 336.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-06-22 11:13:42,239 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:13:42,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:42,239 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:42,246 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:42,259 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:42,261 INFO ]: Computing forward predicates... [2018-06-22 11:13:42,488 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:13:42,519 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:42,520 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-06-22 11:13:42,520 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:13:42,520 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:13:42,520 INFO ]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:13:42,520 INFO ]: Start difference. First operand 22 states and 26 transitions. Second operand 17 states. [2018-06-22 11:13:43,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:43,044 INFO ]: Finished difference Result 28 states and 33 transitions. [2018-06-22 11:13:43,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:13:43,047 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-22 11:13:43,047 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:43,047 INFO ]: With dead ends: 28 [2018-06-22 11:13:43,047 INFO ]: Without dead ends: 22 [2018-06-22 11:13:43,048 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:13:43,048 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:13:43,049 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-22 11:13:43,049 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:13:43,050 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-06-22 11:13:43,050 INFO ]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 21 [2018-06-22 11:13:43,050 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:43,050 INFO ]: Abstraction has 20 states and 23 transitions. [2018-06-22 11:13:43,050 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:13:43,050 INFO ]: Start isEmpty. Operand 20 states and 23 transitions. [2018-06-22 11:13:43,050 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:43,050 INFO ]: Found error trace [2018-06-22 11:13:43,050 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:43,050 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:43,050 INFO ]: Analyzing trace with hash 1553610863, now seen corresponding path program 2 times [2018-06-22 11:13:43,050 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:43,050 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:43,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:43,051 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:43,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:43,056 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:43,141 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:43,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:43,141 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) [2018-06-22 11:13:43,156 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:43,180 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:13:43,180 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:43,181 INFO ]: Computing forward predicates... [2018-06-22 11:13:43,209 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:43,228 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:43,228 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:13:43,228 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:13:43,228 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:13:43,228 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:13:43,228 INFO ]: Start difference. First operand 20 states and 23 transitions. Second operand 10 states. [2018-06-22 11:13:43,413 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:43,413 INFO ]: Finished difference Result 22 states and 25 transitions. [2018-06-22 11:13:43,414 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:13:43,414 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-22 11:13:43,414 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:43,414 INFO ]: With dead ends: 22 [2018-06-22 11:13:43,414 INFO ]: Without dead ends: 22 [2018-06-22 11:13:43,414 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:13:43,414 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:13:43,415 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-22 11:13:43,415 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:13:43,416 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-06-22 11:13:43,416 INFO ]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 21 [2018-06-22 11:13:43,416 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:43,416 INFO ]: Abstraction has 22 states and 25 transitions. [2018-06-22 11:13:43,416 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:13:43,416 INFO ]: Start isEmpty. Operand 22 states and 25 transitions. [2018-06-22 11:13:43,416 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:13:43,416 INFO ]: Found error trace [2018-06-22 11:13:43,417 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:43,417 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:43,417 INFO ]: Analyzing trace with hash -1869049933, now seen corresponding path program 2 times [2018-06-22 11:13:43,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:43,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:43,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:43,417 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:43,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:43,435 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:43,731 INFO ]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:13:43,731 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:43,731 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:43,737 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:13:43,749 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:13:43,749 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:43,751 INFO ]: Computing forward predicates... [2018-06-22 11:13:43,925 INFO ]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:13:43,944 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:43,944 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-06-22 11:13:43,944 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:13:43,944 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:13:43,945 INFO ]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:13:43,945 INFO ]: Start difference. First operand 22 states and 25 transitions. Second operand 21 states. [2018-06-22 11:13:44,244 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:44,244 INFO ]: Finished difference Result 30 states and 34 transitions. [2018-06-22 11:13:44,244 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:13:44,244 INFO ]: Start accepts. Automaton has 21 states. Word has length 25 [2018-06-22 11:13:44,244 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:44,244 INFO ]: With dead ends: 30 [2018-06-22 11:13:44,244 INFO ]: Without dead ends: 30 [2018-06-22 11:13:44,245 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:13:44,245 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:13:44,246 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-06-22 11:13:44,246 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:13:44,246 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-06-22 11:13:44,246 INFO ]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 25 [2018-06-22 11:13:44,246 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:44,246 INFO ]: Abstraction has 24 states and 27 transitions. [2018-06-22 11:13:44,246 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:13:44,246 INFO ]: Start isEmpty. Operand 24 states and 27 transitions. [2018-06-22 11:13:44,247 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:13:44,247 INFO ]: Found error trace [2018-06-22 11:13:44,247 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:44,247 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:44,248 INFO ]: Analyzing trace with hash -70785161, now seen corresponding path program 3 times [2018-06-22 11:13:44,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:44,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:44,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:44,248 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:44,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:44,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:44,417 INFO ]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:13:44,417 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:44,417 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:44,423 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:13:44,464 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:13:44,464 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:44,467 INFO ]: Computing forward predicates... [2018-06-22 11:13:44,803 INFO ]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:13:44,824 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:44,824 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-22 11:13:44,824 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:13:44,824 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:13:44,824 INFO ]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:13:44,825 INFO ]: Start difference. First operand 24 states and 27 transitions. Second operand 20 states. [2018-06-22 11:13:45,110 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:45,110 INFO ]: Finished difference Result 36 states and 40 transitions. [2018-06-22 11:13:45,110 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:13:45,110 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:13:45,110 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:45,111 INFO ]: With dead ends: 36 [2018-06-22 11:13:45,111 INFO ]: Without dead ends: 26 [2018-06-22 11:13:45,111 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:13:45,111 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:13:45,112 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 11:13:45,112 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:13:45,112 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-06-22 11:13:45,112 INFO ]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 29 [2018-06-22 11:13:45,112 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:45,113 INFO ]: Abstraction has 26 states and 29 transitions. [2018-06-22 11:13:45,113 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:13:45,113 INFO ]: Start isEmpty. Operand 26 states and 29 transitions. [2018-06-22 11:13:45,113 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:13:45,113 INFO ]: Found error trace [2018-06-22 11:13:45,113 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:45,113 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:45,113 INFO ]: Analyzing trace with hash -1139803836, now seen corresponding path program 4 times [2018-06-22 11:13:45,113 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:45,113 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:45,113 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:45,113 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:45,113 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:45,122 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:45,311 WARN ]: Spent 140.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-06-22 11:13:45,418 INFO ]: Checked inductivity of 31 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:13:45,418 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:45,418 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:45,425 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:13:45,441 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:13:45,441 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:45,445 INFO ]: Computing forward predicates... [2018-06-22 11:13:45,802 INFO ]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:13:45,831 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:45,831 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-06-22 11:13:45,831 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:13:45,832 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:13:45,832 INFO ]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:13:45,832 INFO ]: Start difference. First operand 26 states and 29 transitions. Second operand 25 states. [2018-06-22 11:13:46,148 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:46,148 INFO ]: Finished difference Result 36 states and 40 transitions. [2018-06-22 11:13:46,148 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:13:46,148 INFO ]: Start accepts. Automaton has 25 states. Word has length 33 [2018-06-22 11:13:46,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:46,148 INFO ]: With dead ends: 36 [2018-06-22 11:13:46,148 INFO ]: Without dead ends: 36 [2018-06-22 11:13:46,149 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:13:46,149 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:13:46,151 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-06-22 11:13:46,151 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:13:46,151 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-06-22 11:13:46,151 INFO ]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 33 [2018-06-22 11:13:46,151 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:46,151 INFO ]: Abstraction has 28 states and 31 transitions. [2018-06-22 11:13:46,151 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:13:46,151 INFO ]: Start isEmpty. Operand 28 states and 31 transitions. [2018-06-22 11:13:46,151 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:13:46,151 INFO ]: Found error trace [2018-06-22 11:13:46,152 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:46,152 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:46,153 INFO ]: Analyzing trace with hash -1391955000, now seen corresponding path program 5 times [2018-06-22 11:13:46,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:46,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:46,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:46,154 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:46,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:46,166 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:46,465 WARN ]: Spent 222.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-06-22 11:13:46,567 INFO ]: Checked inductivity of 42 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:13:46,568 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:46,568 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:46,573 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:13:46,614 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 11:13:46,614 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:46,618 INFO ]: Computing forward predicates... [2018-06-22 11:13:46,889 INFO ]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:13:46,909 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:46,909 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-06-22 11:13:46,910 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:13:46,910 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:13:46,910 INFO ]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:13:46,910 INFO ]: Start difference. First operand 28 states and 31 transitions. Second operand 23 states. [2018-06-22 11:13:47,269 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:47,269 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-22 11:13:47,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:13:47,270 INFO ]: Start accepts. Automaton has 23 states. Word has length 37 [2018-06-22 11:13:47,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:47,270 INFO ]: With dead ends: 42 [2018-06-22 11:13:47,270 INFO ]: Without dead ends: 30 [2018-06-22 11:13:47,271 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:13:47,271 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:13:47,272 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 11:13:47,272 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:13:47,273 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-06-22 11:13:47,273 INFO ]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 37 [2018-06-22 11:13:47,273 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:47,273 INFO ]: Abstraction has 30 states and 33 transitions. [2018-06-22 11:13:47,273 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:13:47,273 INFO ]: Start isEmpty. Operand 30 states and 33 transitions. [2018-06-22 11:13:47,273 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:13:47,273 INFO ]: Found error trace [2018-06-22 11:13:47,273 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:47,273 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:47,273 INFO ]: Analyzing trace with hash -1434612459, now seen corresponding path program 6 times [2018-06-22 11:13:47,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:47,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:47,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:47,274 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:47,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:47,283 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:47,563 INFO ]: Checked inductivity of 57 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:13:47,563 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:47,563 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:47,569 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:13:47,589 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:13:47,589 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:47,593 INFO ]: Computing forward predicates... [2018-06-22 11:13:47,987 INFO ]: Checked inductivity of 57 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:13:48,007 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:48,007 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-06-22 11:13:48,007 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:13:48,007 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:13:48,007 INFO ]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:13:48,007 INFO ]: Start difference. First operand 30 states and 33 transitions. Second operand 29 states. [2018-06-22 11:13:48,612 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:48,612 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-22 11:13:48,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:13:48,613 INFO ]: Start accepts. Automaton has 29 states. Word has length 41 [2018-06-22 11:13:48,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:48,613 INFO ]: With dead ends: 42 [2018-06-22 11:13:48,613 INFO ]: Without dead ends: 42 [2018-06-22 11:13:48,614 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=218, Invalid=1588, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:13:48,614 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:13:48,616 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-06-22 11:13:48,616 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:13:48,616 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-22 11:13:48,616 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 41 [2018-06-22 11:13:48,617 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:48,617 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-22 11:13:48,617 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:13:48,617 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-22 11:13:48,617 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:13:48,617 INFO ]: Found error trace [2018-06-22 11:13:48,617 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:48,617 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:48,617 INFO ]: Analyzing trace with hash -664102311, now seen corresponding path program 7 times [2018-06-22 11:13:48,617 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:48,617 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:48,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:48,618 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:48,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:48,631 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:49,032 WARN ]: Spent 330.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-06-22 11:13:49,557 INFO ]: Checked inductivity of 72 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:13:49,557 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:49,557 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:49,562 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:49,585 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:49,588 INFO ]: Computing forward predicates... [2018-06-22 11:13:49,853 WARN ]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 11:13:49,978 INFO ]: Checked inductivity of 72 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:13:49,997 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:49,997 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2018-06-22 11:13:49,997 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:13:49,998 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:13:49,998 INFO ]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:13:49,998 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 26 states. [2018-06-22 11:13:50,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:50,440 INFO ]: Finished difference Result 48 states and 52 transitions. [2018-06-22 11:13:50,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:13:50,441 INFO ]: Start accepts. Automaton has 26 states. Word has length 45 [2018-06-22 11:13:50,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:50,441 INFO ]: With dead ends: 48 [2018-06-22 11:13:50,441 INFO ]: Without dead ends: 34 [2018-06-22 11:13:50,442 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=201, Invalid=1205, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:13:50,442 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:13:50,445 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 11:13:50,445 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:13:50,445 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-06-22 11:13:50,445 INFO ]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 45 [2018-06-22 11:13:50,445 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:50,445 INFO ]: Abstraction has 34 states and 37 transitions. [2018-06-22 11:13:50,445 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:13:50,445 INFO ]: Start isEmpty. Operand 34 states and 37 transitions. [2018-06-22 11:13:50,446 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:13:50,446 INFO ]: Found error trace [2018-06-22 11:13:50,446 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:50,446 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:50,446 INFO ]: Analyzing trace with hash 421509926, now seen corresponding path program 8 times [2018-06-22 11:13:50,446 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:50,446 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:50,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:50,447 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:50,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:50,462 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:50,773 WARN ]: Spent 237.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-06-22 11:13:50,976 INFO ]: Checked inductivity of 91 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:13:50,976 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:50,976 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:50,983 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:13:51,005 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:13:51,006 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:51,010 INFO ]: Computing forward predicates... [2018-06-22 11:13:51,408 INFO ]: Checked inductivity of 91 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:13:51,427 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:51,427 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-06-22 11:13:51,427 INFO ]: Interpolant automaton has 33 states [2018-06-22 11:13:51,428 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 11:13:51,428 INFO ]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:13:51,428 INFO ]: Start difference. First operand 34 states and 37 transitions. Second operand 33 states. [2018-06-22 11:13:52,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:52,147 INFO ]: Finished difference Result 48 states and 52 transitions. [2018-06-22 11:13:52,148 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:13:52,148 INFO ]: Start accepts. Automaton has 33 states. Word has length 49 [2018-06-22 11:13:52,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:52,148 INFO ]: With dead ends: 48 [2018-06-22 11:13:52,148 INFO ]: Without dead ends: 48 [2018-06-22 11:13:52,149 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=284, Invalid=2166, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:13:52,149 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:13:52,151 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 36. [2018-06-22 11:13:52,151 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:13:52,152 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-06-22 11:13:52,152 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 49 [2018-06-22 11:13:52,152 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:52,152 INFO ]: Abstraction has 36 states and 39 transitions. [2018-06-22 11:13:52,152 INFO ]: Interpolant automaton has 33 states. [2018-06-22 11:13:52,152 INFO ]: Start isEmpty. Operand 36 states and 39 transitions. [2018-06-22 11:13:52,153 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:13:52,153 INFO ]: Found error trace [2018-06-22 11:13:52,153 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:52,153 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:52,153 INFO ]: Analyzing trace with hash -2007971030, now seen corresponding path program 9 times [2018-06-22 11:13:52,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:52,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:52,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:52,153 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:52,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:52,167 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:52,483 INFO ]: Checked inductivity of 110 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 11:13:52,485 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:52,485 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:52,495 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:13:52,522 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 11:13:52,522 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:52,526 INFO ]: Computing forward predicates... [2018-06-22 11:13:53,705 INFO ]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 11:13:53,724 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:53,724 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 29 [2018-06-22 11:13:53,724 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:13:53,725 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:13:53,725 INFO ]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:13:53,725 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 29 states. [2018-06-22 11:13:54,187 WARN ]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 11:13:54,471 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:54,471 INFO ]: Finished difference Result 54 states and 58 transitions. [2018-06-22 11:13:54,471 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:13:54,471 INFO ]: Start accepts. Automaton has 29 states. Word has length 53 [2018-06-22 11:13:54,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:54,471 INFO ]: With dead ends: 54 [2018-06-22 11:13:54,471 INFO ]: Without dead ends: 38 [2018-06-22 11:13:54,472 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=252, Invalid=1554, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:13:54,472 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:13:54,474 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 11:13:54,474 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:13:54,474 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-22 11:13:54,474 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 53 [2018-06-22 11:13:54,475 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:54,475 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-22 11:13:54,475 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:13:54,475 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-22 11:13:54,475 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:13:54,475 INFO ]: Found error trace [2018-06-22 11:13:54,475 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:54,475 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:54,475 INFO ]: Analyzing trace with hash -192351369, now seen corresponding path program 10 times [2018-06-22 11:13:54,475 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:54,475 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:54,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:54,476 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:54,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:54,491 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:54,860 WARN ]: Spent 304.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-06-22 11:13:55,092 INFO ]: Checked inductivity of 133 backedges. 30 proven. 47 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:13:55,092 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:55,092 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:55,097 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:13:55,121 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:13:55,121 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:55,125 INFO ]: Computing forward predicates... [2018-06-22 11:13:55,766 INFO ]: Checked inductivity of 133 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:13:55,786 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:55,786 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2018-06-22 11:13:55,787 INFO ]: Interpolant automaton has 37 states [2018-06-22 11:13:55,787 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 11:13:55,787 INFO ]: CoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:13:55,787 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 37 states. [2018-06-22 11:13:56,385 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:56,385 INFO ]: Finished difference Result 54 states and 58 transitions. [2018-06-22 11:13:56,385 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:13:56,385 INFO ]: Start accepts. Automaton has 37 states. Word has length 57 [2018-06-22 11:13:56,385 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:56,385 INFO ]: With dead ends: 54 [2018-06-22 11:13:56,385 INFO ]: Without dead ends: 54 [2018-06-22 11:13:56,386 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=359, Invalid=2833, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:13:56,386 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:13:56,388 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 40. [2018-06-22 11:13:56,388 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:13:56,388 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-06-22 11:13:56,388 INFO ]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 57 [2018-06-22 11:13:56,388 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:56,388 INFO ]: Abstraction has 40 states and 43 transitions. [2018-06-22 11:13:56,388 INFO ]: Interpolant automaton has 37 states. [2018-06-22 11:13:56,388 INFO ]: Start isEmpty. Operand 40 states and 43 transitions. [2018-06-22 11:13:56,389 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:13:56,389 INFO ]: Found error trace [2018-06-22 11:13:56,389 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:56,389 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:56,389 INFO ]: Analyzing trace with hash 1903261243, now seen corresponding path program 11 times [2018-06-22 11:13:56,389 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:56,389 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:56,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:56,389 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:56,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:56,403 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:56,642 WARN ]: Spent 177.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-06-22 11:13:56,854 INFO ]: Checked inductivity of 156 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 11:13:56,854 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:56,854 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:56,859 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:13:56,888 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 11:13:56,888 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:56,892 INFO ]: Computing forward predicates... [2018-06-22 11:13:57,309 INFO ]: Checked inductivity of 156 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 11:13:57,328 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:57,328 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2018-06-22 11:13:57,328 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:13:57,328 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:13:57,329 INFO ]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:13:57,329 INFO ]: Start difference. First operand 40 states and 43 transitions. Second operand 32 states. [2018-06-22 11:13:58,159 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:58,159 INFO ]: Finished difference Result 60 states and 64 transitions. [2018-06-22 11:13:58,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:13:58,159 INFO ]: Start accepts. Automaton has 32 states. Word has length 61 [2018-06-22 11:13:58,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:58,160 INFO ]: With dead ends: 60 [2018-06-22 11:13:58,160 INFO ]: Without dead ends: 42 [2018-06-22 11:13:58,160 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=309, Invalid=1947, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:13:58,160 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:13:58,162 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 11:13:58,162 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:13:58,162 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-06-22 11:13:58,163 INFO ]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 61 [2018-06-22 11:13:58,163 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:58,163 INFO ]: Abstraction has 42 states and 45 transitions. [2018-06-22 11:13:58,163 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:13:58,163 INFO ]: Start isEmpty. Operand 42 states and 45 transitions. [2018-06-22 11:13:58,163 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:13:58,163 INFO ]: Found error trace [2018-06-22 11:13:58,163 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:58,164 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:58,164 INFO ]: Analyzing trace with hash -140532216, now seen corresponding path program 12 times [2018-06-22 11:13:58,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:58,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:58,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:58,165 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:58,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:58,180 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:58,559 WARN ]: Spent 317.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-06-22 11:13:58,903 INFO ]: Checked inductivity of 183 backedges. 42 proven. 62 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:13:58,903 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:58,903 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:58,909 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:13:58,941 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:13:58,941 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:58,949 INFO ]: Computing forward predicates... [2018-06-22 11:13:59,120 INFO ]: Checked inductivity of 183 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-06-22 11:13:59,139 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:13:59,139 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [22] total 28 [2018-06-22 11:13:59,139 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:13:59,140 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:13:59,140 INFO ]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:13:59,140 INFO ]: Start difference. First operand 42 states and 45 transitions. Second operand 28 states. [2018-06-22 11:13:59,713 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:59,713 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-22 11:13:59,713 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:13:59,713 INFO ]: Start accepts. Automaton has 28 states. Word has length 65 [2018-06-22 11:13:59,713 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:59,713 INFO ]: With dead ends: 40 [2018-06-22 11:13:59,713 INFO ]: Without dead ends: 0 [2018-06-22 11:13:59,713 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=306, Invalid=1764, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:13:59,713 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:13:59,714 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:13:59,714 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:13:59,714 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:13:59,714 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2018-06-22 11:13:59,714 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:59,714 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:13:59,714 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:13:59,714 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:13:59,714 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:13:59,718 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:13:59 BoogieIcfgContainer [2018-06-22 11:13:59,718 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:13:59,718 INFO ]: Toolchain (without parser) took 25944.04 ms. Allocated memory was 308.8 MB in the beginning and 643.8 MB in the end (delta: 335.0 MB). Free memory was 259.2 MB in the beginning and 536.8 MB in the end (delta: -277.6 MB). Peak memory consumption was 57.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:59,719 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:13:59,719 INFO ]: ChcToBoogie took 58.89 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 257.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:59,719 INFO ]: Boogie Preprocessor took 67.03 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:59,720 INFO ]: RCFGBuilder took 663.97 ms. Allocated memory is still 308.8 MB. Free memory was 255.2 MB in the beginning and 237.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:59,720 INFO ]: TraceAbstraction took 25144.76 ms. Allocated memory was 308.8 MB in the beginning and 643.8 MB in the end (delta: 335.0 MB). Free memory was 237.2 MB in the beginning and 536.8 MB in the end (delta: -299.6 MB). Peak memory consumption was 35.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:59,722 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.89 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 257.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 67.03 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 663.97 ms. Allocated memory is still 308.8 MB. Free memory was 255.2 MB in the beginning and 237.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 25144.76 ms. Allocated memory was 308.8 MB in the beginning and 643.8 MB in the end (delta: 335.0 MB). Free memory was 237.2 MB in the beginning and 536.8 MB in the end (delta: -299.6 MB). Peak memory consumption was 35.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 42 locations, 1 error locations. SAFE Result, 25.0s OverallTime, 36 OverallIterations, 8 TraceHistogramMax, 10.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1567 SDtfs, 341 SDslu, 5480 SDs, 0 SdLazy, 3499 SolverSat, 554 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1164 GetRequests, 575 SyntacticMatches, 16 SemanticMatches, 573 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 120 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 1458 NumberOfCodeBlocks, 1458 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 1404 ConstructedInterpolants, 0 QuantifiedInterpolants, 415408 SizeOfPredicates, 402 NumberOfNonLiveVariables, 2792 ConjunctsInSsa, 1188 ConjunctsInUnsatCore, 54 InterpolantComputations, 19 PerfectInterpolantSequences, 1168/1924 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-13-59-733.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-13-59-733.csv Received shutdown request...