java -Xss1g -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_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/digits10_inl_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:59:44,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:59:44,014 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:59:44,028 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:59:44,028 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:59:44,029 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:59:44,030 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:59:44,034 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:59:44,035 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:59:44,037 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:59:44,038 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:59:44,038 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:59:44,039 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:59:44,040 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:59:44,040 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:59:44,044 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:59:44,046 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:59:44,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:59:44,059 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:59:44,060 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:59:44,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:59:44,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:59:44,065 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:59:44,065 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:59:44,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:59:44,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:59:44,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:59:44,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:59:44,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:59:44,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:59:44,072 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:59:44,073 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:59:44,073 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:59:44,073 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:59:44,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:59:44,080 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 10:59:44,102 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:59:44,102 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:59:44,103 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:59:44,103 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:59:44,104 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:59:44,104 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:59:44,104 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:59:44,104 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:59:44,105 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:59:44,108 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:59:44,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:59:44,108 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:59:44,109 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:59:44,109 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:59:44,109 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:59:44,109 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:59:44,109 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:59:44,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:59:44,110 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:59:44,111 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:59:44,111 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:59:44,155 INFO ]: Repository-Root is: /tmp [2018-06-22 10:59:44,170 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:59:44,176 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:59:44,178 INFO ]: Initializing SmtParser... [2018-06-22 10:59:44,178 INFO ]: SmtParser initialized [2018-06-22 10:59:44,179 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/digits10_inl_merged_safe.c-1.smt2 [2018-06-22 10:59:44,180 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-22 10:59:44,270 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/digits10_inl_merged_safe.c-1.smt2 unknown [2018-06-22 10:59:45,378 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/digits10_inl_merged_safe.c-1.smt2 [2018-06-22 10:59:45,383 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:59:45,388 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:59:45,389 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:59:45,389 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:59:45,389 INFO ]: ChcToBoogie initialized [2018-06-22 10:59:45,392 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:59:45" (1/1) ... [2018-06-22 10:59:45,502 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:45 Unit [2018-06-22 10:59:45,502 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:59:45,503 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:59:45,503 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:59:45,503 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:59:45,532 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:45" (1/1) ... [2018-06-22 10:59:45,532 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:45" (1/1) ... [2018-06-22 10:59:45,556 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:45" (1/1) ... [2018-06-22 10:59:45,556 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:45" (1/1) ... [2018-06-22 10:59:45,578 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:45" (1/1) ... [2018-06-22 10:59:45,580 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:45" (1/1) ... [2018-06-22 10:59:45,589 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:45" (1/1) ... [2018-06-22 10:59:45,599 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:59:45,599 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:59:45,600 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:59:45,600 INFO ]: RCFGBuilder initialized [2018-06-22 10:59:45,600 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:45" (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-22 10:59:45,618 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:59:45,618 INFO ]: Found specification of procedure False [2018-06-22 10:59:45,618 INFO ]: Found implementation of procedure False [2018-06-22 10:59:45,618 INFO ]: Specification and implementation of procedure inv_main11 given in one single declaration [2018-06-22 10:59:45,618 INFO ]: Found specification of procedure inv_main11 [2018-06-22 10:59:45,618 INFO ]: Found implementation of procedure inv_main11 [2018-06-22 10:59:45,618 INFO ]: Specification and implementation of procedure inv_main9 given in one single declaration [2018-06-22 10:59:45,618 INFO ]: Found specification of procedure inv_main9 [2018-06-22 10:59:45,618 INFO ]: Found implementation of procedure inv_main9 [2018-06-22 10:59:45,618 INFO ]: Specification and implementation of procedure inv_main4 given in one single declaration [2018-06-22 10:59:45,618 INFO ]: Found specification of procedure inv_main4 [2018-06-22 10:59:45,618 INFO ]: Found implementation of procedure inv_main4 [2018-06-22 10:59:45,618 INFO ]: Specification and implementation of procedure inv_main26 given in one single declaration [2018-06-22 10:59:45,619 INFO ]: Found specification of procedure inv_main26 [2018-06-22 10:59:45,619 INFO ]: Found implementation of procedure inv_main26 [2018-06-22 10:59:45,619 INFO ]: Specification and implementation of procedure inv_main10 given in one single declaration [2018-06-22 10:59:45,619 INFO ]: Found specification of procedure inv_main10 [2018-06-22 10:59:45,619 INFO ]: Found implementation of procedure inv_main10 [2018-06-22 10:59:45,619 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:59:45,619 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:59:45,619 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-22 10:59:46,897 INFO ]: Using library mode [2018-06-22 10:59:46,897 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:59:46 BoogieIcfgContainer [2018-06-22 10:59:46,897 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:59:46,899 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:59:46,899 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:59:46,904 INFO ]: TraceAbstraction initialized [2018-06-22 10:59:46,904 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:59:45" (1/3) ... [2018-06-22 10:59:46,905 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db8af1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:59:46, skipping insertion in model container [2018-06-22 10:59:46,905 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:45" (2/3) ... [2018-06-22 10:59:46,906 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db8af1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:59:46, skipping insertion in model container [2018-06-22 10:59:46,906 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:59:46" (3/3) ... [2018-06-22 10:59:46,908 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:59:46,917 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:59:46,927 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:59:46,974 INFO ]: Using default assertion order modulation [2018-06-22 10:59:46,975 INFO ]: Interprodecural is true [2018-06-22 10:59:46,975 INFO ]: Hoare is false [2018-06-22 10:59:46,975 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:59:46,975 INFO ]: Backedges is TWOTRACK [2018-06-22 10:59:46,975 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:59:46,975 INFO ]: Difference is false [2018-06-22 10:59:46,975 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:59:46,975 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:59:46,995 INFO ]: Start isEmpty. Operand 38 states. [2018-06-22 10:59:47,015 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:59:47,015 INFO ]: Found error trace [2018-06-22 10:59:47,016 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:47,016 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:47,021 INFO ]: Analyzing trace with hash -436460481, now seen corresponding path program 1 times [2018-06-22 10:59:47,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:47,024 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:47,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:47,072 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:47,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:47,122 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:47,242 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:59:47,246 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:59:47,246 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 10:59:47,248 INFO ]: Interpolant automaton has 4 states [2018-06-22 10:59:47,263 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 10:59:47,263 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:59:47,266 INFO ]: Start difference. First operand 38 states. Second operand 4 states. [2018-06-22 10:59:47,442 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:47,443 INFO ]: Finished difference Result 36 states and 54 transitions. [2018-06-22 10:59:47,443 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 10:59:47,444 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 10:59:47,445 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:47,458 INFO ]: With dead ends: 36 [2018-06-22 10:59:47,458 INFO ]: Without dead ends: 35 [2018-06-22 10:59:47,460 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:59:47,479 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 10:59:47,507 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 10:59:47,509 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 10:59:47,510 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2018-06-22 10:59:47,511 INFO ]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 17 [2018-06-22 10:59:47,511 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:47,511 INFO ]: Abstraction has 35 states and 52 transitions. [2018-06-22 10:59:47,512 INFO ]: Interpolant automaton has 4 states. [2018-06-22 10:59:47,512 INFO ]: Start isEmpty. Operand 35 states and 52 transitions. [2018-06-22 10:59:47,514 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:59:47,514 INFO ]: Found error trace [2018-06-22 10:59:47,514 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:47,514 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:47,514 INFO ]: Analyzing trace with hash -468259211, now seen corresponding path program 1 times [2018-06-22 10:59:47,514 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:47,514 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:47,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:47,515 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:47,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:47,526 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:47,704 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:59:47,704 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:59:47,704 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 10:59:47,705 INFO ]: Interpolant automaton has 5 states [2018-06-22 10:59:47,705 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 10:59:47,706 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:59:47,706 INFO ]: Start difference. First operand 35 states and 52 transitions. Second operand 5 states. [2018-06-22 10:59:48,011 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:48,011 INFO ]: Finished difference Result 39 states and 61 transitions. [2018-06-22 10:59:48,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 10:59:48,011 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 10:59:48,012 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:48,013 INFO ]: With dead ends: 39 [2018-06-22 10:59:48,013 INFO ]: Without dead ends: 39 [2018-06-22 10:59:48,014 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:59:48,014 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 10:59:48,024 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 10:59:48,025 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 10:59:48,026 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2018-06-22 10:59:48,026 INFO ]: Start accepts. Automaton has 39 states and 61 transitions. Word has length 21 [2018-06-22 10:59:48,027 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:48,027 INFO ]: Abstraction has 39 states and 61 transitions. [2018-06-22 10:59:48,027 INFO ]: Interpolant automaton has 5 states. [2018-06-22 10:59:48,027 INFO ]: Start isEmpty. Operand 39 states and 61 transitions. [2018-06-22 10:59:48,029 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:59:48,029 INFO ]: Found error trace [2018-06-22 10:59:48,029 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:48,029 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:48,030 INFO ]: Analyzing trace with hash 1347884004, now seen corresponding path program 1 times [2018-06-22 10:59:48,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:48,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:48,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:48,030 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:48,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:48,043 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:48,226 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:59:48,226 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:59:48,226 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:59:48,227 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:59:48,227 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:59:48,227 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:59:48,227 INFO ]: Start difference. First operand 39 states and 61 transitions. Second operand 6 states. [2018-06-22 10:59:48,823 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:48,823 INFO ]: Finished difference Result 53 states and 97 transitions. [2018-06-22 10:59:48,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:59:48,823 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 10:59:48,823 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:48,826 INFO ]: With dead ends: 53 [2018-06-22 10:59:48,826 INFO ]: Without dead ends: 53 [2018-06-22 10:59:48,826 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:59:48,826 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 10:59:48,840 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-06-22 10:59:48,840 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 10:59:48,842 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 97 transitions. [2018-06-22 10:59:48,842 INFO ]: Start accepts. Automaton has 53 states and 97 transitions. Word has length 25 [2018-06-22 10:59:48,842 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:48,842 INFO ]: Abstraction has 53 states and 97 transitions. [2018-06-22 10:59:48,842 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:59:48,842 INFO ]: Start isEmpty. Operand 53 states and 97 transitions. [2018-06-22 10:59:48,844 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:59:48,844 INFO ]: Found error trace [2018-06-22 10:59:48,845 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:48,845 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:48,845 INFO ]: Analyzing trace with hash 852995610, now seen corresponding path program 1 times [2018-06-22 10:59:48,845 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:48,845 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:48,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:48,846 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:48,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:48,856 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:48,938 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:59:48,939 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:59:48,939 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:59:48,939 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:59:48,939 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:59:48,939 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:59:48,939 INFO ]: Start difference. First operand 53 states and 97 transitions. Second operand 6 states. [2018-06-22 10:59:49,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:49,454 INFO ]: Finished difference Result 60 states and 115 transitions. [2018-06-22 10:59:49,455 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:59:49,455 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 10:59:49,455 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:49,457 INFO ]: With dead ends: 60 [2018-06-22 10:59:49,457 INFO ]: Without dead ends: 60 [2018-06-22 10:59:49,458 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:59:49,458 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 10:59:49,478 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-22 10:59:49,478 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 10:59:49,480 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 115 transitions. [2018-06-22 10:59:49,480 INFO ]: Start accepts. Automaton has 60 states and 115 transitions. Word has length 25 [2018-06-22 10:59:49,481 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:49,481 INFO ]: Abstraction has 60 states and 115 transitions. [2018-06-22 10:59:49,481 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:59:49,481 INFO ]: Start isEmpty. Operand 60 states and 115 transitions. [2018-06-22 10:59:49,483 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:59:49,483 INFO ]: Found error trace [2018-06-22 10:59:49,483 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:49,483 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:49,483 INFO ]: Analyzing trace with hash 1100439807, now seen corresponding path program 1 times [2018-06-22 10:59:49,483 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:49,483 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:49,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:49,484 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:49,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:49,496 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:49,570 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:59:49,570 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:49,570 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-22 10:59:49,582 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:49,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:49,627 INFO ]: Computing forward predicates... [2018-06-22 10:59:49,806 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:59:49,834 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:49,834 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-22 10:59:49,835 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:59:49,835 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:59:49,835 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:59:49,835 INFO ]: Start difference. First operand 60 states and 115 transitions. Second operand 14 states. [2018-06-22 10:59:50,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:50,531 INFO ]: Finished difference Result 76 states and 140 transitions. [2018-06-22 10:59:50,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:59:50,532 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 10:59:50,532 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:50,534 INFO ]: With dead ends: 76 [2018-06-22 10:59:50,534 INFO ]: Without dead ends: 74 [2018-06-22 10:59:50,534 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:59:50,534 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 10:59:50,553 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 62. [2018-06-22 10:59:50,553 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 10:59:50,554 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 117 transitions. [2018-06-22 10:59:50,555 INFO ]: Start accepts. Automaton has 62 states and 117 transitions. Word has length 25 [2018-06-22 10:59:50,555 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:50,555 INFO ]: Abstraction has 62 states and 117 transitions. [2018-06-22 10:59:50,555 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:59:50,555 INFO ]: Start isEmpty. Operand 62 states and 117 transitions. [2018-06-22 10:59:50,557 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:59:50,557 INFO ]: Found error trace [2018-06-22 10:59:50,557 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:50,557 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:50,557 INFO ]: Analyzing trace with hash 119403067, now seen corresponding path program 1 times [2018-06-22 10:59:50,557 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:50,557 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:50,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:50,558 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:50,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:50,633 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:50,814 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:59:50,814 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:59:50,814 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:59:50,814 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:59:50,814 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:59:50,815 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:59:50,815 INFO ]: Start difference. First operand 62 states and 117 transitions. Second operand 6 states. [2018-06-22 10:59:50,889 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:50,889 INFO ]: Finished difference Result 78 states and 145 transitions. [2018-06-22 10:59:50,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:59:50,890 INFO ]: Start accepts. Automaton has 6 states. Word has length 29 [2018-06-22 10:59:50,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:50,891 INFO ]: With dead ends: 78 [2018-06-22 10:59:50,891 INFO ]: Without dead ends: 78 [2018-06-22 10:59:50,892 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:59:50,892 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 10:59:50,904 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 62. [2018-06-22 10:59:50,904 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 10:59:50,905 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 117 transitions. [2018-06-22 10:59:50,906 INFO ]: Start accepts. Automaton has 62 states and 117 transitions. Word has length 29 [2018-06-22 10:59:50,906 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:50,906 INFO ]: Abstraction has 62 states and 117 transitions. [2018-06-22 10:59:50,906 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:59:50,906 INFO ]: Start isEmpty. Operand 62 states and 117 transitions. [2018-06-22 10:59:50,907 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:59:50,907 INFO ]: Found error trace [2018-06-22 10:59:50,908 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:50,908 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:50,908 INFO ]: Analyzing trace with hash -768996196, now seen corresponding path program 1 times [2018-06-22 10:59:50,908 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:50,908 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:50,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:50,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:50,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:50,918 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:51,104 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:59:51,104 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:59:51,104 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 10:59:51,104 INFO ]: Interpolant automaton has 8 states [2018-06-22 10:59:51,104 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 10:59:51,104 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:59:51,105 INFO ]: Start difference. First operand 62 states and 117 transitions. Second operand 8 states. [2018-06-22 10:59:51,483 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:51,483 INFO ]: Finished difference Result 91 states and 160 transitions. [2018-06-22 10:59:51,485 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:59:51,485 INFO ]: Start accepts. Automaton has 8 states. Word has length 29 [2018-06-22 10:59:51,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:51,487 INFO ]: With dead ends: 91 [2018-06-22 10:59:51,487 INFO ]: Without dead ends: 91 [2018-06-22 10:59:51,488 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-06-22 10:59:51,488 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 10:59:51,500 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 67. [2018-06-22 10:59:51,500 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 10:59:51,501 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 123 transitions. [2018-06-22 10:59:51,502 INFO ]: Start accepts. Automaton has 67 states and 123 transitions. Word has length 29 [2018-06-22 10:59:51,502 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:51,502 INFO ]: Abstraction has 67 states and 123 transitions. [2018-06-22 10:59:51,502 INFO ]: Interpolant automaton has 8 states. [2018-06-22 10:59:51,502 INFO ]: Start isEmpty. Operand 67 states and 123 transitions. [2018-06-22 10:59:51,503 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:59:51,503 INFO ]: Found error trace [2018-06-22 10:59:51,503 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:51,504 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:51,504 INFO ]: Analyzing trace with hash -2114144767, now seen corresponding path program 1 times [2018-06-22 10:59:51,504 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:51,504 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:51,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:51,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:51,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:51,512 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:51,561 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 10:59:51,561 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:59:51,561 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:59:51,562 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:59:51,562 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:59:51,562 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:59:51,562 INFO ]: Start difference. First operand 67 states and 123 transitions. Second operand 6 states. [2018-06-22 10:59:51,761 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:51,761 INFO ]: Finished difference Result 77 states and 133 transitions. [2018-06-22 10:59:51,761 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 10:59:51,761 INFO ]: Start accepts. Automaton has 6 states. Word has length 29 [2018-06-22 10:59:51,761 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:51,762 INFO ]: With dead ends: 77 [2018-06-22 10:59:51,762 INFO ]: Without dead ends: 75 [2018-06-22 10:59:51,763 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:59:51,763 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 10:59:51,773 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 65. [2018-06-22 10:59:51,773 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 10:59:51,775 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 115 transitions. [2018-06-22 10:59:51,775 INFO ]: Start accepts. Automaton has 65 states and 115 transitions. Word has length 29 [2018-06-22 10:59:51,775 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:51,775 INFO ]: Abstraction has 65 states and 115 transitions. [2018-06-22 10:59:51,775 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:59:51,775 INFO ]: Start isEmpty. Operand 65 states and 115 transitions. [2018-06-22 10:59:51,776 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 10:59:51,776 INFO ]: Found error trace [2018-06-22 10:59:51,776 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:51,776 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:51,776 INFO ]: Analyzing trace with hash 221881925, now seen corresponding path program 1 times [2018-06-22 10:59:51,776 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:51,776 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:51,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:51,777 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:51,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:51,843 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:52,098 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 10:59:52,098 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:52,098 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-22 10:59:52,115 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:52,184 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:52,188 INFO ]: Computing forward predicates... [2018-06-22 10:59:52,524 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 10:59:52,545 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:52,545 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 10:59:52,545 INFO ]: Interpolant automaton has 9 states [2018-06-22 10:59:52,545 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 10:59:52,545 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:59:52,545 INFO ]: Start difference. First operand 65 states and 115 transitions. Second operand 9 states. [2018-06-22 10:59:52,835 WARN ]: Spent 117.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-06-22 10:59:53,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:53,353 INFO ]: Finished difference Result 81 states and 148 transitions. [2018-06-22 10:59:53,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:59:53,353 INFO ]: Start accepts. Automaton has 9 states. Word has length 33 [2018-06-22 10:59:53,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:53,354 INFO ]: With dead ends: 81 [2018-06-22 10:59:53,354 INFO ]: Without dead ends: 80 [2018-06-22 10:59:53,354 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:59:53,355 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-22 10:59:53,363 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 64. [2018-06-22 10:59:53,363 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 10:59:53,364 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2018-06-22 10:59:53,364 INFO ]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 33 [2018-06-22 10:59:53,364 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:53,364 INFO ]: Abstraction has 64 states and 112 transitions. [2018-06-22 10:59:53,364 INFO ]: Interpolant automaton has 9 states. [2018-06-22 10:59:53,364 INFO ]: Start isEmpty. Operand 64 states and 112 transitions. [2018-06-22 10:59:53,367 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 10:59:53,367 INFO ]: Found error trace [2018-06-22 10:59:53,367 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:53,367 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:53,367 INFO ]: Analyzing trace with hash 62080608, now seen corresponding path program 1 times [2018-06-22 10:59:53,367 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:53,367 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:53,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:53,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:53,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:53,405 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:53,834 WARN ]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 10:59:54,315 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 10:59:54,315 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:54,316 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-22 10:59:54,327 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:54,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:54,365 INFO ]: Computing forward predicates... [2018-06-22 10:59:54,416 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 10:59:54,444 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:54,444 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 10:59:54,445 INFO ]: Interpolant automaton has 9 states [2018-06-22 10:59:54,445 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 10:59:54,445 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:59:54,445 INFO ]: Start difference. First operand 64 states and 112 transitions. Second operand 9 states. [2018-06-22 10:59:54,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:54,918 INFO ]: Finished difference Result 88 states and 159 transitions. [2018-06-22 10:59:54,919 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:59:54,919 INFO ]: Start accepts. Automaton has 9 states. Word has length 33 [2018-06-22 10:59:54,919 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:54,920 INFO ]: With dead ends: 88 [2018-06-22 10:59:54,920 INFO ]: Without dead ends: 85 [2018-06-22 10:59:54,920 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:59:54,921 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 10:59:54,934 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-06-22 10:59:54,934 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 10:59:54,936 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 141 transitions. [2018-06-22 10:59:54,936 INFO ]: Start accepts. Automaton has 77 states and 141 transitions. Word has length 33 [2018-06-22 10:59:54,936 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:54,936 INFO ]: Abstraction has 77 states and 141 transitions. [2018-06-22 10:59:54,936 INFO ]: Interpolant automaton has 9 states. [2018-06-22 10:59:54,936 INFO ]: Start isEmpty. Operand 77 states and 141 transitions. [2018-06-22 10:59:54,937 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 10:59:54,937 INFO ]: Found error trace [2018-06-22 10:59:54,937 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:54,937 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:54,937 INFO ]: Analyzing trace with hash 381683242, now seen corresponding path program 1 times [2018-06-22 10:59:54,937 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:54,937 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:54,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:54,938 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:54,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:54,970 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:55,151 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 10:59:55,152 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:55,152 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-22 10:59:55,161 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:55,206 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:55,209 INFO ]: Computing forward predicates... [2018-06-22 10:59:57,278 WARN ]: Spent 1.11 s on a formula simplification. DAG size of input: 112 DAG size of output: 32 [2018-06-22 11:00:01,591 WARN ]: Spent 1.03 s on a formula simplification. DAG size of input: 82 DAG size of output: 28 [2018-06-22 11:00:02,180 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:02,200 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:02,200 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:00:02,200 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:00:02,200 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:00:02,200 INFO ]: CoverageRelationStatistics Valid=26, Invalid=125, Unknown=5, NotChecked=0, Total=156 [2018-06-22 11:00:02,200 INFO ]: Start difference. First operand 77 states and 141 transitions. Second operand 13 states. [2018-06-22 11:00:07,219 WARN ]: Spent 2.81 s on a formula simplification. DAG size of input: 35 DAG size of output: 19 [2018-06-22 11:00:17,516 WARN ]: Spent 2.55 s on a formula simplification. DAG size of input: 41 DAG size of output: 27 [2018-06-22 11:00:23,944 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:23,944 INFO ]: Finished difference Result 109 states and 217 transitions. [2018-06-22 11:00:23,944 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:00:23,944 INFO ]: Start accepts. Automaton has 13 states. Word has length 33 [2018-06-22 11:00:23,944 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:23,945 INFO ]: With dead ends: 109 [2018-06-22 11:00:23,945 INFO ]: Without dead ends: 109 [2018-06-22 11:00:23,946 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=51, Invalid=249, Unknown=6, NotChecked=0, Total=306 [2018-06-22 11:00:23,946 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-22 11:00:23,961 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 95. [2018-06-22 11:00:23,961 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-22 11:00:23,963 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 192 transitions. [2018-06-22 11:00:23,963 INFO ]: Start accepts. Automaton has 95 states and 192 transitions. Word has length 33 [2018-06-22 11:00:23,963 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:23,963 INFO ]: Abstraction has 95 states and 192 transitions. [2018-06-22 11:00:23,963 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:00:23,963 INFO ]: Start isEmpty. Operand 95 states and 192 transitions. [2018-06-22 11:00:23,965 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:00:23,965 INFO ]: Found error trace [2018-06-22 11:00:23,965 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:23,965 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:23,965 INFO ]: Analyzing trace with hash -1366609913, now seen corresponding path program 1 times [2018-06-22 11:00:23,965 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:23,965 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:23,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:23,966 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:23,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:23,979 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:24,160 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:24,160 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:24,160 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-22 11:00:24,165 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:24,186 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:24,189 INFO ]: Computing forward predicates... [2018-06-22 11:00:24,332 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:24,351 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:24,351 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-22 11:00:24,351 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:00:24,351 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:00:24,351 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:00:24,352 INFO ]: Start difference. First operand 95 states and 192 transitions. Second operand 16 states. [2018-06-22 11:00:24,771 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:24,771 INFO ]: Finished difference Result 139 states and 273 transitions. [2018-06-22 11:00:24,771 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:00:24,771 INFO ]: Start accepts. Automaton has 16 states. Word has length 33 [2018-06-22 11:00:24,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:24,773 INFO ]: With dead ends: 139 [2018-06-22 11:00:24,773 INFO ]: Without dead ends: 137 [2018-06-22 11:00:24,774 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:00:24,774 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-22 11:00:24,785 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 101. [2018-06-22 11:00:24,785 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-22 11:00:24,787 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 207 transitions. [2018-06-22 11:00:24,787 INFO ]: Start accepts. Automaton has 101 states and 207 transitions. Word has length 33 [2018-06-22 11:00:24,787 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:24,787 INFO ]: Abstraction has 101 states and 207 transitions. [2018-06-22 11:00:24,787 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:00:24,787 INFO ]: Start isEmpty. Operand 101 states and 207 transitions. [2018-06-22 11:00:24,789 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:00:24,789 INFO ]: Found error trace [2018-06-22 11:00:24,789 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:24,789 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:24,789 INFO ]: Analyzing trace with hash -148670732, now seen corresponding path program 1 times [2018-06-22 11:00:24,789 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:24,789 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:24,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:24,790 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:24,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:24,863 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:25,379 WARN ]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 11:00:25,667 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:25,667 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:25,667 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-22 11:00:25,683 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:25,763 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:25,769 INFO ]: Computing forward predicates... [2018-06-22 11:00:26,313 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:26,347 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:26,347 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:00:26,348 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:00:26,348 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:00:26,348 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:00:26,348 INFO ]: Start difference. First operand 101 states and 207 transitions. Second operand 13 states. [2018-06-22 11:00:31,652 WARN ]: Spent 246.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2018-06-22 11:00:31,848 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 81 [2018-06-22 11:00:32,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:32,198 INFO ]: Finished difference Result 123 states and 241 transitions. [2018-06-22 11:00:32,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:00:32,198 INFO ]: Start accepts. Automaton has 13 states. Word has length 33 [2018-06-22 11:00:32,199 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:32,200 INFO ]: With dead ends: 123 [2018-06-22 11:00:32,200 INFO ]: Without dead ends: 121 [2018-06-22 11:00:32,201 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:00:32,201 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-22 11:00:32,214 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 101. [2018-06-22 11:00:32,214 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-22 11:00:32,215 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 205 transitions. [2018-06-22 11:00:32,216 INFO ]: Start accepts. Automaton has 101 states and 205 transitions. Word has length 33 [2018-06-22 11:00:32,216 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:32,216 INFO ]: Abstraction has 101 states and 205 transitions. [2018-06-22 11:00:32,216 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:00:32,217 INFO ]: Start isEmpty. Operand 101 states and 205 transitions. [2018-06-22 11:00:32,218 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:00:32,218 INFO ]: Found error trace [2018-06-22 11:00:32,218 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:32,218 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:32,218 INFO ]: Analyzing trace with hash -2030977393, now seen corresponding path program 1 times [2018-06-22 11:00:32,218 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:32,218 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:32,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:32,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:32,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:32,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:32,330 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:32,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:32,330 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-22 11:00:32,336 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:32,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:32,369 INFO ]: Computing forward predicates... [2018-06-22 11:00:32,535 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:32,556 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:32,556 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:00:32,556 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:00:32,556 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:00:32,556 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:00:32,556 INFO ]: Start difference. First operand 101 states and 205 transitions. Second operand 12 states. [2018-06-22 11:00:33,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:33,095 INFO ]: Finished difference Result 139 states and 261 transitions. [2018-06-22 11:00:33,098 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:00:33,098 INFO ]: Start accepts. Automaton has 12 states. Word has length 33 [2018-06-22 11:00:33,098 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:33,100 INFO ]: With dead ends: 139 [2018-06-22 11:00:33,100 INFO ]: Without dead ends: 126 [2018-06-22 11:00:33,100 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:00:33,100 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-22 11:00:33,111 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 108. [2018-06-22 11:00:33,111 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 11:00:33,112 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 220 transitions. [2018-06-22 11:00:33,112 INFO ]: Start accepts. Automaton has 108 states and 220 transitions. Word has length 33 [2018-06-22 11:00:33,112 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:33,112 INFO ]: Abstraction has 108 states and 220 transitions. [2018-06-22 11:00:33,112 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:00:33,112 INFO ]: Start isEmpty. Operand 108 states and 220 transitions. [2018-06-22 11:00:33,113 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:00:33,113 INFO ]: Found error trace [2018-06-22 11:00:33,113 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:33,113 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:33,114 INFO ]: Analyzing trace with hash 541484559, now seen corresponding path program 1 times [2018-06-22 11:00:33,114 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:33,114 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:33,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:33,114 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:33,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:33,160 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:33,541 WARN ]: Spent 222.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 11:00:34,243 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:34,243 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:34,243 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-22 11:00:34,251 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:34,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:34,287 INFO ]: Computing forward predicates... [2018-06-22 11:00:34,370 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:34,389 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:34,389 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-22 11:00:34,389 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:00:34,389 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:00:34,389 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:00:34,389 INFO ]: Start difference. First operand 108 states and 220 transitions. Second operand 16 states. [2018-06-22 11:00:34,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:34,763 INFO ]: Finished difference Result 148 states and 284 transitions. [2018-06-22 11:00:34,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:00:34,764 INFO ]: Start accepts. Automaton has 16 states. Word has length 33 [2018-06-22 11:00:34,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:34,765 INFO ]: With dead ends: 148 [2018-06-22 11:00:34,765 INFO ]: Without dead ends: 146 [2018-06-22 11:00:34,766 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:00:34,766 INFO ]: Start minimizeSevpa. Operand 146 states. [2018-06-22 11:00:34,782 INFO ]: Finished minimizeSevpa. Reduced states from 146 to 114. [2018-06-22 11:00:34,783 INFO ]: Start removeUnreachable. Operand 114 states. [2018-06-22 11:00:34,784 INFO ]: Finished removeUnreachable. Reduced from 114 states to 114 states and 232 transitions. [2018-06-22 11:00:34,785 INFO ]: Start accepts. Automaton has 114 states and 232 transitions. Word has length 33 [2018-06-22 11:00:34,785 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:34,785 INFO ]: Abstraction has 114 states and 232 transitions. [2018-06-22 11:00:34,785 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:00:34,785 INFO ]: Start isEmpty. Operand 114 states and 232 transitions. [2018-06-22 11:00:34,787 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:00:34,787 INFO ]: Found error trace [2018-06-22 11:00:34,787 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:34,787 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:34,787 INFO ]: Analyzing trace with hash 1944387269, now seen corresponding path program 1 times [2018-06-22 11:00:34,787 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:34,787 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:34,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:34,788 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:34,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:34,794 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:35,138 WARN ]: Spent 215.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-22 11:00:35,305 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:35,305 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:35,305 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-22 11:00:35,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:35,326 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:35,329 INFO ]: Computing forward predicates... [2018-06-22 11:00:35,454 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:35,484 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:35,484 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-22 11:00:35,484 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:00:35,484 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:00:35,484 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:00:35,484 INFO ]: Start difference. First operand 114 states and 232 transitions. Second operand 16 states. [2018-06-22 11:00:36,270 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:36,270 INFO ]: Finished difference Result 152 states and 291 transitions. [2018-06-22 11:00:36,271 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:00:36,271 INFO ]: Start accepts. Automaton has 16 states. Word has length 33 [2018-06-22 11:00:36,271 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:36,273 INFO ]: With dead ends: 152 [2018-06-22 11:00:36,273 INFO ]: Without dead ends: 150 [2018-06-22 11:00:36,273 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:00:36,273 INFO ]: Start minimizeSevpa. Operand 150 states. [2018-06-22 11:00:36,284 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 118. [2018-06-22 11:00:36,285 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-22 11:00:36,286 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 242 transitions. [2018-06-22 11:00:36,286 INFO ]: Start accepts. Automaton has 118 states and 242 transitions. Word has length 33 [2018-06-22 11:00:36,286 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:36,286 INFO ]: Abstraction has 118 states and 242 transitions. [2018-06-22 11:00:36,286 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:00:36,286 INFO ]: Start isEmpty. Operand 118 states and 242 transitions. [2018-06-22 11:00:36,287 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:00:36,287 INFO ]: Found error trace [2018-06-22 11:00:36,287 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:36,287 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:36,287 INFO ]: Analyzing trace with hash -468273366, now seen corresponding path program 1 times [2018-06-22 11:00:36,287 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:36,287 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:36,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:36,288 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:36,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:36,344 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:36,611 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:36,611 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:36,611 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-22 11:00:36,624 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:36,689 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:36,693 INFO ]: Computing forward predicates... [2018-06-22 11:00:36,875 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:36,895 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:37,047 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:00:37,048 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:00:37,048 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:00:37,048 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:00:37,048 INFO ]: Start difference. First operand 118 states and 242 transitions. Second operand 12 states. [2018-06-22 11:00:37,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:37,718 INFO ]: Finished difference Result 156 states and 294 transitions. [2018-06-22 11:00:37,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:00:37,718 INFO ]: Start accepts. Automaton has 12 states. Word has length 33 [2018-06-22 11:00:37,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:37,720 INFO ]: With dead ends: 156 [2018-06-22 11:00:37,720 INFO ]: Without dead ends: 154 [2018-06-22 11:00:37,720 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:00:37,720 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-22 11:00:37,732 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 116. [2018-06-22 11:00:37,732 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 11:00:37,733 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 232 transitions. [2018-06-22 11:00:37,733 INFO ]: Start accepts. Automaton has 116 states and 232 transitions. Word has length 33 [2018-06-22 11:00:37,733 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:37,733 INFO ]: Abstraction has 116 states and 232 transitions. [2018-06-22 11:00:37,733 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:00:37,733 INFO ]: Start isEmpty. Operand 116 states and 232 transitions. [2018-06-22 11:00:37,735 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:00:37,735 INFO ]: Found error trace [2018-06-22 11:00:37,735 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:37,735 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:37,735 INFO ]: Analyzing trace with hash -1206808596, now seen corresponding path program 1 times [2018-06-22 11:00:37,735 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:37,735 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:37,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:37,736 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:37,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:37,746 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:38,454 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:38,454 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:38,454 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-22 11:00:38,463 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:38,482 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:38,484 INFO ]: Computing forward predicates... [2018-06-22 11:00:38,595 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:38,628 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:38,628 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-06-22 11:00:38,628 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:00:38,628 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:00:38,628 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:00:38,628 INFO ]: Start difference. First operand 116 states and 232 transitions. Second operand 13 states. [2018-06-22 11:00:43,460 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:43,460 INFO ]: Finished difference Result 150 states and 279 transitions. [2018-06-22 11:00:43,460 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:00:43,460 INFO ]: Start accepts. Automaton has 13 states. Word has length 33 [2018-06-22 11:00:43,460 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:43,462 INFO ]: With dead ends: 150 [2018-06-22 11:00:43,462 INFO ]: Without dead ends: 148 [2018-06-22 11:00:43,462 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:00:43,462 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-22 11:00:43,472 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 116. [2018-06-22 11:00:43,472 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 11:00:43,473 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 231 transitions. [2018-06-22 11:00:43,473 INFO ]: Start accepts. Automaton has 116 states and 231 transitions. Word has length 33 [2018-06-22 11:00:43,473 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:43,473 INFO ]: Abstraction has 116 states and 231 transitions. [2018-06-22 11:00:43,473 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:00:43,473 INFO ]: Start isEmpty. Operand 116 states and 231 transitions. [2018-06-22 11:00:43,475 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:00:43,475 INFO ]: Found error trace [2018-06-22 11:00:43,475 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:43,475 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:43,475 INFO ]: Analyzing trace with hash 11130585, now seen corresponding path program 1 times [2018-06-22 11:00:43,475 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:43,475 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:43,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:43,476 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:43,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:43,802 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:44,227 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:44,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:44,227 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-22 11:00:44,238 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:44,308 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:44,312 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-22 11:00:50,296 INFO ]: Timeout while computing interpolants [2018-06-22 11:00:50,497 WARN ]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:50,497 WARN ]: Verification canceled [2018-06-22 11:00:50,500 WARN ]: Timeout [2018-06-22 11:00:50,501 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:00:50 BoogieIcfgContainer [2018-06-22 11:00:50,501 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:00:50,501 INFO ]: Toolchain (without parser) took 65118.26 ms. Allocated memory was 328.7 MB in the beginning and 1.2 GB in the end (delta: 868.7 MB). Free memory was 284.1 MB in the beginning and 1.1 GB in the end (delta: -801.2 MB). Peak memory consumption was 815.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:00:50,502 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:00:50,502 INFO ]: ChcToBoogie took 113.43 ms. Allocated memory is still 328.7 MB. Free memory was 284.1 MB in the beginning and 276.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:00:50,502 INFO ]: Boogie Preprocessor took 96.29 ms. Allocated memory is still 328.7 MB. Free memory was 276.1 MB in the beginning and 271.3 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 3.6 GB. [2018-06-22 11:00:50,503 INFO ]: RCFGBuilder took 1297.89 ms. Allocated memory was 328.7 MB in the beginning and 375.9 MB in the end (delta: 47.2 MB). Free memory was 271.3 MB in the beginning and 344.0 MB in the end (delta: -72.8 MB). Peak memory consumption was 103.6 MB. Max. memory is 3.6 GB. [2018-06-22 11:00:50,503 INFO ]: TraceAbstraction took 63601.34 ms. Allocated memory was 375.9 MB in the beginning and 1.2 GB in the end (delta: 821.6 MB). Free memory was 344.0 MB in the beginning and 1.1 GB in the end (delta: -741.3 MB). Peak memory consumption was 827.7 MB. Max. memory is 3.6 GB. [2018-06-22 11:00:50,505 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 305.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 113.43 ms. Allocated memory is still 328.7 MB. Free memory was 284.1 MB in the beginning and 276.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 96.29 ms. Allocated memory is still 328.7 MB. Free memory was 276.1 MB in the beginning and 271.3 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1297.89 ms. Allocated memory was 328.7 MB in the beginning and 375.9 MB in the end (delta: 47.2 MB). Free memory was 271.3 MB in the beginning and 344.0 MB in the end (delta: -72.8 MB). Peak memory consumption was 103.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 63601.34 ms. Allocated memory was 375.9 MB in the beginning and 1.2 GB in the end (delta: 821.6 MB). Free memory was 344.0 MB in the beginning and 1.1 GB in the end (delta: -741.3 MB). Peak memory consumption was 827.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while XnfDer was eliminating 2261 quantified variables from 21 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 38 locations, 1 error locations. TIMEOUT Result, 63.5s OverallTime, 19 OverallIterations, 3 TraceHistogramMax, 39.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 969 SDtfs, 154 SDslu, 5313 SDs, 0 SdLazy, 4132 SolverSat, 344 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 30.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 317 SyntacticMatches, 29 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 21.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 308 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 885 NumberOfCodeBlocks, 885 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 856 ConstructedInterpolants, 25 QuantifiedInterpolants, 145248 SizeOfPredicates, 48 NumberOfNonLiveVariables, 2231 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 29 InterpolantComputations, 7 PerfectInterpolantSequences, 97/153 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/digits10_inl_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-00-50-522.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/digits10_inl_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-00-50-522.csv Completed graceful shutdown