java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/005-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:58:31,026 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:58:31,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:58:31,039 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:58:31,039 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:58:31,040 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:58:31,041 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:58:31,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:58:31,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:58:31,049 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:58:31,050 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:58:31,050 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:58:31,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:58:31,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:58:31,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:58:31,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:58:31,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:58:31,071 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:58:31,073 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:58:31,074 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:58:31,075 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:58:31,077 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:58:31,077 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:58:31,077 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:58:31,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:58:31,079 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:58:31,080 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:58:31,081 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:58:31,082 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:58:31,082 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:58:31,083 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:58:31,088 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:58:31,088 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:58:31,089 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:58:31,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:58:31,089 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:58:31,113 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:58:31,113 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:58:31,114 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:58:31,114 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:58:31,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:58:31,115 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:58:31,115 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:58:31,115 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:58:31,116 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:58:31,116 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:58:31,116 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:58:31,116 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:58:31,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:58:31,117 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:58:31,118 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:58:31,118 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:58:31,118 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:58:31,118 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:58:31,118 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:58:31,119 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:58:31,119 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:58:31,120 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:58:31,120 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:58:31,167 INFO ]: Repository-Root is: /tmp [2018-06-24 20:58:31,179 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:58:31,182 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:58:31,184 INFO ]: Initializing SmtParser... [2018-06-24 20:58:31,184 INFO ]: SmtParser initialized [2018-06-24 20:58:31,185 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/005-horn.smt2 [2018-06-24 20:58:31,186 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-24 20:58:31,284 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/005-horn.smt2 unknown [2018-06-24 20:58:31,543 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/005-horn.smt2 [2018-06-24 20:58:31,547 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:58:31,554 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:58:31,555 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:58:31,555 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:58:31,555 INFO ]: ChcToBoogie initialized [2018-06-24 20:58:31,558 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:58:31" (1/1) ... [2018-06-24 20:58:31,607 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:31 Unit [2018-06-24 20:58:31,607 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:58:31,607 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:58:31,607 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:58:31,607 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:58:31,629 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:31" (1/1) ... [2018-06-24 20:58:31,629 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:31" (1/1) ... [2018-06-24 20:58:31,636 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:31" (1/1) ... [2018-06-24 20:58:31,636 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:31" (1/1) ... [2018-06-24 20:58:31,640 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:31" (1/1) ... [2018-06-24 20:58:31,651 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:31" (1/1) ... [2018-06-24 20:58:31,652 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:31" (1/1) ... [2018-06-24 20:58:31,654 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:58:31,655 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:58:31,655 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:58:31,655 INFO ]: RCFGBuilder initialized [2018-06-24 20:58:31,656 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:31" (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-24 20:58:31,680 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:58:31,680 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:58:31,680 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:58:31,680 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:58:31,680 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:58:31,680 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-24 20:58:32,038 INFO ]: Using library mode [2018-06-24 20:58:32,039 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:58:32 BoogieIcfgContainer [2018-06-24 20:58:32,039 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:58:32,039 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:58:32,039 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:58:32,040 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:58:32,042 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:58:32" (1/1) ... [2018-06-24 20:58:32,058 INFO ]: Initial Icfg 21 locations, 32 edges [2018-06-24 20:58:32,059 INFO ]: Using Remove infeasible edges [2018-06-24 20:58:32,060 INFO ]: Using Maximize final states [2018-06-24 20:58:32,061 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:58:32,061 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:58:32,063 INFO ]: Using Remove sink states [2018-06-24 20:58:32,064 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:58:32,064 INFO ]: Using Use SBE [2018-06-24 20:58:32,070 INFO ]: SBE split 0 edges [2018-06-24 20:58:32,075 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:58:32,077 INFO ]: 0 new accepting states [2018-06-24 20:58:32,125 INFO ]: Removed 10 edges and 4 locations by large block encoding [2018-06-24 20:58:32,127 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:58:32,128 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:58:32,128 INFO ]: 0 new accepting states [2018-06-24 20:58:32,129 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:58:32,129 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:58:32,130 INFO ]: Encoded RCFG 15 locations, 26 edges [2018-06-24 20:58:32,130 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:58:32 BasicIcfg [2018-06-24 20:58:32,130 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:58:32,131 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:58:32,131 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:58:32,133 INFO ]: TraceAbstraction initialized [2018-06-24 20:58:32,133 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:58:31" (1/4) ... [2018-06-24 20:58:32,134 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17598e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:58:32, skipping insertion in model container [2018-06-24 20:58:32,134 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:31" (2/4) ... [2018-06-24 20:58:32,134 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17598e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:58:32, skipping insertion in model container [2018-06-24 20:58:32,134 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:58:32" (3/4) ... [2018-06-24 20:58:32,134 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17598e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:58:32, skipping insertion in model container [2018-06-24 20:58:32,134 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:58:32" (4/4) ... [2018-06-24 20:58:32,136 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:58:32,143 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:58:32,150 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:58:32,196 INFO ]: Using default assertion order modulation [2018-06-24 20:58:32,196 INFO ]: Interprodecural is true [2018-06-24 20:58:32,196 INFO ]: Hoare is false [2018-06-24 20:58:32,196 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:58:32,196 INFO ]: Backedges is TWOTRACK [2018-06-24 20:58:32,196 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:58:32,197 INFO ]: Difference is false [2018-06-24 20:58:32,197 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:58:32,197 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:58:32,206 INFO ]: Start isEmpty. Operand 15 states. [2018-06-24 20:58:32,216 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:58:32,216 INFO ]: Found error trace [2018-06-24 20:58:32,217 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:58:32,217 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:32,222 INFO ]: Analyzing trace with hash 36142242, now seen corresponding path program 1 times [2018-06-24 20:58:32,224 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:32,224 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:32,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:32,255 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:32,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:32,292 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:32,347 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:58:32,349 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:58:32,349 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:58:32,350 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:58:32,360 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:58:32,360 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:58:32,362 INFO ]: Start difference. First operand 15 states. Second operand 3 states. [2018-06-24 20:58:32,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:32,467 INFO ]: Finished difference Result 20 states and 36 transitions. [2018-06-24 20:58:32,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:58:32,468 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:58:32,468 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:32,476 INFO ]: With dead ends: 20 [2018-06-24 20:58:32,476 INFO ]: Without dead ends: 20 [2018-06-24 20:58:32,478 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:58:32,490 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:58:32,514 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 20:58:32,515 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:58:32,517 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 36 transitions. [2018-06-24 20:58:32,518 INFO ]: Start accepts. Automaton has 20 states and 36 transitions. Word has length 5 [2018-06-24 20:58:32,520 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:32,520 INFO ]: Abstraction has 20 states and 36 transitions. [2018-06-24 20:58:32,521 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:58:32,521 INFO ]: Start isEmpty. Operand 20 states and 36 transitions. [2018-06-24 20:58:32,523 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:58:32,523 INFO ]: Found error trace [2018-06-24 20:58:32,523 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:32,523 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:32,523 INFO ]: Analyzing trace with hash 1018906885, now seen corresponding path program 1 times [2018-06-24 20:58:32,524 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:32,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:32,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:32,526 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:32,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:32,544 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:32,634 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:58:32,634 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:58:32,634 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:58:32,635 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:58:32,636 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:58:32,636 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:58:32,636 INFO ]: Start difference. First operand 20 states and 36 transitions. Second operand 3 states. [2018-06-24 20:58:32,856 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:32,856 INFO ]: Finished difference Result 25 states and 44 transitions. [2018-06-24 20:58:32,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:58:32,856 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 20:58:32,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:32,857 INFO ]: With dead ends: 25 [2018-06-24 20:58:32,857 INFO ]: Without dead ends: 25 [2018-06-24 20:58:32,858 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:58:32,858 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:58:32,863 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 20:58:32,863 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:58:32,864 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2018-06-24 20:58:32,864 INFO ]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 10 [2018-06-24 20:58:32,865 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:32,865 INFO ]: Abstraction has 25 states and 44 transitions. [2018-06-24 20:58:32,865 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:58:32,865 INFO ]: Start isEmpty. Operand 25 states and 44 transitions. [2018-06-24 20:58:32,866 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:58:32,866 INFO ]: Found error trace [2018-06-24 20:58:32,866 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:32,866 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:32,867 INFO ]: Analyzing trace with hash -1226471947, now seen corresponding path program 1 times [2018-06-24 20:58:32,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:32,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:32,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:32,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:32,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:32,905 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:33,162 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:58:33,162 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:58:33,162 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:58:33,162 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:58:33,163 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:58:33,163 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:58:33,163 INFO ]: Start difference. First operand 25 states and 44 transitions. Second operand 6 states. [2018-06-24 20:58:33,753 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:33,754 INFO ]: Finished difference Result 39 states and 86 transitions. [2018-06-24 20:58:33,754 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:58:33,754 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-24 20:58:33,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:33,757 INFO ]: With dead ends: 39 [2018-06-24 20:58:33,757 INFO ]: Without dead ends: 38 [2018-06-24 20:58:33,758 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:58:33,758 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:58:33,766 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-06-24 20:58:33,766 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:58:33,767 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 53 transitions. [2018-06-24 20:58:33,767 INFO ]: Start accepts. Automaton has 28 states and 53 transitions. Word has length 11 [2018-06-24 20:58:33,767 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:33,767 INFO ]: Abstraction has 28 states and 53 transitions. [2018-06-24 20:58:33,767 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:58:33,767 INFO ]: Start isEmpty. Operand 28 states and 53 transitions. [2018-06-24 20:58:33,775 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:58:33,775 INFO ]: Found error trace [2018-06-24 20:58:33,775 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:33,775 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:33,775 INFO ]: Analyzing trace with hash 1229330558, now seen corresponding path program 1 times [2018-06-24 20:58:33,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:33,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:33,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:33,776 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:33,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:33,803 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:33,875 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:58:33,875 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:33,875 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-24 20:58:33,888 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:33,929 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:33,937 INFO ]: Computing forward predicates... [2018-06-24 20:58:34,398 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:58:34,422 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:34,422 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 20:58:34,423 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:58:34,423 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:58:34,423 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:58:34,423 INFO ]: Start difference. First operand 28 states and 53 transitions. Second operand 12 states. [2018-06-24 20:58:35,618 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:35,618 INFO ]: Finished difference Result 49 states and 133 transitions. [2018-06-24 20:58:35,622 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:58:35,622 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-24 20:58:35,622 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:35,625 INFO ]: With dead ends: 49 [2018-06-24 20:58:35,625 INFO ]: Without dead ends: 49 [2018-06-24 20:58:35,625 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:58:35,625 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 20:58:35,643 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 35. [2018-06-24 20:58:35,643 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:58:35,644 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 76 transitions. [2018-06-24 20:58:35,645 INFO ]: Start accepts. Automaton has 35 states and 76 transitions. Word has length 12 [2018-06-24 20:58:35,645 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:35,645 INFO ]: Abstraction has 35 states and 76 transitions. [2018-06-24 20:58:35,645 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:58:35,645 INFO ]: Start isEmpty. Operand 35 states and 76 transitions. [2018-06-24 20:58:35,647 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:58:35,647 INFO ]: Found error trace [2018-06-24 20:58:35,647 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:35,647 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:35,647 INFO ]: Analyzing trace with hash 2116834239, now seen corresponding path program 1 times [2018-06-24 20:58:35,647 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:35,647 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:35,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:35,648 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:35,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:35,670 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:35,761 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:58:35,761 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:35,761 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-24 20:58:35,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:35,797 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:35,799 INFO ]: Computing forward predicates... [2018-06-24 20:58:35,957 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:58:35,976 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:35,976 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-24 20:58:35,976 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:58:35,976 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:58:35,976 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:58:35,977 INFO ]: Start difference. First operand 35 states and 76 transitions. Second operand 11 states. [2018-06-24 20:58:36,134 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:36,134 INFO ]: Finished difference Result 46 states and 120 transitions. [2018-06-24 20:58:36,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:58:36,135 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 20:58:36,135 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:36,138 INFO ]: With dead ends: 46 [2018-06-24 20:58:36,138 INFO ]: Without dead ends: 46 [2018-06-24 20:58:36,138 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:58:36,138 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 20:58:36,150 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-06-24 20:58:36,150 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:58:36,152 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 72 transitions. [2018-06-24 20:58:36,152 INFO ]: Start accepts. Automaton has 34 states and 72 transitions. Word has length 12 [2018-06-24 20:58:36,152 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:36,152 INFO ]: Abstraction has 34 states and 72 transitions. [2018-06-24 20:58:36,152 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:58:36,152 INFO ]: Start isEmpty. Operand 34 states and 72 transitions. [2018-06-24 20:58:36,157 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:58:36,157 INFO ]: Found error trace [2018-06-24 20:58:36,157 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:36,157 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:36,157 INFO ]: Analyzing trace with hash -309238885, now seen corresponding path program 1 times [2018-06-24 20:58:36,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:36,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:36,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:36,158 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:36,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:36,185 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:36,305 INFO ]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:58:36,305 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:36,305 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-24 20:58:36,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:36,347 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:36,350 INFO ]: Computing forward predicates... [2018-06-24 20:58:36,431 INFO ]: Checked inductivity of 10 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:58:36,450 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:36,450 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-24 20:58:36,450 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:58:36,450 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:58:36,450 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:58:36,451 INFO ]: Start difference. First operand 34 states and 72 transitions. Second operand 13 states. [2018-06-24 20:58:36,787 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:36,787 INFO ]: Finished difference Result 47 states and 113 transitions. [2018-06-24 20:58:36,787 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:58:36,787 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-24 20:58:36,787 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:36,789 INFO ]: With dead ends: 47 [2018-06-24 20:58:36,789 INFO ]: Without dead ends: 47 [2018-06-24 20:58:36,789 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:58:36,789 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-24 20:58:36,797 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-06-24 20:58:36,797 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:58:36,799 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 80 transitions. [2018-06-24 20:58:36,799 INFO ]: Start accepts. Automaton has 37 states and 80 transitions. Word has length 17 [2018-06-24 20:58:36,799 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:36,799 INFO ]: Abstraction has 37 states and 80 transitions. [2018-06-24 20:58:36,799 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:58:36,799 INFO ]: Start isEmpty. Operand 37 states and 80 transitions. [2018-06-24 20:58:36,801 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:58:36,801 INFO ]: Found error trace [2018-06-24 20:58:36,801 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:36,802 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:36,802 INFO ]: Analyzing trace with hash -945751879, now seen corresponding path program 1 times [2018-06-24 20:58:36,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:36,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:36,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:36,803 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:36,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:36,819 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:36,859 INFO ]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 20:58:36,859 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:58:36,860 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:58:36,860 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:58:36,860 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:58:36,860 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:58:36,860 INFO ]: Start difference. First operand 37 states and 80 transitions. Second operand 5 states. [2018-06-24 20:58:36,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:36,958 INFO ]: Finished difference Result 43 states and 95 transitions. [2018-06-24 20:58:36,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:58:36,959 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-24 20:58:36,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:36,961 INFO ]: With dead ends: 43 [2018-06-24 20:58:36,961 INFO ]: Without dead ends: 41 [2018-06-24 20:58:36,961 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:58:36,961 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:58:36,968 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 35. [2018-06-24 20:58:36,968 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:58:36,969 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 69 transitions. [2018-06-24 20:58:36,969 INFO ]: Start accepts. Automaton has 35 states and 69 transitions. Word has length 17 [2018-06-24 20:58:36,969 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:36,969 INFO ]: Abstraction has 35 states and 69 transitions. [2018-06-24 20:58:36,969 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:58:36,969 INFO ]: Start isEmpty. Operand 35 states and 69 transitions. [2018-06-24 20:58:36,970 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:58:36,970 INFO ]: Found error trace [2018-06-24 20:58:36,970 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:36,970 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:36,970 INFO ]: Analyzing trace with hash -1495932046, now seen corresponding path program 1 times [2018-06-24 20:58:36,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:36,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:36,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:36,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:36,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:36,986 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:37,067 INFO ]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:58:37,067 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:37,067 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-24 20:58:37,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:37,109 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:37,111 INFO ]: Computing forward predicates... [2018-06-24 20:58:37,262 INFO ]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 20:58:37,281 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:58:37,281 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2018-06-24 20:58:37,281 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:58:37,281 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:58:37,281 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:58:37,282 INFO ]: Start difference. First operand 35 states and 69 transitions. Second operand 13 states. [2018-06-24 20:58:37,909 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:37,909 INFO ]: Finished difference Result 55 states and 127 transitions. [2018-06-24 20:58:37,928 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:58:37,928 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-24 20:58:37,928 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:37,930 INFO ]: With dead ends: 55 [2018-06-24 20:58:37,930 INFO ]: Without dead ends: 55 [2018-06-24 20:58:37,930 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:58:37,930 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 20:58:37,939 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 43. [2018-06-24 20:58:37,939 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 20:58:37,939 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 89 transitions. [2018-06-24 20:58:37,940 INFO ]: Start accepts. Automaton has 43 states and 89 transitions. Word has length 17 [2018-06-24 20:58:37,940 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:37,940 INFO ]: Abstraction has 43 states and 89 transitions. [2018-06-24 20:58:37,940 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:58:37,940 INFO ]: Start isEmpty. Operand 43 states and 89 transitions. [2018-06-24 20:58:37,941 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:58:37,941 INFO ]: Found error trace [2018-06-24 20:58:37,941 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:37,941 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:37,941 INFO ]: Analyzing trace with hash 186413645, now seen corresponding path program 1 times [2018-06-24 20:58:37,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:37,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:37,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:37,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:37,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:37,957 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:38,239 INFO ]: Checked inductivity of 13 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 20:58:38,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:38,239 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-24 20:58:38,245 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:38,270 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:38,272 INFO ]: Computing forward predicates... [2018-06-24 20:58:38,437 INFO ]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 20:58:38,456 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:38,456 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-06-24 20:58:38,456 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:58:38,456 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:58:38,456 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:58:38,456 INFO ]: Start difference. First operand 43 states and 89 transitions. Second operand 14 states. [2018-06-24 20:58:39,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:39,135 INFO ]: Finished difference Result 65 states and 158 transitions. [2018-06-24 20:58:39,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:58:39,135 INFO ]: Start accepts. Automaton has 14 states. Word has length 18 [2018-06-24 20:58:39,135 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:39,137 INFO ]: With dead ends: 65 [2018-06-24 20:58:39,137 INFO ]: Without dead ends: 64 [2018-06-24 20:58:39,137 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:58:39,137 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-24 20:58:39,147 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 45. [2018-06-24 20:58:39,147 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 20:58:39,148 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 93 transitions. [2018-06-24 20:58:39,148 INFO ]: Start accepts. Automaton has 45 states and 93 transitions. Word has length 18 [2018-06-24 20:58:39,148 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:39,148 INFO ]: Abstraction has 45 states and 93 transitions. [2018-06-24 20:58:39,148 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:58:39,148 INFO ]: Start isEmpty. Operand 45 states and 93 transitions. [2018-06-24 20:58:39,149 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:58:39,149 INFO ]: Found error trace [2018-06-24 20:58:39,149 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:39,149 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:39,149 INFO ]: Analyzing trace with hash -713588043, now seen corresponding path program 2 times [2018-06-24 20:58:39,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:39,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:39,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:39,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:39,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:39,165 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:39,316 INFO ]: Checked inductivity of 23 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 20:58:39,316 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:39,317 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-24 20:58:39,322 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:58:39,378 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:58:39,378 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:39,381 INFO ]: Computing forward predicates... [2018-06-24 20:58:39,622 INFO ]: Checked inductivity of 23 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 20:58:39,642 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:39,642 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-06-24 20:58:39,642 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:58:39,642 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:58:39,642 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:58:39,643 INFO ]: Start difference. First operand 45 states and 93 transitions. Second operand 14 states. [2018-06-24 20:58:40,195 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:40,195 INFO ]: Finished difference Result 59 states and 122 transitions. [2018-06-24 20:58:40,196 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:58:40,196 INFO ]: Start accepts. Automaton has 14 states. Word has length 23 [2018-06-24 20:58:40,196 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:40,197 INFO ]: With dead ends: 59 [2018-06-24 20:58:40,197 INFO ]: Without dead ends: 42 [2018-06-24 20:58:40,197 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:58:40,197 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 20:58:40,203 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-06-24 20:58:40,203 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:58:40,204 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 77 transitions. [2018-06-24 20:58:40,204 INFO ]: Start accepts. Automaton has 38 states and 77 transitions. Word has length 23 [2018-06-24 20:58:40,204 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:40,204 INFO ]: Abstraction has 38 states and 77 transitions. [2018-06-24 20:58:40,204 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:58:40,204 INFO ]: Start isEmpty. Operand 38 states and 77 transitions. [2018-06-24 20:58:40,206 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:58:40,206 INFO ]: Found error trace [2018-06-24 20:58:40,207 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:40,207 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:40,207 INFO ]: Analyzing trace with hash 285038145, now seen corresponding path program 1 times [2018-06-24 20:58:40,207 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:40,207 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:40,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:40,207 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:40,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:40,226 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:40,453 INFO ]: Checked inductivity of 25 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:58:40,453 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:40,453 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:40,463 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:40,494 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:40,497 INFO ]: Computing forward predicates... [2018-06-24 20:58:40,716 INFO ]: Checked inductivity of 25 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:58:40,735 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:40,735 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-24 20:58:40,736 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:58:40,736 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:58:40,736 INFO ]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:58:40,736 INFO ]: Start difference. First operand 38 states and 77 transitions. Second operand 24 states. [2018-06-24 20:58:41,814 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:41,814 INFO ]: Finished difference Result 50 states and 111 transitions. [2018-06-24 20:58:41,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:58:41,814 INFO ]: Start accepts. Automaton has 24 states. Word has length 24 [2018-06-24 20:58:41,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:41,815 INFO ]: With dead ends: 50 [2018-06-24 20:58:41,815 INFO ]: Without dead ends: 50 [2018-06-24 20:58:41,816 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:58:41,816 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-24 20:58:41,821 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 44. [2018-06-24 20:58:41,821 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 20:58:41,822 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 91 transitions. [2018-06-24 20:58:41,822 INFO ]: Start accepts. Automaton has 44 states and 91 transitions. Word has length 24 [2018-06-24 20:58:41,822 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:41,822 INFO ]: Abstraction has 44 states and 91 transitions. [2018-06-24 20:58:41,822 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:58:41,822 INFO ]: Start isEmpty. Operand 44 states and 91 transitions. [2018-06-24 20:58:41,824 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:58:41,824 INFO ]: Found error trace [2018-06-24 20:58:41,824 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:41,824 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:41,824 INFO ]: Analyzing trace with hash -1820724324, now seen corresponding path program 1 times [2018-06-24 20:58:41,824 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:41,824 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:41,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:41,825 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:41,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:41,843 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:41,994 INFO ]: Checked inductivity of 27 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 20:58:41,994 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:41,994 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-24 20:58:42,000 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:42,044 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:42,047 INFO ]: Computing forward predicates... [2018-06-24 20:58:42,181 INFO ]: Checked inductivity of 27 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 20:58:42,211 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:42,211 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-06-24 20:58:42,212 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:58:42,212 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:58:42,212 INFO ]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:58:42,212 INFO ]: Start difference. First operand 44 states and 91 transitions. Second operand 15 states. [2018-06-24 20:58:42,772 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-24 20:58:42,903 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:42,904 INFO ]: Finished difference Result 59 states and 133 transitions. [2018-06-24 20:58:42,905 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:58:42,905 INFO ]: Start accepts. Automaton has 15 states. Word has length 24 [2018-06-24 20:58:42,905 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:42,906 INFO ]: With dead ends: 59 [2018-06-24 20:58:42,906 INFO ]: Without dead ends: 59 [2018-06-24 20:58:42,907 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:58:42,907 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-24 20:58:42,922 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-06-24 20:58:42,922 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-24 20:58:42,982 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 111 transitions. [2018-06-24 20:58:42,982 INFO ]: Start accepts. Automaton has 52 states and 111 transitions. Word has length 24 [2018-06-24 20:58:42,982 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:42,982 INFO ]: Abstraction has 52 states and 111 transitions. [2018-06-24 20:58:42,982 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:58:42,982 INFO ]: Start isEmpty. Operand 52 states and 111 transitions. [2018-06-24 20:58:42,984 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:58:42,984 INFO ]: Found error trace [2018-06-24 20:58:42,984 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:42,984 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:42,984 INFO ]: Analyzing trace with hash 1421074079, now seen corresponding path program 1 times [2018-06-24 20:58:42,984 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:42,984 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:42,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:42,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:42,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:43,005 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:43,243 INFO ]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:58:43,243 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:58:43,243 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:58:43,243 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:58:43,243 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:58:43,243 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:58:43,244 INFO ]: Start difference. First operand 52 states and 111 transitions. Second operand 3 states. [2018-06-24 20:58:43,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:43,359 INFO ]: Finished difference Result 68 states and 150 transitions. [2018-06-24 20:58:43,362 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:58:43,362 INFO ]: Start accepts. Automaton has 3 states. Word has length 25 [2018-06-24 20:58:43,362 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:43,363 INFO ]: With dead ends: 68 [2018-06-24 20:58:43,363 INFO ]: Without dead ends: 68 [2018-06-24 20:58:43,363 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:58:43,364 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-24 20:58:43,374 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 59. [2018-06-24 20:58:43,374 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-24 20:58:43,375 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 128 transitions. [2018-06-24 20:58:43,375 INFO ]: Start accepts. Automaton has 59 states and 128 transitions. Word has length 25 [2018-06-24 20:58:43,375 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:43,375 INFO ]: Abstraction has 59 states and 128 transitions. [2018-06-24 20:58:43,375 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:58:43,375 INFO ]: Start isEmpty. Operand 59 states and 128 transitions. [2018-06-24 20:58:43,377 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:58:43,377 INFO ]: Found error trace [2018-06-24 20:58:43,377 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:43,377 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:43,377 INFO ]: Analyzing trace with hash -1993684196, now seen corresponding path program 1 times [2018-06-24 20:58:43,377 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:43,377 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:43,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:43,378 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:43,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:43,400 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:43,479 INFO ]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-24 20:58:43,479 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:58:43,479 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:58:43,480 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:58:43,480 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:58:43,480 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:58:43,480 INFO ]: Start difference. First operand 59 states and 128 transitions. Second operand 3 states. [2018-06-24 20:58:43,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:43,613 INFO ]: Finished difference Result 69 states and 148 transitions. [2018-06-24 20:58:43,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:58:43,613 INFO ]: Start accepts. Automaton has 3 states. Word has length 25 [2018-06-24 20:58:43,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:43,614 INFO ]: With dead ends: 69 [2018-06-24 20:58:43,614 INFO ]: Without dead ends: 58 [2018-06-24 20:58:43,614 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:58:43,614 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 20:58:43,622 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-06-24 20:58:43,622 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-24 20:58:43,629 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2018-06-24 20:58:43,629 INFO ]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 25 [2018-06-24 20:58:43,629 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:43,629 INFO ]: Abstraction has 58 states and 105 transitions. [2018-06-24 20:58:43,629 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:58:43,629 INFO ]: Start isEmpty. Operand 58 states and 105 transitions. [2018-06-24 20:58:43,631 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:58:43,631 INFO ]: Found error trace [2018-06-24 20:58:43,631 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:43,631 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:43,631 INFO ]: Analyzing trace with hash 1795724475, now seen corresponding path program 1 times [2018-06-24 20:58:43,631 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:43,631 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:43,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:43,632 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:43,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:43,646 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:43,734 INFO ]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-24 20:58:43,734 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:58:43,734 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:58:43,735 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:58:43,735 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:58:43,735 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:58:43,735 INFO ]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2018-06-24 20:58:43,836 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:43,836 INFO ]: Finished difference Result 73 states and 127 transitions. [2018-06-24 20:58:43,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:58:43,837 INFO ]: Start accepts. Automaton has 3 states. Word has length 25 [2018-06-24 20:58:43,837 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:43,837 INFO ]: With dead ends: 73 [2018-06-24 20:58:43,837 INFO ]: Without dead ends: 54 [2018-06-24 20:58:43,837 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:58:43,838 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-24 20:58:43,845 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-06-24 20:58:43,845 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-24 20:58:43,846 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 74 transitions. [2018-06-24 20:58:43,846 INFO ]: Start accepts. Automaton has 46 states and 74 transitions. Word has length 25 [2018-06-24 20:58:43,846 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:43,846 INFO ]: Abstraction has 46 states and 74 transitions. [2018-06-24 20:58:43,846 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:58:43,846 INFO ]: Start isEmpty. Operand 46 states and 74 transitions. [2018-06-24 20:58:43,847 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:58:43,847 INFO ]: Found error trace [2018-06-24 20:58:43,847 INFO ]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:43,847 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:43,848 INFO ]: Analyzing trace with hash -982566946, now seen corresponding path program 2 times [2018-06-24 20:58:43,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:43,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:43,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:43,848 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:43,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:43,860 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:43,937 INFO ]: Checked inductivity of 30 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 20:58:43,937 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:43,937 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-24 20:58:43,949 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:58:43,983 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:58:43,983 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:43,987 INFO ]: Computing forward predicates... [2018-06-24 20:58:44,445 INFO ]: Checked inductivity of 30 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 20:58:44,472 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:44,472 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-24 20:58:44,472 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:58:44,472 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:58:44,472 INFO ]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:58:44,472 INFO ]: Start difference. First operand 46 states and 74 transitions. Second operand 18 states. [2018-06-24 20:58:44,959 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:44,959 INFO ]: Finished difference Result 50 states and 84 transitions. [2018-06-24 20:58:44,960 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:58:44,960 INFO ]: Start accepts. Automaton has 18 states. Word has length 25 [2018-06-24 20:58:44,960 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:44,960 INFO ]: With dead ends: 50 [2018-06-24 20:58:44,960 INFO ]: Without dead ends: 50 [2018-06-24 20:58:44,961 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:58:44,961 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-24 20:58:44,964 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-06-24 20:58:44,964 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-24 20:58:44,965 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2018-06-24 20:58:44,965 INFO ]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 25 [2018-06-24 20:58:44,965 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:44,965 INFO ]: Abstraction has 46 states and 73 transitions. [2018-06-24 20:58:44,965 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:58:44,965 INFO ]: Start isEmpty. Operand 46 states and 73 transitions. [2018-06-24 20:58:44,970 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:58:44,970 INFO ]: Found error trace [2018-06-24 20:58:44,971 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:44,971 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:44,971 INFO ]: Analyzing trace with hash 950434229, now seen corresponding path program 2 times [2018-06-24 20:58:44,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:44,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:44,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:44,971 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:44,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:44,986 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:45,155 INFO ]: Checked inductivity of 32 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:58:45,155 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:45,155 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) [2018-06-24 20:58:45,170 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:45,219 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:58:45,219 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:45,222 INFO ]: Computing forward predicates... [2018-06-24 20:58:45,353 INFO ]: Checked inductivity of 32 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:58:45,372 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:45,373 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-06-24 20:58:45,373 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:58:45,373 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:58:45,373 INFO ]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:58:45,373 INFO ]: Start difference. First operand 46 states and 73 transitions. Second operand 19 states. [2018-06-24 20:58:45,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:45,697 INFO ]: Finished difference Result 54 states and 90 transitions. [2018-06-24 20:58:45,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:58:45,698 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-24 20:58:45,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:45,698 INFO ]: With dead ends: 54 [2018-06-24 20:58:45,698 INFO ]: Without dead ends: 51 [2018-06-24 20:58:45,699 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:58:45,699 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 20:58:45,702 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-06-24 20:58:45,702 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 20:58:45,703 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2018-06-24 20:58:45,703 INFO ]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 25 [2018-06-24 20:58:45,703 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:45,703 INFO ]: Abstraction has 49 states and 78 transitions. [2018-06-24 20:58:45,703 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:58:45,703 INFO ]: Start isEmpty. Operand 49 states and 78 transitions. [2018-06-24 20:58:45,707 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:58:45,707 INFO ]: Found error trace [2018-06-24 20:58:45,707 INFO ]: trace histogram [5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:45,707 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:45,707 INFO ]: Analyzing trace with hash 1999928203, now seen corresponding path program 3 times [2018-06-24 20:58:45,707 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:45,707 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:45,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:45,708 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:45,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:45,722 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:46,464 INFO ]: Checked inductivity of 43 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:58:46,464 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:46,464 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-24 20:58:46,470 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:58:46,507 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:58:46,507 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:46,510 INFO ]: Computing forward predicates... [2018-06-24 20:58:46,650 INFO ]: Checked inductivity of 43 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-24 20:58:46,669 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:46,669 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2018-06-24 20:58:46,669 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:58:46,669 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:58:46,669 INFO ]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:58:46,669 INFO ]: Start difference. First operand 49 states and 78 transitions. Second operand 18 states. [2018-06-24 20:58:47,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:47,338 INFO ]: Finished difference Result 53 states and 88 transitions. [2018-06-24 20:58:47,339 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:58:47,339 INFO ]: Start accepts. Automaton has 18 states. Word has length 30 [2018-06-24 20:58:47,339 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:47,339 INFO ]: With dead ends: 53 [2018-06-24 20:58:47,339 INFO ]: Without dead ends: 46 [2018-06-24 20:58:47,340 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=260, Invalid=1222, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:58:47,340 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 20:58:47,342 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-06-24 20:58:47,342 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 20:58:47,345 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 68 transitions. [2018-06-24 20:58:47,345 INFO ]: Start accepts. Automaton has 42 states and 68 transitions. Word has length 30 [2018-06-24 20:58:47,345 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:47,345 INFO ]: Abstraction has 42 states and 68 transitions. [2018-06-24 20:58:47,345 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:58:47,346 INFO ]: Start isEmpty. Operand 42 states and 68 transitions. [2018-06-24 20:58:47,346 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:58:47,346 INFO ]: Found error trace [2018-06-24 20:58:47,346 INFO ]: trace histogram [5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:47,346 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:47,347 INFO ]: Analyzing trace with hash -788914254, now seen corresponding path program 3 times [2018-06-24 20:58:47,347 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:47,347 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:47,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:47,347 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:47,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:47,362 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:47,441 INFO ]: Checked inductivity of 53 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 20:58:47,441 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:47,441 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-24 20:58:47,447 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:58:47,484 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:58:47,484 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:47,487 INFO ]: Computing forward predicates... [2018-06-24 20:58:47,659 INFO ]: Checked inductivity of 53 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 20:58:47,678 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:47,678 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-06-24 20:58:47,679 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:58:47,679 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:58:47,679 INFO ]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:58:47,679 INFO ]: Start difference. First operand 42 states and 68 transitions. Second operand 19 states. [2018-06-24 20:58:47,975 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:47,975 INFO ]: Finished difference Result 57 states and 97 transitions. [2018-06-24 20:58:47,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:58:47,976 INFO ]: Start accepts. Automaton has 19 states. Word has length 31 [2018-06-24 20:58:47,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:47,977 INFO ]: With dead ends: 57 [2018-06-24 20:58:47,977 INFO ]: Without dead ends: 57 [2018-06-24 20:58:47,977 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=839, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:58:47,978 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 20:58:47,981 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 50. [2018-06-24 20:58:47,981 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-24 20:58:47,982 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 79 transitions. [2018-06-24 20:58:47,982 INFO ]: Start accepts. Automaton has 50 states and 79 transitions. Word has length 31 [2018-06-24 20:58:47,982 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:47,982 INFO ]: Abstraction has 50 states and 79 transitions. [2018-06-24 20:58:47,982 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:58:47,982 INFO ]: Start isEmpty. Operand 50 states and 79 transitions. [2018-06-24 20:58:47,983 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:58:47,984 INFO ]: Found error trace [2018-06-24 20:58:47,984 INFO ]: trace histogram [5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:47,984 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:47,984 INFO ]: Analyzing trace with hash 1418009691, now seen corresponding path program 4 times [2018-06-24 20:58:47,984 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:47,984 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:47,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:47,984 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:47,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:47,998 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:48,979 INFO ]: Checked inductivity of 49 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:58:48,979 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:48,979 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-24 20:58:48,986 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:58:49,024 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:58:49,024 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:49,027 INFO ]: Computing forward predicates... [2018-06-24 20:58:49,288 INFO ]: Checked inductivity of 49 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 20:58:49,307 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:49,307 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2018-06-24 20:58:49,307 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:58:49,308 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:58:49,308 INFO ]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:58:49,308 INFO ]: Start difference. First operand 50 states and 79 transitions. Second operand 28 states. [2018-06-24 20:58:50,111 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:50,111 INFO ]: Finished difference Result 57 states and 94 transitions. [2018-06-24 20:58:50,112 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:58:50,112 INFO ]: Start accepts. Automaton has 28 states. Word has length 31 [2018-06-24 20:58:50,112 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:50,113 INFO ]: With dead ends: 57 [2018-06-24 20:58:50,113 INFO ]: Without dead ends: 57 [2018-06-24 20:58:50,113 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=272, Invalid=1620, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:58:50,113 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 20:58:50,116 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-06-24 20:58:50,116 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-24 20:58:50,117 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2018-06-24 20:58:50,117 INFO ]: Start accepts. Automaton has 53 states and 83 transitions. Word has length 31 [2018-06-24 20:58:50,117 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:50,117 INFO ]: Abstraction has 53 states and 83 transitions. [2018-06-24 20:58:50,117 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:58:50,117 INFO ]: Start isEmpty. Operand 53 states and 83 transitions. [2018-06-24 20:58:50,118 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:58:50,118 INFO ]: Found error trace [2018-06-24 20:58:50,118 INFO ]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:50,118 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:50,118 INFO ]: Analyzing trace with hash -1822417488, now seen corresponding path program 5 times [2018-06-24 20:58:50,118 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:50,118 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:50,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:50,119 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:50,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:50,135 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:50,326 INFO ]: Checked inductivity of 56 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 20:58:50,326 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:50,326 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-24 20:58:50,332 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:58:50,376 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 20:58:50,376 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:50,379 INFO ]: Computing forward predicates... [2018-06-24 20:58:50,594 INFO ]: Checked inductivity of 56 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-24 20:58:50,613 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:50,613 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-06-24 20:58:50,613 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:58:50,613 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:58:50,614 INFO ]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:58:50,614 INFO ]: Start difference. First operand 53 states and 83 transitions. Second operand 23 states. [2018-06-24 20:58:51,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:51,374 INFO ]: Finished difference Result 63 states and 102 transitions. [2018-06-24 20:58:51,375 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:58:51,375 INFO ]: Start accepts. Automaton has 23 states. Word has length 32 [2018-06-24 20:58:51,375 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:51,375 INFO ]: With dead ends: 63 [2018-06-24 20:58:51,375 INFO ]: Without dead ends: 60 [2018-06-24 20:58:51,376 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=358, Invalid=1994, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:58:51,376 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-24 20:58:51,378 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-06-24 20:58:51,378 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-24 20:58:51,379 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 87 transitions. [2018-06-24 20:58:51,379 INFO ]: Start accepts. Automaton has 56 states and 87 transitions. Word has length 32 [2018-06-24 20:58:51,379 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:51,379 INFO ]: Abstraction has 56 states and 87 transitions. [2018-06-24 20:58:51,379 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:58:51,379 INFO ]: Start isEmpty. Operand 56 states and 87 transitions. [2018-06-24 20:58:51,380 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:58:51,380 INFO ]: Found error trace [2018-06-24 20:58:51,380 INFO ]: trace histogram [6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:51,380 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:51,380 INFO ]: Analyzing trace with hash 1642133109, now seen corresponding path program 6 times [2018-06-24 20:58:51,380 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:51,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:51,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:51,381 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:51,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:51,398 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:51,506 INFO ]: Checked inductivity of 72 backedges. 35 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 20:58:51,506 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:51,506 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-24 20:58:51,512 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:58:51,559 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:58:51,559 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:51,562 INFO ]: Computing forward predicates... [2018-06-24 20:58:51,855 INFO ]: Checked inductivity of 72 backedges. 35 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 20:58:51,875 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:51,875 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-06-24 20:58:51,875 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:58:51,875 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:58:51,875 INFO ]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:58:51,875 INFO ]: Start difference. First operand 56 states and 87 transitions. Second operand 21 states. [2018-06-24 20:58:52,548 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:52,548 INFO ]: Finished difference Result 58 states and 94 transitions. [2018-06-24 20:58:52,550 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:58:52,550 INFO ]: Start accepts. Automaton has 21 states. Word has length 37 [2018-06-24 20:58:52,550 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:52,551 INFO ]: With dead ends: 58 [2018-06-24 20:58:52,551 INFO ]: Without dead ends: 48 [2018-06-24 20:58:52,551 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=323, Invalid=1237, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:58:52,551 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-24 20:58:52,554 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-06-24 20:58:52,554 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-24 20:58:52,554 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2018-06-24 20:58:52,554 INFO ]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 37 [2018-06-24 20:58:52,554 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:52,554 INFO ]: Abstraction has 46 states and 73 transitions. [2018-06-24 20:58:52,554 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:58:52,555 INFO ]: Start isEmpty. Operand 46 states and 73 transitions. [2018-06-24 20:58:52,555 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-24 20:58:52,555 INFO ]: Found error trace [2018-06-24 20:58:52,555 INFO ]: trace histogram [7, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:52,555 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:52,555 INFO ]: Analyzing trace with hash -621122792, now seen corresponding path program 1 times [2018-06-24 20:58:52,555 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:52,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:52,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:52,556 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:52,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:52,574 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:52,964 INFO ]: Checked inductivity of 114 backedges. 57 proven. 25 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-24 20:58:52,964 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:52,964 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-24 20:58:52,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:53,047 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:53,078 INFO ]: Computing forward predicates... [2018-06-24 20:58:53,585 INFO ]: Checked inductivity of 114 backedges. 57 proven. 25 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-24 20:58:53,607 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:53,607 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-06-24 20:58:53,607 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:58:53,607 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:58:53,607 INFO ]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:58:53,607 INFO ]: Start difference. First operand 46 states and 73 transitions. Second operand 25 states. [2018-06-24 20:58:54,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:54,123 INFO ]: Finished difference Result 67 states and 115 transitions. [2018-06-24 20:58:54,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:58:54,124 INFO ]: Start accepts. Automaton has 25 states. Word has length 44 [2018-06-24 20:58:54,124 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:54,124 INFO ]: With dead ends: 67 [2018-06-24 20:58:54,124 INFO ]: Without dead ends: 67 [2018-06-24 20:58:54,125 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=337, Invalid=1733, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:58:54,125 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-24 20:58:54,131 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 60. [2018-06-24 20:58:54,131 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-24 20:58:54,132 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 97 transitions. [2018-06-24 20:58:54,132 INFO ]: Start accepts. Automaton has 60 states and 97 transitions. Word has length 44 [2018-06-24 20:58:54,132 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:54,132 INFO ]: Abstraction has 60 states and 97 transitions. [2018-06-24 20:58:54,132 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:58:54,132 INFO ]: Start isEmpty. Operand 60 states and 97 transitions. [2018-06-24 20:58:54,133 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:58:54,133 INFO ]: Found error trace [2018-06-24 20:58:54,133 INFO ]: trace histogram [6, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:54,133 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:54,133 INFO ]: Analyzing trace with hash 323188828, now seen corresponding path program 4 times [2018-06-24 20:58:54,133 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:54,133 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:54,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:54,134 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:54,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:54,148 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:54,573 INFO ]: Checked inductivity of 88 backedges. 41 proven. 21 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-24 20:58:54,573 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:54,573 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-24 20:58:54,581 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:58:54,636 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:58:54,636 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:54,638 INFO ]: Computing forward predicates... [2018-06-24 20:58:54,835 INFO ]: Checked inductivity of 88 backedges. 41 proven. 21 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-24 20:58:54,858 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:54,858 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-06-24 20:58:54,858 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:58:54,858 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:58:54,858 INFO ]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:58:54,859 INFO ]: Start difference. First operand 60 states and 97 transitions. Second operand 23 states. [2018-06-24 20:58:55,391 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:55,391 INFO ]: Finished difference Result 64 states and 106 transitions. [2018-06-24 20:58:55,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:58:55,391 INFO ]: Start accepts. Automaton has 23 states. Word has length 38 [2018-06-24 20:58:55,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:55,391 INFO ]: With dead ends: 64 [2018-06-24 20:58:55,391 INFO ]: Without dead ends: 64 [2018-06-24 20:58:55,392 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=324, Invalid=1316, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:58:55,392 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-24 20:58:55,395 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 57. [2018-06-24 20:58:55,395 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-24 20:58:55,396 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 88 transitions. [2018-06-24 20:58:55,396 INFO ]: Start accepts. Automaton has 57 states and 88 transitions. Word has length 38 [2018-06-24 20:58:55,396 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:55,396 INFO ]: Abstraction has 57 states and 88 transitions. [2018-06-24 20:58:55,396 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:58:55,396 INFO ]: Start isEmpty. Operand 57 states and 88 transitions. [2018-06-24 20:58:55,399 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:58:55,399 INFO ]: Found error trace [2018-06-24 20:58:55,399 INFO ]: trace histogram [6, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:55,399 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:55,399 INFO ]: Analyzing trace with hash 527060609, now seen corresponding path program 7 times [2018-06-24 20:58:55,399 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:55,399 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:55,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:55,400 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:55,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:55,416 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:55,779 INFO ]: Checked inductivity of 82 backedges. 13 proven. 54 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:58:55,779 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:55,779 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-24 20:58:55,785 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:55,833 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:55,837 INFO ]: Computing forward predicates... [2018-06-24 20:58:56,195 INFO ]: Checked inductivity of 82 backedges. 22 proven. 41 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-24 20:58:56,214 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:56,214 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 34 [2018-06-24 20:58:56,214 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:58:56,215 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:58:56,215 INFO ]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:58:56,215 INFO ]: Start difference. First operand 57 states and 88 transitions. Second operand 34 states. [2018-06-24 20:58:57,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:57,171 INFO ]: Finished difference Result 64 states and 103 transitions. [2018-06-24 20:58:57,171 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:58:57,171 INFO ]: Start accepts. Automaton has 34 states. Word has length 38 [2018-06-24 20:58:57,171 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:57,172 INFO ]: With dead ends: 64 [2018-06-24 20:58:57,172 INFO ]: Without dead ends: 64 [2018-06-24 20:58:57,173 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=385, Invalid=2477, Unknown=0, NotChecked=0, Total=2862 [2018-06-24 20:58:57,173 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-24 20:58:57,177 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-06-24 20:58:57,177 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-24 20:58:57,178 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2018-06-24 20:58:57,178 INFO ]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 38 [2018-06-24 20:58:57,178 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:57,178 INFO ]: Abstraction has 60 states and 92 transitions. [2018-06-24 20:58:57,178 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:58:57,178 INFO ]: Start isEmpty. Operand 60 states and 92 transitions. [2018-06-24 20:58:57,179 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:58:57,179 INFO ]: Found error trace [2018-06-24 20:58:57,179 INFO ]: trace histogram [6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:57,179 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:57,179 INFO ]: Analyzing trace with hash -680346251, now seen corresponding path program 5 times [2018-06-24 20:58:57,179 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:57,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:57,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:57,183 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:57,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:57,199 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:57,570 INFO ]: Checked inductivity of 97 backedges. 20 proven. 46 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-24 20:58:57,570 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:57,570 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:57,575 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:58:57,628 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:58:57,628 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:57,631 INFO ]: Computing forward predicates... [2018-06-24 20:58:58,617 INFO ]: Checked inductivity of 97 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-24 20:58:58,642 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:58,642 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-06-24 20:58:58,642 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:58:58,642 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:58:58,642 INFO ]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:58:58,642 INFO ]: Start difference. First operand 60 states and 92 transitions. Second operand 27 states. [2018-06-24 20:58:59,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:59,236 INFO ]: Finished difference Result 71 states and 113 transitions. [2018-06-24 20:58:59,236 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:58:59,236 INFO ]: Start accepts. Automaton has 27 states. Word has length 39 [2018-06-24 20:58:59,236 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:59,237 INFO ]: With dead ends: 71 [2018-06-24 20:58:59,237 INFO ]: Without dead ends: 68 [2018-06-24 20:58:59,237 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=519, Invalid=2451, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 20:58:59,237 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-24 20:58:59,239 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 63. [2018-06-24 20:58:59,239 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-24 20:58:59,240 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2018-06-24 20:58:59,240 INFO ]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 39 [2018-06-24 20:58:59,240 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:59,240 INFO ]: Abstraction has 63 states and 97 transitions. [2018-06-24 20:58:59,240 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:58:59,240 INFO ]: Start isEmpty. Operand 63 states and 97 transitions. [2018-06-24 20:58:59,241 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-24 20:58:59,241 INFO ]: Found error trace [2018-06-24 20:58:59,241 INFO ]: trace histogram [7, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:59,241 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:59,241 INFO ]: Analyzing trace with hash -26302773, now seen corresponding path program 8 times [2018-06-24 20:58:59,241 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:59,241 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:59,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:59,242 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:59,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:59,257 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:59,368 INFO ]: Checked inductivity of 110 backedges. 51 proven. 23 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:58:59,368 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:59,368 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:59,375 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:58:59,443 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:58:59,443 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:59,446 INFO ]: Computing forward predicates... [2018-06-24 20:58:59,589 INFO ]: Checked inductivity of 110 backedges. 51 proven. 23 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:58:59,608 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:59,608 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-06-24 20:58:59,608 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:58:59,608 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:58:59,608 INFO ]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:58:59,608 INFO ]: Start difference. First operand 63 states and 97 transitions. Second operand 25 states. [2018-06-24 20:59:00,041 WARN ]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-24 20:59:00,489 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:00,489 INFO ]: Finished difference Result 68 states and 108 transitions. [2018-06-24 20:59:00,489 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:59:00,489 INFO ]: Start accepts. Automaton has 25 states. Word has length 44 [2018-06-24 20:59:00,489 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:00,490 INFO ]: With dead ends: 68 [2018-06-24 20:59:00,490 INFO ]: Without dead ends: 55 [2018-06-24 20:59:00,491 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=447, Invalid=1809, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:59:00,491 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 20:59:00,494 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-06-24 20:59:00,494 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-24 20:59:00,495 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2018-06-24 20:59:00,495 INFO ]: Start accepts. Automaton has 53 states and 83 transitions. Word has length 44 [2018-06-24 20:59:00,495 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:00,495 INFO ]: Abstraction has 53 states and 83 transitions. [2018-06-24 20:59:00,495 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:59:00,495 INFO ]: Start isEmpty. Operand 53 states and 83 transitions. [2018-06-24 20:59:00,496 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-24 20:59:00,496 INFO ]: Found error trace [2018-06-24 20:59:00,496 INFO ]: trace histogram [7, 6, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:00,496 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:00,496 INFO ]: Analyzing trace with hash -1547665966, now seen corresponding path program 9 times [2018-06-24 20:59:00,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:00,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:00,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:00,497 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:00,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:00,513 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:00,704 INFO ]: Checked inductivity of 120 backedges. 51 proven. 31 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-24 20:59:00,704 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:00,704 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:00,710 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:59:00,767 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:59:00,767 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:00,770 INFO ]: Computing forward predicates... [2018-06-24 20:59:01,457 INFO ]: Checked inductivity of 120 backedges. 22 proven. 51 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-24 20:59:01,476 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:01,476 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-24 20:59:01,476 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:59:01,476 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:59:01,476 INFO ]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:59:01,476 INFO ]: Start difference. First operand 53 states and 83 transitions. Second operand 26 states. [2018-06-24 20:59:01,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:01,866 INFO ]: Finished difference Result 54 states and 89 transitions. [2018-06-24 20:59:01,866 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:59:01,866 INFO ]: Start accepts. Automaton has 26 states. Word has length 45 [2018-06-24 20:59:01,866 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:01,866 INFO ]: With dead ends: 54 [2018-06-24 20:59:01,866 INFO ]: Without dead ends: 54 [2018-06-24 20:59:01,867 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=320, Invalid=1660, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:59:01,867 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-24 20:59:01,869 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-06-24 20:59:01,869 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-24 20:59:01,869 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 78 transitions. [2018-06-24 20:59:01,870 INFO ]: Start accepts. Automaton has 50 states and 78 transitions. Word has length 45 [2018-06-24 20:59:01,870 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:01,870 INFO ]: Abstraction has 50 states and 78 transitions. [2018-06-24 20:59:01,870 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:59:01,870 INFO ]: Start isEmpty. Operand 50 states and 78 transitions. [2018-06-24 20:59:01,871 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-24 20:59:01,871 INFO ]: Found error trace [2018-06-24 20:59:01,871 INFO ]: trace histogram [8, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:01,871 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:01,871 INFO ]: Analyzing trace with hash 342150582, now seen corresponding path program 2 times [2018-06-24 20:59:01,871 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:01,871 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:01,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:01,871 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:01,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:01,890 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:02,135 INFO ]: Checked inductivity of 163 backedges. 78 proven. 39 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-24 20:59:02,135 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:02,135 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:02,141 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:59:02,218 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:59:02,218 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:02,221 INFO ]: Computing forward predicates... [2018-06-24 20:59:02,699 INFO ]: Checked inductivity of 163 backedges. 78 proven. 39 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-24 20:59:02,731 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:02,731 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2018-06-24 20:59:02,731 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:59:02,731 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:59:02,731 INFO ]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:59:02,732 INFO ]: Start difference. First operand 50 states and 78 transitions. Second operand 29 states. [2018-06-24 20:59:03,264 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:03,264 INFO ]: Finished difference Result 74 states and 124 transitions. [2018-06-24 20:59:03,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:59:03,264 INFO ]: Start accepts. Automaton has 29 states. Word has length 51 [2018-06-24 20:59:03,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:03,265 INFO ]: With dead ends: 74 [2018-06-24 20:59:03,265 INFO ]: Without dead ends: 74 [2018-06-24 20:59:03,266 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=464, Invalid=2398, Unknown=0, NotChecked=0, Total=2862 [2018-06-24 20:59:03,266 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-24 20:59:03,270 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 67. [2018-06-24 20:59:03,270 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-24 20:59:03,270 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 106 transitions. [2018-06-24 20:59:03,270 INFO ]: Start accepts. Automaton has 67 states and 106 transitions. Word has length 51 [2018-06-24 20:59:03,271 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:03,271 INFO ]: Abstraction has 67 states and 106 transitions. [2018-06-24 20:59:03,271 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:59:03,271 INFO ]: Start isEmpty. Operand 67 states and 106 transitions. [2018-06-24 20:59:03,271 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-24 20:59:03,271 INFO ]: Found error trace [2018-06-24 20:59:03,271 INFO ]: trace histogram [7, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:03,271 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:03,271 INFO ]: Analyzing trace with hash -1357706254, now seen corresponding path program 6 times [2018-06-24 20:59:03,271 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:03,271 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:03,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:03,273 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:03,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:03,288 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:03,523 INFO ]: Checked inductivity of 132 backedges. 59 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-24 20:59:03,523 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:03,523 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:03,529 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:59:03,589 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:59:03,589 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:03,593 INFO ]: Computing forward predicates... [2018-06-24 20:59:03,788 INFO ]: Checked inductivity of 132 backedges. 59 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-24 20:59:03,807 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:03,807 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-06-24 20:59:03,808 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:59:03,808 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:59:03,808 INFO ]: CoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:59:03,808 INFO ]: Start difference. First operand 67 states and 106 transitions. Second operand 27 states. [2018-06-24 20:59:04,662 WARN ]: Spent 306.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2018-06-24 20:59:04,814 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:04,814 INFO ]: Finished difference Result 71 states and 115 transitions. [2018-06-24 20:59:04,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:59:04,814 INFO ]: Start accepts. Automaton has 27 states. Word has length 45 [2018-06-24 20:59:04,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:04,815 INFO ]: With dead ends: 71 [2018-06-24 20:59:04,815 INFO ]: Without dead ends: 71 [2018-06-24 20:59:04,816 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=452, Invalid=1900, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:59:04,816 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-24 20:59:04,818 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-06-24 20:59:04,818 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-24 20:59:04,819 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 97 transitions. [2018-06-24 20:59:04,819 INFO ]: Start accepts. Automaton has 64 states and 97 transitions. Word has length 45 [2018-06-24 20:59:04,819 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:04,819 INFO ]: Abstraction has 64 states and 97 transitions. [2018-06-24 20:59:04,819 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:59:04,819 INFO ]: Start isEmpty. Operand 64 states and 97 transitions. [2018-06-24 20:59:04,820 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-24 20:59:04,820 INFO ]: Found error trace [2018-06-24 20:59:04,820 INFO ]: trace histogram [7, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:04,820 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:04,820 INFO ]: Analyzing trace with hash -1906727653, now seen corresponding path program 10 times [2018-06-24 20:59:04,820 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:04,820 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:04,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:04,821 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:04,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:04,844 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:05,896 INFO ]: Checked inductivity of 124 backedges. 16 proven. 87 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:59:05,896 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:05,896 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:05,902 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:59:05,955 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:59:05,955 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:05,960 INFO ]: Computing forward predicates... [2018-06-24 20:59:06,480 INFO ]: Checked inductivity of 124 backedges. 28 proven. 66 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-24 20:59:06,499 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:06,499 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 40 [2018-06-24 20:59:06,500 INFO ]: Interpolant automaton has 40 states [2018-06-24 20:59:06,500 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 20:59:06,500 INFO ]: CoverageRelationStatistics Valid=120, Invalid=1440, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:59:06,500 INFO ]: Start difference. First operand 64 states and 97 transitions. Second operand 40 states. [2018-06-24 20:59:07,907 WARN ]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-24 20:59:08,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:08,615 INFO ]: Finished difference Result 71 states and 112 transitions. [2018-06-24 20:59:08,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:59:08,616 INFO ]: Start accepts. Automaton has 40 states. Word has length 45 [2018-06-24 20:59:08,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:08,616 INFO ]: With dead ends: 71 [2018-06-24 20:59:08,616 INFO ]: Without dead ends: 71 [2018-06-24 20:59:08,617 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=518, Invalid=3514, Unknown=0, NotChecked=0, Total=4032 [2018-06-24 20:59:08,617 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-24 20:59:08,620 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-06-24 20:59:08,620 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-24 20:59:08,622 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2018-06-24 20:59:08,623 INFO ]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 45 [2018-06-24 20:59:08,623 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:08,623 INFO ]: Abstraction has 67 states and 101 transitions. [2018-06-24 20:59:08,623 INFO ]: Interpolant automaton has 40 states. [2018-06-24 20:59:08,623 INFO ]: Start isEmpty. Operand 67 states and 101 transitions. [2018-06-24 20:59:08,624 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-24 20:59:08,624 INFO ]: Found error trace [2018-06-24 20:59:08,624 INFO ]: trace histogram [7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:08,624 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:08,624 INFO ]: Analyzing trace with hash -348695477, now seen corresponding path program 7 times [2018-06-24 20:59:08,624 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:08,624 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:08,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:08,625 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:08,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:08,648 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:08,820 INFO ]: Checked inductivity of 143 backedges. 27 proven. 70 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-24 20:59:08,820 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:08,851 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:08,857 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:08,912 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:08,915 INFO ]: Computing forward predicates... [2018-06-24 20:59:09,160 INFO ]: Checked inductivity of 143 backedges. 27 proven. 70 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-24 20:59:09,180 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:09,180 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-06-24 20:59:09,180 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:59:09,180 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:59:09,180 INFO ]: CoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:59:09,180 INFO ]: Start difference. First operand 67 states and 101 transitions. Second operand 31 states. [2018-06-24 20:59:09,903 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:09,903 INFO ]: Finished difference Result 78 states and 122 transitions. [2018-06-24 20:59:09,903 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-24 20:59:09,903 INFO ]: Start accepts. Automaton has 31 states. Word has length 46 [2018-06-24 20:59:09,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:09,904 INFO ]: With dead ends: 78 [2018-06-24 20:59:09,904 INFO ]: Without dead ends: 75 [2018-06-24 20:59:09,905 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=734, Invalid=3556, Unknown=0, NotChecked=0, Total=4290 [2018-06-24 20:59:09,906 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-24 20:59:09,909 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-06-24 20:59:09,909 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-24 20:59:09,910 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2018-06-24 20:59:09,910 INFO ]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 46 [2018-06-24 20:59:09,910 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:09,910 INFO ]: Abstraction has 70 states and 106 transitions. [2018-06-24 20:59:09,910 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:59:09,910 INFO ]: Start isEmpty. Operand 70 states and 106 transitions. [2018-06-24 20:59:09,911 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-24 20:59:09,911 INFO ]: Found error trace [2018-06-24 20:59:09,911 INFO ]: trace histogram [8, 7, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:09,911 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:09,911 INFO ]: Analyzing trace with hash -162678219, now seen corresponding path program 11 times [2018-06-24 20:59:09,911 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:09,911 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:09,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:09,912 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:09,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:09,930 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:10,711 INFO ]: Checked inductivity of 157 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 20:59:10,711 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:10,711 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:10,717 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:59:10,780 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-24 20:59:10,780 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:10,784 INFO ]: Computing forward predicates... [2018-06-24 20:59:11,067 INFO ]: Checked inductivity of 157 backedges. 44 proven. 57 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-24 20:59:11,085 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:11,085 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-06-24 20:59:11,085 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:59:11,086 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:59:11,086 INFO ]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:59:11,086 INFO ]: Start difference. First operand 70 states and 106 transitions. Second operand 27 states. [2018-06-24 20:59:12,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:12,317 INFO ]: Finished difference Result 74 states and 116 transitions. [2018-06-24 20:59:12,317 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-24 20:59:12,317 INFO ]: Start accepts. Automaton has 27 states. Word has length 51 [2018-06-24 20:59:12,317 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:12,318 INFO ]: With dead ends: 74 [2018-06-24 20:59:12,318 INFO ]: Without dead ends: 58 [2018-06-24 20:59:12,319 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=563, Invalid=3727, Unknown=0, NotChecked=0, Total=4290 [2018-06-24 20:59:12,319 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 20:59:12,323 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-06-24 20:59:12,323 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-24 20:59:12,324 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 83 transitions. [2018-06-24 20:59:12,324 INFO ]: Start accepts. Automaton has 54 states and 83 transitions. Word has length 51 [2018-06-24 20:59:12,324 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:12,324 INFO ]: Abstraction has 54 states and 83 transitions. [2018-06-24 20:59:12,324 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:59:12,324 INFO ]: Start isEmpty. Operand 54 states and 83 transitions. [2018-06-24 20:59:12,325 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-24 20:59:12,325 INFO ]: Found error trace [2018-06-24 20:59:12,325 INFO ]: trace histogram [8, 7, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:12,325 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:12,325 INFO ]: Analyzing trace with hash -656705855, now seen corresponding path program 12 times [2018-06-24 20:59:12,325 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:12,325 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:12,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:12,326 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:12,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:12,347 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:15,147 INFO ]: Checked inductivity of 175 backedges. 19 proven. 128 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:59:15,147 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:15,147 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:15,153 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:59:15,229 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 20:59:15,229 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:15,240 INFO ]: Computing forward predicates... [2018-06-24 20:59:16,676 INFO ]: Checked inductivity of 175 backedges. 32 proven. 108 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-24 20:59:16,696 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:16,696 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25] total 52 [2018-06-24 20:59:16,696 INFO ]: Interpolant automaton has 52 states [2018-06-24 20:59:16,696 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-24 20:59:16,697 INFO ]: CoverageRelationStatistics Valid=145, Invalid=2506, Unknown=1, NotChecked=0, Total=2652 [2018-06-24 20:59:16,697 INFO ]: Start difference. First operand 54 states and 83 transitions. Second operand 52 states. [2018-06-24 20:59:17,581 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2018-06-24 20:59:19,223 WARN ]: Spent 188.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2018-06-24 20:59:19,533 WARN ]: Spent 147.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 60 [2018-06-24 20:59:20,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:20,339 INFO ]: Finished difference Result 84 states and 136 transitions. [2018-06-24 20:59:20,339 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:59:20,339 INFO ]: Start accepts. Automaton has 52 states. Word has length 52 [2018-06-24 20:59:20,339 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:20,339 INFO ]: With dead ends: 84 [2018-06-24 20:59:20,339 INFO ]: Without dead ends: 84 [2018-06-24 20:59:20,341 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=876, Invalid=6263, Unknown=1, NotChecked=0, Total=7140 [2018-06-24 20:59:20,341 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-24 20:59:20,345 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 77. [2018-06-24 20:59:20,345 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-24 20:59:20,346 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 121 transitions. [2018-06-24 20:59:20,346 INFO ]: Start accepts. Automaton has 77 states and 121 transitions. Word has length 52 [2018-06-24 20:59:20,346 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:20,346 INFO ]: Abstraction has 77 states and 121 transitions. [2018-06-24 20:59:20,346 INFO ]: Interpolant automaton has 52 states. [2018-06-24 20:59:20,346 INFO ]: Start isEmpty. Operand 77 states and 121 transitions. [2018-06-24 20:59:20,347 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-24 20:59:20,347 INFO ]: Found error trace [2018-06-24 20:59:20,347 INFO ]: trace histogram [9, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:20,348 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:20,348 INFO ]: Analyzing trace with hash 296404696, now seen corresponding path program 3 times [2018-06-24 20:59:20,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:20,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:20,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:20,348 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:20,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:20,368 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:21,097 INFO ]: Checked inductivity of 221 backedges. 102 proven. 56 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-24 20:59:21,097 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:21,097 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:21,103 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:59:21,187 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-24 20:59:21,187 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:21,192 INFO ]: Computing forward predicates... [2018-06-24 20:59:22,435 INFO ]: Checked inductivity of 221 backedges. 102 proven. 56 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-24 20:59:22,455 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:22,455 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2018-06-24 20:59:22,455 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:59:22,455 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:59:22,455 INFO ]: CoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:59:22,455 INFO ]: Start difference. First operand 77 states and 121 transitions. Second operand 33 states. [2018-06-24 20:59:23,362 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:23,363 INFO ]: Finished difference Result 84 states and 137 transitions. [2018-06-24 20:59:23,363 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 20:59:23,363 INFO ]: Start accepts. Automaton has 33 states. Word has length 58 [2018-06-24 20:59:23,363 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:23,364 INFO ]: With dead ends: 84 [2018-06-24 20:59:23,364 INFO ]: Without dead ends: 84 [2018-06-24 20:59:23,364 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=612, Invalid=3170, Unknown=0, NotChecked=0, Total=3782 [2018-06-24 20:59:23,364 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-24 20:59:23,371 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 77. [2018-06-24 20:59:23,371 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-24 20:59:23,371 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 119 transitions. [2018-06-24 20:59:23,372 INFO ]: Start accepts. Automaton has 77 states and 119 transitions. Word has length 58 [2018-06-24 20:59:23,372 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:23,372 INFO ]: Abstraction has 77 states and 119 transitions. [2018-06-24 20:59:23,372 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:59:23,372 INFO ]: Start isEmpty. Operand 77 states and 119 transitions. [2018-06-24 20:59:23,374 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-24 20:59:23,374 INFO ]: Found error trace [2018-06-24 20:59:23,374 INFO ]: trace histogram [8, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:23,374 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:23,374 INFO ]: Analyzing trace with hash -1730065124, now seen corresponding path program 8 times [2018-06-24 20:59:23,374 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:23,374 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:23,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:23,375 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:23,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:23,394 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:23,672 INFO ]: Checked inductivity of 185 backedges. 80 proven. 50 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:59:23,672 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:23,672 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:23,679 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:59:23,741 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:59:23,741 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:23,744 INFO ]: Computing forward predicates... [2018-06-24 20:59:24,009 INFO ]: Checked inductivity of 185 backedges. 80 proven. 50 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:59:24,028 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:24,028 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-06-24 20:59:24,028 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:59:24,028 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:59:24,028 INFO ]: CoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:59:24,028 INFO ]: Start difference. First operand 77 states and 119 transitions. Second operand 31 states. [2018-06-24 20:59:24,623 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:24,623 INFO ]: Finished difference Result 81 states and 128 transitions. [2018-06-24 20:59:24,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:59:24,629 INFO ]: Start accepts. Automaton has 31 states. Word has length 52 [2018-06-24 20:59:24,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:24,630 INFO ]: With dead ends: 81 [2018-06-24 20:59:24,630 INFO ]: Without dead ends: 81 [2018-06-24 20:59:24,630 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=601, Invalid=2591, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 20:59:24,630 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-24 20:59:24,633 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-06-24 20:59:24,633 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-24 20:59:24,634 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 110 transitions. [2018-06-24 20:59:24,634 INFO ]: Start accepts. Automaton has 74 states and 110 transitions. Word has length 52 [2018-06-24 20:59:24,634 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:24,634 INFO ]: Abstraction has 74 states and 110 transitions. [2018-06-24 20:59:24,634 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:59:24,634 INFO ]: Start isEmpty. Operand 74 states and 110 transitions. [2018-06-24 20:59:24,635 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-24 20:59:24,635 INFO ]: Found error trace [2018-06-24 20:59:24,635 INFO ]: trace histogram [8, 7, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:24,636 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:24,636 INFO ]: Analyzing trace with hash -2103891874, now seen corresponding path program 13 times [2018-06-24 20:59:24,636 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:24,636 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:24,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:24,636 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:24,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:24,657 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:25,291 INFO ]: Checked inductivity of 188 backedges. 57 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:59:25,291 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:25,291 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:25,296 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:25,372 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:25,392 INFO ]: Computing forward predicates... [2018-06-24 20:59:25,646 INFO ]: Checked inductivity of 188 backedges. 35 proven. 92 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-24 20:59:25,665 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:25,665 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-06-24 20:59:25,665 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:59:25,665 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:59:25,665 INFO ]: CoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:59:25,665 INFO ]: Start difference. First operand 74 states and 110 transitions. Second operand 34 states. [2018-06-24 20:59:26,655 WARN ]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-24 20:59:26,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:26,922 INFO ]: Finished difference Result 78 states and 120 transitions. [2018-06-24 20:59:26,923 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-24 20:59:26,923 INFO ]: Start accepts. Automaton has 34 states. Word has length 53 [2018-06-24 20:59:26,923 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:26,923 INFO ]: With dead ends: 78 [2018-06-24 20:59:26,923 INFO ]: Without dead ends: 78 [2018-06-24 20:59:26,924 INFO ]: 0 DeclaredPredicates, 120 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=844, Invalid=4558, Unknown=0, NotChecked=0, Total=5402 [2018-06-24 20:59:26,924 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-24 20:59:26,926 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-06-24 20:59:26,926 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-24 20:59:26,927 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2018-06-24 20:59:26,927 INFO ]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 53 [2018-06-24 20:59:26,927 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:26,927 INFO ]: Abstraction has 74 states and 109 transitions. [2018-06-24 20:59:26,927 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:59:26,927 INFO ]: Start isEmpty. Operand 74 states and 109 transitions. [2018-06-24 20:59:26,930 INFO ]: Finished isEmpty. Found accepting run of length 60 [2018-06-24 20:59:26,930 INFO ]: Found error trace [2018-06-24 20:59:26,930 INFO ]: trace histogram [9, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:26,930 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:26,930 INFO ]: Analyzing trace with hash 164892409, now seen corresponding path program 4 times [2018-06-24 20:59:26,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:26,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:26,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:26,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:26,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:26,950 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:27,504 INFO ]: Checked inductivity of 235 backedges. 105 proven. 67 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-24 20:59:27,504 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:27,504 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:27,509 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:59:27,592 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:59:27,592 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:27,596 INFO ]: Computing forward predicates... [2018-06-24 20:59:27,880 INFO ]: Checked inductivity of 235 backedges. 105 proven. 67 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-24 20:59:27,899 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:27,899 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2018-06-24 20:59:27,899 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:59:27,899 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:59:27,899 INFO ]: CoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:59:27,899 INFO ]: Start difference. First operand 74 states and 109 transitions. Second operand 35 states. Received shutdown request... [2018-06-24 20:59:28,882 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-24 20:59:28,882 WARN ]: Verification canceled [2018-06-24 20:59:28,883 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:59:28,884 WARN ]: Timeout [2018-06-24 20:59:28,884 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:59:28 BasicIcfg [2018-06-24 20:59:28,884 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:59:28,885 INFO ]: Toolchain (without parser) took 57337.41 ms. Allocated memory was 306.2 MB in the beginning and 822.1 MB in the end (delta: 515.9 MB). Free memory was 260.6 MB in the beginning and 473.9 MB in the end (delta: -213.3 MB). Peak memory consumption was 302.6 MB. Max. memory is 3.6 GB. [2018-06-24 20:59:28,885 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:59:28,886 INFO ]: ChcToBoogie took 52.12 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:59:28,886 INFO ]: Boogie Preprocessor took 46.87 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 256.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:59:28,886 INFO ]: RCFGBuilder took 384.29 ms. Allocated memory is still 306.2 MB. Free memory was 256.5 MB in the beginning and 243.4 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:59:28,886 INFO ]: BlockEncodingV2 took 90.75 ms. Allocated memory is still 306.2 MB. Free memory was 243.4 MB in the beginning and 239.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:59:28,887 INFO ]: TraceAbstraction took 56753.80 ms. Allocated memory was 306.2 MB in the beginning and 822.1 MB in the end (delta: 515.9 MB). Free memory was 239.4 MB in the beginning and 473.9 MB in the end (delta: -234.4 MB). Peak memory consumption was 281.5 MB. Max. memory is 3.6 GB. [2018-06-24 20:59:28,889 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 21 locations, 32 edges - StatisticsResult: Encoded RCFG 15 locations, 26 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 52.12 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.87 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 256.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 384.29 ms. Allocated memory is still 306.2 MB. Free memory was 256.5 MB in the beginning and 243.4 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 90.75 ms. Allocated memory is still 306.2 MB. Free memory was 243.4 MB in the beginning and 239.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56753.80 ms. Allocated memory was 306.2 MB in the beginning and 822.1 MB in the end (delta: 515.9 MB). Free memory was 239.4 MB in the beginning and 473.9 MB in the end (delta: -234.4 MB). Peak memory consumption was 281.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 41 states, 35 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. TIMEOUT Result, 56.6s OverallTime, 38 OverallIterations, 9 TraceHistogramMax, 27.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1052 SDtfs, 2006 SDslu, 5798 SDs, 0 SdLazy, 15000 SolverSat, 2172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2345 GetRequests, 971 SyntacticMatches, 8 SemanticMatches, 1365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15397 ImplicationChecksByTransitivity, 37.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=34, 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.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 225 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 25.1s InterpolantComputationTime, 2354 NumberOfCodeBlocks, 2345 NumberOfCodeBlocksAsserted, 127 NumberOfCheckSat, 2285 ConstructedInterpolants, 6 QuantifiedInterpolants, 564775 SizeOfPredicates, 586 NumberOfNonLiveVariables, 13438 ConjunctsInSsa, 1573 ConjunctsInUnsatCore, 69 InterpolantComputations, 8 PerfectInterpolantSequences, 3749/5680 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/005-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-59-28-899.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/005-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-59-28-899.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/005-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-59-28-899.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/005-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-59-28-899.csv Completed graceful shutdown