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/vmt-chc-benchmarks/ctigar/up3.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 22:02:32,384 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 22:02:32,385 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 22:02:32,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 22:02:32,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 22:02:32,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 22:02:32,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 22:02:32,400 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 22:02:32,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 22:02:32,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 22:02:32,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 22:02:32,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 22:02:32,405 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 22:02:32,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 22:02:32,410 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 22:02:32,411 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 22:02:32,412 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 22:02:32,423 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 22:02:32,425 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 22:02:32,426 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 22:02:32,427 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 22:02:32,428 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 22:02:32,430 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 22:02:32,436 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 22:02:32,436 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 22:02:32,437 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 22:02:32,438 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 22:02:32,439 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 22:02:32,439 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 22:02:32,440 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 22:02:32,440 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 22:02:32,445 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 22:02:32,445 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 22:02:32,445 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 22:02:32,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 22:02:32,447 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 22:02:32,447 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 22:02:32,461 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 22:02:32,461 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 22:02:32,462 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 22:02:32,462 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 22:02:32,463 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 22:02:32,463 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 22:02:32,463 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 22:02:32,463 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 22:02:32,464 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 22:02:32,464 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 22:02:32,464 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 22:02:32,464 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 22:02:32,464 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 22:02:32,464 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 22:02:32,465 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 22:02:32,465 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 22:02:32,465 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 22:02:32,465 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 22:02:32,465 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 22:02:32,465 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 22:02:32,466 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 22:02:32,467 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 22:02:32,467 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 22:02:32,513 INFO ]: Repository-Root is: /tmp [2018-06-26 22:02:32,527 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 22:02:32,530 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 22:02:32,532 INFO ]: Initializing SmtParser... [2018-06-26 22:02:32,532 INFO ]: SmtParser initialized [2018-06-26 22:02:32,532 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/up3.c.smt2 [2018-06-26 22:02:32,533 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-26 22:02:32,629 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/up3.c.smt2 unknown [2018-06-26 22:02:32,937 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/up3.c.smt2 [2018-06-26 22:02:32,943 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 22:02:32,948 INFO ]: Walking toolchain with 5 elements. [2018-06-26 22:02:32,949 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 22:02:32,949 INFO ]: Initializing ChcToBoogie... [2018-06-26 22:02:32,949 INFO ]: ChcToBoogie initialized [2018-06-26 22:02:32,952 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 10:02:32" (1/1) ... [2018-06-26 22:02:33,004 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:33 Unit [2018-06-26 22:02:33,005 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 22:02:33,005 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 22:02:33,005 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 22:02:33,005 INFO ]: Boogie Preprocessor initialized [2018-06-26 22:02:33,026 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:33" (1/1) ... [2018-06-26 22:02:33,026 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:33" (1/1) ... [2018-06-26 22:02:33,033 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:33" (1/1) ... [2018-06-26 22:02:33,033 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:33" (1/1) ... [2018-06-26 22:02:33,049 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:33" (1/1) ... [2018-06-26 22:02:33,050 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:33" (1/1) ... [2018-06-26 22:02:33,051 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:33" (1/1) ... [2018-06-26 22:02:33,053 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 22:02:33,054 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 22:02:33,054 INFO ]: Initializing RCFGBuilder... [2018-06-26 22:02:33,054 INFO ]: RCFGBuilder initialized [2018-06-26 22:02:33,055 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:33" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 22:02:33,081 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 22:02:33,081 INFO ]: Found specification of procedure gotoProc [2018-06-26 22:02:33,081 INFO ]: Found implementation of procedure gotoProc [2018-06-26 22:02:33,081 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 22:02:33,082 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 22:02:33,082 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-26 22:02:33,321 INFO ]: Using library mode [2018-06-26 22:02:33,321 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:02:33 BoogieIcfgContainer [2018-06-26 22:02:33,321 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 22:02:33,321 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 22:02:33,321 INFO ]: Initializing BlockEncodingV2... [2018-06-26 22:02:33,322 INFO ]: BlockEncodingV2 initialized [2018-06-26 22:02:33,332 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:02:33" (1/1) ... [2018-06-26 22:02:33,356 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 22:02:33,359 INFO ]: Using Remove infeasible edges [2018-06-26 22:02:33,359 INFO ]: Using Maximize final states [2018-06-26 22:02:33,360 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 22:02:33,360 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 22:02:33,362 INFO ]: Using Remove sink states [2018-06-26 22:02:33,363 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 22:02:33,363 INFO ]: Using Use SBE [2018-06-26 22:02:33,374 WARN ]: expecting exponential blowup for input size 22 [2018-06-26 22:02:38,943 INFO ]: SBE split 1 edges [2018-06-26 22:02:38,950 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 22:02:38,952 INFO ]: 0 new accepting states [2018-06-26 22:02:38,983 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 22:02:38,985 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 22:02:38,991 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 22:02:38,991 INFO ]: 0 new accepting states [2018-06-26 22:02:38,991 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 22:02:38,992 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 22:02:38,995 INFO ]: Encoded RCFG 6 locations, 89 edges [2018-06-26 22:02:38,995 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 10:02:38 BasicIcfg [2018-06-26 22:02:38,995 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 22:02:38,996 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 22:02:38,997 INFO ]: Initializing TraceAbstraction... [2018-06-26 22:02:39,000 INFO ]: TraceAbstraction initialized [2018-06-26 22:02:39,000 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 10:02:32" (1/4) ... [2018-06-26 22:02:39,001 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54fee1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 10:02:39, skipping insertion in model container [2018-06-26 22:02:39,001 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:02:33" (2/4) ... [2018-06-26 22:02:39,001 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54fee1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 10:02:39, skipping insertion in model container [2018-06-26 22:02:39,001 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:02:33" (3/4) ... [2018-06-26 22:02:39,002 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54fee1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 10:02:39, skipping insertion in model container [2018-06-26 22:02:39,002 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 10:02:38" (4/4) ... [2018-06-26 22:02:39,003 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 22:02:39,011 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 22:02:39,017 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 22:02:39,051 INFO ]: Using default assertion order modulation [2018-06-26 22:02:39,051 INFO ]: Interprodecural is true [2018-06-26 22:02:39,051 INFO ]: Hoare is false [2018-06-26 22:02:39,051 INFO ]: Compute interpolants for FPandBP [2018-06-26 22:02:39,051 INFO ]: Backedges is TWOTRACK [2018-06-26 22:02:39,051 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 22:02:39,051 INFO ]: Difference is false [2018-06-26 22:02:39,051 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 22:02:39,051 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 22:02:39,061 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 22:02:39,073 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 22:02:39,073 INFO ]: Found error trace [2018-06-26 22:02:39,074 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 22:02:39,074 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:39,077 INFO ]: Analyzing trace with hash 37985730, now seen corresponding path program 1 times [2018-06-26 22:02:39,079 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:39,079 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:39,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:39,112 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:39,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:39,150 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:39,214 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:02:39,215 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:39,216 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:39,217 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:39,228 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:39,228 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:39,232 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 22:02:40,102 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:40,102 INFO ]: Finished difference Result 7 states and 126 transitions. [2018-06-26 22:02:40,103 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:40,104 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 22:02:40,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:40,113 INFO ]: With dead ends: 7 [2018-06-26 22:02:40,113 INFO ]: Without dead ends: 7 [2018-06-26 22:02:40,115 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-26 22:02:40,130 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 22:02:40,144 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 22:02:40,145 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 22:02:40,146 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2018-06-26 22:02:40,147 INFO ]: Start accepts. Automaton has 7 states and 126 transitions. Word has length 5 [2018-06-26 22:02:40,148 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:40,148 INFO ]: Abstraction has 7 states and 126 transitions. [2018-06-26 22:02:40,148 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:40,148 INFO ]: Start isEmpty. Operand 7 states and 126 transitions. [2018-06-26 22:02:40,148 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 22:02:40,148 INFO ]: Found error trace [2018-06-26 22:02:40,148 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 22:02:40,148 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:40,148 INFO ]: Analyzing trace with hash 1175167782, now seen corresponding path program 1 times [2018-06-26 22:02:40,148 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:40,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:40,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:40,149 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:40,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:40,159 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:40,183 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:02:40,183 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:40,183 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:40,184 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:40,184 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:40,184 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:40,184 INFO ]: Start difference. First operand 7 states and 126 transitions. Second operand 3 states. [2018-06-26 22:02:40,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:40,769 INFO ]: Finished difference Result 9 states and 189 transitions. [2018-06-26 22:02:40,770 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:40,770 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 22:02:40,770 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:40,771 INFO ]: With dead ends: 9 [2018-06-26 22:02:40,771 INFO ]: Without dead ends: 9 [2018-06-26 22:02:40,772 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-26 22:02:40,772 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 22:02:40,775 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 22:02:40,775 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 22:02:40,776 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2018-06-26 22:02:40,776 INFO ]: Start accepts. Automaton has 9 states and 189 transitions. Word has length 6 [2018-06-26 22:02:40,776 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:40,776 INFO ]: Abstraction has 9 states and 189 transitions. [2018-06-26 22:02:40,776 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:40,776 INFO ]: Start isEmpty. Operand 9 states and 189 transitions. [2018-06-26 22:02:40,777 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 22:02:40,777 INFO ]: Found error trace [2018-06-26 22:02:40,777 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:40,777 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:40,777 INFO ]: Analyzing trace with hash 2068043235, now seen corresponding path program 1 times [2018-06-26 22:02:40,777 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:40,777 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:40,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:40,778 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:40,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:40,788 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:40,820 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:02:40,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:40,821 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:40,821 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:40,821 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:40,821 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:40,821 INFO ]: Start difference. First operand 9 states and 189 transitions. Second operand 3 states. [2018-06-26 22:02:41,058 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:41,058 INFO ]: Finished difference Result 13 states and 268 transitions. [2018-06-26 22:02:41,059 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:41,060 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 22:02:41,060 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:41,061 INFO ]: With dead ends: 13 [2018-06-26 22:02:41,061 INFO ]: Without dead ends: 13 [2018-06-26 22:02:41,061 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-26 22:02:41,061 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 22:02:41,066 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 22:02:41,067 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 22:02:41,067 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 268 transitions. [2018-06-26 22:02:41,068 INFO ]: Start accepts. Automaton has 13 states and 268 transitions. Word has length 7 [2018-06-26 22:02:41,068 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:41,068 INFO ]: Abstraction has 13 states and 268 transitions. [2018-06-26 22:02:41,068 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:41,068 INFO ]: Start isEmpty. Operand 13 states and 268 transitions. [2018-06-26 22:02:41,068 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 22:02:41,068 INFO ]: Found error trace [2018-06-26 22:02:41,068 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:41,068 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:41,069 INFO ]: Analyzing trace with hash -1697941658, now seen corresponding path program 1 times [2018-06-26 22:02:41,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:41,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:41,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:41,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:41,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:41,079 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:41,107 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 22:02:41,107 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:41,107 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:41,107 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:41,107 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:41,108 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:41,108 INFO ]: Start difference. First operand 13 states and 268 transitions. Second operand 3 states. [2018-06-26 22:02:41,304 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:41,304 INFO ]: Finished difference Result 13 states and 184 transitions. [2018-06-26 22:02:41,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:41,304 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 22:02:41,304 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:41,304 INFO ]: With dead ends: 13 [2018-06-26 22:02:41,304 INFO ]: Without dead ends: 13 [2018-06-26 22:02:41,305 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-26 22:02:41,305 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 22:02:41,309 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 22:02:41,309 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 22:02:41,310 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 184 transitions. [2018-06-26 22:02:41,310 INFO ]: Start accepts. Automaton has 13 states and 184 transitions. Word has length 9 [2018-06-26 22:02:41,310 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:41,310 INFO ]: Abstraction has 13 states and 184 transitions. [2018-06-26 22:02:41,310 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:41,310 INFO ]: Start isEmpty. Operand 13 states and 184 transitions. [2018-06-26 22:02:41,310 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 22:02:41,310 INFO ]: Found error trace [2018-06-26 22:02:41,310 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:41,311 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:41,311 INFO ]: Analyzing trace with hash -839067128, now seen corresponding path program 1 times [2018-06-26 22:02:41,311 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:41,311 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:41,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:41,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:41,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:41,327 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:41,352 INFO ]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 22:02:41,352 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:41,352 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:41,352 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:41,353 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:41,353 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:41,353 INFO ]: Start difference. First operand 13 states and 184 transitions. Second operand 3 states. [2018-06-26 22:02:41,600 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:41,600 INFO ]: Finished difference Result 13 states and 144 transitions. [2018-06-26 22:02:41,601 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:41,601 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 22:02:41,601 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:41,601 INFO ]: With dead ends: 13 [2018-06-26 22:02:41,601 INFO ]: Without dead ends: 13 [2018-06-26 22:02:41,602 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-26 22:02:41,602 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 22:02:41,604 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 22:02:41,604 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 22:02:41,605 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2018-06-26 22:02:41,605 INFO ]: Start accepts. Automaton has 13 states and 144 transitions. Word has length 9 [2018-06-26 22:02:41,605 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:41,605 INFO ]: Abstraction has 13 states and 144 transitions. [2018-06-26 22:02:41,605 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:41,605 INFO ]: Start isEmpty. Operand 13 states and 144 transitions. [2018-06-26 22:02:41,605 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 22:02:41,605 INFO ]: Found error trace [2018-06-26 22:02:41,605 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:41,605 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:41,605 INFO ]: Analyzing trace with hash -636696865, now seen corresponding path program 1 times [2018-06-26 22:02:41,605 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:41,605 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:41,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:41,606 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:41,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:41,620 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:41,660 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 22:02:41,660 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:41,660 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:41,660 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:41,661 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:41,661 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:41,661 INFO ]: Start difference. First operand 13 states and 144 transitions. Second operand 3 states. [2018-06-26 22:02:41,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:41,824 INFO ]: Finished difference Result 19 states and 170 transitions. [2018-06-26 22:02:41,825 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:41,825 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 22:02:41,825 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:41,825 INFO ]: With dead ends: 19 [2018-06-26 22:02:41,825 INFO ]: Without dead ends: 18 [2018-06-26 22:02:41,825 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-26 22:02:41,826 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 22:02:41,827 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 22:02:41,828 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 22:02:41,828 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2018-06-26 22:02:41,828 INFO ]: Start accepts. Automaton has 18 states and 89 transitions. Word has length 9 [2018-06-26 22:02:41,828 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:41,828 INFO ]: Abstraction has 18 states and 89 transitions. [2018-06-26 22:02:41,828 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:41,828 INFO ]: Start isEmpty. Operand 18 states and 89 transitions. [2018-06-26 22:02:41,829 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 22:02:41,829 INFO ]: Found error trace [2018-06-26 22:02:41,829 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:41,829 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:41,829 INFO ]: Analyzing trace with hash 1073364453, now seen corresponding path program 1 times [2018-06-26 22:02:41,829 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:41,829 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:41,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:41,830 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:41,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:41,851 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:41,950 INFO ]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 22:02:41,950 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:41,950 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-26 22:02:41,957 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:42,009 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:42,017 INFO ]: Computing forward predicates... [2018-06-26 22:02:42,373 INFO ]: Checked inductivity of 15 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 22:02:42,408 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:02:42,408 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 22:02:42,409 INFO ]: Interpolant automaton has 8 states [2018-06-26 22:02:42,409 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 22:02:42,409 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 22:02:42,409 INFO ]: Start difference. First operand 18 states and 89 transitions. Second operand 8 states. [2018-06-26 22:02:44,898 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:44,898 INFO ]: Finished difference Result 180 states and 929 transitions. [2018-06-26 22:02:44,905 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 22:02:44,905 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-26 22:02:44,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:44,910 INFO ]: With dead ends: 180 [2018-06-26 22:02:44,910 INFO ]: Without dead ends: 168 [2018-06-26 22:02:44,911 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-06-26 22:02:44,911 INFO ]: Start minimizeSevpa. Operand 168 states. [2018-06-26 22:02:44,940 INFO ]: Finished minimizeSevpa. Reduced states from 168 to 53. [2018-06-26 22:02:44,940 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-26 22:02:44,942 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 249 transitions. [2018-06-26 22:02:44,942 INFO ]: Start accepts. Automaton has 53 states and 249 transitions. Word has length 10 [2018-06-26 22:02:44,942 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:44,942 INFO ]: Abstraction has 53 states and 249 transitions. [2018-06-26 22:02:44,942 INFO ]: Interpolant automaton has 8 states. [2018-06-26 22:02:44,942 INFO ]: Start isEmpty. Operand 53 states and 249 transitions. [2018-06-26 22:02:44,943 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 22:02:44,943 INFO ]: Found error trace [2018-06-26 22:02:44,943 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:44,943 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:44,943 INFO ]: Analyzing trace with hash -550344469, now seen corresponding path program 1 times [2018-06-26 22:02:44,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:44,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:44,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:44,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:44,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:44,989 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:45,094 INFO ]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-26 22:02:45,094 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:45,094 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:45,094 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:45,094 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:45,094 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:45,095 INFO ]: Start difference. First operand 53 states and 249 transitions. Second operand 3 states. [2018-06-26 22:02:45,457 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:45,457 INFO ]: Finished difference Result 77 states and 370 transitions. [2018-06-26 22:02:45,457 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:45,457 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 22:02:45,457 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:45,460 INFO ]: With dead ends: 77 [2018-06-26 22:02:45,460 INFO ]: Without dead ends: 75 [2018-06-26 22:02:45,460 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 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-26 22:02:45,460 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-26 22:02:45,472 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-06-26 22:02:45,472 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-26 22:02:45,473 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 346 transitions. [2018-06-26 22:02:45,474 INFO ]: Start accepts. Automaton has 72 states and 346 transitions. Word has length 14 [2018-06-26 22:02:45,474 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:45,474 INFO ]: Abstraction has 72 states and 346 transitions. [2018-06-26 22:02:45,474 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:45,474 INFO ]: Start isEmpty. Operand 72 states and 346 transitions. [2018-06-26 22:02:45,475 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 22:02:45,475 INFO ]: Found error trace [2018-06-26 22:02:45,475 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:45,475 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:45,475 INFO ]: Analyzing trace with hash -924305475, now seen corresponding path program 1 times [2018-06-26 22:02:45,475 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:45,475 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:45,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:45,476 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:45,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:45,501 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:45,555 INFO ]: Checked inductivity of 45 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 22:02:45,556 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:45,556 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 22:02:45,556 INFO ]: Interpolant automaton has 4 states [2018-06-26 22:02:45,556 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 22:02:45,556 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 22:02:45,556 INFO ]: Start difference. First operand 72 states and 346 transitions. Second operand 4 states. [2018-06-26 22:02:45,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:45,689 INFO ]: Finished difference Result 99 states and 441 transitions. [2018-06-26 22:02:45,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 22:02:45,689 INFO ]: Start accepts. Automaton has 4 states. Word has length 14 [2018-06-26 22:02:45,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:45,690 INFO ]: With dead ends: 99 [2018-06-26 22:02:45,690 INFO ]: Without dead ends: 65 [2018-06-26 22:02:45,690 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 22:02:45,691 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-26 22:02:45,699 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-06-26 22:02:45,699 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-26 22:02:45,700 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 295 transitions. [2018-06-26 22:02:45,700 INFO ]: Start accepts. Automaton has 61 states and 295 transitions. Word has length 14 [2018-06-26 22:02:45,700 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:45,700 INFO ]: Abstraction has 61 states and 295 transitions. [2018-06-26 22:02:45,700 INFO ]: Interpolant automaton has 4 states. [2018-06-26 22:02:45,700 INFO ]: Start isEmpty. Operand 61 states and 295 transitions. [2018-06-26 22:02:45,703 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 22:02:45,703 INFO ]: Found error trace [2018-06-26 22:02:45,703 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:45,703 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:45,704 INFO ]: Analyzing trace with hash -605095178, now seen corresponding path program 1 times [2018-06-26 22:02:45,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:45,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:45,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:45,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:45,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:45,725 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:45,831 INFO ]: Checked inductivity of 120 backedges. 53 proven. 53 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-26 22:02:45,831 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:45,831 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-26 22:02:45,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:45,915 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:45,919 INFO ]: Computing forward predicates... [2018-06-26 22:02:46,081 INFO ]: Checked inductivity of 120 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-26 22:02:46,113 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 22:02:46,113 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-06-26 22:02:46,114 INFO ]: Interpolant automaton has 8 states [2018-06-26 22:02:46,114 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 22:02:46,114 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-26 22:02:46,114 INFO ]: Start difference. First operand 61 states and 295 transitions. Second operand 8 states. [2018-06-26 22:02:47,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:47,474 INFO ]: Finished difference Result 418 states and 1714 transitions. [2018-06-26 22:02:47,474 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 22:02:47,474 INFO ]: Start accepts. Automaton has 8 states. Word has length 20 [2018-06-26 22:02:47,474 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:47,477 INFO ]: With dead ends: 418 [2018-06-26 22:02:47,477 INFO ]: Without dead ends: 265 [2018-06-26 22:02:47,477 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2018-06-26 22:02:47,478 INFO ]: Start minimizeSevpa. Operand 265 states. [2018-06-26 22:02:47,504 INFO ]: Finished minimizeSevpa. Reduced states from 265 to 150. [2018-06-26 22:02:47,504 INFO ]: Start removeUnreachable. Operand 150 states. [2018-06-26 22:02:47,506 INFO ]: Finished removeUnreachable. Reduced from 150 states to 150 states and 550 transitions. [2018-06-26 22:02:47,506 INFO ]: Start accepts. Automaton has 150 states and 550 transitions. Word has length 20 [2018-06-26 22:02:47,506 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:47,506 INFO ]: Abstraction has 150 states and 550 transitions. [2018-06-26 22:02:47,506 INFO ]: Interpolant automaton has 8 states. [2018-06-26 22:02:47,506 INFO ]: Start isEmpty. Operand 150 states and 550 transitions. [2018-06-26 22:02:47,508 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 22:02:47,508 INFO ]: Found error trace [2018-06-26 22:02:47,508 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:47,508 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:47,508 INFO ]: Analyzing trace with hash -104554268, now seen corresponding path program 1 times [2018-06-26 22:02:47,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:47,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:47,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:47,509 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:47,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:47,520 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:47,582 INFO ]: Checked inductivity of 153 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-06-26 22:02:47,582 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:47,582 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:47,582 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:47,583 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:47,583 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:47,583 INFO ]: Start difference. First operand 150 states and 550 transitions. Second operand 3 states. [2018-06-26 22:02:47,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:47,990 INFO ]: Finished difference Result 136 states and 395 transitions. [2018-06-26 22:02:47,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:47,991 INFO ]: Start accepts. Automaton has 3 states. Word has length 22 [2018-06-26 22:02:47,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:47,992 INFO ]: With dead ends: 136 [2018-06-26 22:02:47,992 INFO ]: Without dead ends: 136 [2018-06-26 22:02:47,992 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-26 22:02:47,993 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-26 22:02:47,999 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 102. [2018-06-26 22:02:48,000 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-26 22:02:48,001 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 311 transitions. [2018-06-26 22:02:48,001 INFO ]: Start accepts. Automaton has 102 states and 311 transitions. Word has length 22 [2018-06-26 22:02:48,001 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:48,001 INFO ]: Abstraction has 102 states and 311 transitions. [2018-06-26 22:02:48,001 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:48,001 INFO ]: Start isEmpty. Operand 102 states and 311 transitions. [2018-06-26 22:02:48,002 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 22:02:48,002 INFO ]: Found error trace [2018-06-26 22:02:48,002 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:48,003 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:48,003 INFO ]: Analyzing trace with hash 603100790, now seen corresponding path program 1 times [2018-06-26 22:02:48,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:48,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:48,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:48,003 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:48,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:48,014 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:48,073 INFO ]: Checked inductivity of 171 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-26 22:02:48,073 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:02:48,073 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:02:48,073 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:02:48,073 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:02:48,073 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:02:48,073 INFO ]: Start difference. First operand 102 states and 311 transitions. Second operand 3 states. [2018-06-26 22:02:48,127 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:48,127 INFO ]: Finished difference Result 67 states and 132 transitions. [2018-06-26 22:02:48,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:02:48,127 INFO ]: Start accepts. Automaton has 3 states. Word has length 23 [2018-06-26 22:02:48,127 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:48,127 INFO ]: With dead ends: 67 [2018-06-26 22:02:48,127 INFO ]: Without dead ends: 60 [2018-06-26 22:02:48,128 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-26 22:02:48,128 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-26 22:02:48,131 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-06-26 22:02:48,131 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-26 22:02:48,131 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 115 transitions. [2018-06-26 22:02:48,131 INFO ]: Start accepts. Automaton has 55 states and 115 transitions. Word has length 23 [2018-06-26 22:02:48,131 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:48,131 INFO ]: Abstraction has 55 states and 115 transitions. [2018-06-26 22:02:48,132 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:02:48,132 INFO ]: Start isEmpty. Operand 55 states and 115 transitions. [2018-06-26 22:02:48,134 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 22:02:48,135 INFO ]: Found error trace [2018-06-26 22:02:48,135 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:48,135 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:48,135 INFO ]: Analyzing trace with hash -1212315461, now seen corresponding path program 2 times [2018-06-26 22:02:48,135 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:48,135 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:48,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:48,135 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:48,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:48,159 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:48,273 INFO ]: Checked inductivity of 190 backedges. 114 proven. 24 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-26 22:02:48,273 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:48,273 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) [2018-06-26 22:02:48,288 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:02:48,384 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:02:48,384 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:48,389 INFO ]: Computing forward predicates... [2018-06-26 22:02:48,406 INFO ]: Checked inductivity of 190 backedges. 114 proven. 24 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-26 22:02:48,438 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:02:48,438 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 22:02:48,439 INFO ]: Interpolant automaton has 5 states [2018-06-26 22:02:48,439 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 22:02:48,439 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 22:02:48,439 INFO ]: Start difference. First operand 55 states and 115 transitions. Second operand 5 states. [2018-06-26 22:02:48,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:48,806 INFO ]: Finished difference Result 113 states and 231 transitions. [2018-06-26 22:02:48,807 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 22:02:48,807 INFO ]: Start accepts. Automaton has 5 states. Word has length 24 [2018-06-26 22:02:48,807 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:48,807 INFO ]: With dead ends: 113 [2018-06-26 22:02:48,807 INFO ]: Without dead ends: 64 [2018-06-26 22:02:48,808 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 22:02:48,808 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-26 22:02:48,810 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-06-26 22:02:48,810 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-26 22:02:48,811 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 126 transitions. [2018-06-26 22:02:48,811 INFO ]: Start accepts. Automaton has 61 states and 126 transitions. Word has length 24 [2018-06-26 22:02:48,811 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:48,811 INFO ]: Abstraction has 61 states and 126 transitions. [2018-06-26 22:02:48,811 INFO ]: Interpolant automaton has 5 states. [2018-06-26 22:02:48,811 INFO ]: Start isEmpty. Operand 61 states and 126 transitions. [2018-06-26 22:02:48,812 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 22:02:48,812 INFO ]: Found error trace [2018-06-26 22:02:48,812 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:48,812 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:48,812 INFO ]: Analyzing trace with hash 1349338940, now seen corresponding path program 1 times [2018-06-26 22:02:48,812 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:48,812 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:48,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:48,813 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:02:48,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:48,836 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:48,998 INFO ]: Checked inductivity of 325 backedges. 125 proven. 165 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-26 22:02:48,998 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:48,998 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-26 22:02:49,012 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:49,082 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:49,089 INFO ]: Computing forward predicates... [2018-06-26 22:02:49,236 INFO ]: Checked inductivity of 325 backedges. 125 proven. 165 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-26 22:02:49,256 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:02:49,256 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-26 22:02:49,256 INFO ]: Interpolant automaton has 10 states [2018-06-26 22:02:49,256 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 22:02:49,256 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-26 22:02:49,257 INFO ]: Start difference. First operand 61 states and 126 transitions. Second operand 10 states. [2018-06-26 22:02:49,555 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:49,555 INFO ]: Finished difference Result 86 states and 171 transitions. [2018-06-26 22:02:49,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 22:02:49,555 INFO ]: Start accepts. Automaton has 10 states. Word has length 30 [2018-06-26 22:02:49,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:49,556 INFO ]: With dead ends: 86 [2018-06-26 22:02:49,556 INFO ]: Without dead ends: 86 [2018-06-26 22:02:49,556 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-06-26 22:02:49,556 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-26 22:02:49,559 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 73. [2018-06-26 22:02:49,559 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-26 22:02:49,560 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 148 transitions. [2018-06-26 22:02:49,560 INFO ]: Start accepts. Automaton has 73 states and 148 transitions. Word has length 30 [2018-06-26 22:02:49,560 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:49,560 INFO ]: Abstraction has 73 states and 148 transitions. [2018-06-26 22:02:49,560 INFO ]: Interpolant automaton has 10 states. [2018-06-26 22:02:49,560 INFO ]: Start isEmpty. Operand 73 states and 148 transitions. [2018-06-26 22:02:49,561 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 22:02:49,561 INFO ]: Found error trace [2018-06-26 22:02:49,561 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:49,561 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:49,561 INFO ]: Analyzing trace with hash -344408684, now seen corresponding path program 2 times [2018-06-26 22:02:49,561 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:49,561 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:49,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:49,562 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:49,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:49,595 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:49,947 INFO ]: Checked inductivity of 435 backedges. 236 proven. 102 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-06-26 22:02:49,947 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:49,947 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) [2018-06-26 22:02:49,962 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:02:50,089 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:02:50,089 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:50,096 INFO ]: Computing forward predicates... [2018-06-26 22:02:50,118 INFO ]: Checked inductivity of 435 backedges. 236 proven. 102 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-06-26 22:02:50,148 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:02:50,148 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 22:02:50,148 INFO ]: Interpolant automaton has 6 states [2018-06-26 22:02:50,149 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 22:02:50,149 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:02:50,149 INFO ]: Start difference. First operand 73 states and 148 transitions. Second operand 6 states. [2018-06-26 22:02:50,519 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:50,519 INFO ]: Finished difference Result 155 states and 308 transitions. [2018-06-26 22:02:50,519 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 22:02:50,519 INFO ]: Start accepts. Automaton has 6 states. Word has length 34 [2018-06-26 22:02:50,519 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:50,520 INFO ]: With dead ends: 155 [2018-06-26 22:02:50,520 INFO ]: Without dead ends: 82 [2018-06-26 22:02:50,520 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:02:50,520 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-26 22:02:50,523 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 79. [2018-06-26 22:02:50,523 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-26 22:02:50,523 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 159 transitions. [2018-06-26 22:02:50,524 INFO ]: Start accepts. Automaton has 79 states and 159 transitions. Word has length 34 [2018-06-26 22:02:50,525 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:50,525 INFO ]: Abstraction has 79 states and 159 transitions. [2018-06-26 22:02:50,525 INFO ]: Interpolant automaton has 6 states. [2018-06-26 22:02:50,525 INFO ]: Start isEmpty. Operand 79 states and 159 transitions. [2018-06-26 22:02:50,526 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 22:02:50,526 INFO ]: Found error trace [2018-06-26 22:02:50,526 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:50,526 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:50,526 INFO ]: Analyzing trace with hash 2035355349, now seen corresponding path program 3 times [2018-06-26 22:02:50,526 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:50,526 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:50,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:50,526 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:02:50,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:50,569 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:50,960 INFO ]: Checked inductivity of 630 backedges. 233 proven. 341 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-26 22:02:50,960 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:50,960 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-26 22:02:50,975 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:02:51,156 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-06-26 22:02:51,156 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:51,164 INFO ]: Computing forward predicates... [2018-06-26 22:02:51,236 INFO ]: Checked inductivity of 630 backedges. 233 proven. 341 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-26 22:02:51,256 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:02:51,256 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-26 22:02:51,256 INFO ]: Interpolant automaton has 12 states [2018-06-26 22:02:51,256 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 22:02:51,257 INFO ]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-26 22:02:51,257 INFO ]: Start difference. First operand 79 states and 159 transitions. Second operand 12 states. [2018-06-26 22:02:51,596 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:51,596 INFO ]: Finished difference Result 104 states and 204 transitions. [2018-06-26 22:02:51,596 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 22:02:51,596 INFO ]: Start accepts. Automaton has 12 states. Word has length 40 [2018-06-26 22:02:51,597 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:51,597 INFO ]: With dead ends: 104 [2018-06-26 22:02:51,597 INFO ]: Without dead ends: 104 [2018-06-26 22:02:51,597 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2018-06-26 22:02:51,598 INFO ]: Start minimizeSevpa. Operand 104 states. [2018-06-26 22:02:51,600 INFO ]: Finished minimizeSevpa. Reduced states from 104 to 91. [2018-06-26 22:02:51,600 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-26 22:02:51,601 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 181 transitions. [2018-06-26 22:02:51,601 INFO ]: Start accepts. Automaton has 91 states and 181 transitions. Word has length 40 [2018-06-26 22:02:51,601 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:51,601 INFO ]: Abstraction has 91 states and 181 transitions. [2018-06-26 22:02:51,601 INFO ]: Interpolant automaton has 12 states. [2018-06-26 22:02:51,601 INFO ]: Start isEmpty. Operand 91 states and 181 transitions. [2018-06-26 22:02:51,602 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-26 22:02:51,602 INFO ]: Found error trace [2018-06-26 22:02:51,602 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:51,602 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:51,602 INFO ]: Analyzing trace with hash -410185555, now seen corresponding path program 4 times [2018-06-26 22:02:51,602 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:51,602 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:51,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:51,603 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:02:51,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:51,634 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:51,771 INFO ]: Checked inductivity of 780 backedges. 398 proven. 240 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-06-26 22:02:51,771 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:51,771 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-26 22:02:51,777 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 22:02:51,892 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:02:51,892 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:51,899 INFO ]: Computing forward predicates... [2018-06-26 22:02:51,925 INFO ]: Checked inductivity of 780 backedges. 398 proven. 240 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-06-26 22:02:51,957 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:02:51,957 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 22:02:51,958 INFO ]: Interpolant automaton has 7 states [2018-06-26 22:02:51,958 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 22:02:51,958 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 22:02:51,958 INFO ]: Start difference. First operand 91 states and 181 transitions. Second operand 7 states. [2018-06-26 22:02:52,193 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:52,193 INFO ]: Finished difference Result 197 states and 385 transitions. [2018-06-26 22:02:52,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 22:02:52,194 INFO ]: Start accepts. Automaton has 7 states. Word has length 44 [2018-06-26 22:02:52,194 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:52,194 INFO ]: With dead ends: 197 [2018-06-26 22:02:52,194 INFO ]: Without dead ends: 100 [2018-06-26 22:02:52,194 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 22:02:52,194 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-26 22:02:52,197 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-06-26 22:02:52,197 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-26 22:02:52,198 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 192 transitions. [2018-06-26 22:02:52,198 INFO ]: Start accepts. Automaton has 97 states and 192 transitions. Word has length 44 [2018-06-26 22:02:52,198 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:52,198 INFO ]: Abstraction has 97 states and 192 transitions. [2018-06-26 22:02:52,198 INFO ]: Interpolant automaton has 7 states. [2018-06-26 22:02:52,198 INFO ]: Start isEmpty. Operand 97 states and 192 transitions. [2018-06-26 22:02:52,199 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 22:02:52,199 INFO ]: Found error trace [2018-06-26 22:02:52,199 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:52,199 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:52,199 INFO ]: Analyzing trace with hash 839222446, now seen corresponding path program 5 times [2018-06-26 22:02:52,199 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:52,199 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:52,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:52,200 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:02:52,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:52,232 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:52,790 INFO ]: Checked inductivity of 1035 backedges. 377 proven. 581 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-26 22:02:52,790 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:52,790 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-26 22:02:52,797 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 22:02:52,976 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-06-26 22:02:52,976 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:52,985 INFO ]: Computing forward predicates... [2018-06-26 22:02:53,128 INFO ]: Checked inductivity of 1035 backedges. 377 proven. 581 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-26 22:02:53,148 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:02:53,148 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-26 22:02:53,148 INFO ]: Interpolant automaton has 14 states [2018-06-26 22:02:53,149 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 22:02:53,149 INFO ]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-06-26 22:02:53,149 INFO ]: Start difference. First operand 97 states and 192 transitions. Second operand 14 states. [2018-06-26 22:02:53,707 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:53,707 INFO ]: Finished difference Result 122 states and 237 transitions. [2018-06-26 22:02:53,707 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 22:02:53,707 INFO ]: Start accepts. Automaton has 14 states. Word has length 50 [2018-06-26 22:02:53,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:53,708 INFO ]: With dead ends: 122 [2018-06-26 22:02:53,708 INFO ]: Without dead ends: 122 [2018-06-26 22:02:53,709 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2018-06-26 22:02:53,709 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-26 22:02:53,711 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 109. [2018-06-26 22:02:53,711 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-26 22:02:53,711 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 214 transitions. [2018-06-26 22:02:53,711 INFO ]: Start accepts. Automaton has 109 states and 214 transitions. Word has length 50 [2018-06-26 22:02:53,711 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:53,711 INFO ]: Abstraction has 109 states and 214 transitions. [2018-06-26 22:02:53,711 INFO ]: Interpolant automaton has 14 states. [2018-06-26 22:02:53,711 INFO ]: Start isEmpty. Operand 109 states and 214 transitions. [2018-06-26 22:02:53,712 INFO ]: Finished isEmpty. Found accepting run of length 55 [2018-06-26 22:02:53,712 INFO ]: Found error trace [2018-06-26 22:02:53,712 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:53,712 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:53,712 INFO ]: Analyzing trace with hash -1561267706, now seen corresponding path program 6 times [2018-06-26 22:02:53,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:53,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:53,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:53,713 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:02:53,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:53,751 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:54,393 INFO ]: Checked inductivity of 1225 backedges. 600 proven. 438 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-06-26 22:02:54,393 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:54,393 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) [2018-06-26 22:02:54,408 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:02:54,650 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-06-26 22:02:54,650 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:54,659 INFO ]: Computing forward predicates... [2018-06-26 22:02:54,688 INFO ]: Checked inductivity of 1225 backedges. 600 proven. 438 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-06-26 22:02:54,721 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:02:54,721 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 22:02:54,721 INFO ]: Interpolant automaton has 8 states [2018-06-26 22:02:54,721 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 22:02:54,721 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 22:02:54,721 INFO ]: Start difference. First operand 109 states and 214 transitions. Second operand 8 states. [2018-06-26 22:02:54,920 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:54,920 INFO ]: Finished difference Result 239 states and 462 transitions. [2018-06-26 22:02:54,921 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 22:02:54,921 INFO ]: Start accepts. Automaton has 8 states. Word has length 54 [2018-06-26 22:02:54,921 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:54,921 INFO ]: With dead ends: 239 [2018-06-26 22:02:54,921 INFO ]: Without dead ends: 118 [2018-06-26 22:02:54,922 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 22:02:54,922 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-26 22:02:54,926 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 115. [2018-06-26 22:02:54,926 INFO ]: Start removeUnreachable. Operand 115 states. [2018-06-26 22:02:54,927 INFO ]: Finished removeUnreachable. Reduced from 115 states to 115 states and 225 transitions. [2018-06-26 22:02:54,927 INFO ]: Start accepts. Automaton has 115 states and 225 transitions. Word has length 54 [2018-06-26 22:02:54,927 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:54,927 INFO ]: Abstraction has 115 states and 225 transitions. [2018-06-26 22:02:54,927 INFO ]: Interpolant automaton has 8 states. [2018-06-26 22:02:54,927 INFO ]: Start isEmpty. Operand 115 states and 225 transitions. [2018-06-26 22:02:54,928 INFO ]: Finished isEmpty. Found accepting run of length 61 [2018-06-26 22:02:54,928 INFO ]: Found error trace [2018-06-26 22:02:54,928 INFO ]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:54,928 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:54,928 INFO ]: Analyzing trace with hash 1833769159, now seen corresponding path program 7 times [2018-06-26 22:02:54,928 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:54,928 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:54,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:54,929 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:02:54,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:54,973 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:56,191 INFO ]: Checked inductivity of 1540 backedges. 557 proven. 885 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-26 22:02:56,192 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:56,192 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:02:56,199 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:56,353 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:56,362 INFO ]: Computing forward predicates... [2018-06-26 22:02:56,460 INFO ]: Checked inductivity of 1540 backedges. 557 proven. 885 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-26 22:02:56,480 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:02:56,480 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-26 22:02:56,480 INFO ]: Interpolant automaton has 16 states [2018-06-26 22:02:56,480 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 22:02:56,480 INFO ]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-06-26 22:02:56,480 INFO ]: Start difference. First operand 115 states and 225 transitions. Second operand 16 states. [2018-06-26 22:02:56,976 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:56,976 INFO ]: Finished difference Result 140 states and 270 transitions. [2018-06-26 22:02:56,977 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 22:02:56,977 INFO ]: Start accepts. Automaton has 16 states. Word has length 60 [2018-06-26 22:02:56,977 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:56,978 INFO ]: With dead ends: 140 [2018-06-26 22:02:56,978 INFO ]: Without dead ends: 140 [2018-06-26 22:02:56,978 INFO ]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2018-06-26 22:02:56,978 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-26 22:02:56,983 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 127. [2018-06-26 22:02:56,983 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-26 22:02:56,984 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 247 transitions. [2018-06-26 22:02:56,984 INFO ]: Start accepts. Automaton has 127 states and 247 transitions. Word has length 60 [2018-06-26 22:02:56,984 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:56,984 INFO ]: Abstraction has 127 states and 247 transitions. [2018-06-26 22:02:56,984 INFO ]: Interpolant automaton has 16 states. [2018-06-26 22:02:56,984 INFO ]: Start isEmpty. Operand 127 states and 247 transitions. [2018-06-26 22:02:56,985 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-26 22:02:56,985 INFO ]: Found error trace [2018-06-26 22:02:56,985 INFO ]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:56,985 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:56,985 INFO ]: Analyzing trace with hash 162451871, now seen corresponding path program 8 times [2018-06-26 22:02:56,985 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:56,985 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:56,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:56,986 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:02:56,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:57,030 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:57,198 INFO ]: Checked inductivity of 1770 backedges. 842 proven. 696 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-06-26 22:02:57,198 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:57,198 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-26 22:02:57,209 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:02:57,422 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:02:57,422 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:57,433 INFO ]: Computing forward predicates... [2018-06-26 22:02:57,465 INFO ]: Checked inductivity of 1770 backedges. 842 proven. 696 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-06-26 22:02:57,491 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:02:57,491 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 22:02:57,491 INFO ]: Interpolant automaton has 9 states [2018-06-26 22:02:57,491 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 22:02:57,491 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 22:02:57,491 INFO ]: Start difference. First operand 127 states and 247 transitions. Second operand 9 states. [2018-06-26 22:02:57,721 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:57,721 INFO ]: Finished difference Result 281 states and 539 transitions. [2018-06-26 22:02:57,721 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 22:02:57,721 INFO ]: Start accepts. Automaton has 9 states. Word has length 64 [2018-06-26 22:02:57,721 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:57,722 INFO ]: With dead ends: 281 [2018-06-26 22:02:57,722 INFO ]: Without dead ends: 136 [2018-06-26 22:02:57,722 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 22:02:57,722 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-26 22:02:57,726 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 133. [2018-06-26 22:02:57,726 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-26 22:02:57,726 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 258 transitions. [2018-06-26 22:02:57,726 INFO ]: Start accepts. Automaton has 133 states and 258 transitions. Word has length 64 [2018-06-26 22:02:57,727 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:57,727 INFO ]: Abstraction has 133 states and 258 transitions. [2018-06-26 22:02:57,727 INFO ]: Interpolant automaton has 9 states. [2018-06-26 22:02:57,727 INFO ]: Start isEmpty. Operand 133 states and 258 transitions. [2018-06-26 22:02:57,727 INFO ]: Finished isEmpty. Found accepting run of length 71 [2018-06-26 22:02:57,727 INFO ]: Found error trace [2018-06-26 22:02:57,727 INFO ]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:57,727 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:57,728 INFO ]: Analyzing trace with hash -1006748896, now seen corresponding path program 9 times [2018-06-26 22:02:57,728 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:57,728 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:57,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:57,728 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:02:57,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:57,771 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:58,037 INFO ]: Checked inductivity of 2145 backedges. 773 proven. 1250 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-06-26 22:02:58,037 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:58,037 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-26 22:02:58,044 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:02:58,323 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-06-26 22:02:58,323 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:58,335 INFO ]: Computing forward predicates... [2018-06-26 22:02:58,468 INFO ]: Checked inductivity of 2145 backedges. 773 proven. 1253 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-06-26 22:02:58,498 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:02:58,498 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 18 [2018-06-26 22:02:58,498 INFO ]: Interpolant automaton has 18 states [2018-06-26 22:02:58,498 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 22:02:58,498 INFO ]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-06-26 22:02:58,498 INFO ]: Start difference. First operand 133 states and 258 transitions. Second operand 18 states. [2018-06-26 22:02:59,237 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:02:59,237 INFO ]: Finished difference Result 158 states and 303 transitions. [2018-06-26 22:02:59,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 22:02:59,263 INFO ]: Start accepts. Automaton has 18 states. Word has length 70 [2018-06-26 22:02:59,263 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:02:59,263 INFO ]: With dead ends: 158 [2018-06-26 22:02:59,263 INFO ]: Without dead ends: 158 [2018-06-26 22:02:59,264 INFO ]: 0 DeclaredPredicates, 149 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=774, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 22:02:59,264 INFO ]: Start minimizeSevpa. Operand 158 states. [2018-06-26 22:02:59,268 INFO ]: Finished minimizeSevpa. Reduced states from 158 to 145. [2018-06-26 22:02:59,268 INFO ]: Start removeUnreachable. Operand 145 states. [2018-06-26 22:02:59,269 INFO ]: Finished removeUnreachable. Reduced from 145 states to 145 states and 280 transitions. [2018-06-26 22:02:59,269 INFO ]: Start accepts. Automaton has 145 states and 280 transitions. Word has length 70 [2018-06-26 22:02:59,269 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:02:59,269 INFO ]: Abstraction has 145 states and 280 transitions. [2018-06-26 22:02:59,269 INFO ]: Interpolant automaton has 18 states. [2018-06-26 22:02:59,269 INFO ]: Start isEmpty. Operand 145 states and 280 transitions. [2018-06-26 22:02:59,270 INFO ]: Finished isEmpty. Found accepting run of length 75 [2018-06-26 22:02:59,270 INFO ]: Found error trace [2018-06-26 22:02:59,270 INFO ]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:02:59,270 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:02:59,270 INFO ]: Analyzing trace with hash -2082136200, now seen corresponding path program 10 times [2018-06-26 22:02:59,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:02:59,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:02:59,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:59,270 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:02:59,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:02:59,322 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:59,499 INFO ]: Checked inductivity of 2415 backedges. 1124 proven. 1014 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-06-26 22:02:59,499 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:02:59,499 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-26 22:02:59,506 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 22:02:59,750 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:02:59,750 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:02:59,761 INFO ]: Computing forward predicates... [2018-06-26 22:02:59,803 INFO ]: Checked inductivity of 2415 backedges. 1124 proven. 1014 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-06-26 22:02:59,836 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:02:59,836 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 22:02:59,836 INFO ]: Interpolant automaton has 10 states [2018-06-26 22:02:59,836 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 22:02:59,836 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 22:02:59,837 INFO ]: Start difference. First operand 145 states and 280 transitions. Second operand 10 states. [2018-06-26 22:03:00,651 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:00,651 INFO ]: Finished difference Result 323 states and 616 transitions. [2018-06-26 22:03:00,651 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 22:03:00,651 INFO ]: Start accepts. Automaton has 10 states. Word has length 74 [2018-06-26 22:03:00,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:00,652 INFO ]: With dead ends: 323 [2018-06-26 22:03:00,652 INFO ]: Without dead ends: 154 [2018-06-26 22:03:00,653 INFO ]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 22:03:00,653 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-26 22:03:00,656 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-06-26 22:03:00,656 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-26 22:03:00,657 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 291 transitions. [2018-06-26 22:03:00,657 INFO ]: Start accepts. Automaton has 151 states and 291 transitions. Word has length 74 [2018-06-26 22:03:00,657 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:00,657 INFO ]: Abstraction has 151 states and 291 transitions. [2018-06-26 22:03:00,657 INFO ]: Interpolant automaton has 10 states. [2018-06-26 22:03:00,657 INFO ]: Start isEmpty. Operand 151 states and 291 transitions. [2018-06-26 22:03:00,658 INFO ]: Finished isEmpty. Found accepting run of length 81 [2018-06-26 22:03:00,658 INFO ]: Found error trace [2018-06-26 22:03:00,658 INFO ]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:00,658 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:00,658 INFO ]: Analyzing trace with hash -1140630599, now seen corresponding path program 11 times [2018-06-26 22:03:00,659 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:00,659 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:00,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:00,659 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:00,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:00,702 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:01,173 INFO ]: Checked inductivity of 2850 backedges. 1025 proven. 1685 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-06-26 22:03:01,173 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:01,173 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-26 22:03:01,179 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 22:03:01,529 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2018-06-26 22:03:01,529 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:01,548 INFO ]: Computing forward predicates... [2018-06-26 22:03:01,689 INFO ]: Checked inductivity of 2850 backedges. 1025 proven. 1685 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-06-26 22:03:01,709 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:01,709 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-06-26 22:03:01,710 INFO ]: Interpolant automaton has 20 states [2018-06-26 22:03:01,710 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 22:03:01,710 INFO ]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-06-26 22:03:01,710 INFO ]: Start difference. First operand 151 states and 291 transitions. Second operand 20 states. [2018-06-26 22:03:02,501 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:02,501 INFO ]: Finished difference Result 176 states and 336 transitions. [2018-06-26 22:03:02,502 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 22:03:02,502 INFO ]: Start accepts. Automaton has 20 states. Word has length 80 [2018-06-26 22:03:02,502 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:02,502 INFO ]: With dead ends: 176 [2018-06-26 22:03:02,502 INFO ]: Without dead ends: 176 [2018-06-26 22:03:02,503 INFO ]: 0 DeclaredPredicates, 171 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=349, Invalid=983, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 22:03:02,503 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-26 22:03:02,507 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 163. [2018-06-26 22:03:02,507 INFO ]: Start removeUnreachable. Operand 163 states. [2018-06-26 22:03:02,508 INFO ]: Finished removeUnreachable. Reduced from 163 states to 163 states and 313 transitions. [2018-06-26 22:03:02,508 INFO ]: Start accepts. Automaton has 163 states and 313 transitions. Word has length 80 [2018-06-26 22:03:02,508 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:02,508 INFO ]: Abstraction has 163 states and 313 transitions. [2018-06-26 22:03:02,508 INFO ]: Interpolant automaton has 20 states. [2018-06-26 22:03:02,508 INFO ]: Start isEmpty. Operand 163 states and 313 transitions. [2018-06-26 22:03:02,509 INFO ]: Finished isEmpty. Found accepting run of length 85 [2018-06-26 22:03:02,509 INFO ]: Found error trace [2018-06-26 22:03:02,509 INFO ]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:02,509 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:02,510 INFO ]: Analyzing trace with hash -1127855215, now seen corresponding path program 12 times [2018-06-26 22:03:02,510 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:02,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:02,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:02,510 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:02,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:02,564 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:03,110 INFO ]: Checked inductivity of 3160 backedges. 1446 proven. 1392 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-06-26 22:03:03,111 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:03,111 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-26 22:03:03,116 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 22:03:03,502 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2018-06-26 22:03:03,502 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:03,515 INFO ]: Computing forward predicates... [2018-06-26 22:03:03,554 INFO ]: Checked inductivity of 3160 backedges. 1446 proven. 1392 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-06-26 22:03:03,588 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:03,588 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 22:03:03,589 INFO ]: Interpolant automaton has 11 states [2018-06-26 22:03:03,589 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 22:03:03,589 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-26 22:03:03,589 INFO ]: Start difference. First operand 163 states and 313 transitions. Second operand 11 states. [2018-06-26 22:03:04,008 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:04,008 INFO ]: Finished difference Result 365 states and 693 transitions. [2018-06-26 22:03:04,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 22:03:04,008 INFO ]: Start accepts. Automaton has 11 states. Word has length 84 [2018-06-26 22:03:04,008 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:04,009 INFO ]: With dead ends: 365 [2018-06-26 22:03:04,009 INFO ]: Without dead ends: 172 [2018-06-26 22:03:04,009 INFO ]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-26 22:03:04,009 INFO ]: Start minimizeSevpa. Operand 172 states. [2018-06-26 22:03:04,013 INFO ]: Finished minimizeSevpa. Reduced states from 172 to 169. [2018-06-26 22:03:04,013 INFO ]: Start removeUnreachable. Operand 169 states. [2018-06-26 22:03:04,013 INFO ]: Finished removeUnreachable. Reduced from 169 states to 169 states and 324 transitions. [2018-06-26 22:03:04,013 INFO ]: Start accepts. Automaton has 169 states and 324 transitions. Word has length 84 [2018-06-26 22:03:04,014 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:04,014 INFO ]: Abstraction has 169 states and 324 transitions. [2018-06-26 22:03:04,014 INFO ]: Interpolant automaton has 11 states. [2018-06-26 22:03:04,014 INFO ]: Start isEmpty. Operand 169 states and 324 transitions. [2018-06-26 22:03:04,014 INFO ]: Finished isEmpty. Found accepting run of length 91 [2018-06-26 22:03:04,014 INFO ]: Found error trace [2018-06-26 22:03:04,014 INFO ]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:04,015 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:04,015 INFO ]: Analyzing trace with hash 1331358354, now seen corresponding path program 13 times [2018-06-26 22:03:04,015 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:04,015 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:04,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:04,015 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:04,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:04,062 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:04,888 INFO ]: Checked inductivity of 3655 backedges. 1313 proven. 2178 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-06-26 22:03:04,888 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:04,907 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-26 22:03:04,912 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:05,148 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:05,166 INFO ]: Computing forward predicates... [2018-06-26 22:03:05,629 INFO ]: Checked inductivity of 3655 backedges. 1313 proven. 2181 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-06-26 22:03:05,649 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:05,649 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 22 [2018-06-26 22:03:05,650 INFO ]: Interpolant automaton has 22 states [2018-06-26 22:03:05,650 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 22:03:05,650 INFO ]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-06-26 22:03:05,650 INFO ]: Start difference. First operand 169 states and 324 transitions. Second operand 22 states. [2018-06-26 22:03:06,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:06,588 INFO ]: Finished difference Result 194 states and 369 transitions. [2018-06-26 22:03:06,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 22:03:06,589 INFO ]: Start accepts. Automaton has 22 states. Word has length 90 [2018-06-26 22:03:06,589 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:06,590 INFO ]: With dead ends: 194 [2018-06-26 22:03:06,590 INFO ]: Without dead ends: 194 [2018-06-26 22:03:06,590 INFO ]: 0 DeclaredPredicates, 193 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=423, Invalid=1217, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 22:03:06,590 INFO ]: Start minimizeSevpa. Operand 194 states. [2018-06-26 22:03:06,595 INFO ]: Finished minimizeSevpa. Reduced states from 194 to 181. [2018-06-26 22:03:06,595 INFO ]: Start removeUnreachable. Operand 181 states. [2018-06-26 22:03:06,595 INFO ]: Finished removeUnreachable. Reduced from 181 states to 181 states and 346 transitions. [2018-06-26 22:03:06,595 INFO ]: Start accepts. Automaton has 181 states and 346 transitions. Word has length 90 [2018-06-26 22:03:06,596 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:06,596 INFO ]: Abstraction has 181 states and 346 transitions. [2018-06-26 22:03:06,596 INFO ]: Interpolant automaton has 22 states. [2018-06-26 22:03:06,596 INFO ]: Start isEmpty. Operand 181 states and 346 transitions. [2018-06-26 22:03:06,597 INFO ]: Finished isEmpty. Found accepting run of length 95 [2018-06-26 22:03:06,597 INFO ]: Found error trace [2018-06-26 22:03:06,597 INFO ]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:06,597 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:06,597 INFO ]: Analyzing trace with hash -1449605654, now seen corresponding path program 14 times [2018-06-26 22:03:06,597 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:06,597 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:06,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:06,598 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:06,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:06,652 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:07,711 INFO ]: Checked inductivity of 4005 backedges. 1808 proven. 1830 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-06-26 22:03:07,711 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:07,711 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-26 22:03:07,716 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:03:07,967 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:03:07,967 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:07,985 INFO ]: Computing forward predicates... [2018-06-26 22:03:08,026 INFO ]: Checked inductivity of 4005 backedges. 1808 proven. 1830 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-06-26 22:03:08,060 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:08,060 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-26 22:03:08,060 INFO ]: Interpolant automaton has 12 states [2018-06-26 22:03:08,060 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 22:03:08,060 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 22:03:08,060 INFO ]: Start difference. First operand 181 states and 346 transitions. Second operand 12 states. [2018-06-26 22:03:08,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:08,608 INFO ]: Finished difference Result 407 states and 770 transitions. [2018-06-26 22:03:08,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 22:03:08,608 INFO ]: Start accepts. Automaton has 12 states. Word has length 94 [2018-06-26 22:03:08,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:08,609 INFO ]: With dead ends: 407 [2018-06-26 22:03:08,609 INFO ]: Without dead ends: 190 [2018-06-26 22:03:08,609 INFO ]: 0 DeclaredPredicates, 183 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 22:03:08,609 INFO ]: Start minimizeSevpa. Operand 190 states. [2018-06-26 22:03:08,614 INFO ]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-06-26 22:03:08,614 INFO ]: Start removeUnreachable. Operand 187 states. [2018-06-26 22:03:08,614 INFO ]: Finished removeUnreachable. Reduced from 187 states to 187 states and 357 transitions. [2018-06-26 22:03:08,614 INFO ]: Start accepts. Automaton has 187 states and 357 transitions. Word has length 94 [2018-06-26 22:03:08,614 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:08,614 INFO ]: Abstraction has 187 states and 357 transitions. [2018-06-26 22:03:08,614 INFO ]: Interpolant automaton has 12 states. [2018-06-26 22:03:08,614 INFO ]: Start isEmpty. Operand 187 states and 357 transitions. [2018-06-26 22:03:08,615 INFO ]: Finished isEmpty. Found accepting run of length 101 [2018-06-26 22:03:08,615 INFO ]: Found error trace [2018-06-26 22:03:08,615 INFO ]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:08,615 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:08,616 INFO ]: Analyzing trace with hash -1290315861, now seen corresponding path program 15 times [2018-06-26 22:03:08,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:08,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:08,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:08,616 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:08,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:08,663 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:09,360 INFO ]: Checked inductivity of 4560 backedges. 1637 proven. 2741 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-06-26 22:03:09,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:09,360 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-26 22:03:09,366 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:03:09,915 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-06-26 22:03:09,915 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:09,938 INFO ]: Computing forward predicates... [2018-06-26 22:03:10,008 INFO ]: Checked inductivity of 4560 backedges. 1637 proven. 2741 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-06-26 22:03:10,030 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:10,030 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-06-26 22:03:10,030 INFO ]: Interpolant automaton has 24 states [2018-06-26 22:03:10,030 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 22:03:10,030 INFO ]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-06-26 22:03:10,031 INFO ]: Start difference. First operand 187 states and 357 transitions. Second operand 24 states. [2018-06-26 22:03:11,152 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:11,152 INFO ]: Finished difference Result 212 states and 402 transitions. [2018-06-26 22:03:11,153 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 22:03:11,153 INFO ]: Start accepts. Automaton has 24 states. Word has length 100 [2018-06-26 22:03:11,153 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:11,154 INFO ]: With dead ends: 212 [2018-06-26 22:03:11,154 INFO ]: Without dead ends: 212 [2018-06-26 22:03:11,154 INFO ]: 0 DeclaredPredicates, 215 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=504, Invalid=1476, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 22:03:11,154 INFO ]: Start minimizeSevpa. Operand 212 states. [2018-06-26 22:03:11,160 INFO ]: Finished minimizeSevpa. Reduced states from 212 to 199. [2018-06-26 22:03:11,160 INFO ]: Start removeUnreachable. Operand 199 states. [2018-06-26 22:03:11,161 INFO ]: Finished removeUnreachable. Reduced from 199 states to 199 states and 379 transitions. [2018-06-26 22:03:11,161 INFO ]: Start accepts. Automaton has 199 states and 379 transitions. Word has length 100 [2018-06-26 22:03:11,161 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:11,161 INFO ]: Abstraction has 199 states and 379 transitions. [2018-06-26 22:03:11,161 INFO ]: Interpolant automaton has 24 states. [2018-06-26 22:03:11,161 INFO ]: Start isEmpty. Operand 199 states and 379 transitions. [2018-06-26 22:03:11,162 INFO ]: Finished isEmpty. Found accepting run of length 105 [2018-06-26 22:03:11,162 INFO ]: Found error trace [2018-06-26 22:03:11,162 INFO ]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:11,162 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:11,163 INFO ]: Analyzing trace with hash -793313661, now seen corresponding path program 16 times [2018-06-26 22:03:11,163 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:11,163 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:11,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:11,163 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:11,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:11,237 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:11,803 INFO ]: Checked inductivity of 4950 backedges. 2210 proven. 2328 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2018-06-26 22:03:11,804 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:11,804 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-26 22:03:11,811 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 22:03:12,089 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:03:12,089 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:12,107 INFO ]: Computing forward predicates... [2018-06-26 22:03:12,150 INFO ]: Checked inductivity of 4950 backedges. 2210 proven. 2328 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2018-06-26 22:03:12,184 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:12,184 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 22:03:12,184 INFO ]: Interpolant automaton has 13 states [2018-06-26 22:03:12,184 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 22:03:12,184 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 22:03:12,184 INFO ]: Start difference. First operand 199 states and 379 transitions. Second operand 13 states. [2018-06-26 22:03:12,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:12,692 INFO ]: Finished difference Result 449 states and 847 transitions. [2018-06-26 22:03:12,692 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 22:03:12,692 INFO ]: Start accepts. Automaton has 13 states. Word has length 104 [2018-06-26 22:03:12,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:12,693 INFO ]: With dead ends: 449 [2018-06-26 22:03:12,693 INFO ]: Without dead ends: 208 [2018-06-26 22:03:12,694 INFO ]: 0 DeclaredPredicates, 203 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 22:03:12,694 INFO ]: Start minimizeSevpa. Operand 208 states. [2018-06-26 22:03:12,699 INFO ]: Finished minimizeSevpa. Reduced states from 208 to 205. [2018-06-26 22:03:12,699 INFO ]: Start removeUnreachable. Operand 205 states. [2018-06-26 22:03:12,700 INFO ]: Finished removeUnreachable. Reduced from 205 states to 205 states and 390 transitions. [2018-06-26 22:03:12,700 INFO ]: Start accepts. Automaton has 205 states and 390 transitions. Word has length 104 [2018-06-26 22:03:12,700 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:12,700 INFO ]: Abstraction has 205 states and 390 transitions. [2018-06-26 22:03:12,700 INFO ]: Interpolant automaton has 13 states. [2018-06-26 22:03:12,700 INFO ]: Start isEmpty. Operand 205 states and 390 transitions. [2018-06-26 22:03:12,701 INFO ]: Finished isEmpty. Found accepting run of length 111 [2018-06-26 22:03:12,701 INFO ]: Found error trace [2018-06-26 22:03:12,701 INFO ]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:12,701 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:12,702 INFO ]: Analyzing trace with hash 1583289092, now seen corresponding path program 17 times [2018-06-26 22:03:12,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:12,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:12,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:12,703 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:12,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:12,753 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:13,418 INFO ]: Checked inductivity of 5565 backedges. 1997 proven. 3365 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-06-26 22:03:13,419 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:13,419 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-26 22:03:13,427 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 22:03:14,020 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2018-06-26 22:03:14,020 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:14,058 INFO ]: Computing forward predicates... [2018-06-26 22:03:14,595 INFO ]: Checked inductivity of 5565 backedges. 1997 proven. 3365 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-06-26 22:03:14,629 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:14,629 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-06-26 22:03:14,629 INFO ]: Interpolant automaton has 26 states [2018-06-26 22:03:14,629 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 22:03:14,629 INFO ]: CoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-06-26 22:03:14,629 INFO ]: Start difference. First operand 205 states and 390 transitions. Second operand 26 states. [2018-06-26 22:03:16,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:16,531 INFO ]: Finished difference Result 230 states and 435 transitions. [2018-06-26 22:03:16,534 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 22:03:16,534 INFO ]: Start accepts. Automaton has 26 states. Word has length 110 [2018-06-26 22:03:16,534 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:16,535 INFO ]: With dead ends: 230 [2018-06-26 22:03:16,535 INFO ]: Without dead ends: 230 [2018-06-26 22:03:16,536 INFO ]: 0 DeclaredPredicates, 237 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=592, Invalid=1760, Unknown=0, NotChecked=0, Total=2352 [2018-06-26 22:03:16,536 INFO ]: Start minimizeSevpa. Operand 230 states. [2018-06-26 22:03:16,542 INFO ]: Finished minimizeSevpa. Reduced states from 230 to 217. [2018-06-26 22:03:16,542 INFO ]: Start removeUnreachable. Operand 217 states. [2018-06-26 22:03:16,542 INFO ]: Finished removeUnreachable. Reduced from 217 states to 217 states and 412 transitions. [2018-06-26 22:03:16,543 INFO ]: Start accepts. Automaton has 217 states and 412 transitions. Word has length 110 [2018-06-26 22:03:16,543 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:16,543 INFO ]: Abstraction has 217 states and 412 transitions. [2018-06-26 22:03:16,543 INFO ]: Interpolant automaton has 26 states. [2018-06-26 22:03:16,543 INFO ]: Start isEmpty. Operand 217 states and 412 transitions. [2018-06-26 22:03:16,544 INFO ]: Finished isEmpty. Found accepting run of length 115 [2018-06-26 22:03:16,544 INFO ]: Found error trace [2018-06-26 22:03:16,544 INFO ]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:16,544 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:16,544 INFO ]: Analyzing trace with hash -795908772, now seen corresponding path program 18 times [2018-06-26 22:03:16,544 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:16,544 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:16,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:16,545 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:16,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:16,609 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:16,827 INFO ]: Checked inductivity of 5995 backedges. 2652 proven. 2886 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2018-06-26 22:03:16,827 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:16,827 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-26 22:03:16,832 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 22:03:17,455 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 56 check-sat command(s) [2018-06-26 22:03:17,455 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:17,468 INFO ]: Computing forward predicates... [2018-06-26 22:03:17,513 INFO ]: Checked inductivity of 5995 backedges. 2652 proven. 2886 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2018-06-26 22:03:17,547 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:17,547 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-26 22:03:17,547 INFO ]: Interpolant automaton has 14 states [2018-06-26 22:03:17,548 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 22:03:17,548 INFO ]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-26 22:03:17,548 INFO ]: Start difference. First operand 217 states and 412 transitions. Second operand 14 states. [2018-06-26 22:03:20,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:20,590 INFO ]: Finished difference Result 491 states and 924 transitions. [2018-06-26 22:03:20,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 22:03:20,591 INFO ]: Start accepts. Automaton has 14 states. Word has length 114 [2018-06-26 22:03:20,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:20,592 INFO ]: With dead ends: 491 [2018-06-26 22:03:20,592 INFO ]: Without dead ends: 226 [2018-06-26 22:03:20,592 INFO ]: 0 DeclaredPredicates, 223 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-26 22:03:20,592 INFO ]: Start minimizeSevpa. Operand 226 states. [2018-06-26 22:03:20,596 INFO ]: Finished minimizeSevpa. Reduced states from 226 to 223. [2018-06-26 22:03:20,596 INFO ]: Start removeUnreachable. Operand 223 states. [2018-06-26 22:03:20,596 INFO ]: Finished removeUnreachable. Reduced from 223 states to 223 states and 423 transitions. [2018-06-26 22:03:20,597 INFO ]: Start accepts. Automaton has 223 states and 423 transitions. Word has length 114 [2018-06-26 22:03:20,597 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:20,597 INFO ]: Abstraction has 223 states and 423 transitions. [2018-06-26 22:03:20,597 INFO ]: Interpolant automaton has 14 states. [2018-06-26 22:03:20,597 INFO ]: Start isEmpty. Operand 223 states and 423 transitions. [2018-06-26 22:03:20,598 INFO ]: Finished isEmpty. Found accepting run of length 121 [2018-06-26 22:03:20,598 INFO ]: Found error trace [2018-06-26 22:03:20,598 INFO ]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:20,598 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:20,598 INFO ]: Analyzing trace with hash 1366068381, now seen corresponding path program 19 times [2018-06-26 22:03:20,598 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:20,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:20,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:20,598 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:20,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:20,652 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:21,019 INFO ]: Checked inductivity of 6670 backedges. 2393 proven. 4053 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-06-26 22:03:21,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:21,019 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-26 22:03:21,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:21,399 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:21,426 INFO ]: Computing forward predicates... [2018-06-26 22:03:21,540 INFO ]: Checked inductivity of 6670 backedges. 2393 proven. 4053 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-06-26 22:03:21,574 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:21,574 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-06-26 22:03:21,574 INFO ]: Interpolant automaton has 28 states [2018-06-26 22:03:21,574 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 22:03:21,574 INFO ]: CoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-06-26 22:03:21,575 INFO ]: Start difference. First operand 223 states and 423 transitions. Second operand 28 states. [2018-06-26 22:03:22,558 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:22,558 INFO ]: Finished difference Result 248 states and 468 transitions. [2018-06-26 22:03:22,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-26 22:03:22,558 INFO ]: Start accepts. Automaton has 28 states. Word has length 120 [2018-06-26 22:03:22,558 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:22,559 INFO ]: With dead ends: 248 [2018-06-26 22:03:22,559 INFO ]: Without dead ends: 248 [2018-06-26 22:03:22,560 INFO ]: 0 DeclaredPredicates, 259 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=687, Invalid=2069, Unknown=0, NotChecked=0, Total=2756 [2018-06-26 22:03:22,560 INFO ]: Start minimizeSevpa. Operand 248 states. [2018-06-26 22:03:22,565 INFO ]: Finished minimizeSevpa. Reduced states from 248 to 235. [2018-06-26 22:03:22,565 INFO ]: Start removeUnreachable. Operand 235 states. [2018-06-26 22:03:22,566 INFO ]: Finished removeUnreachable. Reduced from 235 states to 235 states and 445 transitions. [2018-06-26 22:03:22,566 INFO ]: Start accepts. Automaton has 235 states and 445 transitions. Word has length 120 [2018-06-26 22:03:22,567 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:22,567 INFO ]: Abstraction has 235 states and 445 transitions. [2018-06-26 22:03:22,567 INFO ]: Interpolant automaton has 28 states. [2018-06-26 22:03:22,567 INFO ]: Start isEmpty. Operand 235 states and 445 transitions. [2018-06-26 22:03:22,567 INFO ]: Finished isEmpty. Found accepting run of length 125 [2018-06-26 22:03:22,567 INFO ]: Found error trace [2018-06-26 22:03:22,567 INFO ]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:22,568 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:22,568 INFO ]: Analyzing trace with hash 648309365, now seen corresponding path program 20 times [2018-06-26 22:03:22,568 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:22,568 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:22,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:22,568 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:22,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:22,649 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:22,917 INFO ]: Checked inductivity of 7140 backedges. 3134 proven. 3504 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2018-06-26 22:03:22,917 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:22,917 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-26 22:03:22,922 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:03:23,267 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:03:23,267 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:23,288 INFO ]: Computing forward predicates... [2018-06-26 22:03:23,341 INFO ]: Checked inductivity of 7140 backedges. 3134 proven. 3504 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2018-06-26 22:03:23,376 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:23,376 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-26 22:03:23,377 INFO ]: Interpolant automaton has 15 states [2018-06-26 22:03:23,377 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 22:03:23,377 INFO ]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-06-26 22:03:23,377 INFO ]: Start difference. First operand 235 states and 445 transitions. Second operand 15 states. [2018-06-26 22:03:24,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:24,161 INFO ]: Finished difference Result 533 states and 1001 transitions. [2018-06-26 22:03:24,161 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 22:03:24,161 INFO ]: Start accepts. Automaton has 15 states. Word has length 124 [2018-06-26 22:03:24,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:24,162 INFO ]: With dead ends: 533 [2018-06-26 22:03:24,162 INFO ]: Without dead ends: 244 [2018-06-26 22:03:24,162 INFO ]: 0 DeclaredPredicates, 243 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-06-26 22:03:24,162 INFO ]: Start minimizeSevpa. Operand 244 states. [2018-06-26 22:03:24,165 INFO ]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-06-26 22:03:24,165 INFO ]: Start removeUnreachable. Operand 241 states. [2018-06-26 22:03:24,166 INFO ]: Finished removeUnreachable. Reduced from 241 states to 241 states and 456 transitions. [2018-06-26 22:03:24,166 INFO ]: Start accepts. Automaton has 241 states and 456 transitions. Word has length 124 [2018-06-26 22:03:24,166 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:24,166 INFO ]: Abstraction has 241 states and 456 transitions. [2018-06-26 22:03:24,166 INFO ]: Interpolant automaton has 15 states. [2018-06-26 22:03:24,166 INFO ]: Start isEmpty. Operand 241 states and 456 transitions. [2018-06-26 22:03:24,166 INFO ]: Finished isEmpty. Found accepting run of length 131 [2018-06-26 22:03:24,166 INFO ]: Found error trace [2018-06-26 22:03:24,166 INFO ]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:24,166 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:24,166 INFO ]: Analyzing trace with hash -1668402058, now seen corresponding path program 21 times [2018-06-26 22:03:24,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:24,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:24,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:24,167 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:24,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:24,219 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-26 22:03:25,715 WARN ]: Verification canceled [2018-06-26 22:03:25,790 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 22:03:25,791 WARN ]: Timeout [2018-06-26 22:03:25,792 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 10:03:25 BasicIcfg [2018-06-26 22:03:25,792 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 22:03:25,792 INFO ]: Toolchain (without parser) took 52848.94 ms. Allocated memory was 308.3 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 260.6 MB in the beginning and 1.1 GB in the end (delta: -859.7 MB). Peak memory consumption was 412.8 MB. Max. memory is 3.6 GB. [2018-06-26 22:03:25,793 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 308.3 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 22:03:25,794 INFO ]: ChcToBoogie took 56.19 ms. Allocated memory is still 308.3 MB. Free memory was 259.6 MB in the beginning and 257.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 22:03:25,794 INFO ]: Boogie Preprocessor took 48.01 ms. Allocated memory is still 308.3 MB. Free memory was 257.6 MB in the beginning and 256.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 22:03:25,794 INFO ]: RCFGBuilder took 267.44 ms. Allocated memory is still 308.3 MB. Free memory was 256.6 MB in the beginning and 247.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-26 22:03:25,796 INFO ]: BlockEncodingV2 took 5673.65 ms. Allocated memory was 308.3 MB in the beginning and 1.1 GB in the end (delta: 798.0 MB). Free memory was 247.6 MB in the beginning and 777.2 MB in the end (delta: -529.6 MB). Peak memory consumption was 762.5 MB. Max. memory is 3.6 GB. [2018-06-26 22:03:25,797 INFO ]: TraceAbstraction took 46795.10 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 474.5 MB). Free memory was 766.5 MB in the beginning and 1.1 GB in the end (delta: -353.8 MB). Peak memory consumption was 120.7 MB. Max. memory is 3.6 GB. [2018-06-26 22:03:25,800 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 89 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 308.3 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.19 ms. Allocated memory is still 308.3 MB. Free memory was 259.6 MB in the beginning and 257.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 48.01 ms. Allocated memory is still 308.3 MB. Free memory was 257.6 MB in the beginning and 256.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 267.44 ms. Allocated memory is still 308.3 MB. Free memory was 256.6 MB in the beginning and 247.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 5673.65 ms. Allocated memory was 308.3 MB in the beginning and 1.1 GB in the end (delta: 798.0 MB). Free memory was 247.6 MB in the beginning and 777.2 MB in the end (delta: -529.6 MB). Peak memory consumption was 762.5 MB. Max. memory is 3.6 GB. * TraceAbstraction took 46795.10 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 474.5 MB). Free memory was 766.5 MB in the beginning and 1.1 GB in the end (delta: -353.8 MB). Peak memory consumption was 120.7 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 analyzing trace of length 131 with TraceHistMax 13, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 129 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 46.7s OverallTime, 34 OverallIterations, 13 TraceHistogramMax, 22.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 194 SDtfs, 52 SDslu, 865 SDs, 0 SdLazy, 18090 SolverSat, 6311 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3330 GetRequests, 2849 SyntacticMatches, 0 SemanticMatches, 481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3890 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 439 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 3306 NumberOfCodeBlocks, 3291 NumberOfCodeBlocksAsserted, 391 NumberOfCheckSat, 3250 ConstructedInterpolants, 0 QuantifiedInterpolants, 915410 SizeOfPredicates, 0 NumberOfNonLiveVariables, 43281 ConjunctsInSsa, 3715 ConjunctsInUnsatCore, 56 InterpolantComputations, 11 PerfectInterpolantSequences, 59335/122798 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/up3.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_22-03-25-817.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/up3.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_22-03-25-817.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/up3.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_22-03-25-817.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/up3.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_22-03-25-817.csv Completed graceful shutdown