java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i '/storage/chc-comp/llreve-bench/smt2/faulty__ackermann!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:49:06,235 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:49:06,237 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:49:06,252 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:49:06,252 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:49:06,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:49:06,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:49:06,259 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:49:06,260 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:49:06,262 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:49:06,262 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:49:06,263 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:49:06,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:49:06,264 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:49:06,268 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:49:06,269 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:49:06,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:49:06,284 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:49:06,285 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:49:06,286 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:49:06,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:49:06,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:49:06,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:49:06,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:49:06,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:49:06,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:49:06,290 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:49:06,291 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:49:06,295 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:49:06,296 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:49:06,296 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:49:06,297 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:49:06,297 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:49:06,298 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:49:06,298 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:49:06,299 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:49:06,322 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:49:06,322 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:49:06,322 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:49:06,323 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:49:06,327 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:49:06,327 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:49:06,327 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:49:06,328 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:49:06,328 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:49:06,328 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:49:06,328 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:49:06,328 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:49:06,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:49:06,329 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:49:06,329 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:49:06,329 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:49:06,329 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:49:06,329 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:49:06,329 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:49:06,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:49:06,331 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:49:06,332 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:49:06,332 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:49:06,385 INFO ]: Repository-Root is: /tmp [2018-06-25 09:49:06,402 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:49:06,408 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:49:06,410 INFO ]: Initializing SmtParser... [2018-06-25 09:49:06,410 INFO ]: SmtParser initialized [2018-06-25 09:49:06,411 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__ackermann!.smt2 [2018-06-25 09:49:06,412 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-25 09:49:06,499 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/faulty__ackermann!.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@1c9b1b5b [2018-06-25 09:49:06,900 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__ackermann!.smt2 [2018-06-25 09:49:06,905 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:49:06,910 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:49:06,911 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:49:06,911 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:49:06,911 INFO ]: ChcToBoogie initialized [2018-06-25 09:49:06,914 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:49:06" (1/1) ... [2018-06-25 09:49:06,993 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:06 Unit [2018-06-25 09:49:06,993 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:49:06,994 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:49:06,994 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:49:06,994 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:49:07,014 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:06" (1/1) ... [2018-06-25 09:49:07,014 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:06" (1/1) ... [2018-06-25 09:49:07,023 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:06" (1/1) ... [2018-06-25 09:49:07,023 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:06" (1/1) ... [2018-06-25 09:49:07,050 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:06" (1/1) ... [2018-06-25 09:49:07,055 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:06" (1/1) ... [2018-06-25 09:49:07,057 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:06" (1/1) ... [2018-06-25 09:49:07,060 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:49:07,061 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:49:07,061 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:49:07,061 INFO ]: RCFGBuilder initialized [2018-06-25 09:49:07,062 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:06" (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-25 09:49:07,095 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:49:07,095 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:49:07,095 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:49:07,095 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:49:07,096 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:49:07,096 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-25 09:49:08,099 INFO ]: Using library mode [2018-06-25 09:49:08,099 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:49:08 BoogieIcfgContainer [2018-06-25 09:49:08,099 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:49:08,101 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:49:08,101 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:49:08,104 INFO ]: TraceAbstraction initialized [2018-06-25 09:49:08,104 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:49:06" (1/3) ... [2018-06-25 09:49:08,105 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328bc5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:49:08, skipping insertion in model container [2018-06-25 09:49:08,105 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:06" (2/3) ... [2018-06-25 09:49:08,105 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328bc5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:49:08, skipping insertion in model container [2018-06-25 09:49:08,105 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:49:08" (3/3) ... [2018-06-25 09:49:08,107 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:49:08,115 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:49:08,123 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:49:08,166 INFO ]: Using default assertion order modulation [2018-06-25 09:49:08,166 INFO ]: Interprodecural is true [2018-06-25 09:49:08,166 INFO ]: Hoare is false [2018-06-25 09:49:08,166 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:49:08,166 INFO ]: Backedges is TWOTRACK [2018-06-25 09:49:08,166 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:49:08,166 INFO ]: Difference is false [2018-06-25 09:49:08,166 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:49:08,166 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:49:08,189 INFO ]: Start isEmpty. Operand 75 states. [2018-06-25 09:49:08,220 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:49:08,220 INFO ]: Found error trace [2018-06-25 09:49:08,221 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:08,222 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:08,230 INFO ]: Analyzing trace with hash -1363304725, now seen corresponding path program 1 times [2018-06-25 09:49:08,233 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:08,233 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:08,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:08,280 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:08,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:08,326 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:08,460 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:49:08,463 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:08,463 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:49:08,465 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:49:08,480 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:49:08,481 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:49:08,483 INFO ]: Start difference. First operand 75 states. Second operand 4 states. [2018-06-25 09:49:09,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:09,793 INFO ]: Finished difference Result 135 states and 277 transitions. [2018-06-25 09:49:09,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:49:09,796 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:49:09,796 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:09,825 INFO ]: With dead ends: 135 [2018-06-25 09:49:09,825 INFO ]: Without dead ends: 135 [2018-06-25 09:49:09,827 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:49:09,848 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-25 09:49:09,925 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-06-25 09:49:09,927 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-25 09:49:09,935 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 277 transitions. [2018-06-25 09:49:09,937 INFO ]: Start accepts. Automaton has 135 states and 277 transitions. Word has length 8 [2018-06-25 09:49:09,937 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:09,938 INFO ]: Abstraction has 135 states and 277 transitions. [2018-06-25 09:49:09,938 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:49:09,938 INFO ]: Start isEmpty. Operand 135 states and 277 transitions. [2018-06-25 09:49:09,944 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:49:09,944 INFO ]: Found error trace [2018-06-25 09:49:09,944 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:09,944 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:09,944 INFO ]: Analyzing trace with hash -908801158, now seen corresponding path program 1 times [2018-06-25 09:49:09,944 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:09,944 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:09,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:09,945 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:09,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:09,949 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:10,084 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:49:10,084 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:10,084 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:49:10,085 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:49:10,085 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:49:10,085 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:49:10,086 INFO ]: Start difference. First operand 135 states and 277 transitions. Second operand 4 states. [2018-06-25 09:49:11,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:11,208 INFO ]: Finished difference Result 201 states and 414 transitions. [2018-06-25 09:49:11,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:49:11,209 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:49:11,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:11,220 INFO ]: With dead ends: 201 [2018-06-25 09:49:11,220 INFO ]: Without dead ends: 201 [2018-06-25 09:49:11,221 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:49:11,222 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-25 09:49:11,251 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-06-25 09:49:11,251 INFO ]: Start removeUnreachable. Operand 201 states. [2018-06-25 09:49:11,258 INFO ]: Finished removeUnreachable. Reduced from 201 states to 201 states and 414 transitions. [2018-06-25 09:49:11,258 INFO ]: Start accepts. Automaton has 201 states and 414 transitions. Word has length 9 [2018-06-25 09:49:11,258 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:11,258 INFO ]: Abstraction has 201 states and 414 transitions. [2018-06-25 09:49:11,258 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:49:11,259 INFO ]: Start isEmpty. Operand 201 states and 414 transitions. [2018-06-25 09:49:11,262 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:49:11,262 INFO ]: Found error trace [2018-06-25 09:49:11,262 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:11,262 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:11,262 INFO ]: Analyzing trace with hash -999425380, now seen corresponding path program 1 times [2018-06-25 09:49:11,262 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:11,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:11,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:11,263 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:11,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:11,269 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:11,314 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:49:11,314 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:11,314 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:49:11,314 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:49:11,314 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:49:11,314 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:49:11,314 INFO ]: Start difference. First operand 201 states and 414 transitions. Second operand 4 states. [2018-06-25 09:49:11,779 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:11,779 INFO ]: Finished difference Result 267 states and 551 transitions. [2018-06-25 09:49:11,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:49:11,779 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:49:11,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:11,796 INFO ]: With dead ends: 267 [2018-06-25 09:49:11,796 INFO ]: Without dead ends: 267 [2018-06-25 09:49:11,796 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:49:11,797 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-25 09:49:11,829 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-25 09:49:11,829 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-25 09:49:11,837 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 551 transitions. [2018-06-25 09:49:11,837 INFO ]: Start accepts. Automaton has 267 states and 551 transitions. Word has length 9 [2018-06-25 09:49:11,838 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:11,838 INFO ]: Abstraction has 267 states and 551 transitions. [2018-06-25 09:49:11,838 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:49:11,838 INFO ]: Start isEmpty. Operand 267 states and 551 transitions. [2018-06-25 09:49:11,842 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:49:11,842 INFO ]: Found error trace [2018-06-25 09:49:11,842 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:11,842 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:11,842 INFO ]: Analyzing trace with hash -998212335, now seen corresponding path program 1 times [2018-06-25 09:49:11,842 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:11,842 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:11,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:11,843 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:11,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:11,857 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:11,923 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:49:11,923 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:11,923 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:49:11,923 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:49:11,923 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:49:11,923 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:49:11,923 INFO ]: Start difference. First operand 267 states and 551 transitions. Second operand 4 states. [2018-06-25 09:49:12,271 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:12,272 INFO ]: Finished difference Result 333 states and 688 transitions. [2018-06-25 09:49:12,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:49:12,272 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-25 09:49:12,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:12,294 INFO ]: With dead ends: 333 [2018-06-25 09:49:12,295 INFO ]: Without dead ends: 333 [2018-06-25 09:49:12,295 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:49:12,295 INFO ]: Start minimizeSevpa. Operand 333 states. [2018-06-25 09:49:12,329 INFO ]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-06-25 09:49:12,329 INFO ]: Start removeUnreachable. Operand 333 states. [2018-06-25 09:49:12,340 INFO ]: Finished removeUnreachable. Reduced from 333 states to 333 states and 688 transitions. [2018-06-25 09:49:12,340 INFO ]: Start accepts. Automaton has 333 states and 688 transitions. Word has length 10 [2018-06-25 09:49:12,340 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:12,340 INFO ]: Abstraction has 333 states and 688 transitions. [2018-06-25 09:49:12,340 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:49:12,340 INFO ]: Start isEmpty. Operand 333 states and 688 transitions. [2018-06-25 09:49:12,349 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:49:12,349 INFO ]: Found error trace [2018-06-25 09:49:12,349 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:12,349 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:12,349 INFO ]: Analyzing trace with hash 1729861476, now seen corresponding path program 1 times [2018-06-25 09:49:12,349 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:12,349 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:12,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:12,350 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:12,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:12,356 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:12,424 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:49:12,424 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:12,424 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:49:12,424 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:49:12,424 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:49:12,424 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:49:12,424 INFO ]: Start difference. First operand 333 states and 688 transitions. Second operand 4 states. [2018-06-25 09:49:12,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:12,667 INFO ]: Finished difference Result 399 states and 825 transitions. [2018-06-25 09:49:12,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:49:12,667 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-25 09:49:12,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:12,687 INFO ]: With dead ends: 399 [2018-06-25 09:49:12,687 INFO ]: Without dead ends: 399 [2018-06-25 09:49:12,687 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:49:12,688 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-25 09:49:12,723 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-06-25 09:49:12,723 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-25 09:49:12,736 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 825 transitions. [2018-06-25 09:49:12,736 INFO ]: Start accepts. Automaton has 399 states and 825 transitions. Word has length 12 [2018-06-25 09:49:12,736 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:12,736 INFO ]: Abstraction has 399 states and 825 transitions. [2018-06-25 09:49:12,736 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:49:12,736 INFO ]: Start isEmpty. Operand 399 states and 825 transitions. [2018-06-25 09:49:12,749 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:49:12,749 INFO ]: Found error trace [2018-06-25 09:49:12,749 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:12,749 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:12,749 INFO ]: Analyzing trace with hash -975942201, now seen corresponding path program 1 times [2018-06-25 09:49:12,749 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:12,749 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:12,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:12,750 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:12,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:12,760 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:12,821 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:49:12,821 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:12,821 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:49:12,821 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:49:12,821 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:49:12,821 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:49:12,821 INFO ]: Start difference. First operand 399 states and 825 transitions. Second operand 3 states. [2018-06-25 09:49:13,106 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:13,106 INFO ]: Finished difference Result 717 states and 1822 transitions. [2018-06-25 09:49:13,106 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:49:13,106 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 09:49:13,106 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:13,198 INFO ]: With dead ends: 717 [2018-06-25 09:49:13,198 INFO ]: Without dead ends: 717 [2018-06-25 09:49:13,198 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-25 09:49:13,200 INFO ]: Start minimizeSevpa. Operand 717 states. [2018-06-25 09:49:13,293 INFO ]: Finished minimizeSevpa. Reduced states from 717 to 405. [2018-06-25 09:49:13,293 INFO ]: Start removeUnreachable. Operand 405 states. [2018-06-25 09:49:13,316 INFO ]: Finished removeUnreachable. Reduced from 405 states to 405 states and 861 transitions. [2018-06-25 09:49:13,317 INFO ]: Start accepts. Automaton has 405 states and 861 transitions. Word has length 13 [2018-06-25 09:49:13,317 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:13,317 INFO ]: Abstraction has 405 states and 861 transitions. [2018-06-25 09:49:13,317 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:49:13,317 INFO ]: Start isEmpty. Operand 405 states and 861 transitions. [2018-06-25 09:49:13,332 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:49:13,332 INFO ]: Found error trace [2018-06-25 09:49:13,332 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:13,332 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:13,332 INFO ]: Analyzing trace with hash -975852828, now seen corresponding path program 1 times [2018-06-25 09:49:13,332 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:13,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:13,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:13,334 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:13,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:13,346 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:13,407 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:49:13,407 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:13,407 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:49:13,407 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:49:13,407 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:49:13,408 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:49:13,408 INFO ]: Start difference. First operand 405 states and 861 transitions. Second operand 3 states. [2018-06-25 09:49:13,694 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:13,694 INFO ]: Finished difference Result 639 states and 1660 transitions. [2018-06-25 09:49:13,694 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:49:13,694 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 09:49:13,694 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:13,746 INFO ]: With dead ends: 639 [2018-06-25 09:49:13,746 INFO ]: Without dead ends: 639 [2018-06-25 09:49:13,746 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-25 09:49:13,747 INFO ]: Start minimizeSevpa. Operand 639 states. [2018-06-25 09:49:13,808 INFO ]: Finished minimizeSevpa. Reduced states from 639 to 429. [2018-06-25 09:49:13,808 INFO ]: Start removeUnreachable. Operand 429 states. [2018-06-25 09:49:13,819 INFO ]: Finished removeUnreachable. Reduced from 429 states to 429 states and 933 transitions. [2018-06-25 09:49:13,819 INFO ]: Start accepts. Automaton has 429 states and 933 transitions. Word has length 13 [2018-06-25 09:49:13,819 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:13,819 INFO ]: Abstraction has 429 states and 933 transitions. [2018-06-25 09:49:13,819 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:49:13,819 INFO ]: Start isEmpty. Operand 429 states and 933 transitions. [2018-06-25 09:49:13,861 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:49:13,861 INFO ]: Found error trace [2018-06-25 09:49:13,861 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:13,861 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:13,862 INFO ]: Analyzing trace with hash -1492888897, now seen corresponding path program 1 times [2018-06-25 09:49:13,862 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:13,862 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:13,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:13,862 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:13,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:13,868 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:13,928 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:49:13,929 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:49:13,929 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-25 09:49:13,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:13,994 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:14,002 INFO ]: Computing forward predicates... [2018-06-25 09:49:14,103 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:49:14,138 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:49:14,138 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-06-25 09:49:14,138 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:49:14,139 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:49:14,139 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:49:14,139 INFO ]: Start difference. First operand 429 states and 933 transitions. Second operand 4 states. [2018-06-25 09:49:15,329 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:15,330 INFO ]: Finished difference Result 615 states and 1612 transitions. [2018-06-25 09:49:15,330 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:49:15,330 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-25 09:49:15,330 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:15,376 INFO ]: With dead ends: 615 [2018-06-25 09:49:15,376 INFO ]: Without dead ends: 615 [2018-06-25 09:49:15,376 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:49:15,377 INFO ]: Start minimizeSevpa. Operand 615 states. [2018-06-25 09:49:15,430 INFO ]: Finished minimizeSevpa. Reduced states from 615 to 435. [2018-06-25 09:49:15,430 INFO ]: Start removeUnreachable. Operand 435 states. [2018-06-25 09:49:15,458 INFO ]: Finished removeUnreachable. Reduced from 435 states to 435 states and 951 transitions. [2018-06-25 09:49:15,458 INFO ]: Start accepts. Automaton has 435 states and 951 transitions. Word has length 21 [2018-06-25 09:49:15,458 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:15,458 INFO ]: Abstraction has 435 states and 951 transitions. [2018-06-25 09:49:15,458 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:49:15,458 INFO ]: Start isEmpty. Operand 435 states and 951 transitions. [2018-06-25 09:49:15,499 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:49:15,499 INFO ]: Found error trace [2018-06-25 09:49:15,499 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:15,499 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:15,499 INFO ]: Analyzing trace with hash 875588708, now seen corresponding path program 1 times [2018-06-25 09:49:15,499 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:15,499 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:15,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:15,500 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:15,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:15,512 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:15,868 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:49:15,868 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:49:15,868 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-25 09:49:15,883 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:15,927 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:15,929 INFO ]: Computing forward predicates... [2018-06-25 09:49:16,511 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:49:16,540 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:49:16,541 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-06-25 09:49:16,541 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:49:16,541 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:49:16,541 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:49:16,541 INFO ]: Start difference. First operand 435 states and 951 transitions. Second operand 9 states. [2018-06-25 09:49:16,868 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-25 09:49:17,126 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 09:49:20,188 WARN ]: Spent 202.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-06-25 09:49:25,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:25,824 INFO ]: Finished difference Result 1493 states and 5123 transitions. [2018-06-25 09:49:25,824 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:49:25,824 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-25 09:49:25,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:26,202 INFO ]: With dead ends: 1493 [2018-06-25 09:49:26,202 INFO ]: Without dead ends: 1361 [2018-06-25 09:49:26,203 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:49:26,204 INFO ]: Start minimizeSevpa. Operand 1361 states. [2018-06-25 09:49:26,481 INFO ]: Finished minimizeSevpa. Reduced states from 1361 to 785. [2018-06-25 09:49:26,481 INFO ]: Start removeUnreachable. Operand 785 states. [2018-06-25 09:49:26,517 INFO ]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1895 transitions. [2018-06-25 09:49:26,517 INFO ]: Start accepts. Automaton has 785 states and 1895 transitions. Word has length 21 [2018-06-25 09:49:26,517 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:26,517 INFO ]: Abstraction has 785 states and 1895 transitions. [2018-06-25 09:49:26,517 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:49:26,517 INFO ]: Start isEmpty. Operand 785 states and 1895 transitions. [2018-06-25 09:49:26,601 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:49:26,601 INFO ]: Found error trace [2018-06-25 09:49:26,601 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:26,601 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:26,601 INFO ]: Analyzing trace with hash 1058231548, now seen corresponding path program 1 times [2018-06-25 09:49:26,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:26,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:26,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:26,602 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:26,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:26,622 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:26,765 INFO ]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:49:26,765 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:26,765 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:49:26,765 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:49:26,766 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:49:26,766 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:49:26,766 INFO ]: Start difference. First operand 785 states and 1895 transitions. Second operand 4 states. [2018-06-25 09:49:27,278 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:27,279 INFO ]: Finished difference Result 1015 states and 2482 transitions. [2018-06-25 09:49:27,279 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:49:27,279 INFO ]: Start accepts. Automaton has 4 states. Word has length 22 [2018-06-25 09:49:27,279 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:27,332 INFO ]: With dead ends: 1015 [2018-06-25 09:49:27,332 INFO ]: Without dead ends: 785 [2018-06-25 09:49:27,332 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:49:27,333 INFO ]: Start minimizeSevpa. Operand 785 states. [2018-06-25 09:49:27,407 INFO ]: Finished minimizeSevpa. Reduced states from 785 to 785. [2018-06-25 09:49:27,407 INFO ]: Start removeUnreachable. Operand 785 states. [2018-06-25 09:49:27,434 INFO ]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1881 transitions. [2018-06-25 09:49:27,434 INFO ]: Start accepts. Automaton has 785 states and 1881 transitions. Word has length 22 [2018-06-25 09:49:27,434 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:27,434 INFO ]: Abstraction has 785 states and 1881 transitions. [2018-06-25 09:49:27,434 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:49:27,434 INFO ]: Start isEmpty. Operand 785 states and 1881 transitions. [2018-06-25 09:49:27,452 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:49:27,452 INFO ]: Found error trace [2018-06-25 09:49:27,452 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:27,452 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:27,452 INFO ]: Analyzing trace with hash 1300010484, now seen corresponding path program 1 times [2018-06-25 09:49:27,452 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:27,452 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:27,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:27,453 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:27,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:27,469 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:27,600 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:49:27,601 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:27,601 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:49:27,601 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:49:27,601 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:49:27,601 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:49:27,601 INFO ]: Start difference. First operand 785 states and 1881 transitions. Second operand 4 states. [2018-06-25 09:49:27,889 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:27,890 INFO ]: Finished difference Result 1388 states and 4386 transitions. [2018-06-25 09:49:27,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:49:27,890 INFO ]: Start accepts. Automaton has 4 states. Word has length 22 [2018-06-25 09:49:27,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:28,064 INFO ]: With dead ends: 1388 [2018-06-25 09:49:28,064 INFO ]: Without dead ends: 1388 [2018-06-25 09:49:28,065 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:49:28,066 INFO ]: Start minimizeSevpa. Operand 1388 states. [2018-06-25 09:49:28,214 INFO ]: Finished minimizeSevpa. Reduced states from 1388 to 794. [2018-06-25 09:49:28,214 INFO ]: Start removeUnreachable. Operand 794 states. [2018-06-25 09:49:28,240 INFO ]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1899 transitions. [2018-06-25 09:49:28,240 INFO ]: Start accepts. Automaton has 794 states and 1899 transitions. Word has length 22 [2018-06-25 09:49:28,240 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:28,240 INFO ]: Abstraction has 794 states and 1899 transitions. [2018-06-25 09:49:28,240 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:49:28,240 INFO ]: Start isEmpty. Operand 794 states and 1899 transitions. [2018-06-25 09:49:28,262 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:49:28,262 INFO ]: Found error trace [2018-06-25 09:49:28,262 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:28,262 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:28,262 INFO ]: Analyzing trace with hash -1378908538, now seen corresponding path program 1 times [2018-06-25 09:49:28,262 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:28,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:28,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:28,263 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:28,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:28,272 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:28,340 INFO ]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-25 09:49:28,340 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:28,340 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:49:28,340 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:49:28,340 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:49:28,340 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:49:28,341 INFO ]: Start difference. First operand 794 states and 1899 transitions. Second operand 3 states. [2018-06-25 09:49:28,862 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:28,862 INFO ]: Finished difference Result 1451 states and 4512 transitions. [2018-06-25 09:49:28,862 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:49:28,862 INFO ]: Start accepts. Automaton has 3 states. Word has length 25 [2018-06-25 09:49:28,862 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:29,023 INFO ]: With dead ends: 1451 [2018-06-25 09:49:29,023 INFO ]: Without dead ends: 1451 [2018-06-25 09:49:29,023 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-25 09:49:29,024 INFO ]: Start minimizeSevpa. Operand 1451 states. [2018-06-25 09:49:29,161 INFO ]: Finished minimizeSevpa. Reduced states from 1451 to 803. [2018-06-25 09:49:29,161 INFO ]: Start removeUnreachable. Operand 803 states. [2018-06-25 09:49:29,183 INFO ]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1962 transitions. [2018-06-25 09:49:29,183 INFO ]: Start accepts. Automaton has 803 states and 1962 transitions. Word has length 25 [2018-06-25 09:49:29,183 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:29,183 INFO ]: Abstraction has 803 states and 1962 transitions. [2018-06-25 09:49:29,183 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:49:29,183 INFO ]: Start isEmpty. Operand 803 states and 1962 transitions. [2018-06-25 09:49:29,209 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:49:29,209 INFO ]: Found error trace [2018-06-25 09:49:29,209 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:29,209 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:29,209 INFO ]: Analyzing trace with hash -490215698, now seen corresponding path program 1 times [2018-06-25 09:49:29,209 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:29,209 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:29,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:29,210 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:29,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:29,217 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:29,283 INFO ]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-25 09:49:29,283 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:29,283 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:49:29,283 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:49:29,283 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:49:29,283 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:49:29,284 INFO ]: Start difference. First operand 803 states and 1962 transitions. Second operand 3 states. [2018-06-25 09:49:29,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:29,873 INFO ]: Finished difference Result 1397 states and 4332 transitions. [2018-06-25 09:49:29,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:49:29,873 INFO ]: Start accepts. Automaton has 3 states. Word has length 27 [2018-06-25 09:49:29,873 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:30,051 INFO ]: With dead ends: 1397 [2018-06-25 09:49:30,052 INFO ]: Without dead ends: 1397 [2018-06-25 09:49:30,052 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-25 09:49:30,053 INFO ]: Start minimizeSevpa. Operand 1397 states. [2018-06-25 09:49:30,185 INFO ]: Finished minimizeSevpa. Reduced states from 1397 to 812. [2018-06-25 09:49:30,185 INFO ]: Start removeUnreachable. Operand 812 states. [2018-06-25 09:49:30,208 INFO ]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2007 transitions. [2018-06-25 09:49:30,208 INFO ]: Start accepts. Automaton has 812 states and 2007 transitions. Word has length 27 [2018-06-25 09:49:30,209 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:30,209 INFO ]: Abstraction has 812 states and 2007 transitions. [2018-06-25 09:49:30,209 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:49:30,209 INFO ]: Start isEmpty. Operand 812 states and 2007 transitions. [2018-06-25 09:49:30,238 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:49:30,238 INFO ]: Found error trace [2018-06-25 09:49:30,238 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:30,238 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:30,240 INFO ]: Analyzing trace with hash -1079666840, now seen corresponding path program 1 times [2018-06-25 09:49:30,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:30,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:30,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:30,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:30,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:30,250 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:30,315 INFO ]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-25 09:49:30,315 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:30,315 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:49:30,315 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:49:30,315 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:49:30,315 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:49:30,315 INFO ]: Start difference. First operand 812 states and 2007 transitions. Second operand 3 states. [2018-06-25 09:49:30,905 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:30,915 INFO ]: Finished difference Result 1460 states and 4602 transitions. [2018-06-25 09:49:30,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:49:30,916 INFO ]: Start accepts. Automaton has 3 states. Word has length 27 [2018-06-25 09:49:30,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:31,120 INFO ]: With dead ends: 1460 [2018-06-25 09:49:31,120 INFO ]: Without dead ends: 1460 [2018-06-25 09:49:31,120 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-25 09:49:31,121 INFO ]: Start minimizeSevpa. Operand 1460 states. [2018-06-25 09:49:31,244 INFO ]: Finished minimizeSevpa. Reduced states from 1460 to 830. [2018-06-25 09:49:31,244 INFO ]: Start removeUnreachable. Operand 830 states. [2018-06-25 09:49:31,270 INFO ]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2070 transitions. [2018-06-25 09:49:31,270 INFO ]: Start accepts. Automaton has 830 states and 2070 transitions. Word has length 27 [2018-06-25 09:49:31,270 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:31,270 INFO ]: Abstraction has 830 states and 2070 transitions. [2018-06-25 09:49:31,270 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:49:31,270 INFO ]: Start isEmpty. Operand 830 states and 2070 transitions. [2018-06-25 09:49:31,300 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:49:31,300 INFO ]: Found error trace [2018-06-25 09:49:31,300 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:31,300 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:31,300 INFO ]: Analyzing trace with hash -647927568, now seen corresponding path program 1 times [2018-06-25 09:49:31,300 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:31,300 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:31,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:31,303 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:31,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:31,312 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:31,349 INFO ]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:49:31,349 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:31,349 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:49:31,349 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:49:31,349 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:49:31,349 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:49:31,349 INFO ]: Start difference. First operand 830 states and 2070 transitions. Second operand 3 states. [2018-06-25 09:49:31,501 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:31,501 INFO ]: Finished difference Result 1514 states and 4764 transitions. [2018-06-25 09:49:31,501 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:49:31,501 INFO ]: Start accepts. Automaton has 3 states. Word has length 27 [2018-06-25 09:49:31,502 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:31,617 INFO ]: With dead ends: 1514 [2018-06-25 09:49:31,617 INFO ]: Without dead ends: 1514 [2018-06-25 09:49:31,618 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-25 09:49:31,621 INFO ]: Start minimizeSevpa. Operand 1514 states. [2018-06-25 09:49:31,756 INFO ]: Finished minimizeSevpa. Reduced states from 1514 to 839. [2018-06-25 09:49:31,756 INFO ]: Start removeUnreachable. Operand 839 states. [2018-06-25 09:49:31,782 INFO ]: Finished removeUnreachable. Reduced from 839 states to 839 states and 2106 transitions. [2018-06-25 09:49:31,782 INFO ]: Start accepts. Automaton has 839 states and 2106 transitions. Word has length 27 [2018-06-25 09:49:31,782 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:31,782 INFO ]: Abstraction has 839 states and 2106 transitions. [2018-06-25 09:49:31,782 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:49:31,782 INFO ]: Start isEmpty. Operand 839 states and 2106 transitions. [2018-06-25 09:49:31,817 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:49:31,817 INFO ]: Found error trace [2018-06-25 09:49:31,817 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:31,817 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:31,817 INFO ]: Analyzing trace with hash -1406394330, now seen corresponding path program 1 times [2018-06-25 09:49:31,817 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:31,817 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:31,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:31,818 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:31,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:31,828 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:31,980 INFO ]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:49:31,980 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:49:31,980 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:49:31,994 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:32,031 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:32,033 INFO ]: Computing forward predicates... [2018-06-25 09:49:32,194 INFO ]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-25 09:49:32,213 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:49:32,213 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2018-06-25 09:49:32,213 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:49:32,214 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:49:32,214 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:49:32,214 INFO ]: Start difference. First operand 839 states and 2106 transitions. Second operand 11 states. [2018-06-25 09:49:32,869 WARN ]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-25 09:49:46,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:46,840 INFO ]: Finished difference Result 8656 states and 87903 transitions. [2018-06-25 09:49:46,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-25 09:49:46,840 INFO ]: Start accepts. Automaton has 11 states. Word has length 29 [2018-06-25 09:49:46,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:50,150 INFO ]: With dead ends: 8656 [2018-06-25 09:49:50,150 INFO ]: Without dead ends: 8125 [2018-06-25 09:49:50,150 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1709, Unknown=0, NotChecked=0, Total=2070 [2018-06-25 09:49:50,154 INFO ]: Start minimizeSevpa. Operand 8125 states. [2018-06-25 09:49:57,079 INFO ]: Finished minimizeSevpa. Reduced states from 8125 to 1145. [2018-06-25 09:49:57,079 INFO ]: Start removeUnreachable. Operand 1145 states. [2018-06-25 09:49:57,107 INFO ]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 3150 transitions. [2018-06-25 09:49:57,107 INFO ]: Start accepts. Automaton has 1145 states and 3150 transitions. Word has length 29 [2018-06-25 09:49:57,107 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:57,107 INFO ]: Abstraction has 1145 states and 3150 transitions. [2018-06-25 09:49:57,107 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:49:57,107 INFO ]: Start isEmpty. Operand 1145 states and 3150 transitions. [2018-06-25 09:49:57,138 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 09:49:57,138 INFO ]: Found error trace [2018-06-25 09:49:57,138 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:57,138 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:57,138 INFO ]: Analyzing trace with hash 854619131, now seen corresponding path program 1 times [2018-06-25 09:49:57,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:57,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:57,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:57,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:57,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:57,157 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:57,218 INFO ]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 09:49:57,218 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:49:57,218 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:49:57,250 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:57,285 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:57,287 INFO ]: Computing forward predicates... [2018-06-25 09:49:57,294 INFO ]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:49:57,326 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:49:57,326 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-25 09:49:57,327 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:49:57,327 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:49:57,327 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:49:57,327 INFO ]: Start difference. First operand 1145 states and 3150 transitions. Second operand 3 states. [2018-06-25 09:49:57,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:57,617 INFO ]: Finished difference Result 2114 states and 7812 transitions. [2018-06-25 09:49:57,618 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:49:57,618 INFO ]: Start accepts. Automaton has 3 states. Word has length 31 [2018-06-25 09:49:57,618 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:57,781 INFO ]: With dead ends: 2114 [2018-06-25 09:49:57,781 INFO ]: Without dead ends: 2114 [2018-06-25 09:49:57,781 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 32 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-25 09:49:57,782 INFO ]: Start minimizeSevpa. Operand 2114 states. [2018-06-25 09:49:57,930 INFO ]: Finished minimizeSevpa. Reduced states from 2114 to 1157. [2018-06-25 09:49:57,930 INFO ]: Start removeUnreachable. Operand 1157 states. [2018-06-25 09:49:57,959 INFO ]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 3246 transitions. [2018-06-25 09:49:57,959 INFO ]: Start accepts. Automaton has 1157 states and 3246 transitions. Word has length 31 [2018-06-25 09:49:57,959 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:57,959 INFO ]: Abstraction has 1157 states and 3246 transitions. [2018-06-25 09:49:57,959 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:49:57,959 INFO ]: Start isEmpty. Operand 1157 states and 3246 transitions. [2018-06-25 09:49:57,979 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 09:49:57,979 INFO ]: Found error trace [2018-06-25 09:49:57,979 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:57,979 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:57,979 INFO ]: Analyzing trace with hash 1375356932, now seen corresponding path program 1 times [2018-06-25 09:49:57,979 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:57,979 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:57,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:57,980 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:57,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:57,985 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:58,025 INFO ]: Checked inductivity of 19 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:49:58,025 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:49:58,025 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-25 09:49:58,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:58,050 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:58,052 INFO ]: Computing forward predicates... [2018-06-25 09:49:58,056 INFO ]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:49:58,075 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:49:58,075 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-25 09:49:58,075 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:49:58,076 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:49:58,076 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:49:58,076 INFO ]: Start difference. First operand 1157 states and 3246 transitions. Second operand 4 states. [2018-06-25 09:49:58,298 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:58,298 INFO ]: Finished difference Result 1239 states and 3487 transitions. [2018-06-25 09:49:58,299 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:49:58,299 INFO ]: Start accepts. Automaton has 4 states. Word has length 31 [2018-06-25 09:49:58,299 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:58,334 INFO ]: With dead ends: 1239 [2018-06-25 09:49:58,335 INFO ]: Without dead ends: 1157 [2018-06-25 09:49:58,335 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:49:58,336 INFO ]: Start minimizeSevpa. Operand 1157 states. [2018-06-25 09:49:58,379 INFO ]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2018-06-25 09:49:58,380 INFO ]: Start removeUnreachable. Operand 1157 states. [2018-06-25 09:49:58,405 INFO ]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 3241 transitions. [2018-06-25 09:49:58,405 INFO ]: Start accepts. Automaton has 1157 states and 3241 transitions. Word has length 31 [2018-06-25 09:49:58,405 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:58,405 INFO ]: Abstraction has 1157 states and 3241 transitions. [2018-06-25 09:49:58,405 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:49:58,405 INFO ]: Start isEmpty. Operand 1157 states and 3241 transitions. [2018-06-25 09:49:58,423 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 09:49:58,423 INFO ]: Found error trace [2018-06-25 09:49:58,423 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:58,423 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:58,423 INFO ]: Analyzing trace with hash 577122111, now seen corresponding path program 1 times [2018-06-25 09:49:58,423 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:58,423 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:58,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:58,424 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:58,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:58,437 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:58,614 INFO ]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 09:49:58,614 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:58,614 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:49:58,614 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:49:58,614 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:49:58,614 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:49:58,614 INFO ]: Start difference. First operand 1157 states and 3241 transitions. Second operand 5 states. [2018-06-25 09:50:00,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:00,437 INFO ]: Finished difference Result 5078 states and 44146 transitions. [2018-06-25 09:50:00,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:50:00,437 INFO ]: Start accepts. Automaton has 5 states. Word has length 33 [2018-06-25 09:50:00,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:01,372 INFO ]: With dead ends: 5078 [2018-06-25 09:50:01,372 INFO ]: Without dead ends: 5078 [2018-06-25 09:50:01,372 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:50:01,374 INFO ]: Start minimizeSevpa. Operand 5078 states. Received shutdown request... [2018-06-25 09:50:01,965 WARN ]: Verification canceled [2018-06-25 09:50:01,968 WARN ]: Timeout [2018-06-25 09:50:01,968 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:50:01 BoogieIcfgContainer [2018-06-25 09:50:01,968 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:50:01,969 INFO ]: Toolchain (without parser) took 55063.18 ms. Allocated memory was 309.9 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 258.4 MB in the beginning and 472.9 MB in the end (delta: -214.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 3.6 GB. [2018-06-25 09:50:01,970 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 274.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:50:01,970 INFO ]: ChcToBoogie took 83.12 ms. Allocated memory is still 309.9 MB. Free memory was 258.4 MB in the beginning and 254.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:01,970 INFO ]: Boogie Preprocessor took 66.33 ms. Allocated memory is still 309.9 MB. Free memory was 254.4 MB in the beginning and 252.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:01,971 INFO ]: RCFGBuilder took 1038.65 ms. Allocated memory is still 309.9 MB. Free memory was 252.4 MB in the beginning and 218.5 MB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:01,971 INFO ]: TraceAbstraction took 53867.87 ms. Allocated memory was 309.9 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 218.5 MB in the beginning and 472.9 MB in the end (delta: -254.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 3.6 GB. [2018-06-25 09:50:01,974 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 274.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 83.12 ms. Allocated memory is still 309.9 MB. Free memory was 258.4 MB in the beginning and 254.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 66.33 ms. Allocated memory is still 309.9 MB. Free memory was 254.4 MB in the beginning and 252.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1038.65 ms. Allocated memory is still 309.9 MB. Free memory was 252.4 MB in the beginning and 218.5 MB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 53867.87 ms. Allocated memory was 309.9 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 218.5 MB in the beginning and 472.9 MB in the end (delta: -254.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. TIMEOUT Result, 53.8s OverallTime, 19 OverallIterations, 3 TraceHistogramMax, 40.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5838 SDtfs, 3904 SDslu, 10887 SDs, 0 SdLazy, 13715 SolverSat, 5123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1157occurred 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: 9.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 12347 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 499 ConstructedInterpolants, 0 QuantifiedInterpolants, 16672 SizeOfPredicates, 12 NumberOfNonLiveVariables, 802 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 24 InterpolantComputations, 19 PerfectInterpolantSequences, 195/208 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__ackermann!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-50-01-992.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__ackermann!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-50-01-992.csv Completed graceful shutdown