java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/break_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:46:59,111 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:46:59,113 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:46:59,127 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:46:59,128 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:46:59,129 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:46:59,130 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:46:59,134 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:46:59,136 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:46:59,137 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:46:59,138 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:46:59,138 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:46:59,139 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:46:59,141 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:46:59,142 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:46:59,143 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:46:59,144 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:46:59,154 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:46:59,156 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:46:59,156 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:46:59,157 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:46:59,162 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:46:59,162 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:46:59,162 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:46:59,163 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:46:59,164 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:46:59,164 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:46:59,167 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:46:59,168 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:46:59,168 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:46:59,169 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:46:59,169 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:46:59,169 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:46:59,174 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:46:59,175 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:46:59,175 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:46:59,195 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:46:59,195 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:46:59,196 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:46:59,196 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:46:59,197 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:46:59,197 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:46:59,197 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:46:59,197 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:46:59,198 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:46:59,198 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:46:59,198 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:46:59,198 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:46:59,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:46:59,198 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:46:59,199 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:46:59,199 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:46:59,199 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:46:59,199 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:46:59,199 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:46:59,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:46:59,200 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:46:59,201 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:46:59,201 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:46:59,249 INFO ]: Repository-Root is: /tmp [2018-06-24 20:46:59,269 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:46:59,274 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:46:59,275 INFO ]: Initializing SmtParser... [2018-06-24 20:46:59,275 INFO ]: SmtParser initialized [2018-06-24 20:46:59,276 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/break_safe.c-1.smt2 [2018-06-24 20:46:59,277 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:46:59,369 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_safe.c-1.smt2 unknown [2018-06-24 20:46:59,553 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_safe.c-1.smt2 [2018-06-24 20:46:59,561 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:46:59,567 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:46:59,567 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:46:59,567 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:46:59,567 INFO ]: ChcToBoogie initialized [2018-06-24 20:46:59,570 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:46:59" (1/1) ... [2018-06-24 20:46:59,620 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:59 Unit [2018-06-24 20:46:59,620 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:46:59,620 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:46:59,621 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:46:59,621 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:46:59,642 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:59" (1/1) ... [2018-06-24 20:46:59,642 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:59" (1/1) ... [2018-06-24 20:46:59,647 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:59" (1/1) ... [2018-06-24 20:46:59,648 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:59" (1/1) ... [2018-06-24 20:46:59,650 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:59" (1/1) ... [2018-06-24 20:46:59,652 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:59" (1/1) ... [2018-06-24 20:46:59,653 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:59" (1/1) ... [2018-06-24 20:46:59,654 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:46:59,655 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:46:59,655 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:46:59,655 INFO ]: RCFGBuilder initialized [2018-06-24 20:46:59,657 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:59" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:46:59,670 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:46:59,670 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:46:59,670 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:46:59,670 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:46:59,670 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:46:59,670 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:46:59,899 INFO ]: Using library mode [2018-06-24 20:46:59,899 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:46:59 BoogieIcfgContainer [2018-06-24 20:46:59,899 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:46:59,900 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:46:59,900 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:46:59,901 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:46:59,910 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:46:59" (1/1) ... [2018-06-24 20:46:59,928 INFO ]: Initial Icfg 13 locations, 16 edges [2018-06-24 20:46:59,934 INFO ]: Using Remove infeasible edges [2018-06-24 20:46:59,934 INFO ]: Using Maximize final states [2018-06-24 20:46:59,935 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:46:59,935 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:46:59,937 INFO ]: Using Remove sink states [2018-06-24 20:46:59,937 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:46:59,938 INFO ]: Using Use SBE [2018-06-24 20:46:59,950 INFO ]: SBE split 0 edges [2018-06-24 20:46:59,955 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:46:59,957 INFO ]: 0 new accepting states [2018-06-24 20:46:59,995 INFO ]: Removed 9 edges and 4 locations by large block encoding [2018-06-24 20:46:59,997 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:46:59,998 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:46:59,998 INFO ]: 0 new accepting states [2018-06-24 20:46:59,998 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:46:59,999 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:46:59,999 INFO ]: Encoded RCFG 7 locations, 10 edges [2018-06-24 20:46:59,999 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:46:59 BasicIcfg [2018-06-24 20:46:59,999 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:47:00,000 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:47:00,001 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:47:00,003 INFO ]: TraceAbstraction initialized [2018-06-24 20:47:00,003 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:46:59" (1/4) ... [2018-06-24 20:47:00,004 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4d3f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:47:00, skipping insertion in model container [2018-06-24 20:47:00,004 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:59" (2/4) ... [2018-06-24 20:47:00,004 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4d3f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:47:00, skipping insertion in model container [2018-06-24 20:47:00,004 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:46:59" (3/4) ... [2018-06-24 20:47:00,004 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4d3f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:47:00, skipping insertion in model container [2018-06-24 20:47:00,004 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:46:59" (4/4) ... [2018-06-24 20:47:00,006 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:47:00,013 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:47:00,020 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:47:00,071 INFO ]: Using default assertion order modulation [2018-06-24 20:47:00,072 INFO ]: Interprodecural is true [2018-06-24 20:47:00,072 INFO ]: Hoare is false [2018-06-24 20:47:00,072 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:47:00,072 INFO ]: Backedges is TWOTRACK [2018-06-24 20:47:00,072 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:47:00,072 INFO ]: Difference is false [2018-06-24 20:47:00,072 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:47:00,072 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:47:00,080 INFO ]: Start isEmpty. Operand 7 states. [2018-06-24 20:47:00,090 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:47:00,090 INFO ]: Found error trace [2018-06-24 20:47:00,091 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:47:00,091 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:00,096 INFO ]: Analyzing trace with hash 1017739839, now seen corresponding path program 1 times [2018-06-24 20:47:00,098 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:00,098 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:00,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:00,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:00,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:00,172 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:00,226 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:00,227 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:47:00,227 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:47:00,228 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:47:00,239 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:47:00,240 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:47:00,242 INFO ]: Start difference. First operand 7 states. Second operand 3 states. [2018-06-24 20:47:00,311 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:00,311 INFO ]: Finished difference Result 8 states and 11 transitions. [2018-06-24 20:47:00,312 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:47:00,312 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 20:47:00,313 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:00,319 INFO ]: With dead ends: 8 [2018-06-24 20:47:00,319 INFO ]: Without dead ends: 8 [2018-06-24 20:47:00,321 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:47:00,334 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:47:00,349 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:47:00,352 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:47:00,353 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-24 20:47:00,355 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 6 [2018-06-24 20:47:00,355 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:00,355 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-24 20:47:00,355 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:47:00,355 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-24 20:47:00,355 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:47:00,355 INFO ]: Found error trace [2018-06-24 20:47:00,355 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:47:00,355 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:00,356 INFO ]: Analyzing trace with hash 1018663360, now seen corresponding path program 1 times [2018-06-24 20:47:00,356 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:00,356 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:00,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:00,357 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:00,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:00,378 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:00,707 WARN ]: Spent 255.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-06-24 20:47:00,725 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:00,725 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:47:00,725 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:47:00,727 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:47:00,727 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:47:00,727 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:47:00,727 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 4 states. [2018-06-24 20:47:00,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:00,890 INFO ]: Finished difference Result 12 states and 18 transitions. [2018-06-24 20:47:00,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:47:00,891 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:47:00,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:00,893 INFO ]: With dead ends: 12 [2018-06-24 20:47:00,893 INFO ]: Without dead ends: 12 [2018-06-24 20:47:00,894 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:47:00,894 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:47:00,895 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-24 20:47:00,895 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:47:00,896 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-24 20:47:00,896 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 6 [2018-06-24 20:47:00,896 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:00,896 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-24 20:47:00,896 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:47:00,896 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-24 20:47:00,896 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:47:00,896 INFO ]: Found error trace [2018-06-24 20:47:00,896 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:00,896 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:00,896 INFO ]: Analyzing trace with hash 1486420069, now seen corresponding path program 1 times [2018-06-24 20:47:00,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:00,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:00,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:00,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:00,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:00,906 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:01,118 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:01,118 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:47:01,118 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:47:01,118 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:47:01,119 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:47:01,119 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:47:01,119 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 4 states. [2018-06-24 20:47:01,290 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:01,290 INFO ]: Finished difference Result 14 states and 20 transitions. [2018-06-24 20:47:01,290 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:47:01,290 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:47:01,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:01,291 INFO ]: With dead ends: 14 [2018-06-24 20:47:01,291 INFO ]: Without dead ends: 14 [2018-06-24 20:47:01,291 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:47:01,291 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:47:01,293 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 9. [2018-06-24 20:47:01,293 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:47:01,293 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-06-24 20:47:01,293 INFO ]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 7 [2018-06-24 20:47:01,294 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:01,294 INFO ]: Abstraction has 9 states and 12 transitions. [2018-06-24 20:47:01,294 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:47:01,294 INFO ]: Start isEmpty. Operand 9 states and 12 transitions. [2018-06-24 20:47:01,294 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:47:01,294 INFO ]: Found error trace [2018-06-24 20:47:01,294 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:01,294 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:01,294 INFO ]: Analyzing trace with hash 1513529879, now seen corresponding path program 1 times [2018-06-24 20:47:01,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:01,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:01,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:01,295 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:01,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:01,308 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:01,410 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:01,410 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:01,410 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:01,416 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:01,440 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:01,447 INFO ]: Computing forward predicates... [2018-06-24 20:47:01,653 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:01,673 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:47:01,673 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-06-24 20:47:01,673 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:47:01,673 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:47:01,673 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:47:01,673 INFO ]: Start difference. First operand 9 states and 12 transitions. Second operand 8 states. [2018-06-24 20:47:01,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:01,772 INFO ]: Finished difference Result 16 states and 22 transitions. [2018-06-24 20:47:01,773 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:47:01,773 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 20:47:01,773 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:01,773 INFO ]: With dead ends: 16 [2018-06-24 20:47:01,773 INFO ]: Without dead ends: 14 [2018-06-24 20:47:01,774 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:47:01,774 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:47:01,776 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-06-24 20:47:01,776 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:47:01,776 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-24 20:47:01,776 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 7 [2018-06-24 20:47:01,776 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:01,776 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-24 20:47:01,776 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:47:01,776 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-24 20:47:01,777 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:47:01,777 INFO ]: Found error trace [2018-06-24 20:47:01,777 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:01,777 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:01,777 INFO ]: Analyzing trace with hash 1514453400, now seen corresponding path program 1 times [2018-06-24 20:47:01,777 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:01,777 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:01,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:01,778 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:01,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:01,785 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:01,829 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:01,829 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:01,829 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:01,840 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:01,850 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:01,851 INFO ]: Computing forward predicates... [2018-06-24 20:47:01,878 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:01,909 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:01,909 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 20:47:01,909 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:47:01,909 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:47:01,909 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:47:01,909 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 5 states. [2018-06-24 20:47:02,008 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:02,008 INFO ]: Finished difference Result 13 states and 17 transitions. [2018-06-24 20:47:02,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:47:02,008 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:47:02,008 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:02,009 INFO ]: With dead ends: 13 [2018-06-24 20:47:02,009 INFO ]: Without dead ends: 13 [2018-06-24 20:47:02,009 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:47:02,009 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:47:02,011 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-24 20:47:02,011 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:47:02,011 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-24 20:47:02,011 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2018-06-24 20:47:02,011 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:02,011 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-24 20:47:02,011 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:47:02,011 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-24 20:47:02,012 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:47:02,012 INFO ]: Found error trace [2018-06-24 20:47:02,012 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:02,012 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:02,012 INFO ]: Analyzing trace with hash -1165881326, now seen corresponding path program 1 times [2018-06-24 20:47:02,012 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:02,012 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:02,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:02,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:02,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:02,020 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:02,043 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:02,044 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:02,044 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:02,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:02,082 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:02,083 INFO ]: Computing forward predicates... [2018-06-24 20:47:02,087 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:02,109 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:02,109 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 20:47:02,109 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:47:02,109 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:47:02,109 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:47:02,109 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 4 states. [2018-06-24 20:47:02,152 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:02,152 INFO ]: Finished difference Result 13 states and 17 transitions. [2018-06-24 20:47:02,152 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:47:02,152 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-24 20:47:02,152 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:02,153 INFO ]: With dead ends: 13 [2018-06-24 20:47:02,153 INFO ]: Without dead ends: 13 [2018-06-24 20:47:02,153 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 9 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-24 20:47:02,153 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:47:02,154 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:47:02,155 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:47:02,155 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-24 20:47:02,155 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 8 [2018-06-24 20:47:02,155 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:02,155 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-24 20:47:02,155 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:47:02,155 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-24 20:47:02,155 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:47:02,155 INFO ]: Found error trace [2018-06-24 20:47:02,156 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:02,156 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:02,156 INFO ]: Analyzing trace with hash -278377645, now seen corresponding path program 1 times [2018-06-24 20:47:02,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:02,156 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:02,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:02,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:02,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:02,167 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:02,227 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:02,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:02,227 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:02,233 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:02,259 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:02,261 INFO ]: Computing forward predicates... [2018-06-24 20:47:02,475 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:02,509 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:02,509 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:47:02,509 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:47:02,509 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:47:02,509 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:47:02,510 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 6 states. [2018-06-24 20:47:02,844 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:02,844 INFO ]: Finished difference Result 21 states and 29 transitions. [2018-06-24 20:47:02,844 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:47:02,844 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:47:02,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:02,845 INFO ]: With dead ends: 21 [2018-06-24 20:47:02,845 INFO ]: Without dead ends: 21 [2018-06-24 20:47:02,845 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:47:02,845 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:47:02,847 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-06-24 20:47:02,847 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:47:02,848 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-06-24 20:47:02,848 INFO ]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 8 [2018-06-24 20:47:02,848 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:02,848 INFO ]: Abstraction has 14 states and 20 transitions. [2018-06-24 20:47:02,848 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:47:02,848 INFO ]: Start isEmpty. Operand 14 states and 20 transitions. [2018-06-24 20:47:02,848 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:47:02,848 INFO ]: Found error trace [2018-06-24 20:47:02,848 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:02,848 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:02,848 INFO ]: Analyzing trace with hash -1735746376, now seen corresponding path program 2 times [2018-06-24 20:47:02,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:02,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:02,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:02,849 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:02,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:02,858 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:02,924 INFO ]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:02,925 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:02,925 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:02,930 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:02,966 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:02,966 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:02,968 INFO ]: Computing forward predicates... [2018-06-24 20:47:03,009 INFO ]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:03,029 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:03,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-06-24 20:47:03,029 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:47:03,029 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:47:03,029 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:47:03,029 INFO ]: Start difference. First operand 14 states and 20 transitions. Second operand 9 states. [2018-06-24 20:47:03,335 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-24 20:47:03,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:03,645 INFO ]: Finished difference Result 26 states and 34 transitions. [2018-06-24 20:47:03,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:47:03,645 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-24 20:47:03,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:03,646 INFO ]: With dead ends: 26 [2018-06-24 20:47:03,646 INFO ]: Without dead ends: 26 [2018-06-24 20:47:03,646 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:47:03,646 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:47:03,648 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 14. [2018-06-24 20:47:03,648 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:47:03,648 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-06-24 20:47:03,648 INFO ]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 9 [2018-06-24 20:47:03,648 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:03,648 INFO ]: Abstraction has 14 states and 18 transitions. [2018-06-24 20:47:03,648 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:47:03,649 INFO ]: Start isEmpty. Operand 14 states and 18 transitions. [2018-06-24 20:47:03,649 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:47:03,649 INFO ]: Found error trace [2018-06-24 20:47:03,649 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:03,649 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:03,649 INFO ]: Analyzing trace with hash -612618632, now seen corresponding path program 2 times [2018-06-24 20:47:03,649 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:03,649 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:03,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:03,650 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:03,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:03,658 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:03,728 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:03,728 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:03,728 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:03,733 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:03,751 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:03,751 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:03,752 INFO ]: Computing forward predicates... [2018-06-24 20:47:03,762 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:03,780 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:03,780 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 20:47:03,780 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:47:03,781 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:47:03,781 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:47:03,781 INFO ]: Start difference. First operand 14 states and 18 transitions. Second operand 7 states. [2018-06-24 20:47:03,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:03,818 INFO ]: Finished difference Result 18 states and 22 transitions. [2018-06-24 20:47:03,819 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:47:03,819 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 20:47:03,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:03,819 INFO ]: With dead ends: 18 [2018-06-24 20:47:03,819 INFO ]: Without dead ends: 18 [2018-06-24 20:47:03,820 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:47:03,820 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:47:03,821 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-06-24 20:47:03,821 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:47:03,822 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-06-24 20:47:03,822 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 9 [2018-06-24 20:47:03,822 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:03,822 INFO ]: Abstraction has 16 states and 20 transitions. [2018-06-24 20:47:03,822 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:47:03,822 INFO ]: Start isEmpty. Operand 16 states and 20 transitions. [2018-06-24 20:47:03,822 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:47:03,822 INFO ]: Found error trace [2018-06-24 20:47:03,822 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:03,822 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:03,822 INFO ]: Analyzing trace with hash -40035612, now seen corresponding path program 2 times [2018-06-24 20:47:03,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:03,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:03,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:03,823 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:03,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:03,831 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:03,924 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:03,925 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:03,925 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:03,931 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:03,941 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:03,941 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:03,943 INFO ]: Computing forward predicates... [2018-06-24 20:47:03,995 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:04,014 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:04,014 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-24 20:47:04,015 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:47:04,015 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:47:04,015 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:47:04,015 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 11 states. [2018-06-24 20:47:04,127 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:04,127 INFO ]: Finished difference Result 34 states and 42 transitions. [2018-06-24 20:47:04,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:47:04,128 INFO ]: Start accepts. Automaton has 11 states. Word has length 9 [2018-06-24 20:47:04,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:04,128 INFO ]: With dead ends: 34 [2018-06-24 20:47:04,128 INFO ]: Without dead ends: 31 [2018-06-24 20:47:04,129 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:47:04,129 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:47:04,131 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-06-24 20:47:04,131 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:47:04,131 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-06-24 20:47:04,131 INFO ]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2018-06-24 20:47:04,131 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:04,131 INFO ]: Abstraction has 17 states and 22 transitions. [2018-06-24 20:47:04,131 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:47:04,131 INFO ]: Start isEmpty. Operand 17 states and 22 transitions. [2018-06-24 20:47:04,132 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:47:04,132 INFO ]: Found error trace [2018-06-24 20:47:04,132 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:04,132 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:04,132 INFO ]: Analyzing trace with hash 218719520, now seen corresponding path program 3 times [2018-06-24 20:47:04,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:04,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:04,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:04,133 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:04,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:04,142 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:04,373 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:04,373 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:04,373 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:04,379 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:04,411 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:47:04,411 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:04,413 INFO ]: Computing forward predicates... [2018-06-24 20:47:04,433 INFO ]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:47:04,453 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:47:04,453 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-06-24 20:47:04,453 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:47:04,453 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:47:04,453 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:47:04,453 INFO ]: Start difference. First operand 17 states and 22 transitions. Second operand 10 states. [2018-06-24 20:47:05,000 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:05,000 INFO ]: Finished difference Result 37 states and 48 transitions. [2018-06-24 20:47:05,000 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:47:05,000 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:47:05,000 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:05,001 INFO ]: With dead ends: 37 [2018-06-24 20:47:05,001 INFO ]: Without dead ends: 30 [2018-06-24 20:47:05,002 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=622, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:47:05,002 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:47:05,005 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 16. [2018-06-24 20:47:05,005 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:47:05,005 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-06-24 20:47:05,005 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2018-06-24 20:47:05,005 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:05,005 INFO ]: Abstraction has 16 states and 20 transitions. [2018-06-24 20:47:05,005 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:47:05,005 INFO ]: Start isEmpty. Operand 16 states and 20 transitions. [2018-06-24 20:47:05,006 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:47:05,006 INFO ]: Found error trace [2018-06-24 20:47:05,006 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:05,006 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:05,006 INFO ]: Analyzing trace with hash -153292475, now seen corresponding path program 3 times [2018-06-24 20:47:05,006 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:05,006 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:05,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:05,007 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:05,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:05,015 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:05,048 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:05,048 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:05,048 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:05,054 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:05,107 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:47:05,107 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:05,108 INFO ]: Computing forward predicates... [2018-06-24 20:47:05,113 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:05,139 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:05,139 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:47:05,139 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:47:05,139 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:47:05,139 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:47:05,139 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 6 states. [2018-06-24 20:47:05,176 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:05,176 INFO ]: Finished difference Result 17 states and 21 transitions. [2018-06-24 20:47:05,176 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:47:05,176 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-24 20:47:05,176 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:05,177 INFO ]: With dead ends: 17 [2018-06-24 20:47:05,177 INFO ]: Without dead ends: 17 [2018-06-24 20:47:05,177 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:47:05,177 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:47:05,178 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:47:05,178 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:47:05,179 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-06-24 20:47:05,179 INFO ]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2018-06-24 20:47:05,179 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:05,179 INFO ]: Abstraction has 17 states and 21 transitions. [2018-06-24 20:47:05,179 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:47:05,179 INFO ]: Start isEmpty. Operand 17 states and 21 transitions. [2018-06-24 20:47:05,179 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:47:05,179 INFO ]: Found error trace [2018-06-24 20:47:05,179 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:05,179 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:05,179 INFO ]: Analyzing trace with hash -324408488, now seen corresponding path program 3 times [2018-06-24 20:47:05,179 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:05,180 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:05,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:05,180 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:05,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:05,188 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:05,587 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:05,587 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:05,587 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-24 20:47:05,597 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:05,609 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:47:05,609 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:05,611 INFO ]: Computing forward predicates... [2018-06-24 20:47:05,633 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:05,652 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:05,652 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 20:47:05,652 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:47:05,652 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:47:05,652 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:47:05,653 INFO ]: Start difference. First operand 17 states and 21 transitions. Second operand 9 states. [2018-06-24 20:47:05,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:05,662 INFO ]: Finished difference Result 21 states and 25 transitions. [2018-06-24 20:47:05,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:47:05,663 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 20:47:05,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:05,663 INFO ]: With dead ends: 21 [2018-06-24 20:47:05,663 INFO ]: Without dead ends: 21 [2018-06-24 20:47:05,664 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:47:05,664 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:47:05,665 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-24 20:47:05,665 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:47:05,665 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-06-24 20:47:05,665 INFO ]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2018-06-24 20:47:05,667 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:05,667 INFO ]: Abstraction has 19 states and 23 transitions. [2018-06-24 20:47:05,667 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:47:05,667 INFO ]: Start isEmpty. Operand 19 states and 23 transitions. [2018-06-24 20:47:05,668 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:47:05,668 INFO ]: Found error trace [2018-06-24 20:47:05,668 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:05,668 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:05,668 INFO ]: Analyzing trace with hash 1002724063, now seen corresponding path program 4 times [2018-06-24 20:47:05,668 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:05,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:05,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:05,668 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:05,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:05,683 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:05,719 INFO ]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:05,719 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:05,719 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:05,725 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:47:05,747 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:47:05,747 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:05,748 INFO ]: Computing forward predicates... [2018-06-24 20:47:05,753 INFO ]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:05,783 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:05,784 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 20:47:05,784 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:47:05,784 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:47:05,784 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:47:05,784 INFO ]: Start difference. First operand 19 states and 23 transitions. Second operand 7 states. [2018-06-24 20:47:05,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:05,818 INFO ]: Finished difference Result 20 states and 24 transitions. [2018-06-24 20:47:05,819 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:47:05,819 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-24 20:47:05,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:05,819 INFO ]: With dead ends: 20 [2018-06-24 20:47:05,819 INFO ]: Without dead ends: 20 [2018-06-24 20:47:05,819 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:47:05,819 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:47:05,820 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 20:47:05,820 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:47:05,821 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-06-24 20:47:05,821 INFO ]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2018-06-24 20:47:05,821 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:05,821 INFO ]: Abstraction has 20 states and 24 transitions. [2018-06-24 20:47:05,821 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:47:05,821 INFO ]: Start isEmpty. Operand 20 states and 24 transitions. [2018-06-24 20:47:05,821 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:47:05,821 INFO ]: Found error trace [2018-06-24 20:47:05,821 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:05,821 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:05,821 INFO ]: Analyzing trace with hash -1815468923, now seen corresponding path program 5 times [2018-06-24 20:47:05,821 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:05,821 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:05,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:05,822 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:05,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:05,830 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:05,889 INFO ]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:05,889 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:05,889 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) [2018-06-24 20:47:05,903 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:05,920 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:47:05,920 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:05,921 INFO ]: Computing forward predicates... [2018-06-24 20:47:06,049 INFO ]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:06,072 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:06,072 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 20:47:06,072 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:47:06,072 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:47:06,072 INFO ]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:47:06,072 INFO ]: Start difference. First operand 20 states and 24 transitions. Second operand 14 states. [2018-06-24 20:47:06,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:06,767 INFO ]: Finished difference Result 45 states and 54 transitions. [2018-06-24 20:47:06,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:47:06,767 INFO ]: Start accepts. Automaton has 14 states. Word has length 13 [2018-06-24 20:47:06,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:06,767 INFO ]: With dead ends: 45 [2018-06-24 20:47:06,767 INFO ]: Without dead ends: 45 [2018-06-24 20:47:06,768 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=241, Invalid=949, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:47:06,768 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 20:47:06,770 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 21. [2018-06-24 20:47:06,770 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:47:06,771 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-06-24 20:47:06,771 INFO ]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-06-24 20:47:06,771 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:06,771 INFO ]: Abstraction has 21 states and 25 transitions. [2018-06-24 20:47:06,771 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:47:06,771 INFO ]: Start isEmpty. Operand 21 states and 25 transitions. [2018-06-24 20:47:06,771 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:47:06,771 INFO ]: Found error trace [2018-06-24 20:47:06,771 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:06,772 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:06,772 INFO ]: Analyzing trace with hash 1767632952, now seen corresponding path program 4 times [2018-06-24 20:47:06,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:06,772 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:06,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:06,772 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:06,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:06,779 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:06,880 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:06,880 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:06,880 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:06,886 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:47:06,908 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:47:06,908 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:06,909 INFO ]: Computing forward predicates... [2018-06-24 20:47:06,924 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:06,944 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:06,944 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 20:47:06,944 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:47:06,944 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:47:06,944 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:47:06,944 INFO ]: Start difference. First operand 21 states and 25 transitions. Second operand 11 states. [2018-06-24 20:47:06,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:06,973 INFO ]: Finished difference Result 26 states and 30 transitions. [2018-06-24 20:47:06,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:47:06,975 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 20:47:06,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:06,975 INFO ]: With dead ends: 26 [2018-06-24 20:47:06,975 INFO ]: Without dead ends: 26 [2018-06-24 20:47:06,976 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:47:06,976 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:47:06,977 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-06-24 20:47:06,977 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:47:06,978 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-06-24 20:47:06,978 INFO ]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2018-06-24 20:47:06,978 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:06,978 INFO ]: Abstraction has 23 states and 27 transitions. [2018-06-24 20:47:06,978 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:47:06,978 INFO ]: Start isEmpty. Operand 23 states and 27 transitions. [2018-06-24 20:47:06,978 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:47:06,978 INFO ]: Found error trace [2018-06-24 20:47:06,978 INFO ]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:06,978 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:06,979 INFO ]: Analyzing trace with hash 1395679256, now seen corresponding path program 6 times [2018-06-24 20:47:06,979 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:06,979 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:06,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:06,979 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:06,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:06,988 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:07,126 INFO ]: Checked inductivity of 27 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:07,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:07,126 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:07,131 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:47:07,199 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:47:07,199 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:07,201 INFO ]: Computing forward predicates... [2018-06-24 20:47:07,291 INFO ]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:47:07,310 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:07,310 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-24 20:47:07,310 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:47:07,310 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:47:07,310 INFO ]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:47:07,310 INFO ]: Start difference. First operand 23 states and 27 transitions. Second operand 17 states. [2018-06-24 20:47:08,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:08,448 INFO ]: Finished difference Result 65 states and 76 transitions. [2018-06-24 20:47:08,449 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 20:47:08,449 INFO ]: Start accepts. Automaton has 17 states. Word has length 15 [2018-06-24 20:47:08,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:08,449 INFO ]: With dead ends: 65 [2018-06-24 20:47:08,449 INFO ]: Without dead ends: 65 [2018-06-24 20:47:08,450 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=413, Invalid=1843, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:47:08,450 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-24 20:47:08,454 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 24. [2018-06-24 20:47:08,454 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:47:08,454 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-06-24 20:47:08,454 INFO ]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2018-06-24 20:47:08,454 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:08,454 INFO ]: Abstraction has 24 states and 28 transitions. [2018-06-24 20:47:08,454 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:47:08,454 INFO ]: Start isEmpty. Operand 24 states and 28 transitions. [2018-06-24 20:47:08,455 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:47:08,455 INFO ]: Found error trace [2018-06-24 20:47:08,455 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:08,455 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:08,455 INFO ]: Analyzing trace with hash -2120205032, now seen corresponding path program 5 times [2018-06-24 20:47:08,455 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:08,455 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:08,455 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:08,455 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:08,455 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:08,463 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:09,271 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:09,271 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:09,271 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:09,277 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:47:09,294 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:47:09,294 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:09,295 INFO ]: Computing forward predicates... [2018-06-24 20:47:09,317 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:09,336 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:09,336 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 20:47:09,336 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:47:09,336 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:47:09,337 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:47:09,337 INFO ]: Start difference. First operand 24 states and 28 transitions. Second operand 13 states. [2018-06-24 20:47:09,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:09,364 INFO ]: Finished difference Result 30 states and 34 transitions. [2018-06-24 20:47:09,364 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:47:09,364 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-24 20:47:09,364 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:09,364 INFO ]: With dead ends: 30 [2018-06-24 20:47:09,364 INFO ]: Without dead ends: 30 [2018-06-24 20:47:09,364 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:47:09,364 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:47:09,366 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-06-24 20:47:09,366 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:47:09,366 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-06-24 20:47:09,366 INFO ]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 15 [2018-06-24 20:47:09,366 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:09,366 INFO ]: Abstraction has 26 states and 30 transitions. [2018-06-24 20:47:09,366 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:47:09,366 INFO ]: Start isEmpty. Operand 26 states and 30 transitions. [2018-06-24 20:47:09,367 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:47:09,367 INFO ]: Found error trace [2018-06-24 20:47:09,367 INFO ]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:09,367 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:09,367 INFO ]: Analyzing trace with hash -101440155, now seen corresponding path program 7 times [2018-06-24 20:47:09,367 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:09,367 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:09,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:09,368 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:09,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:09,383 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:09,621 INFO ]: Checked inductivity of 38 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:09,621 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:09,621 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:09,627 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:09,646 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:09,647 INFO ]: Computing forward predicates... [2018-06-24 20:47:09,797 INFO ]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:47:09,818 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:09,818 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-24 20:47:09,819 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:47:09,819 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:47:09,819 INFO ]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:47:09,819 INFO ]: Start difference. First operand 26 states and 30 transitions. Second operand 20 states. [2018-06-24 20:47:10,429 WARN ]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-06-24 20:47:10,940 WARN ]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-06-24 20:47:12,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:12,072 INFO ]: Finished difference Result 89 states and 102 transitions. [2018-06-24 20:47:12,073 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 20:47:12,073 INFO ]: Start accepts. Automaton has 20 states. Word has length 17 [2018-06-24 20:47:12,073 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:12,073 INFO ]: With dead ends: 89 [2018-06-24 20:47:12,073 INFO ]: Without dead ends: 89 [2018-06-24 20:47:12,074 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=660, Invalid=3246, Unknown=0, NotChecked=0, Total=3906 [2018-06-24 20:47:12,074 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-24 20:47:12,077 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 27. [2018-06-24 20:47:12,077 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:47:12,077 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-06-24 20:47:12,078 INFO ]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2018-06-24 20:47:12,078 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:12,078 INFO ]: Abstraction has 27 states and 31 transitions. [2018-06-24 20:47:12,078 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:47:12,078 INFO ]: Start isEmpty. Operand 27 states and 31 transitions. [2018-06-24 20:47:12,078 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:47:12,078 INFO ]: Found error trace [2018-06-24 20:47:12,078 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:12,078 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:12,078 INFO ]: Analyzing trace with hash -1710960136, now seen corresponding path program 6 times [2018-06-24 20:47:12,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:12,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:12,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:12,079 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:12,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:12,088 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:12,161 INFO ]: Checked inductivity of 66 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:47:12,161 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:12,161 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:12,167 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:47:12,191 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:47:12,191 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:12,193 INFO ]: Computing forward predicates... [2018-06-24 20:47:12,206 INFO ]: Checked inductivity of 66 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:47:12,225 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:47:12,225 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-06-24 20:47:12,225 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:47:12,225 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:47:12,225 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:47:12,225 INFO ]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2018-06-24 20:47:12,252 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:12,252 INFO ]: Finished difference Result 40 states and 45 transitions. [2018-06-24 20:47:12,252 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:47:12,252 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-24 20:47:12,252 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:12,253 INFO ]: With dead ends: 40 [2018-06-24 20:47:12,253 INFO ]: Without dead ends: 28 [2018-06-24 20:47:12,253 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:47:12,253 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:47:12,255 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-24 20:47:12,255 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:47:12,255 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-06-24 20:47:12,255 INFO ]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2018-06-24 20:47:12,256 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:12,256 INFO ]: Abstraction has 28 states and 32 transitions. [2018-06-24 20:47:12,256 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:47:12,256 INFO ]: Start isEmpty. Operand 28 states and 32 transitions. [2018-06-24 20:47:12,256 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:47:12,256 INFO ]: Found error trace [2018-06-24 20:47:12,256 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:12,256 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:12,257 INFO ]: Analyzing trace with hash 93397044, now seen corresponding path program 1 times [2018-06-24 20:47:12,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:12,257 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:12,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:12,257 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:12,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:12,266 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:12,424 INFO ]: Checked inductivity of 67 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:47:12,424 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:12,424 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:12,439 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:12,456 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:12,459 INFO ]: Computing forward predicates... [2018-06-24 20:47:12,621 INFO ]: Checked inductivity of 67 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:47:12,641 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:12,641 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15] total 18 [2018-06-24 20:47:12,641 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:47:12,641 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:47:12,641 INFO ]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:47:12,641 INFO ]: Start difference. First operand 28 states and 32 transitions. Second operand 18 states. [2018-06-24 20:47:12,854 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:12,854 INFO ]: Finished difference Result 41 states and 46 transitions. [2018-06-24 20:47:12,854 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:47:12,854 INFO ]: Start accepts. Automaton has 18 states. Word has length 18 [2018-06-24 20:47:12,854 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:12,854 INFO ]: With dead ends: 41 [2018-06-24 20:47:12,854 INFO ]: Without dead ends: 29 [2018-06-24 20:47:12,855 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:47:12,855 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:47:12,856 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:47:12,856 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:47:12,857 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-06-24 20:47:12,857 INFO ]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2018-06-24 20:47:12,857 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:12,857 INFO ]: Abstraction has 29 states and 33 transitions. [2018-06-24 20:47:12,857 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:47:12,857 INFO ]: Start isEmpty. Operand 29 states and 33 transitions. [2018-06-24 20:47:12,857 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:47:12,857 INFO ]: Found error trace [2018-06-24 20:47:12,857 INFO ]: trace histogram [8, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:12,857 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:12,858 INFO ]: Analyzing trace with hash -694028232, now seen corresponding path program 8 times [2018-06-24 20:47:12,858 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:12,858 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:12,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:12,858 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:12,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:12,868 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:13,020 INFO ]: Checked inductivity of 51 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:13,020 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:13,020 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:13,028 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:13,047 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:13,047 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:13,049 INFO ]: Computing forward predicates... [2018-06-24 20:47:13,201 INFO ]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:47:13,220 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:13,220 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2018-06-24 20:47:13,220 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:47:13,220 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:47:13,220 INFO ]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:47:13,220 INFO ]: Start difference. First operand 29 states and 33 transitions. Second operand 23 states. [2018-06-24 20:47:15,247 WARN ]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-24 20:47:15,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:15,672 INFO ]: Finished difference Result 79 states and 90 transitions. [2018-06-24 20:47:15,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 20:47:15,672 INFO ]: Start accepts. Automaton has 23 states. Word has length 19 [2018-06-24 20:47:15,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:15,673 INFO ]: With dead ends: 79 [2018-06-24 20:47:15,673 INFO ]: Without dead ends: 79 [2018-06-24 20:47:15,674 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=755, Invalid=3535, Unknown=0, NotChecked=0, Total=4290 [2018-06-24 20:47:15,674 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-24 20:47:15,682 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 30. [2018-06-24 20:47:15,682 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:47:15,683 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-06-24 20:47:15,683 INFO ]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2018-06-24 20:47:15,683 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:15,683 INFO ]: Abstraction has 30 states and 34 transitions. [2018-06-24 20:47:15,683 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:47:15,683 INFO ]: Start isEmpty. Operand 30 states and 34 transitions. [2018-06-24 20:47:15,684 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:47:15,684 INFO ]: Found error trace [2018-06-24 20:47:15,684 INFO ]: trace histogram [11, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:15,684 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:15,684 INFO ]: Analyzing trace with hash 193894776, now seen corresponding path program 2 times [2018-06-24 20:47:15,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:15,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:15,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:15,684 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:15,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:15,700 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:16,182 INFO ]: Checked inductivity of 69 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:47:16,182 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:16,182 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:16,198 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:16,255 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:16,255 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:16,259 INFO ]: Computing forward predicates... [2018-06-24 20:47:16,564 INFO ]: Checked inductivity of 69 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:16,585 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:16,585 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 19 [2018-06-24 20:47:16,585 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:47:16,585 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:47:16,585 INFO ]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:47:16,585 INFO ]: Start difference. First operand 30 states and 34 transitions. Second operand 19 states. [2018-06-24 20:47:17,147 WARN ]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-24 20:47:17,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:17,348 INFO ]: Finished difference Result 43 states and 48 transitions. [2018-06-24 20:47:17,348 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:47:17,348 INFO ]: Start accepts. Automaton has 19 states. Word has length 19 [2018-06-24 20:47:17,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:17,348 INFO ]: With dead ends: 43 [2018-06-24 20:47:17,348 INFO ]: Without dead ends: 31 [2018-06-24 20:47:17,349 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:47:17,349 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:47:17,350 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 20:47:17,350 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:47:17,350 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-06-24 20:47:17,350 INFO ]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 19 [2018-06-24 20:47:17,350 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:17,350 INFO ]: Abstraction has 31 states and 35 transitions. [2018-06-24 20:47:17,350 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:47:17,351 INFO ]: Start isEmpty. Operand 31 states and 35 transitions. [2018-06-24 20:47:17,351 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:47:17,351 INFO ]: Found error trace [2018-06-24 20:47:17,351 INFO ]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:17,351 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:17,351 INFO ]: Analyzing trace with hash -985642828, now seen corresponding path program 3 times [2018-06-24 20:47:17,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:17,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:17,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:17,352 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:17,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:17,359 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:17,809 INFO ]: Checked inductivity of 72 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:47:17,810 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:17,810 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:17,815 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:17,840 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:47:17,840 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:17,842 INFO ]: Computing forward predicates... [2018-06-24 20:47:17,925 INFO ]: Checked inductivity of 72 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:47:17,944 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:17,944 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-24 20:47:17,944 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:47:17,944 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:47:17,944 INFO ]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:47:17,944 INFO ]: Start difference. First operand 31 states and 35 transitions. Second operand 15 states. [2018-06-24 20:47:18,136 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:18,137 INFO ]: Finished difference Result 44 states and 49 transitions. [2018-06-24 20:47:18,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:47:18,137 INFO ]: Start accepts. Automaton has 15 states. Word has length 20 [2018-06-24 20:47:18,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:18,137 INFO ]: With dead ends: 44 [2018-06-24 20:47:18,137 INFO ]: Without dead ends: 32 [2018-06-24 20:47:18,137 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:47:18,137 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:47:18,138 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 20:47:18,138 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:47:18,140 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-06-24 20:47:18,140 INFO ]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-06-24 20:47:18,140 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:18,140 INFO ]: Abstraction has 32 states and 36 transitions. [2018-06-24 20:47:18,140 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:47:18,140 INFO ]: Start isEmpty. Operand 32 states and 36 transitions. [2018-06-24 20:47:18,140 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:47:18,140 INFO ]: Found error trace [2018-06-24 20:47:18,140 INFO ]: trace histogram [9, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:18,141 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:18,141 INFO ]: Analyzing trace with hash 1613090373, now seen corresponding path program 9 times [2018-06-24 20:47:18,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:18,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:18,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:18,141 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:18,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:18,150 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:18,332 INFO ]: Checked inductivity of 66 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:47:18,332 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:18,332 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:18,337 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:18,384 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:47:18,384 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:18,386 INFO ]: Computing forward predicates... [2018-06-24 20:47:18,508 INFO ]: Checked inductivity of 66 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:47:18,527 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:18,527 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2018-06-24 20:47:18,527 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:47:18,527 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:47:18,527 INFO ]: CoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:47:18,527 INFO ]: Start difference. First operand 32 states and 36 transitions. Second operand 25 states. [2018-06-24 20:47:19,533 WARN ]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-24 20:47:19,582 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:19,582 INFO ]: Finished difference Result 53 states and 58 transitions. [2018-06-24 20:47:19,582 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 20:47:19,582 INFO ]: Start accepts. Automaton has 25 states. Word has length 21 [2018-06-24 20:47:19,582 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:19,583 INFO ]: With dead ends: 53 [2018-06-24 20:47:19,583 INFO ]: Without dead ends: 53 [2018-06-24 20:47:19,583 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=423, Invalid=2229, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:47:19,584 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 20:47:19,585 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 33. [2018-06-24 20:47:19,585 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:47:19,589 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-06-24 20:47:19,589 INFO ]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2018-06-24 20:47:19,589 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:19,590 INFO ]: Abstraction has 33 states and 37 transitions. [2018-06-24 20:47:19,590 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:47:19,590 INFO ]: Start isEmpty. Operand 33 states and 37 transitions. [2018-06-24 20:47:19,590 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:47:19,590 INFO ]: Found error trace [2018-06-24 20:47:19,590 INFO ]: trace histogram [11, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:19,590 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:19,590 INFO ]: Analyzing trace with hash 1103397112, now seen corresponding path program 4 times [2018-06-24 20:47:19,590 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:19,590 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:19,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:19,591 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:19,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:19,601 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:19,746 INFO ]: Checked inductivity of 76 backedges. 7 proven. 48 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:47:19,746 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:19,746 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:19,841 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:47:19,878 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:47:19,878 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:19,881 INFO ]: Computing forward predicates... [2018-06-24 20:47:20,061 INFO ]: Checked inductivity of 76 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:47:20,080 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:20,080 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 21 [2018-06-24 20:47:20,080 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:47:20,081 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:47:20,081 INFO ]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:47:20,081 INFO ]: Start difference. First operand 33 states and 37 transitions. Second operand 21 states. [2018-06-24 20:47:20,341 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:20,341 INFO ]: Finished difference Result 46 states and 51 transitions. [2018-06-24 20:47:20,341 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:47:20,341 INFO ]: Start accepts. Automaton has 21 states. Word has length 21 [2018-06-24 20:47:20,341 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:20,341 INFO ]: With dead ends: 46 [2018-06-24 20:47:20,341 INFO ]: Without dead ends: 34 [2018-06-24 20:47:20,342 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:47:20,342 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:47:20,343 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:47:20,343 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:47:20,344 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-06-24 20:47:20,344 INFO ]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 21 [2018-06-24 20:47:20,344 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:20,344 INFO ]: Abstraction has 34 states and 38 transitions. [2018-06-24 20:47:20,344 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:47:20,344 INFO ]: Start isEmpty. Operand 34 states and 38 transitions. [2018-06-24 20:47:20,345 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:47:20,345 INFO ]: Found error trace [2018-06-24 20:47:20,345 INFO ]: trace histogram [11, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:20,345 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:20,345 INFO ]: Analyzing trace with hash 1439125812, now seen corresponding path program 5 times [2018-06-24 20:47:20,345 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:20,345 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:20,345 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:20,345 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:20,345 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:20,354 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:20,618 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:20,618 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:20,618 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:20,625 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:47:20,659 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:47:20,659 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:20,662 INFO ]: Computing forward predicates... [2018-06-24 20:47:20,958 INFO ]: Checked inductivity of 81 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:47:20,976 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:20,976 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 27 [2018-06-24 20:47:20,977 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:47:20,977 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:47:20,977 INFO ]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:47:20,977 INFO ]: Start difference. First operand 34 states and 38 transitions. Second operand 27 states. [2018-06-24 20:47:21,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:21,254 INFO ]: Finished difference Result 54 states and 59 transitions. [2018-06-24 20:47:21,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:47:21,255 INFO ]: Start accepts. Automaton has 27 states. Word has length 22 [2018-06-24 20:47:21,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:21,277 INFO ]: With dead ends: 54 [2018-06-24 20:47:21,277 INFO ]: Without dead ends: 42 [2018-06-24 20:47:21,278 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:47:21,278 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 20:47:21,279 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 35. [2018-06-24 20:47:21,279 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:47:21,279 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-06-24 20:47:21,279 INFO ]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2018-06-24 20:47:21,279 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:21,279 INFO ]: Abstraction has 35 states and 39 transitions. [2018-06-24 20:47:21,279 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:47:21,279 INFO ]: Start isEmpty. Operand 35 states and 39 transitions. [2018-06-24 20:47:21,280 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:47:21,280 INFO ]: Found error trace [2018-06-24 20:47:21,280 INFO ]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:21,280 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:21,280 INFO ]: Analyzing trace with hash -1761974184, now seen corresponding path program 10 times [2018-06-24 20:47:21,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:21,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:21,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:21,280 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:21,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:21,290 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:21,933 INFO ]: Checked inductivity of 83 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:47:21,933 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:21,933 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:21,939 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:47:21,961 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:47:21,961 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:21,963 INFO ]: Computing forward predicates... [2018-06-24 20:47:22,473 INFO ]: Checked inductivity of 83 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:47:22,493 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:22,493 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2018-06-24 20:47:22,493 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:47:22,494 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:47:22,494 INFO ]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:22,494 INFO ]: Start difference. First operand 35 states and 39 transitions. Second operand 26 states. [2018-06-24 20:47:23,830 WARN ]: Spent 521.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-06-24 20:47:23,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:23,875 INFO ]: Finished difference Result 57 states and 62 transitions. [2018-06-24 20:47:23,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-24 20:47:23,875 INFO ]: Start accepts. Automaton has 26 states. Word has length 23 [2018-06-24 20:47:23,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:23,876 INFO ]: With dead ends: 57 [2018-06-24 20:47:23,876 INFO ]: Without dead ends: 57 [2018-06-24 20:47:23,877 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=524, Invalid=2782, Unknown=0, NotChecked=0, Total=3306 [2018-06-24 20:47:23,877 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 20:47:23,878 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 36. [2018-06-24 20:47:23,878 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:47:23,879 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-06-24 20:47:23,879 INFO ]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 23 [2018-06-24 20:47:23,879 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:23,879 INFO ]: Abstraction has 36 states and 40 transitions. [2018-06-24 20:47:23,879 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:47:23,879 INFO ]: Start isEmpty. Operand 36 states and 40 transitions. [2018-06-24 20:47:23,879 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:47:23,879 INFO ]: Found error trace [2018-06-24 20:47:23,879 INFO ]: trace histogram [11, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:23,879 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:23,880 INFO ]: Analyzing trace with hash -1038186376, now seen corresponding path program 6 times [2018-06-24 20:47:23,880 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:23,880 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:23,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:23,880 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:23,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:23,889 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:24,293 INFO ]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:24,293 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:24,293 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:24,299 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:47:24,326 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:47:24,326 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:24,328 INFO ]: Computing forward predicates... [2018-06-24 20:47:24,485 INFO ]: Checked inductivity of 87 backedges. 35 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:47:24,504 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:24,504 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 29 [2018-06-24 20:47:24,504 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:47:24,504 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:47:24,504 INFO ]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:47:24,504 INFO ]: Start difference. First operand 36 states and 40 transitions. Second operand 29 states. [2018-06-24 20:47:24,903 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:24,903 INFO ]: Finished difference Result 57 states and 62 transitions. [2018-06-24 20:47:24,903 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:47:24,904 INFO ]: Start accepts. Automaton has 29 states. Word has length 23 [2018-06-24 20:47:24,904 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:24,904 INFO ]: With dead ends: 57 [2018-06-24 20:47:24,904 INFO ]: Without dead ends: 45 [2018-06-24 20:47:24,904 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:47:24,904 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 20:47:24,906 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 37. [2018-06-24 20:47:24,906 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:47:24,906 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-06-24 20:47:24,907 INFO ]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 23 [2018-06-24 20:47:24,907 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:24,907 INFO ]: Abstraction has 37 states and 41 transitions. [2018-06-24 20:47:24,907 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:47:24,907 INFO ]: Start isEmpty. Operand 37 states and 41 transitions. [2018-06-24 20:47:24,907 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:47:24,907 INFO ]: Found error trace [2018-06-24 20:47:24,907 INFO ]: trace histogram [11, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:24,907 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:24,907 INFO ]: Analyzing trace with hash -525452876, now seen corresponding path program 7 times [2018-06-24 20:47:24,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:24,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:24,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:24,908 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:24,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:24,920 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:25,224 INFO ]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:25,224 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:25,225 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:25,231 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:25,255 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:25,257 INFO ]: Computing forward predicates... [2018-06-24 20:47:25,391 INFO ]: Checked inductivity of 94 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:47:25,410 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:25,410 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 27 [2018-06-24 20:47:25,411 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:47:25,411 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:47:25,411 INFO ]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:47:25,411 INFO ]: Start difference. First operand 37 states and 41 transitions. Second operand 27 states. [2018-06-24 20:47:25,602 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:25,602 INFO ]: Finished difference Result 58 states and 63 transitions. [2018-06-24 20:47:25,602 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:47:25,602 INFO ]: Start accepts. Automaton has 27 states. Word has length 24 [2018-06-24 20:47:25,603 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:25,603 INFO ]: With dead ends: 58 [2018-06-24 20:47:25,603 INFO ]: Without dead ends: 46 [2018-06-24 20:47:25,603 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=755, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:47:25,603 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 20:47:25,604 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-06-24 20:47:25,604 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:47:25,605 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-06-24 20:47:25,605 INFO ]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 24 [2018-06-24 20:47:25,605 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:25,605 INFO ]: Abstraction has 38 states and 42 transitions. [2018-06-24 20:47:25,605 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:47:25,605 INFO ]: Start isEmpty. Operand 38 states and 42 transitions. [2018-06-24 20:47:25,605 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:47:25,605 INFO ]: Found error trace [2018-06-24 20:47:25,605 INFO ]: trace histogram [11, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:25,605 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:25,605 INFO ]: Analyzing trace with hash 1239752485, now seen corresponding path program 11 times [2018-06-24 20:47:25,605 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:25,605 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:25,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:25,606 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:25,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:25,616 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:26,504 INFO ]: Checked inductivity of 102 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:47:26,504 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:26,504 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:26,510 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:47:26,541 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:47:26,541 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:26,544 INFO ]: Computing forward predicates... [2018-06-24 20:47:27,427 INFO ]: Checked inductivity of 102 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:27,446 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:27,446 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22] total 36 [2018-06-24 20:47:27,446 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:47:27,446 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:47:27,446 INFO ]: CoverageRelationStatistics Valid=137, Invalid=1123, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:47:27,446 INFO ]: Start difference. First operand 38 states and 42 transitions. Second operand 36 states. [2018-06-24 20:47:30,119 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:30,119 INFO ]: Finished difference Result 62 states and 69 transitions. [2018-06-24 20:47:30,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-24 20:47:30,119 INFO ]: Start accepts. Automaton has 36 states. Word has length 25 [2018-06-24 20:47:30,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:30,119 INFO ]: With dead ends: 62 [2018-06-24 20:47:30,119 INFO ]: Without dead ends: 62 [2018-06-24 20:47:30,121 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1631, Invalid=5509, Unknown=0, NotChecked=0, Total=7140 [2018-06-24 20:47:30,121 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-24 20:47:30,122 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 38. [2018-06-24 20:47:30,122 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:47:30,123 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-06-24 20:47:30,123 INFO ]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2018-06-24 20:47:30,123 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:30,123 INFO ]: Abstraction has 38 states and 42 transitions. [2018-06-24 20:47:30,123 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:47:30,123 INFO ]: Start isEmpty. Operand 38 states and 42 transitions. [2018-06-24 20:47:30,123 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:47:30,123 INFO ]: Found error trace [2018-06-24 20:47:30,123 INFO ]: trace histogram [11, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:30,124 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:30,124 INFO ]: Analyzing trace with hash -1810583560, now seen corresponding path program 8 times [2018-06-24 20:47:30,124 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:30,124 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:30,124 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:30,124 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:30,124 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:30,140 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:30,654 INFO ]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:30,654 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:30,654 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:30,659 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:30,684 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:30,684 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:30,687 INFO ]: Computing forward predicates... [2018-06-24 20:47:30,778 INFO ]: Checked inductivity of 102 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:47:30,797 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:30,797 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15] total 27 [2018-06-24 20:47:30,797 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:47:30,797 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:47:30,797 INFO ]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:47:30,797 INFO ]: Start difference. First operand 38 states and 42 transitions. Second operand 27 states. [2018-06-24 20:47:30,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:30,989 INFO ]: Finished difference Result 60 states and 65 transitions. [2018-06-24 20:47:30,989 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:47:30,989 INFO ]: Start accepts. Automaton has 27 states. Word has length 25 [2018-06-24 20:47:30,989 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:30,989 INFO ]: With dead ends: 60 [2018-06-24 20:47:30,989 INFO ]: Without dead ends: 48 [2018-06-24 20:47:30,990 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:47:30,990 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-24 20:47:30,991 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 39. [2018-06-24 20:47:30,991 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:47:30,992 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-06-24 20:47:30,992 INFO ]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 25 [2018-06-24 20:47:30,992 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:30,992 INFO ]: Abstraction has 39 states and 43 transitions. [2018-06-24 20:47:30,992 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:47:30,992 INFO ]: Start isEmpty. Operand 39 states and 43 transitions. [2018-06-24 20:47:30,992 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:47:30,992 INFO ]: Found error trace [2018-06-24 20:47:30,992 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:30,992 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:30,992 INFO ]: Analyzing trace with hash -222641838, now seen corresponding path program 12 times [2018-06-24 20:47:30,992 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:30,992 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:30,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:30,993 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:30,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:31,002 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:31,355 INFO ]: Checked inductivity of 111 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:47:31,355 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:31,355 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:31,360 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:47:31,394 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:47:31,394 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:31,396 INFO ]: Computing forward predicates... [2018-06-24 20:47:31,590 INFO ]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:47:31,609 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:31,611 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 26 [2018-06-24 20:47:31,611 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:47:31,611 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:47:31,611 INFO ]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:31,612 INFO ]: Start difference. First operand 39 states and 43 transitions. Second operand 26 states. [2018-06-24 20:47:32,665 WARN ]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-06-24 20:47:33,250 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:33,250 INFO ]: Finished difference Result 62 states and 67 transitions. [2018-06-24 20:47:33,250 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 20:47:33,250 INFO ]: Start accepts. Automaton has 26 states. Word has length 26 [2018-06-24 20:47:33,250 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:33,250 INFO ]: With dead ends: 62 [2018-06-24 20:47:33,250 INFO ]: Without dead ends: 62 [2018-06-24 20:47:33,251 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=476, Invalid=2830, Unknown=0, NotChecked=0, Total=3306 [2018-06-24 20:47:33,251 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-24 20:47:33,253 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 39. [2018-06-24 20:47:33,253 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:47:33,253 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-06-24 20:47:33,253 INFO ]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2018-06-24 20:47:33,253 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:33,253 INFO ]: Abstraction has 39 states and 43 transitions. [2018-06-24 20:47:33,253 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:47:33,253 INFO ]: Start isEmpty. Operand 39 states and 43 transitions. [2018-06-24 20:47:33,253 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:47:33,253 INFO ]: Found error trace [2018-06-24 20:47:33,253 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:33,254 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:33,254 INFO ]: Analyzing trace with hash 1300038196, now seen corresponding path program 9 times [2018-06-24 20:47:33,254 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:33,254 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:33,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:33,254 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:33,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:33,263 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:33,537 INFO ]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:33,537 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:33,537 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:33,542 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:33,575 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:47:33,575 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:33,577 INFO ]: Computing forward predicates... [2018-06-24 20:47:33,677 INFO ]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:47:33,696 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:33,696 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 27 [2018-06-24 20:47:33,696 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:47:33,696 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:47:33,696 INFO ]: CoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:47:33,697 INFO ]: Start difference. First operand 39 states and 43 transitions. Second operand 27 states. [2018-06-24 20:47:33,892 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:33,892 INFO ]: Finished difference Result 62 states and 67 transitions. [2018-06-24 20:47:33,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:47:33,892 INFO ]: Start accepts. Automaton has 27 states. Word has length 26 [2018-06-24 20:47:33,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:33,892 INFO ]: With dead ends: 62 [2018-06-24 20:47:33,892 INFO ]: Without dead ends: 50 [2018-06-24 20:47:33,892 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:47:33,892 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-24 20:47:33,893 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 40. [2018-06-24 20:47:33,893 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:47:33,894 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-06-24 20:47:33,894 INFO ]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 26 [2018-06-24 20:47:33,894 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:33,894 INFO ]: Abstraction has 40 states and 44 transitions. [2018-06-24 20:47:33,894 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:47:33,894 INFO ]: Start isEmpty. Operand 40 states and 44 transitions. [2018-06-24 20:47:33,894 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:47:33,894 INFO ]: Found error trace [2018-06-24 20:47:33,894 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:33,894 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:33,894 INFO ]: Analyzing trace with hash 1687774405, now seen corresponding path program 13 times [2018-06-24 20:47:33,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:33,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:33,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:33,895 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:33,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:33,902 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:34,838 INFO ]: Checked inductivity of 121 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:34,838 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:34,838 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:34,843 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:34,888 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:34,893 INFO ]: Computing forward predicates... [2018-06-24 20:47:35,286 INFO ]: Checked inductivity of 121 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:47:35,309 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:35,309 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 37 [2018-06-24 20:47:35,309 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:47:35,309 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:47:35,310 INFO ]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:47:35,310 INFO ]: Start difference. First operand 40 states and 44 transitions. Second operand 37 states. [2018-06-24 20:47:37,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:37,804 INFO ]: Finished difference Result 64 states and 69 transitions. [2018-06-24 20:47:37,804 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-06-24 20:47:37,804 INFO ]: Start accepts. Automaton has 37 states. Word has length 27 [2018-06-24 20:47:37,805 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:37,805 INFO ]: With dead ends: 64 [2018-06-24 20:47:37,805 INFO ]: Without dead ends: 64 [2018-06-24 20:47:37,807 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1675 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1858, Invalid=6698, Unknown=0, NotChecked=0, Total=8556 [2018-06-24 20:47:37,807 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-24 20:47:37,808 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 40. [2018-06-24 20:47:37,808 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:47:37,808 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-06-24 20:47:37,808 INFO ]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 27 [2018-06-24 20:47:37,808 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:37,808 INFO ]: Abstraction has 40 states and 44 transitions. [2018-06-24 20:47:37,808 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:47:37,808 INFO ]: Start isEmpty. Operand 40 states and 44 transitions. [2018-06-24 20:47:37,809 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:47:37,809 INFO ]: Found error trace [2018-06-24 20:47:37,809 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:37,809 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:37,809 INFO ]: Analyzing trace with hash -1054935176, now seen corresponding path program 10 times [2018-06-24 20:47:37,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:37,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:37,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:37,809 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:37,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:37,822 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:38,062 INFO ]: Checked inductivity of 121 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:47:38,062 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:38,062 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:38,067 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:47:38,095 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:47:38,095 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:38,098 INFO ]: Computing forward predicates... [2018-06-24 20:47:38,458 INFO ]: Checked inductivity of 121 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:47:38,477 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:38,477 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-06-24 20:47:38,477 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:47:38,477 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:47:38,477 INFO ]: CoverageRelationStatistics Valid=231, Invalid=525, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:47:38,477 INFO ]: Start difference. First operand 40 states and 44 transitions. Second operand 28 states. [2018-06-24 20:47:38,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:38,609 INFO ]: Finished difference Result 52 states and 56 transitions. [2018-06-24 20:47:38,610 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:47:38,610 INFO ]: Start accepts. Automaton has 28 states. Word has length 27 [2018-06-24 20:47:38,610 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:38,610 INFO ]: With dead ends: 52 [2018-06-24 20:47:38,610 INFO ]: Without dead ends: 29 [2018-06-24 20:47:38,610 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=587, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:47:38,610 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:47:38,611 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:47:38,611 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:47:38,611 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-24 20:47:38,611 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2018-06-24 20:47:38,611 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:38,611 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-24 20:47:38,611 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:47:38,611 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-24 20:47:38,612 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:47:38,612 INFO ]: Found error trace [2018-06-24 20:47:38,612 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:38,612 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:38,612 INFO ]: Analyzing trace with hash 781135794, now seen corresponding path program 14 times [2018-06-24 20:47:38,612 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:38,612 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:38,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:38,613 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:38,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:38,619 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:38,894 INFO ]: Checked inductivity of 132 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:47:38,894 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:38,894 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:38,899 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:47:38,957 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:38,957 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:38,968 INFO ]: Computing forward predicates... [2018-06-24 20:47:39,192 INFO ]: Checked inductivity of 132 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:47:39,210 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:47:39,210 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 15 [2018-06-24 20:47:39,210 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:47:39,210 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:47:39,210 INFO ]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:47:39,211 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-06-24 20:47:39,230 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:39,230 INFO ]: Finished difference Result 41 states and 43 transitions. [2018-06-24 20:47:39,230 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:47:39,230 INFO ]: Start accepts. Automaton has 15 states. Word has length 28 [2018-06-24 20:47:39,230 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:39,230 INFO ]: With dead ends: 41 [2018-06-24 20:47:39,230 INFO ]: Without dead ends: 29 [2018-06-24 20:47:39,230 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:47:39,230 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:47:39,231 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:47:39,231 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:47:39,231 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-24 20:47:39,231 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 28 [2018-06-24 20:47:39,231 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:39,231 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-24 20:47:39,231 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:47:39,231 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-24 20:47:39,232 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:47:39,232 INFO ]: Found error trace [2018-06-24 20:47:39,232 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:39,232 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:39,232 INFO ]: Analyzing trace with hash -2006279693, now seen corresponding path program 1 times [2018-06-24 20:47:39,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:39,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:39,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:39,232 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:39,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:39,249 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:39,381 INFO ]: Checked inductivity of 132 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-24 20:47:39,381 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:39,381 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:39,388 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:39,417 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:39,418 INFO ]: Computing forward predicates... [2018-06-24 20:47:39,433 INFO ]: Checked inductivity of 132 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-24 20:47:39,452 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:39,452 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:47:39,452 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:47:39,452 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:47:39,452 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:47:39,452 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 5 states. [2018-06-24 20:47:39,462 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:39,462 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-24 20:47:39,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:47:39,462 INFO ]: Start accepts. Automaton has 5 states. Word has length 28 [2018-06-24 20:47:39,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:39,462 INFO ]: With dead ends: 15 [2018-06-24 20:47:39,462 INFO ]: Without dead ends: 0 [2018-06-24 20:47:39,462 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:47:39,462 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 20:47:39,462 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 20:47:39,462 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 20:47:39,462 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 20:47:39,462 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-06-24 20:47:39,462 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:39,462 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 20:47:39,462 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:47:39,462 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 20:47:39,462 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 20:47:39,464 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:47:39,465 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:47:39 BasicIcfg [2018-06-24 20:47:39,465 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:47:39,465 INFO ]: Toolchain (without parser) took 39904.36 ms. Allocated memory was 306.2 MB in the beginning and 741.3 MB in the end (delta: 435.2 MB). Free memory was 262.5 MB in the beginning and 673.1 MB in the end (delta: -410.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:39,466 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:47:39,466 INFO ]: ChcToBoogie took 53.04 ms. Allocated memory is still 306.2 MB. Free memory was 262.5 MB in the beginning and 260.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:39,466 INFO ]: Boogie Preprocessor took 33.95 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:39,467 INFO ]: RCFGBuilder took 244.38 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 250.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 20:47:39,467 INFO ]: BlockEncodingV2 took 99.70 ms. Allocated memory is still 306.2 MB. Free memory was 250.6 MB in the beginning and 247.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 20:47:39,467 INFO ]: TraceAbstraction took 39464.27 ms. Allocated memory was 306.2 MB in the beginning and 741.3 MB in the end (delta: 435.2 MB). Free memory was 247.6 MB in the beginning and 673.1 MB in the end (delta: -425.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:39,470 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 13 locations, 16 edges - StatisticsResult: Encoded RCFG 7 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 53.04 ms. Allocated memory is still 306.2 MB. Free memory was 262.5 MB in the beginning and 260.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 33.95 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 244.38 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 250.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 99.70 ms. Allocated memory is still 306.2 MB. Free memory was 250.6 MB in the beginning and 247.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 39464.27 ms. Allocated memory was 306.2 MB in the beginning and 741.3 MB in the end (delta: 435.2 MB). Free memory was 247.6 MB in the beginning and 673.1 MB in the end (delta: -425.5 MB). Peak memory consumption was 9.6 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, 7 locations, 1 error locations. SAFE Result, 39.4s OverallTime, 38 OverallIterations, 11 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 319 SDtfs, 387 SDslu, 2182 SDs, 0 SdLazy, 6117 SolverSat, 1282 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1565 GetRequests, 514 SyntacticMatches, 61 SemanticMatches, 990 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7875 ImplicationChecksByTransitivity, 30.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 400 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 1245 NumberOfCodeBlocks, 1245 NumberOfCodeBlocksAsserted, 144 NumberOfCheckSat, 1172 ConstructedInterpolants, 0 QuantifiedInterpolants, 128543 SizeOfPredicates, 133 NumberOfNonLiveVariables, 6299 ConjunctsInSsa, 1792 ConjunctsInUnsatCore, 73 InterpolantComputations, 7 PerfectInterpolantSequences, 1737/3927 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/break_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-47-39-479.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-47-39-479.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-47-39-479.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-47-39-479.csv Received shutdown request...