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/simple-loop_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:52:29,081 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:52:29,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:52:29,095 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:52:29,095 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:52:29,096 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:52:29,097 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:52:29,100 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:52:29,101 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:52:29,105 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:52:29,106 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:52:29,106 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:52:29,107 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:52:29,112 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:52:29,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:52:29,114 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:52:29,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:52:29,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:52:29,130 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:52:29,131 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:52:29,132 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:52:29,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:52:29,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:52:29,135 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:52:29,139 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:52:29,140 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:52:29,141 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:52:29,143 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:52:29,144 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:52:29,145 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:52:29,145 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:52:29,146 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:52:29,146 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:52:29,147 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:52:29,147 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:52:29,148 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:52:29,166 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:52:29,166 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:52:29,166 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:52:29,167 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:52:29,168 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:52:29,168 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:52:29,168 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:52:29,168 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:52:29,169 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:52:29,169 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:52:29,169 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:52:29,169 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:52:29,169 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:52:29,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:52:29,172 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:52:29,172 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:52:29,172 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:52:29,172 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:52:29,173 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:52:29,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:52:29,173 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:52:29,175 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:52:29,175 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:52:29,222 INFO ]: Repository-Root is: /tmp [2018-06-24 20:52:29,233 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:52:29,236 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:52:29,237 INFO ]: Initializing SmtParser... [2018-06-24 20:52:29,238 INFO ]: SmtParser initialized [2018-06-24 20:52:29,238 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/simple-loop_merged_safe.c-1.smt2 [2018-06-24 20:52:29,239 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:52:29,332 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/simple-loop_merged_safe.c-1.smt2 unknown [2018-06-24 20:52:29,495 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/simple-loop_merged_safe.c-1.smt2 [2018-06-24 20:52:29,500 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:52:29,507 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:52:29,508 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:52:29,508 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:52:29,508 INFO ]: ChcToBoogie initialized [2018-06-24 20:52:29,511 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:52:29" (1/1) ... [2018-06-24 20:52:29,565 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:29 Unit [2018-06-24 20:52:29,565 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:52:29,566 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:52:29,566 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:52:29,566 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:52:29,589 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:29" (1/1) ... [2018-06-24 20:52:29,589 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:29" (1/1) ... [2018-06-24 20:52:29,594 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:29" (1/1) ... [2018-06-24 20:52:29,594 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:29" (1/1) ... [2018-06-24 20:52:29,597 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:29" (1/1) ... [2018-06-24 20:52:29,598 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:29" (1/1) ... [2018-06-24 20:52:29,600 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:29" (1/1) ... [2018-06-24 20:52:29,601 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:52:29,601 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:52:29,601 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:52:29,601 INFO ]: RCFGBuilder initialized [2018-06-24 20:52:29,602 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:29" (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:52:29,616 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:52:29,616 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:52:29,616 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:52:29,616 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:52:29,616 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:52:29,616 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:52:29,882 INFO ]: Using library mode [2018-06-24 20:52:29,883 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:52:29 BoogieIcfgContainer [2018-06-24 20:52:29,883 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:52:29,883 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:52:29,883 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:52:29,884 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:52:29,885 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:52:29" (1/1) ... [2018-06-24 20:52:29,902 INFO ]: Initial Icfg 13 locations, 14 edges [2018-06-24 20:52:29,903 INFO ]: Using Remove infeasible edges [2018-06-24 20:52:29,904 INFO ]: Using Maximize final states [2018-06-24 20:52:29,904 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:52:29,904 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:52:29,908 INFO ]: Using Remove sink states [2018-06-24 20:52:29,908 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:52:29,908 INFO ]: Using Use SBE [2018-06-24 20:52:29,913 INFO ]: SBE split 0 edges [2018-06-24 20:52:29,918 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:52:29,919 INFO ]: 0 new accepting states [2018-06-24 20:52:29,945 INFO ]: Removed 8 edges and 4 locations by large block encoding [2018-06-24 20:52:29,947 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:52:29,951 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:52:29,951 INFO ]: 0 new accepting states [2018-06-24 20:52:29,951 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:52:29,951 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:52:29,951 INFO ]: Encoded RCFG 7 locations, 8 edges [2018-06-24 20:52:29,952 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:52:29 BasicIcfg [2018-06-24 20:52:29,952 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:52:29,952 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:52:29,952 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:52:29,955 INFO ]: TraceAbstraction initialized [2018-06-24 20:52:29,955 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:52:29" (1/4) ... [2018-06-24 20:52:29,956 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256b3add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:52:29, skipping insertion in model container [2018-06-24 20:52:29,956 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:29" (2/4) ... [2018-06-24 20:52:29,956 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256b3add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:52:29, skipping insertion in model container [2018-06-24 20:52:29,956 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:52:29" (3/4) ... [2018-06-24 20:52:29,957 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256b3add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:52:29, skipping insertion in model container [2018-06-24 20:52:29,957 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:52:29" (4/4) ... [2018-06-24 20:52:29,958 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:52:29,967 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:52:29,976 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:52:30,023 INFO ]: Using default assertion order modulation [2018-06-24 20:52:30,023 INFO ]: Interprodecural is true [2018-06-24 20:52:30,023 INFO ]: Hoare is false [2018-06-24 20:52:30,023 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:52:30,023 INFO ]: Backedges is TWOTRACK [2018-06-24 20:52:30,023 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:52:30,023 INFO ]: Difference is false [2018-06-24 20:52:30,023 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:52:30,024 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:52:30,033 INFO ]: Start isEmpty. Operand 7 states. [2018-06-24 20:52:30,042 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:52:30,042 INFO ]: Found error trace [2018-06-24 20:52:30,043 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:52:30,043 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:30,052 INFO ]: Analyzing trace with hash 987439445, now seen corresponding path program 1 times [2018-06-24 20:52:30,053 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:30,054 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:30,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:30,089 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:30,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:30,133 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:30,203 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:52:30,205 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:52:30,205 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:52:30,207 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:52:30,220 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:52:30,221 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:52:30,222 INFO ]: Start difference. First operand 7 states. Second operand 3 states. [2018-06-24 20:52:30,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:30,257 INFO ]: Finished difference Result 8 states and 9 transitions. [2018-06-24 20:52:30,258 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:52:30,259 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 20:52:30,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:30,267 INFO ]: With dead ends: 8 [2018-06-24 20:52:30,267 INFO ]: Without dead ends: 8 [2018-06-24 20:52:30,269 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:52:30,281 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:52:30,295 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:52:30,297 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:52:30,298 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-06-24 20:52:30,299 INFO ]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-06-24 20:52:30,299 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:30,299 INFO ]: Abstraction has 8 states and 9 transitions. [2018-06-24 20:52:30,299 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:52:30,299 INFO ]: Start isEmpty. Operand 8 states and 9 transitions. [2018-06-24 20:52:30,299 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:52:30,299 INFO ]: Found error trace [2018-06-24 20:52:30,299 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:30,299 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:30,299 INFO ]: Analyzing trace with hash 546451490, now seen corresponding path program 1 times [2018-06-24 20:52:30,300 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:30,300 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:30,302 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:30,302 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:30,302 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:30,315 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:30,427 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:52:30,427 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:52:30,427 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:52:30,428 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:52:30,429 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:52:30,429 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:52:30,429 INFO ]: Start difference. First operand 8 states and 9 transitions. Second operand 3 states. [2018-06-24 20:52:30,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:30,470 INFO ]: Finished difference Result 9 states and 10 transitions. [2018-06-24 20:52:30,471 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:52:30,471 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 20:52:30,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:30,471 INFO ]: With dead ends: 9 [2018-06-24 20:52:30,471 INFO ]: Without dead ends: 9 [2018-06-24 20:52:30,472 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:52:30,472 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:52:30,473 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:52:30,473 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:52:30,473 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-06-24 20:52:30,473 INFO ]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2018-06-24 20:52:30,474 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:30,474 INFO ]: Abstraction has 9 states and 10 transitions. [2018-06-24 20:52:30,474 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:52:30,474 INFO ]: Start isEmpty. Operand 9 states and 10 transitions. [2018-06-24 20:52:30,474 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:52:30,474 INFO ]: Found error trace [2018-06-24 20:52:30,474 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:30,474 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:30,474 INFO ]: Analyzing trace with hash -240345703, now seen corresponding path program 1 times [2018-06-24 20:52:30,474 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:30,474 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:30,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:30,475 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:30,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:30,490 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:30,546 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:52:30,546 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:30,546 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:52:30,552 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:30,588 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:30,594 INFO ]: Computing forward predicates... [2018-06-24 20:52:30,610 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:52:30,629 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:30,629 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 20:52:30,630 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:52:30,630 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:52:30,630 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:52:30,630 INFO ]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2018-06-24 20:52:30,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:30,672 INFO ]: Finished difference Result 10 states and 11 transitions. [2018-06-24 20:52:30,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:52:30,672 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-24 20:52:30,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:30,673 INFO ]: With dead ends: 10 [2018-06-24 20:52:30,673 INFO ]: Without dead ends: 10 [2018-06-24 20:52:30,673 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:52:30,673 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:52:30,675 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:52:30,675 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:52:30,675 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-06-24 20:52:30,675 INFO ]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-06-24 20:52:30,675 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:30,675 INFO ]: Abstraction has 10 states and 11 transitions. [2018-06-24 20:52:30,675 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:52:30,675 INFO ]: Start isEmpty. Operand 10 states and 11 transitions. [2018-06-24 20:52:30,676 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:52:30,676 INFO ]: Found error trace [2018-06-24 20:52:30,676 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:30,676 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:30,676 INFO ]: Analyzing trace with hash 1171991846, now seen corresponding path program 2 times [2018-06-24 20:52:30,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:30,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:30,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:30,680 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:30,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:30,692 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:30,784 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:52:30,784 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:30,784 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:52:30,790 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:30,822 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:30,822 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:30,824 INFO ]: Computing forward predicates... [2018-06-24 20:52:30,832 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:52:30,850 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:30,850 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:52:30,850 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:52:30,851 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:52:30,851 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:52:30,851 INFO ]: Start difference. First operand 10 states and 11 transitions. Second operand 5 states. [2018-06-24 20:52:30,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:30,866 INFO ]: Finished difference Result 11 states and 12 transitions. [2018-06-24 20:52:30,866 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:52:30,866 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:52:30,866 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:30,866 INFO ]: With dead ends: 11 [2018-06-24 20:52:30,867 INFO ]: Without dead ends: 11 [2018-06-24 20:52:30,867 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 10 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:52:30,867 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:52:30,868 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:52:30,868 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:52:30,869 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-06-24 20:52:30,869 INFO ]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2018-06-24 20:52:30,869 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:30,869 INFO ]: Abstraction has 11 states and 12 transitions. [2018-06-24 20:52:30,869 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:52:30,869 INFO ]: Start isEmpty. Operand 11 states and 12 transitions. [2018-06-24 20:52:30,869 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:52:30,869 INFO ]: Found error trace [2018-06-24 20:52:30,869 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:30,869 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:30,869 INFO ]: Analyzing trace with hash 2004782905, now seen corresponding path program 3 times [2018-06-24 20:52:30,869 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:30,869 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:30,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:30,870 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:30,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:30,886 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:31,000 INFO ]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:52:31,000 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:31,000 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:52:31,015 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:31,075 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:52:31,075 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:31,077 INFO ]: Computing forward predicates... [2018-06-24 20:52:31,083 INFO ]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:52:31,119 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:31,119 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 20:52:31,119 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:52:31,119 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:52:31,119 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:52:31,119 INFO ]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2018-06-24 20:52:31,139 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:31,139 INFO ]: Finished difference Result 12 states and 13 transitions. [2018-06-24 20:52:31,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:52:31,140 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-24 20:52:31,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:31,140 INFO ]: With dead ends: 12 [2018-06-24 20:52:31,140 INFO ]: Without dead ends: 12 [2018-06-24 20:52:31,140 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 11 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:52:31,141 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:52:31,142 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 20:52:31,142 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:52:31,142 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-24 20:52:31,142 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-06-24 20:52:31,142 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:31,142 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-24 20:52:31,142 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:52:31,142 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-24 20:52:31,143 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:52:31,143 INFO ]: Found error trace [2018-06-24 20:52:31,143 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:31,143 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:31,143 INFO ]: Analyzing trace with hash 2018255202, now seen corresponding path program 4 times [2018-06-24 20:52:31,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:31,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:31,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:31,144 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:31,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:31,162 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:31,438 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:52:31,438 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:31,439 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) [2018-06-24 20:52:31,454 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:31,494 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:31,494 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:31,496 INFO ]: Computing forward predicates... [2018-06-24 20:52:31,506 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:52:31,539 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:31,539 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:52:31,539 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:52:31,539 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:52:31,539 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:52:31,539 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 6 states. [2018-06-24 20:52:31,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:31,570 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-24 20:52:31,570 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:52:31,570 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-24 20:52:31,570 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:31,570 INFO ]: With dead ends: 13 [2018-06-24 20:52:31,570 INFO ]: Without dead ends: 13 [2018-06-24 20:52:31,571 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:52:31,571 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:52:31,572 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:52:31,572 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:52:31,572 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-24 20:52:31,573 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-06-24 20:52:31,573 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:31,573 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-24 20:52:31,573 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:52:31,573 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-24 20:52:31,573 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:52:31,573 INFO ]: Found error trace [2018-06-24 20:52:31,573 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:31,573 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:31,573 INFO ]: Analyzing trace with hash -828421451, now seen corresponding path program 5 times [2018-06-24 20:52:31,573 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:31,573 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:31,574 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:31,574 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:31,574 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:31,599 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:31,837 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:52:31,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:31,837 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:52:31,843 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:52:31,882 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:52:31,882 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:31,884 INFO ]: Computing forward predicates... [2018-06-24 20:52:31,891 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:52:31,912 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:31,912 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 20:52:31,912 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:52:31,913 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:52:31,913 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:52:31,913 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-06-24 20:52:31,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:31,939 INFO ]: Finished difference Result 14 states and 15 transitions. [2018-06-24 20:52:31,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:52:31,939 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-24 20:52:31,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:31,939 INFO ]: With dead ends: 14 [2018-06-24 20:52:31,939 INFO ]: Without dead ends: 14 [2018-06-24 20:52:31,940 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:52:31,940 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:52:31,941 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:52:31,941 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:52:31,941 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-24 20:52:31,941 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-06-24 20:52:31,941 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:31,942 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-24 20:52:31,942 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:52:31,942 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-24 20:52:31,942 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:52:31,942 INFO ]: Found error trace [2018-06-24 20:52:31,942 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:31,942 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:31,942 INFO ]: Analyzing trace with hash 1118915522, now seen corresponding path program 6 times [2018-06-24 20:52:31,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:31,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:31,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:31,943 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:31,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:31,954 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:32,149 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:52:32,149 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:32,149 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:52:32,156 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:52:32,179 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:52:32,179 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:32,180 INFO ]: Computing forward predicates... [2018-06-24 20:52:32,361 INFO ]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:52:32,380 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:32,381 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-06-24 20:52:32,381 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:52:32,381 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:52:32,381 INFO ]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:52:32,381 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 11 states. [2018-06-24 20:52:32,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:32,426 INFO ]: Finished difference Result 16 states and 17 transitions. [2018-06-24 20:52:32,426 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:52:32,426 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 20:52:32,426 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:32,426 INFO ]: With dead ends: 16 [2018-06-24 20:52:32,426 INFO ]: Without dead ends: 16 [2018-06-24 20:52:32,427 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:52:32,427 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:52:32,428 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:52:32,428 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:52:32,429 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-24 20:52:32,429 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2018-06-24 20:52:32,429 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:32,429 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-24 20:52:32,429 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:52:32,429 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-24 20:52:32,429 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:52:32,429 INFO ]: Found error trace [2018-06-24 20:52:32,429 INFO ]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:32,429 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:32,430 INFO ]: Analyzing trace with hash -888739898, now seen corresponding path program 7 times [2018-06-24 20:52:32,430 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:32,430 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:32,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:32,430 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:32,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:32,442 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:32,492 INFO ]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:52:32,492 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:32,492 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:52:32,499 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:32,519 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:32,521 INFO ]: Computing forward predicates... [2018-06-24 20:52:32,625 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:52:32,645 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:32,645 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-06-24 20:52:32,645 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:52:32,645 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:52:32,645 INFO ]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:52:32,645 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 13 states. [2018-06-24 20:52:32,681 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:32,681 INFO ]: Finished difference Result 18 states and 19 transitions. [2018-06-24 20:52:32,681 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:52:32,681 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-24 20:52:32,681 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:32,681 INFO ]: With dead ends: 18 [2018-06-24 20:52:32,681 INFO ]: Without dead ends: 18 [2018-06-24 20:52:32,682 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:52:32,682 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:52:32,683 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 20:52:32,683 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:52:32,684 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-24 20:52:32,684 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2018-06-24 20:52:32,684 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:32,684 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-24 20:52:32,684 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:52:32,684 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-24 20:52:32,684 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:52:32,684 INFO ]: Found error trace [2018-06-24 20:52:32,684 INFO ]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:32,684 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:32,684 INFO ]: Analyzing trace with hash -1079014142, now seen corresponding path program 8 times [2018-06-24 20:52:32,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:32,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:32,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:32,685 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:32,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:32,698 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:32,893 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:52:32,893 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:32,893 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:52:32,901 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:32,949 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:32,949 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:32,951 INFO ]: Computing forward predicates... [2018-06-24 20:52:32,960 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:52:32,991 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:32,991 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 20:52:32,991 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:52:32,992 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:52:32,992 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:52:32,992 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 10 states. [2018-06-24 20:52:33,225 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:33,226 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-24 20:52:33,226 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:52:33,226 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-24 20:52:33,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:33,227 INFO ]: With dead ends: 19 [2018-06-24 20:52:33,227 INFO ]: Without dead ends: 19 [2018-06-24 20:52:33,227 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:52:33,227 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:52:33,229 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 20:52:33,229 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:52:33,229 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-24 20:52:33,229 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-06-24 20:52:33,229 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:33,230 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-24 20:52:33,230 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:52:33,230 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-24 20:52:33,232 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:52:33,232 INFO ]: Found error trace [2018-06-24 20:52:33,232 INFO ]: trace histogram [8, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:33,232 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:33,232 INFO ]: Analyzing trace with hash -773510123, now seen corresponding path program 9 times [2018-06-24 20:52:33,233 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:33,233 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:33,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:33,233 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:33,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:33,265 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:33,729 INFO ]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:52:33,729 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:33,729 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:52:33,736 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:33,785 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:52:33,785 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:33,787 INFO ]: Computing forward predicates... [2018-06-24 20:52:33,872 INFO ]: Checked inductivity of 46 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:52:33,891 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:33,891 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-06-24 20:52:33,892 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:52:33,892 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:52:33,892 INFO ]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:52:33,892 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2018-06-24 20:52:33,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:33,935 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-24 20:52:33,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:52:33,935 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-24 20:52:33,935 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:33,936 INFO ]: With dead ends: 21 [2018-06-24 20:52:33,936 INFO ]: Without dead ends: 21 [2018-06-24 20:52:33,936 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:52:33,936 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:52:33,938 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 20:52:33,938 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:52:33,938 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-24 20:52:33,938 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-06-24 20:52:33,938 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:33,938 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-24 20:52:33,938 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:52:33,938 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-24 20:52:33,939 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:52:33,939 INFO ]: Found error trace [2018-06-24 20:52:33,939 INFO ]: trace histogram [9, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:33,939 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:33,939 INFO ]: Analyzing trace with hash -972863911, now seen corresponding path program 10 times [2018-06-24 20:52:33,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:33,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:33,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:33,940 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:33,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:33,952 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:34,056 INFO ]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:52:34,056 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:34,056 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:52:34,062 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:34,095 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:34,095 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:34,098 INFO ]: Computing forward predicates... [2018-06-24 20:52:34,213 INFO ]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:52:34,238 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:34,238 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2018-06-24 20:52:34,238 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:52:34,238 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:52:34,238 INFO ]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:52:34,238 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 18 states. [2018-06-24 20:52:34,283 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:34,283 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-24 20:52:34,285 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:52:34,285 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-24 20:52:34,285 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:34,285 INFO ]: With dead ends: 23 [2018-06-24 20:52:34,285 INFO ]: Without dead ends: 23 [2018-06-24 20:52:34,286 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:52:34,286 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:52:34,287 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 20:52:34,288 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:52:34,288 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-24 20:52:34,288 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-06-24 20:52:34,288 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:34,288 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-24 20:52:34,288 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:52:34,288 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-24 20:52:34,289 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:52:34,289 INFO ]: Found error trace [2018-06-24 20:52:34,289 INFO ]: trace histogram [10, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:34,289 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:34,289 INFO ]: Analyzing trace with hash -1413993515, now seen corresponding path program 11 times [2018-06-24 20:52:34,289 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:34,289 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:34,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:34,290 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:34,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:34,302 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:34,408 INFO ]: Checked inductivity of 76 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:52:34,408 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:34,408 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:52:34,421 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:52:34,467 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:52:34,467 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:34,469 INFO ]: Computing forward predicates... [2018-06-24 20:52:34,478 INFO ]: Checked inductivity of 76 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:52:34,498 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:34,498 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:52:34,578 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:52:34,579 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:52:34,579 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:52:34,579 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2018-06-24 20:52:34,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:34,666 INFO ]: Finished difference Result 24 states and 25 transitions. [2018-06-24 20:52:34,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:52:34,666 INFO ]: Start accepts. Automaton has 9 states. Word has length 22 [2018-06-24 20:52:34,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:34,667 INFO ]: With dead ends: 24 [2018-06-24 20:52:34,667 INFO ]: Without dead ends: 24 [2018-06-24 20:52:34,667 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:52:34,667 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:52:34,668 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 20:52:34,669 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:52:34,669 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-24 20:52:34,669 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-24 20:52:34,669 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:34,669 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-24 20:52:34,669 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:52:34,669 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-24 20:52:34,672 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:52:34,673 INFO ]: Found error trace [2018-06-24 20:52:34,673 INFO ]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:34,673 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:34,673 INFO ]: Analyzing trace with hash -884598714, now seen corresponding path program 12 times [2018-06-24 20:52:34,673 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:34,673 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:34,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:34,673 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:34,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:34,695 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:34,782 INFO ]: Checked inductivity of 83 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:52:34,783 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:34,783 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:34,789 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:52:34,815 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:52:34,815 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:34,818 INFO ]: Computing forward predicates... [2018-06-24 20:52:34,827 INFO ]: Checked inductivity of 83 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:52:34,860 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:34,860 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 20:52:34,860 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:52:34,860 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:52:34,860 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:52:34,860 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2018-06-24 20:52:34,914 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:34,914 INFO ]: Finished difference Result 25 states and 26 transitions. [2018-06-24 20:52:34,914 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:52:34,914 INFO ]: Start accepts. Automaton has 10 states. Word has length 23 [2018-06-24 20:52:34,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:34,915 INFO ]: With dead ends: 25 [2018-06-24 20:52:34,915 INFO ]: Without dead ends: 25 [2018-06-24 20:52:34,915 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:52:34,915 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:52:34,916 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 20:52:34,916 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:52:34,918 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-24 20:52:34,918 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-06-24 20:52:34,918 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:34,918 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-24 20:52:34,918 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:52:34,918 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-24 20:52:34,918 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:52:34,918 INFO ]: Found error trace [2018-06-24 20:52:34,918 INFO ]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:34,919 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:34,919 INFO ]: Analyzing trace with hash -1653229067, now seen corresponding path program 13 times [2018-06-24 20:52:34,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:34,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:34,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:34,919 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:34,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:34,931 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:35,050 INFO ]: Checked inductivity of 91 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:52:35,050 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:35,050 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) [2018-06-24 20:52:35,066 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:35,107 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:35,109 INFO ]: Computing forward predicates... [2018-06-24 20:52:35,120 INFO ]: Checked inductivity of 91 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:52:35,148 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:35,148 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 20:52:35,148 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:52:35,148 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:52:35,148 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:52:35,148 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2018-06-24 20:52:35,172 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:35,173 INFO ]: Finished difference Result 26 states and 27 transitions. [2018-06-24 20:52:35,173 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:52:35,173 INFO ]: Start accepts. Automaton has 11 states. Word has length 24 [2018-06-24 20:52:35,173 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:35,173 INFO ]: With dead ends: 26 [2018-06-24 20:52:35,173 INFO ]: Without dead ends: 26 [2018-06-24 20:52:35,174 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 25 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:52:35,174 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:52:35,176 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:52:35,176 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:52:35,176 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-24 20:52:35,176 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-06-24 20:52:35,177 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:35,177 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-24 20:52:35,177 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:52:35,177 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-24 20:52:35,177 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:52:35,177 INFO ]: Found error trace [2018-06-24 20:52:35,177 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:35,177 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:35,177 INFO ]: Analyzing trace with hash 289033766, now seen corresponding path program 14 times [2018-06-24 20:52:35,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:35,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:35,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:35,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:35,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:35,190 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:35,285 INFO ]: Checked inductivity of 100 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:52:35,285 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:35,285 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:52:35,291 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:35,323 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:35,323 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:35,325 INFO ]: Computing forward predicates... [2018-06-24 20:52:35,338 INFO ]: Checked inductivity of 100 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:52:35,359 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:35,359 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 20:52:35,359 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:52:35,359 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:52:35,359 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:52:35,360 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 12 states. [2018-06-24 20:52:35,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:35,390 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-24 20:52:35,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:52:35,391 INFO ]: Start accepts. Automaton has 12 states. Word has length 25 [2018-06-24 20:52:35,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:35,391 INFO ]: With dead ends: 27 [2018-06-24 20:52:35,391 INFO ]: Without dead ends: 27 [2018-06-24 20:52:35,392 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:52:35,392 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:52:35,394 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 20:52:35,394 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:52:35,394 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-24 20:52:35,394 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2018-06-24 20:52:35,395 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:35,395 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-24 20:52:35,395 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:52:35,395 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-24 20:52:35,395 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:52:35,395 INFO ]: Found error trace [2018-06-24 20:52:35,395 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:35,396 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:35,396 INFO ]: Analyzing trace with hash 369639445, now seen corresponding path program 15 times [2018-06-24 20:52:35,396 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:35,396 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:35,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:35,397 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:35,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:35,409 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:35,539 INFO ]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:52:35,539 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:35,539 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:52:35,545 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:35,635 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:52:35,636 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:35,638 INFO ]: Computing forward predicates... [2018-06-24 20:52:35,648 INFO ]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:52:35,679 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:35,679 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-24 20:52:35,679 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:52:35,680 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:52:35,680 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:52:35,680 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2018-06-24 20:52:35,753 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:35,753 INFO ]: Finished difference Result 28 states and 29 transitions. [2018-06-24 20:52:35,753 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:52:35,753 INFO ]: Start accepts. Automaton has 13 states. Word has length 26 [2018-06-24 20:52:35,753 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:35,753 INFO ]: With dead ends: 28 [2018-06-24 20:52:35,753 INFO ]: Without dead ends: 28 [2018-06-24 20:52:35,754 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:52:35,754 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:52:35,755 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-24 20:52:35,755 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:52:35,756 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-24 20:52:35,756 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-06-24 20:52:35,756 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:35,756 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-24 20:52:35,756 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:52:35,756 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-24 20:52:35,756 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:52:35,757 INFO ]: Found error trace [2018-06-24 20:52:35,757 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:35,757 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:35,757 INFO ]: Analyzing trace with hash -1426551802, now seen corresponding path program 16 times [2018-06-24 20:52:35,757 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:35,757 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:35,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:35,757 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:35,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:35,772 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:35,951 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-24 20:52:36,085 INFO ]: Checked inductivity of 121 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:52:36,085 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:36,085 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:52:36,091 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:36,134 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:36,134 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:36,137 INFO ]: Computing forward predicates... [2018-06-24 20:52:36,260 INFO ]: Checked inductivity of 121 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-06-24 20:52:36,278 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:36,278 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 16 [2018-06-24 20:52:36,279 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:52:36,279 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:52:36,279 INFO ]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:52:36,279 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 16 states. [2018-06-24 20:52:36,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:36,305 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-24 20:52:36,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:52:36,305 INFO ]: Start accepts. Automaton has 16 states. Word has length 27 [2018-06-24 20:52:36,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:36,305 INFO ]: With dead ends: 14 [2018-06-24 20:52:36,305 INFO ]: Without dead ends: 0 [2018-06-24 20:52:36,305 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 13 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:52:36,306 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 20:52:36,306 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 20:52:36,306 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 20:52:36,306 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 20:52:36,306 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-06-24 20:52:36,306 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:36,306 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 20:52:36,306 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:52:36,306 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 20:52:36,306 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 20:52:36,307 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:52:36,309 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:52:36 BasicIcfg [2018-06-24 20:52:36,309 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:52:36,309 INFO ]: Toolchain (without parser) took 6808.76 ms. Allocated memory was 304.1 MB in the beginning and 364.4 MB in the end (delta: 60.3 MB). Free memory was 258.5 MB in the beginning and 255.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 63.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:52:36,310 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:52:36,310 INFO ]: ChcToBoogie took 57.56 ms. Allocated memory is still 304.1 MB. Free memory was 258.5 MB in the beginning and 256.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:52:36,311 INFO ]: Boogie Preprocessor took 34.90 ms. Allocated memory is still 304.1 MB. Free memory was 256.5 MB in the beginning and 255.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 20:52:36,311 INFO ]: RCFGBuilder took 281.78 ms. Allocated memory is still 304.1 MB. Free memory was 255.5 MB in the beginning and 247.5 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:52:36,312 INFO ]: BlockEncodingV2 took 68.32 ms. Allocated memory is still 304.1 MB. Free memory was 247.5 MB in the beginning and 244.5 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:52:36,312 INFO ]: TraceAbstraction took 6356.13 ms. Allocated memory was 304.1 MB in the beginning and 364.4 MB in the end (delta: 60.3 MB). Free memory was 244.5 MB in the beginning and 255.8 MB in the end (delta: -11.3 MB). Peak memory consumption was 49.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:52:36,316 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 13 locations, 14 edges - StatisticsResult: Encoded RCFG 7 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 57.56 ms. Allocated memory is still 304.1 MB. Free memory was 258.5 MB in the beginning and 256.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.90 ms. Allocated memory is still 304.1 MB. Free memory was 256.5 MB in the beginning and 255.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 281.78 ms. Allocated memory is still 304.1 MB. Free memory was 255.5 MB in the beginning and 247.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 68.32 ms. Allocated memory is still 304.1 MB. Free memory was 247.5 MB in the beginning and 244.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6356.13 ms. Allocated memory was 304.1 MB in the beginning and 364.4 MB in the end (delta: 60.3 MB). Free memory was 244.5 MB in the beginning and 255.8 MB in the end (delta: -11.3 MB). Peak memory consumption was 49.0 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, 6.2s OverallTime, 18 OverallIterations, 11 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 1 SDslu, 473 SDs, 0 SdLazy, 308 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 421 GetRequests, 271 SyntacticMatches, 14 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=17, 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.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 573 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 539 ConstructedInterpolants, 0 QuantifiedInterpolants, 19790 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2611 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 34 InterpolantComputations, 2 PerfectInterpolantSequences, 906/1611 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/simple-loop_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-52-36-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-loop_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-52-36-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-loop_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-52-36-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-loop_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-52-36-327.csv Received shutdown request...