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/llreve-bench/smt2/rec__add-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:59:08,197 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:59:08,199 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:59:08,212 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:59:08,212 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:59:08,213 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:59:08,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:59:08,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:59:08,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:59:08,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:59:08,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:59:08,222 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:59:08,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:59:08,224 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:59:08,224 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:59:08,225 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:59:08,227 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:59:08,240 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:59:08,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:59:08,242 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:59:08,243 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:59:08,246 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:59:08,246 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:59:08,247 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:59:08,247 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:59:08,250 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:59:08,250 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:59:08,251 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:59:08,252 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:59:08,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:59:08,253 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:59:08,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:59:08,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:59:08,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:59:08,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:59:08,255 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:59:08,268 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:59:08,268 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:59:08,269 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:59:08,269 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:59:08,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:59:08,270 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:59:08,270 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:59:08,270 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:59:08,270 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:59:08,271 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:59:08,271 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:59:08,271 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:59:08,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:59:08,271 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:59:08,271 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:59:08,272 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:59:08,273 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:59:08,273 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:59:08,273 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:59:08,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:59:08,274 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:59:08,275 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:59:08,275 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:59:08,329 INFO ]: Repository-Root is: /tmp [2018-06-24 21:59:08,347 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:59:08,353 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:59:08,355 INFO ]: Initializing SmtParser... [2018-06-24 21:59:08,355 INFO ]: SmtParser initialized [2018-06-24 21:59:08,355 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__add-horn.smt2 [2018-06-24 21:59:08,356 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:59:08,444 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__add-horn.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@393f8b87 [2018-06-24 21:59:08,692 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__add-horn.smt2 [2018-06-24 21:59:08,697 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:59:08,702 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:59:08,703 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:59:08,703 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:59:08,703 INFO ]: ChcToBoogie initialized [2018-06-24 21:59:08,706 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:59:08" (1/1) ... [2018-06-24 21:59:08,766 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:08 Unit [2018-06-24 21:59:08,766 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:59:08,767 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:59:08,767 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:59:08,767 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:59:08,788 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:08" (1/1) ... [2018-06-24 21:59:08,788 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:08" (1/1) ... [2018-06-24 21:59:08,794 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:08" (1/1) ... [2018-06-24 21:59:08,795 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:08" (1/1) ... [2018-06-24 21:59:08,804 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:08" (1/1) ... [2018-06-24 21:59:08,807 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:08" (1/1) ... [2018-06-24 21:59:08,809 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:08" (1/1) ... [2018-06-24 21:59:08,811 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:59:08,811 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:59:08,811 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:59:08,811 INFO ]: RCFGBuilder initialized [2018-06-24 21:59:08,818 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:08" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:59:08,827 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:59:08,827 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:59:08,827 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:59:08,827 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:59:08,827 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:59:08,827 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 21:59:09,279 INFO ]: Using library mode [2018-06-24 21:59:09,280 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:59:09 BoogieIcfgContainer [2018-06-24 21:59:09,280 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:59:09,281 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:59:09,281 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:59:09,282 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:59:09,282 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:59:09" (1/1) ... [2018-06-24 21:59:09,301 INFO ]: Initial Icfg 31 locations, 60 edges [2018-06-24 21:59:09,303 INFO ]: Using Remove infeasible edges [2018-06-24 21:59:09,303 INFO ]: Using Maximize final states [2018-06-24 21:59:09,304 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:59:09,304 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:59:09,306 INFO ]: Using Remove sink states [2018-06-24 21:59:09,306 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:59:09,306 INFO ]: Using Use SBE [2018-06-24 21:59:09,315 INFO ]: SBE split 0 edges [2018-06-24 21:59:09,320 INFO ]: Removed 6 edges and 2 locations because of local infeasibility [2018-06-24 21:59:09,322 INFO ]: 0 new accepting states [2018-06-24 21:59:09,580 INFO ]: Removed 28 edges and 7 locations by large block encoding [2018-06-24 21:59:09,582 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:59:09,585 INFO ]: Removed 2 edges and 0 locations because of local infeasibility [2018-06-24 21:59:09,585 INFO ]: 0 new accepting states [2018-06-24 21:59:09,585 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:59:09,586 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:59:09,586 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:59:09,586 INFO ]: 0 new accepting states [2018-06-24 21:59:09,587 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:59:09,587 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:59:09,587 INFO ]: Encoded RCFG 22 locations, 46 edges [2018-06-24 21:59:09,588 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:59:09 BasicIcfg [2018-06-24 21:59:09,588 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:59:09,589 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:59:09,589 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:59:09,592 INFO ]: TraceAbstraction initialized [2018-06-24 21:59:09,592 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:59:08" (1/4) ... [2018-06-24 21:59:09,594 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ed0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:59:09, skipping insertion in model container [2018-06-24 21:59:09,594 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:08" (2/4) ... [2018-06-24 21:59:09,594 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ed0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:59:09, skipping insertion in model container [2018-06-24 21:59:09,594 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:59:09" (3/4) ... [2018-06-24 21:59:09,594 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ed0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:59:09, skipping insertion in model container [2018-06-24 21:59:09,594 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:59:09" (4/4) ... [2018-06-24 21:59:09,596 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:59:09,604 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:59:09,611 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:59:09,658 INFO ]: Using default assertion order modulation [2018-06-24 21:59:09,659 INFO ]: Interprodecural is true [2018-06-24 21:59:09,659 INFO ]: Hoare is false [2018-06-24 21:59:09,659 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:59:09,659 INFO ]: Backedges is TWOTRACK [2018-06-24 21:59:09,659 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:59:09,659 INFO ]: Difference is false [2018-06-24 21:59:09,659 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:59:09,659 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:59:09,670 INFO ]: Start isEmpty. Operand 22 states. [2018-06-24 21:59:09,684 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:59:09,684 INFO ]: Found error trace [2018-06-24 21:59:09,685 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:59:09,685 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:09,689 INFO ]: Analyzing trace with hash 45481141, now seen corresponding path program 1 times [2018-06-24 21:59:09,691 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:09,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:09,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:09,730 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:09,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:09,781 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:09,854 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:59:09,857 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:09,857 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:09,859 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:09,875 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:09,875 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:09,879 INFO ]: Start difference. First operand 22 states. Second operand 3 states. [2018-06-24 21:59:10,179 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:10,179 INFO ]: Finished difference Result 38 states and 79 transitions. [2018-06-24 21:59:10,180 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:10,181 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:59:10,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:10,192 INFO ]: With dead ends: 38 [2018-06-24 21:59:10,192 INFO ]: Without dead ends: 38 [2018-06-24 21:59:10,194 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:10,208 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 21:59:10,237 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 21:59:10,238 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 21:59:10,241 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 79 transitions. [2018-06-24 21:59:10,242 INFO ]: Start accepts. Automaton has 38 states and 79 transitions. Word has length 5 [2018-06-24 21:59:10,243 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:10,243 INFO ]: Abstraction has 38 states and 79 transitions. [2018-06-24 21:59:10,243 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:10,243 INFO ]: Start isEmpty. Operand 38 states and 79 transitions. [2018-06-24 21:59:10,246 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:59:10,246 INFO ]: Found error trace [2018-06-24 21:59:10,246 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:59:10,246 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:10,247 INFO ]: Analyzing trace with hash 45628174, now seen corresponding path program 1 times [2018-06-24 21:59:10,247 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:10,247 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:10,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:10,247 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:10,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:10,254 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:10,317 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:59:10,317 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:10,317 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:10,319 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:10,319 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:10,319 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:10,319 INFO ]: Start difference. First operand 38 states and 79 transitions. Second operand 3 states. [2018-06-24 21:59:10,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:10,750 INFO ]: Finished difference Result 54 states and 114 transitions. [2018-06-24 21:59:10,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:10,750 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:59:10,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:10,753 INFO ]: With dead ends: 54 [2018-06-24 21:59:10,753 INFO ]: Without dead ends: 54 [2018-06-24 21:59:10,754 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:10,754 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-24 21:59:10,763 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-24 21:59:10,764 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-24 21:59:10,766 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 114 transitions. [2018-06-24 21:59:10,766 INFO ]: Start accepts. Automaton has 54 states and 114 transitions. Word has length 5 [2018-06-24 21:59:10,766 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:10,766 INFO ]: Abstraction has 54 states and 114 transitions. [2018-06-24 21:59:10,766 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:10,766 INFO ]: Start isEmpty. Operand 54 states and 114 transitions. [2018-06-24 21:59:10,770 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:59:10,770 INFO ]: Found error trace [2018-06-24 21:59:10,770 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:59:10,770 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:10,770 INFO ]: Analyzing trace with hash 1414942659, now seen corresponding path program 1 times [2018-06-24 21:59:10,770 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:10,770 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:10,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:10,771 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:10,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:10,782 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:10,802 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:59:10,802 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:10,802 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:10,803 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:10,803 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:10,803 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:10,803 INFO ]: Start difference. First operand 54 states and 114 transitions. Second operand 3 states. [2018-06-24 21:59:10,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:10,839 INFO ]: Finished difference Result 72 states and 161 transitions. [2018-06-24 21:59:10,839 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:10,839 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:59:10,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:10,845 INFO ]: With dead ends: 72 [2018-06-24 21:59:10,845 INFO ]: Without dead ends: 72 [2018-06-24 21:59:10,845 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:10,845 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-24 21:59:10,860 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 57. [2018-06-24 21:59:10,860 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-24 21:59:10,862 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 117 transitions. [2018-06-24 21:59:10,862 INFO ]: Start accepts. Automaton has 57 states and 117 transitions. Word has length 6 [2018-06-24 21:59:10,862 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:10,862 INFO ]: Abstraction has 57 states and 117 transitions. [2018-06-24 21:59:10,862 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:10,862 INFO ]: Start isEmpty. Operand 57 states and 117 transitions. [2018-06-24 21:59:10,865 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:59:10,865 INFO ]: Found error trace [2018-06-24 21:59:10,865 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:59:10,865 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:10,865 INFO ]: Analyzing trace with hash 1416878113, now seen corresponding path program 1 times [2018-06-24 21:59:10,865 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:10,865 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:10,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:10,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:10,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:10,876 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:10,937 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:59:10,937 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:10,937 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:10,938 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:10,938 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:10,938 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:10,938 INFO ]: Start difference. First operand 57 states and 117 transitions. Second operand 3 states. [2018-06-24 21:59:11,174 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:11,174 INFO ]: Finished difference Result 74 states and 154 transitions. [2018-06-24 21:59:11,174 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:11,174 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:59:11,174 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:11,177 INFO ]: With dead ends: 74 [2018-06-24 21:59:11,177 INFO ]: Without dead ends: 74 [2018-06-24 21:59:11,177 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:11,177 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-24 21:59:11,186 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-24 21:59:11,186 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-24 21:59:11,188 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 154 transitions. [2018-06-24 21:59:11,188 INFO ]: Start accepts. Automaton has 74 states and 154 transitions. Word has length 6 [2018-06-24 21:59:11,188 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:11,188 INFO ]: Abstraction has 74 states and 154 transitions. [2018-06-24 21:59:11,188 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:11,188 INFO ]: Start isEmpty. Operand 74 states and 154 transitions. [2018-06-24 21:59:11,190 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:59:11,190 INFO ]: Found error trace [2018-06-24 21:59:11,190 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:59:11,190 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:11,191 INFO ]: Analyzing trace with hash 1417801634, now seen corresponding path program 1 times [2018-06-24 21:59:11,191 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:11,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:11,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,192 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:11,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,204 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:11,403 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 8 [2018-06-24 21:59:11,404 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:59:11,404 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:11,404 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:11,404 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:11,404 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:11,404 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:11,404 INFO ]: Start difference. First operand 74 states and 154 transitions. Second operand 3 states. [2018-06-24 21:59:11,583 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:11,583 INFO ]: Finished difference Result 105 states and 236 transitions. [2018-06-24 21:59:11,583 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:11,583 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:59:11,583 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:11,586 INFO ]: With dead ends: 105 [2018-06-24 21:59:11,586 INFO ]: Without dead ends: 105 [2018-06-24 21:59:11,587 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:11,587 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-24 21:59:11,602 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 75. [2018-06-24 21:59:11,602 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-24 21:59:11,603 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 156 transitions. [2018-06-24 21:59:11,603 INFO ]: Start accepts. Automaton has 75 states and 156 transitions. Word has length 6 [2018-06-24 21:59:11,604 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:11,604 INFO ]: Abstraction has 75 states and 156 transitions. [2018-06-24 21:59:11,604 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:11,604 INFO ]: Start isEmpty. Operand 75 states and 156 transitions. [2018-06-24 21:59:11,606 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:59:11,606 INFO ]: Found error trace [2018-06-24 21:59:11,606 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:59:11,606 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:11,606 INFO ]: Analyzing trace with hash 1417950589, now seen corresponding path program 1 times [2018-06-24 21:59:11,606 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:11,606 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:11,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,607 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:11,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,616 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:11,679 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:59:11,679 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:11,679 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:11,680 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:11,680 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:11,680 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:11,680 INFO ]: Start difference. First operand 75 states and 156 transitions. Second operand 3 states. [2018-06-24 21:59:11,842 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:11,842 INFO ]: Finished difference Result 79 states and 160 transitions. [2018-06-24 21:59:11,842 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:11,842 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:59:11,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:11,844 INFO ]: With dead ends: 79 [2018-06-24 21:59:11,844 INFO ]: Without dead ends: 75 [2018-06-24 21:59:11,844 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:11,844 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-24 21:59:11,852 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-06-24 21:59:11,852 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-24 21:59:11,854 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 151 transitions. [2018-06-24 21:59:11,854 INFO ]: Start accepts. Automaton has 75 states and 151 transitions. Word has length 6 [2018-06-24 21:59:11,854 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:11,854 INFO ]: Abstraction has 75 states and 151 transitions. [2018-06-24 21:59:11,854 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:11,854 INFO ]: Start isEmpty. Operand 75 states and 151 transitions. [2018-06-24 21:59:11,857 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:59:11,857 INFO ]: Found error trace [2018-06-24 21:59:11,857 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:11,857 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:11,857 INFO ]: Analyzing trace with hash -681958738, now seen corresponding path program 1 times [2018-06-24 21:59:11,857 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:11,857 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:11,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,858 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:11,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,866 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:11,909 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:59:11,909 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:11,910 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:11,910 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:11,910 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:11,910 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:11,910 INFO ]: Start difference. First operand 75 states and 151 transitions. Second operand 3 states. [2018-06-24 21:59:12,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:12,103 INFO ]: Finished difference Result 92 states and 176 transitions. [2018-06-24 21:59:12,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:12,104 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 21:59:12,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:12,106 INFO ]: With dead ends: 92 [2018-06-24 21:59:12,106 INFO ]: Without dead ends: 92 [2018-06-24 21:59:12,106 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:12,106 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-24 21:59:12,123 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-06-24 21:59:12,123 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-24 21:59:12,125 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 176 transitions. [2018-06-24 21:59:12,125 INFO ]: Start accepts. Automaton has 92 states and 176 transitions. Word has length 11 [2018-06-24 21:59:12,125 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:12,125 INFO ]: Abstraction has 92 states and 176 transitions. [2018-06-24 21:59:12,125 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:12,125 INFO ]: Start isEmpty. Operand 92 states and 176 transitions. [2018-06-24 21:59:12,132 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:59:12,132 INFO ]: Found error trace [2018-06-24 21:59:12,132 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:12,132 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:12,133 INFO ]: Analyzing trace with hash 1252942732, now seen corresponding path program 1 times [2018-06-24 21:59:12,133 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:12,133 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:12,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:12,134 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:12,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:12,159 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:12,266 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:59:12,266 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:12,266 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-24 21:59:12,267 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:59:12,267 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:59:12,267 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:59:12,267 INFO ]: Start difference. First operand 92 states and 176 transitions. Second operand 7 states. [2018-06-24 21:59:13,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:13,026 INFO ]: Finished difference Result 167 states and 387 transitions. [2018-06-24 21:59:13,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:59:13,027 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-24 21:59:13,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:13,030 INFO ]: With dead ends: 167 [2018-06-24 21:59:13,030 INFO ]: Without dead ends: 140 [2018-06-24 21:59:13,030 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:59:13,031 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-24 21:59:13,050 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 96. [2018-06-24 21:59:13,050 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-24 21:59:13,052 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 189 transitions. [2018-06-24 21:59:13,052 INFO ]: Start accepts. Automaton has 96 states and 189 transitions. Word has length 11 [2018-06-24 21:59:13,052 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:13,052 INFO ]: Abstraction has 96 states and 189 transitions. [2018-06-24 21:59:13,053 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:59:13,053 INFO ]: Start isEmpty. Operand 96 states and 189 transitions. [2018-06-24 21:59:13,055 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:59:13,055 INFO ]: Found error trace [2018-06-24 21:59:13,055 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:13,055 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:13,055 INFO ]: Analyzing trace with hash -1552125582, now seen corresponding path program 1 times [2018-06-24 21:59:13,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:13,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:13,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:13,056 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:13,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:13,067 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:13,422 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:59:13,422 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:13,422 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 21:59:13,422 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:59:13,422 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:59:13,422 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:59:13,422 INFO ]: Start difference. First operand 96 states and 189 transitions. Second operand 6 states. [2018-06-24 21:59:13,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:13,705 INFO ]: Finished difference Result 116 states and 237 transitions. [2018-06-24 21:59:13,705 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:59:13,705 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-24 21:59:13,706 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:13,707 INFO ]: With dead ends: 116 [2018-06-24 21:59:13,707 INFO ]: Without dead ends: 106 [2018-06-24 21:59:13,707 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:59:13,708 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-24 21:59:13,719 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 96. [2018-06-24 21:59:13,719 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-24 21:59:13,720 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 184 transitions. [2018-06-24 21:59:13,720 INFO ]: Start accepts. Automaton has 96 states and 184 transitions. Word has length 11 [2018-06-24 21:59:13,720 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:13,720 INFO ]: Abstraction has 96 states and 184 transitions. [2018-06-24 21:59:13,720 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:59:13,721 INFO ]: Start isEmpty. Operand 96 states and 184 transitions. [2018-06-24 21:59:13,723 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:59:13,723 INFO ]: Found error trace [2018-06-24 21:59:13,723 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:13,723 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:13,723 INFO ]: Analyzing trace with hash 297758644, now seen corresponding path program 1 times [2018-06-24 21:59:13,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:13,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:13,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:13,724 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:13,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:13,731 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:13,762 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:59:13,762 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:13,762 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:59:13,769 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:13,790 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:13,796 INFO ]: Computing forward predicates... [2018-06-24 21:59:13,821 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:59:13,846 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:13,846 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 21:59:13,846 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:59:13,847 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:59:13,847 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:59:13,847 INFO ]: Start difference. First operand 96 states and 184 transitions. Second operand 5 states. [2018-06-24 21:59:13,949 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:13,949 INFO ]: Finished difference Result 131 states and 292 transitions. [2018-06-24 21:59:13,950 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:59:13,950 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-24 21:59:13,950 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:13,952 INFO ]: With dead ends: 131 [2018-06-24 21:59:13,952 INFO ]: Without dead ends: 131 [2018-06-24 21:59:13,952 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:59:13,952 INFO ]: Start minimizeSevpa. Operand 131 states. [2018-06-24 21:59:13,983 INFO ]: Finished minimizeSevpa. Reduced states from 131 to 107. [2018-06-24 21:59:13,983 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-24 21:59:13,988 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 211 transitions. [2018-06-24 21:59:13,988 INFO ]: Start accepts. Automaton has 107 states and 211 transitions. Word has length 12 [2018-06-24 21:59:13,988 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:13,988 INFO ]: Abstraction has 107 states and 211 transitions. [2018-06-24 21:59:13,988 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:59:13,988 INFO ]: Start isEmpty. Operand 107 states and 211 transitions. [2018-06-24 21:59:13,991 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:59:13,992 INFO ]: Found error trace [2018-06-24 21:59:13,992 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:13,992 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:13,992 INFO ]: Analyzing trace with hash 2072766006, now seen corresponding path program 1 times [2018-06-24 21:59:13,992 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:13,992 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:13,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:13,993 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:13,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:13,999 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:14,026 INFO ]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:59:14,026 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:14,026 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:14,026 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:14,026 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:14,026 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:14,026 INFO ]: Start difference. First operand 107 states and 211 transitions. Second operand 3 states. [2018-06-24 21:59:14,063 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:14,063 INFO ]: Finished difference Result 125 states and 275 transitions. [2018-06-24 21:59:14,064 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:14,064 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 21:59:14,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:14,066 INFO ]: With dead ends: 125 [2018-06-24 21:59:14,066 INFO ]: Without dead ends: 125 [2018-06-24 21:59:14,066 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:14,067 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-24 21:59:14,079 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 113. [2018-06-24 21:59:14,079 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-24 21:59:14,080 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 223 transitions. [2018-06-24 21:59:14,080 INFO ]: Start accepts. Automaton has 113 states and 223 transitions. Word has length 12 [2018-06-24 21:59:14,081 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:14,081 INFO ]: Abstraction has 113 states and 223 transitions. [2018-06-24 21:59:14,081 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:14,081 INFO ]: Start isEmpty. Operand 113 states and 223 transitions. [2018-06-24 21:59:14,083 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:59:14,083 INFO ]: Found error trace [2018-06-24 21:59:14,083 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:14,083 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:14,083 INFO ]: Analyzing trace with hash -2119789217, now seen corresponding path program 1 times [2018-06-24 21:59:14,083 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:14,084 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:14,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:14,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:14,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:14,095 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:14,281 WARN ]: Spent 107.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-06-24 21:59:14,312 INFO ]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:59:14,312 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:14,312 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:59:14,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:14,352 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:14,355 INFO ]: Computing forward predicates... [2018-06-24 21:59:14,567 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:59:14,586 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:14,586 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-06-24 21:59:14,587 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:59:14,587 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:59:14,587 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:59:14,587 INFO ]: Start difference. First operand 113 states and 223 transitions. Second operand 11 states. [2018-06-24 21:59:15,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:15,333 INFO ]: Finished difference Result 155 states and 332 transitions. [2018-06-24 21:59:15,334 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:59:15,334 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 21:59:15,334 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:15,336 INFO ]: With dead ends: 155 [2018-06-24 21:59:15,336 INFO ]: Without dead ends: 148 [2018-06-24 21:59:15,337 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:59:15,337 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-24 21:59:15,354 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 113. [2018-06-24 21:59:15,354 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-24 21:59:15,356 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 221 transitions. [2018-06-24 21:59:15,356 INFO ]: Start accepts. Automaton has 113 states and 221 transitions. Word has length 12 [2018-06-24 21:59:15,356 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:15,356 INFO ]: Abstraction has 113 states and 221 transitions. [2018-06-24 21:59:15,356 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:59:15,356 INFO ]: Start isEmpty. Operand 113 states and 221 transitions. [2018-06-24 21:59:15,358 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:59:15,358 INFO ]: Found error trace [2018-06-24 21:59:15,358 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:15,358 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:15,359 INFO ]: Analyzing trace with hash 1297444784, now seen corresponding path program 1 times [2018-06-24 21:59:15,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:15,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:15,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:15,359 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:15,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:15,371 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:15,439 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:59:15,439 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:15,439 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:59:15,447 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:15,478 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:15,479 INFO ]: Computing forward predicates... [2018-06-24 21:59:15,499 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:59:15,525 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:15,525 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 21:59:15,526 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:59:15,526 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:59:15,526 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:59:15,526 INFO ]: Start difference. First operand 113 states and 221 transitions. Second operand 5 states. [2018-06-24 21:59:15,719 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:15,719 INFO ]: Finished difference Result 145 states and 321 transitions. [2018-06-24 21:59:15,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:59:15,719 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-24 21:59:15,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:15,721 INFO ]: With dead ends: 145 [2018-06-24 21:59:15,721 INFO ]: Without dead ends: 145 [2018-06-24 21:59:15,721 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:59:15,722 INFO ]: Start minimizeSevpa. Operand 145 states. [2018-06-24 21:59:15,731 INFO ]: Finished minimizeSevpa. Reduced states from 145 to 113. [2018-06-24 21:59:15,731 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-24 21:59:15,733 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 221 transitions. [2018-06-24 21:59:15,733 INFO ]: Start accepts. Automaton has 113 states and 221 transitions. Word has length 13 [2018-06-24 21:59:15,733 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:15,733 INFO ]: Abstraction has 113 states and 221 transitions. [2018-06-24 21:59:15,733 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:59:15,734 INFO ]: Start isEmpty. Operand 113 states and 221 transitions. [2018-06-24 21:59:15,736 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:59:15,736 INFO ]: Found error trace [2018-06-24 21:59:15,736 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:15,736 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:15,736 INFO ]: Analyzing trace with hash -78682033, now seen corresponding path program 1 times [2018-06-24 21:59:15,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:15,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:15,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:15,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:15,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:15,745 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:15,779 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:59:15,779 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:15,779 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:59:15,779 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:59:15,779 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:59:15,779 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:59:15,779 INFO ]: Start difference. First operand 113 states and 221 transitions. Second operand 4 states. [2018-06-24 21:59:15,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:15,804 INFO ]: Finished difference Result 125 states and 239 transitions. [2018-06-24 21:59:15,805 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:59:15,805 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-24 21:59:15,805 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:15,806 INFO ]: With dead ends: 125 [2018-06-24 21:59:15,806 INFO ]: Without dead ends: 113 [2018-06-24 21:59:15,807 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:59:15,807 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-24 21:59:15,813 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-06-24 21:59:15,813 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-24 21:59:15,815 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 215 transitions. [2018-06-24 21:59:15,815 INFO ]: Start accepts. Automaton has 113 states and 215 transitions. Word has length 13 [2018-06-24 21:59:15,815 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:15,815 INFO ]: Abstraction has 113 states and 215 transitions. [2018-06-24 21:59:15,815 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:59:15,815 INFO ]: Start isEmpty. Operand 113 states and 215 transitions. [2018-06-24 21:59:15,817 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:59:15,817 INFO ]: Found error trace [2018-06-24 21:59:15,817 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:15,817 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:15,818 INFO ]: Analyzing trace with hash -76834991, now seen corresponding path program 1 times [2018-06-24 21:59:15,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:15,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:15,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:15,818 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:15,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:15,826 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:15,865 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:59:15,865 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:15,865 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:59:15,865 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:59:15,865 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:59:15,865 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:59:15,865 INFO ]: Start difference. First operand 113 states and 215 transitions. Second operand 4 states. [2018-06-24 21:59:15,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:15,885 INFO ]: Finished difference Result 115 states and 209 transitions. [2018-06-24 21:59:15,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:59:15,885 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-24 21:59:15,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:15,886 INFO ]: With dead ends: 115 [2018-06-24 21:59:15,886 INFO ]: Without dead ends: 103 [2018-06-24 21:59:15,886 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:59:15,886 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-24 21:59:15,891 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 91. [2018-06-24 21:59:15,891 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-24 21:59:15,892 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 167 transitions. [2018-06-24 21:59:15,893 INFO ]: Start accepts. Automaton has 91 states and 167 transitions. Word has length 13 [2018-06-24 21:59:15,893 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:15,893 INFO ]: Abstraction has 91 states and 167 transitions. [2018-06-24 21:59:15,893 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:59:15,893 INFO ]: Start isEmpty. Operand 91 states and 167 transitions. [2018-06-24 21:59:15,894 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:59:15,894 INFO ]: Found error trace [2018-06-24 21:59:15,894 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:15,894 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:15,895 INFO ]: Analyzing trace with hash -680097853, now seen corresponding path program 1 times [2018-06-24 21:59:15,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:15,895 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:15,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:15,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:15,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:15,903 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:16,039 INFO ]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:59:16,039 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:16,039 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:59:16,049 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:16,084 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:16,086 INFO ]: Computing forward predicates... [2018-06-24 21:59:16,265 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:59:16,284 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:59:16,284 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 9 [2018-06-24 21:59:16,285 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:59:16,285 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:59:16,285 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:59:16,285 INFO ]: Start difference. First operand 91 states and 167 transitions. Second operand 9 states. [2018-06-24 21:59:16,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:16,630 INFO ]: Finished difference Result 150 states and 345 transitions. [2018-06-24 21:59:16,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:59:16,630 INFO ]: Start accepts. Automaton has 9 states. Word has length 16 [2018-06-24 21:59:16,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:16,632 INFO ]: With dead ends: 150 [2018-06-24 21:59:16,632 INFO ]: Without dead ends: 150 [2018-06-24 21:59:16,632 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:59:16,632 INFO ]: Start minimizeSevpa. Operand 150 states. [2018-06-24 21:59:16,643 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 96. [2018-06-24 21:59:16,643 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-24 21:59:16,644 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 178 transitions. [2018-06-24 21:59:16,644 INFO ]: Start accepts. Automaton has 96 states and 178 transitions. Word has length 16 [2018-06-24 21:59:16,644 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:16,644 INFO ]: Abstraction has 96 states and 178 transitions. [2018-06-24 21:59:16,644 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:59:16,644 INFO ]: Start isEmpty. Operand 96 states and 178 transitions. [2018-06-24 21:59:16,646 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:59:16,646 INFO ]: Found error trace [2018-06-24 21:59:16,647 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:16,647 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:16,647 INFO ]: Analyzing trace with hash -2145187413, now seen corresponding path program 1 times [2018-06-24 21:59:16,647 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:16,647 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:16,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:16,648 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:16,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:16,658 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:16,900 INFO ]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:59:16,900 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:16,900 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-24 21:59:16,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:59:16,951 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:16,953 INFO ]: Computing forward predicates... [2018-06-24 21:59:17,103 INFO ]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:59:17,134 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:17,134 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2018-06-24 21:59:17,135 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:59:17,135 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:59:17,135 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:59:17,135 INFO ]: Start difference. First operand 96 states and 178 transitions. Second operand 14 states. [2018-06-24 21:59:18,157 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:18,157 INFO ]: Finished difference Result 149 states and 307 transitions. [2018-06-24 21:59:18,157 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:59:18,157 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-24 21:59:18,158 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:18,159 INFO ]: With dead ends: 149 [2018-06-24 21:59:18,159 INFO ]: Without dead ends: 143 [2018-06-24 21:59:18,160 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:59:18,160 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-24 21:59:18,166 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 96. [2018-06-24 21:59:18,167 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-24 21:59:18,168 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 177 transitions. [2018-06-24 21:59:18,168 INFO ]: Start accepts. Automaton has 96 states and 177 transitions. Word has length 17 [2018-06-24 21:59:18,168 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:18,168 INFO ]: Abstraction has 96 states and 177 transitions. [2018-06-24 21:59:18,168 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:59:18,168 INFO ]: Start isEmpty. Operand 96 states and 177 transitions. [2018-06-24 21:59:18,170 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 21:59:18,170 INFO ]: Found error trace [2018-06-24 21:59:18,170 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:18,170 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:18,170 INFO ]: Analyzing trace with hash 2039206089, now seen corresponding path program 1 times [2018-06-24 21:59:18,170 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:18,170 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:18,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:18,171 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:18,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:18,180 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:18,274 INFO ]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:59:18,274 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:18,274 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:59:18,293 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:18,332 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:18,334 INFO ]: Computing forward predicates... [2018-06-24 21:59:18,504 INFO ]: Checked inductivity of 17 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:59:18,524 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:18,525 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2018-06-24 21:59:18,526 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:59:18,526 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:59:18,526 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:59:18,526 INFO ]: Start difference. First operand 96 states and 177 transitions. Second operand 14 states. [2018-06-24 21:59:18,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:18,830 INFO ]: Finished difference Result 80 states and 127 transitions. [2018-06-24 21:59:18,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:59:18,830 INFO ]: Start accepts. Automaton has 14 states. Word has length 23 [2018-06-24 21:59:18,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:18,830 INFO ]: With dead ends: 80 [2018-06-24 21:59:18,830 INFO ]: Without dead ends: 0 [2018-06-24 21:59:18,831 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:59:18,831 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:59:18,831 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:59:18,831 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:59:18,831 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:59:18,831 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-06-24 21:59:18,831 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:18,831 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:59:18,831 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:59:18,831 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:59:18,831 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:59:18,832 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:59:18,834 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:59:18 BasicIcfg [2018-06-24 21:59:18,834 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:59:18,835 INFO ]: Toolchain (without parser) took 10137.49 ms. Allocated memory was 307.2 MB in the beginning and 482.3 MB in the end (delta: 175.1 MB). Free memory was 260.6 MB in the beginning and 401.8 MB in the end (delta: -141.2 MB). Peak memory consumption was 33.9 MB. Max. memory is 3.6 GB. [2018-06-24 21:59:18,836 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:59:18,836 INFO ]: ChcToBoogie took 63.84 ms. Allocated memory is still 307.2 MB. Free memory was 260.6 MB in the beginning and 257.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:59:18,836 INFO ]: Boogie Preprocessor took 43.98 ms. Allocated memory is still 307.2 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-24 21:59:18,837 INFO ]: RCFGBuilder took 469.10 ms. Allocated memory is still 307.2 MB. Free memory was 256.6 MB in the beginning and 239.6 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:59:18,837 INFO ]: BlockEncodingV2 took 306.88 ms. Allocated memory is still 307.2 MB. Free memory was 239.6 MB in the beginning and 231.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:59:18,838 INFO ]: TraceAbstraction took 9245.19 ms. Allocated memory was 307.2 MB in the beginning and 482.3 MB in the end (delta: 175.1 MB). Free memory was 231.6 MB in the beginning and 401.8 MB in the end (delta: -170.3 MB). Peak memory consumption was 4.9 MB. Max. memory is 3.6 GB. [2018-06-24 21:59:18,841 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 31 locations, 60 edges - StatisticsResult: Encoded RCFG 22 locations, 46 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.84 ms. Allocated memory is still 307.2 MB. Free memory was 260.6 MB in the beginning and 257.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 43.98 ms. Allocated memory is still 307.2 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 469.10 ms. Allocated memory is still 307.2 MB. Free memory was 256.6 MB in the beginning and 239.6 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 306.88 ms. Allocated memory is still 307.2 MB. Free memory was 239.6 MB in the beginning and 231.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 9245.19 ms. Allocated memory was 307.2 MB in the beginning and 482.3 MB in the end (delta: 175.1 MB). Free memory was 231.6 MB in the beginning and 401.8 MB in the end (delta: -170.3 MB). Peak memory consumption was 4.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. SAFE Result, 9.1s OverallTime, 18 OverallIterations, 3 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1057 SDtfs, 936 SDslu, 2232 SDs, 0 SdLazy, 2400 SolverSat, 517 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=11, 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, 18 MinimizatonAttempts, 315 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 10576 SizeOfPredicates, 32 NumberOfNonLiveVariables, 915 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 24 InterpolantComputations, 13 PerfectInterpolantSequences, 86/104 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__add-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-59-18-852.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__add-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-59-18-852.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__add-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-59-18-852.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__add-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-59-18-852.csv Received shutdown request...