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_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/inc4.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:48:20,086 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:48:20,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:48:20,103 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:48:20,103 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:48:20,104 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:48:20,105 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:48:20,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:48:20,111 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:48:20,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:48:20,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:48:20,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:48:20,115 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:48:20,116 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:48:20,119 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:48:20,120 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:48:20,122 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:48:20,133 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:48:20,135 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:48:20,136 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:48:20,137 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:48:20,139 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:48:20,139 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:48:20,140 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:48:20,141 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:48:20,142 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:48:20,142 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:48:20,143 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:48:20,144 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:48:20,144 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:48:20,145 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:48:20,146 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:48:20,146 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:48:20,146 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:48:20,147 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:48:20,147 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:48:20,164 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:48:20,164 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:48:20,164 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:48:20,164 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:48:20,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:48:20,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:48:20,171 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:48:20,171 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:48:20,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:48:20,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:48:20,171 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:48:20,172 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:48:20,172 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:48:20,172 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:48:20,172 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:48:20,172 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:48:20,172 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:48:20,178 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:48:20,218 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:48:20,273 INFO ]: Repository-Root is: /tmp [2018-06-22 01:48:20,291 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:48:20,296 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:48:20,297 INFO ]: Initializing SmtParser... [2018-06-22 01:48:20,298 INFO ]: SmtParser initialized [2018-06-22 01:48:20,298 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/inc4.smt2 [2018-06-22 01:48:20,300 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 01:48:20,404 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/inc4.smt2 unknown [2018-06-22 01:48:20,738 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/inc4.smt2 [2018-06-22 01:48:20,752 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:48:20,759 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:48:20,760 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:48:20,760 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:48:20,760 INFO ]: ChcToBoogie initialized [2018-06-22 01:48:20,764 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:48:20" (1/1) ... [2018-06-22 01:48:20,837 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:20 Unit [2018-06-22 01:48:20,837 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:48:20,838 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:48:20,838 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:48:20,838 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:48:20,863 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:20" (1/1) ... [2018-06-22 01:48:20,863 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:20" (1/1) ... [2018-06-22 01:48:20,874 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:20" (1/1) ... [2018-06-22 01:48:20,874 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:20" (1/1) ... [2018-06-22 01:48:20,894 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:20" (1/1) ... [2018-06-22 01:48:20,897 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:20" (1/1) ... [2018-06-22 01:48:20,909 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:20" (1/1) ... [2018-06-22 01:48:20,912 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:48:20,912 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:48:20,912 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:48:20,912 INFO ]: RCFGBuilder initialized [2018-06-22 01:48:20,913 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:20" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:48:20,945 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:48:20,945 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:48:20,945 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:48:20,945 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:48:20,945 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:48:20,945 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:48:21,777 INFO ]: Using library mode [2018-06-22 01:48:21,778 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:48:21 BoogieIcfgContainer [2018-06-22 01:48:21,778 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:48:21,784 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:48:21,784 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:48:21,788 INFO ]: TraceAbstraction initialized [2018-06-22 01:48:21,788 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:48:20" (1/3) ... [2018-06-22 01:48:21,789 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a554955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:48:21, skipping insertion in model container [2018-06-22 01:48:21,790 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:48:20" (2/3) ... [2018-06-22 01:48:21,790 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a554955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:48:21, skipping insertion in model container [2018-06-22 01:48:21,790 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:48:21" (3/3) ... [2018-06-22 01:48:21,792 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:48:21,801 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:48:21,813 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:48:21,870 INFO ]: Using default assertion order modulation [2018-06-22 01:48:21,871 INFO ]: Interprodecural is true [2018-06-22 01:48:21,871 INFO ]: Hoare is false [2018-06-22 01:48:21,871 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:48:21,871 INFO ]: Backedges is TWOTRACK [2018-06-22 01:48:21,871 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:48:21,871 INFO ]: Difference is false [2018-06-22 01:48:21,871 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:48:21,871 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:48:21,911 INFO ]: Start isEmpty. Operand 70 states. [2018-06-22 01:48:21,947 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:48:21,947 INFO ]: Found error trace [2018-06-22 01:48:21,948 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:21,948 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:21,960 INFO ]: Analyzing trace with hash 1207957681, now seen corresponding path program 1 times [2018-06-22 01:48:21,968 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:21,968 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:22,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:22,021 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:22,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:22,077 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:22,221 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:48:22,225 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:48:22,225 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:48:22,228 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:22,248 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:22,248 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:22,251 INFO ]: Start difference. First operand 70 states. Second operand 4 states. [2018-06-22 01:48:24,474 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:24,475 INFO ]: Finished difference Result 133 states and 211 transitions. [2018-06-22 01:48:24,475 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:48:24,477 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-22 01:48:24,477 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:24,517 INFO ]: With dead ends: 133 [2018-06-22 01:48:24,517 INFO ]: Without dead ends: 133 [2018-06-22 01:48:24,522 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:48:24,550 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-22 01:48:24,626 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-06-22 01:48:24,630 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-22 01:48:24,638 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 211 transitions. [2018-06-22 01:48:24,680 INFO ]: Start accepts. Automaton has 133 states and 211 transitions. Word has length 7 [2018-06-22 01:48:24,680 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:24,680 INFO ]: Abstraction has 133 states and 211 transitions. [2018-06-22 01:48:24,680 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:48:24,680 INFO ]: Start isEmpty. Operand 133 states and 211 transitions. [2018-06-22 01:48:24,690 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:48:24,690 INFO ]: Found error trace [2018-06-22 01:48:24,690 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:24,690 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:24,691 INFO ]: Analyzing trace with hash 1641518227, now seen corresponding path program 1 times [2018-06-22 01:48:24,691 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:24,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:24,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:24,692 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:24,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:24,702 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:24,764 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:48:24,764 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:48:24,764 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:48:24,765 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:24,766 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:24,766 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:24,766 INFO ]: Start difference. First operand 133 states and 211 transitions. Second operand 4 states. [2018-06-22 01:48:25,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:25,400 INFO ]: Finished difference Result 163 states and 261 transitions. [2018-06-22 01:48:25,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:48:25,400 INFO ]: Start accepts. Automaton has 4 states. Word has length 18 [2018-06-22 01:48:25,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:25,409 INFO ]: With dead ends: 163 [2018-06-22 01:48:25,409 INFO ]: Without dead ends: 163 [2018-06-22 01:48:25,410 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:48:25,410 INFO ]: Start minimizeSevpa. Operand 163 states. [2018-06-22 01:48:25,432 INFO ]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-06-22 01:48:25,432 INFO ]: Start removeUnreachable. Operand 163 states. [2018-06-22 01:48:25,437 INFO ]: Finished removeUnreachable. Reduced from 163 states to 163 states and 261 transitions. [2018-06-22 01:48:25,437 INFO ]: Start accepts. Automaton has 163 states and 261 transitions. Word has length 18 [2018-06-22 01:48:25,437 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:25,437 INFO ]: Abstraction has 163 states and 261 transitions. [2018-06-22 01:48:25,438 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:48:25,438 INFO ]: Start isEmpty. Operand 163 states and 261 transitions. [2018-06-22 01:48:25,441 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:48:25,441 INFO ]: Found error trace [2018-06-22 01:48:25,441 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:25,441 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:25,442 INFO ]: Analyzing trace with hash -935700009, now seen corresponding path program 1 times [2018-06-22 01:48:25,442 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:25,442 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:25,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:25,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:25,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:25,451 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:25,523 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:48:25,523 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:48:25,523 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:48:25,523 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:25,523 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:25,523 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:25,523 INFO ]: Start difference. First operand 163 states and 261 transitions. Second operand 4 states. [2018-06-22 01:48:26,097 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:26,097 INFO ]: Finished difference Result 193 states and 311 transitions. [2018-06-22 01:48:26,097 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:48:26,097 INFO ]: Start accepts. Automaton has 4 states. Word has length 18 [2018-06-22 01:48:26,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:26,104 INFO ]: With dead ends: 193 [2018-06-22 01:48:26,104 INFO ]: Without dead ends: 193 [2018-06-22 01:48:26,104 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:48:26,105 INFO ]: Start minimizeSevpa. Operand 193 states. [2018-06-22 01:48:26,126 INFO ]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-06-22 01:48:26,126 INFO ]: Start removeUnreachable. Operand 193 states. [2018-06-22 01:48:26,131 INFO ]: Finished removeUnreachable. Reduced from 193 states to 193 states and 311 transitions. [2018-06-22 01:48:26,131 INFO ]: Start accepts. Automaton has 193 states and 311 transitions. Word has length 18 [2018-06-22 01:48:26,131 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:26,131 INFO ]: Abstraction has 193 states and 311 transitions. [2018-06-22 01:48:26,131 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:48:26,131 INFO ]: Start isEmpty. Operand 193 states and 311 transitions. [2018-06-22 01:48:26,135 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:48:26,135 INFO ]: Found error trace [2018-06-22 01:48:26,135 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:26,135 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:26,135 INFO ]: Analyzing trace with hash 400059645, now seen corresponding path program 1 times [2018-06-22 01:48:26,136 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:26,136 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:26,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:26,136 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:26,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:26,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:26,411 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:48:26,411 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:48:26,411 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:48:26,412 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:48:26,412 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:48:26,412 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:48:26,412 INFO ]: Start difference. First operand 193 states and 311 transitions. Second operand 5 states. [2018-06-22 01:48:26,645 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 01:48:27,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:27,044 INFO ]: Finished difference Result 371 states and 755 transitions. [2018-06-22 01:48:27,045 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:48:27,045 INFO ]: Start accepts. Automaton has 5 states. Word has length 20 [2018-06-22 01:48:27,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:27,087 INFO ]: With dead ends: 371 [2018-06-22 01:48:27,087 INFO ]: Without dead ends: 371 [2018-06-22 01:48:27,087 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:48:27,087 INFO ]: Start minimizeSevpa. Operand 371 states. [2018-06-22 01:48:27,156 INFO ]: Finished minimizeSevpa. Reduced states from 371 to 203. [2018-06-22 01:48:27,156 INFO ]: Start removeUnreachable. Operand 203 states. [2018-06-22 01:48:27,160 INFO ]: Finished removeUnreachable. Reduced from 203 states to 203 states and 325 transitions. [2018-06-22 01:48:27,160 INFO ]: Start accepts. Automaton has 203 states and 325 transitions. Word has length 20 [2018-06-22 01:48:27,160 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:27,161 INFO ]: Abstraction has 203 states and 325 transitions. [2018-06-22 01:48:27,161 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:48:27,161 INFO ]: Start isEmpty. Operand 203 states and 325 transitions. [2018-06-22 01:48:27,176 INFO ]: Finished isEmpty. Found accepting run of length 68 [2018-06-22 01:48:27,176 INFO ]: Found error trace [2018-06-22 01:48:27,176 INFO ]: trace histogram [5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:27,176 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:27,176 INFO ]: Analyzing trace with hash -497138793, now seen corresponding path program 1 times [2018-06-22 01:48:27,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:27,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:27,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:27,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:27,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:27,218 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:27,347 INFO ]: Checked inductivity of 75 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 01:48:27,347 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:48:27,347 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 01:48:27,368 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:27,444 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:27,455 INFO ]: Computing forward predicates... [2018-06-22 01:48:27,494 INFO ]: Checked inductivity of 75 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 01:48:27,530 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:48:27,530 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:48:27,530 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:27,530 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:27,530 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:27,531 INFO ]: Start difference. First operand 203 states and 325 transitions. Second operand 4 states. [2018-06-22 01:48:29,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:29,389 INFO ]: Finished difference Result 267 states and 426 transitions. [2018-06-22 01:48:29,389 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:48:29,389 INFO ]: Start accepts. Automaton has 4 states. Word has length 67 [2018-06-22 01:48:29,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:29,402 INFO ]: With dead ends: 267 [2018-06-22 01:48:29,402 INFO ]: Without dead ends: 267 [2018-06-22 01:48:29,402 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:48:29,406 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-22 01:48:29,443 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-22 01:48:29,443 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-22 01:48:29,450 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 426 transitions. [2018-06-22 01:48:29,450 INFO ]: Start accepts. Automaton has 267 states and 426 transitions. Word has length 67 [2018-06-22 01:48:29,451 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:29,451 INFO ]: Abstraction has 267 states and 426 transitions. [2018-06-22 01:48:29,451 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:48:29,451 INFO ]: Start isEmpty. Operand 267 states and 426 transitions. [2018-06-22 01:48:29,470 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 01:48:29,470 INFO ]: Found error trace [2018-06-22 01:48:29,470 INFO ]: trace histogram [6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:29,470 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:29,471 INFO ]: Analyzing trace with hash -1871828954, now seen corresponding path program 1 times [2018-06-22 01:48:29,471 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:29,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:29,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:29,472 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:29,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:29,526 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:29,654 INFO ]: Checked inductivity of 130 backedges. 44 proven. 9 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-22 01:48:29,654 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:48:29,654 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 01:48:29,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:29,728 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:29,733 INFO ]: Computing forward predicates... [2018-06-22 01:48:29,758 INFO ]: Checked inductivity of 130 backedges. 44 proven. 9 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-22 01:48:29,788 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:48:29,789 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:48:29,789 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:29,789 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:29,789 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:29,789 INFO ]: Start difference. First operand 267 states and 426 transitions. Second operand 4 states. [2018-06-22 01:48:30,077 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:30,077 INFO ]: Finished difference Result 322 states and 513 transitions. [2018-06-22 01:48:30,077 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:48:30,077 INFO ]: Start accepts. Automaton has 4 states. Word has length 85 [2018-06-22 01:48:30,078 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:30,088 INFO ]: With dead ends: 322 [2018-06-22 01:48:30,088 INFO ]: Without dead ends: 322 [2018-06-22 01:48:30,089 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:48:30,090 INFO ]: Start minimizeSevpa. Operand 322 states. [2018-06-22 01:48:30,111 INFO ]: Finished minimizeSevpa. Reduced states from 322 to 322. [2018-06-22 01:48:30,111 INFO ]: Start removeUnreachable. Operand 322 states. [2018-06-22 01:48:30,118 INFO ]: Finished removeUnreachable. Reduced from 322 states to 322 states and 513 transitions. [2018-06-22 01:48:30,118 INFO ]: Start accepts. Automaton has 322 states and 513 transitions. Word has length 85 [2018-06-22 01:48:30,118 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:30,118 INFO ]: Abstraction has 322 states and 513 transitions. [2018-06-22 01:48:30,118 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:48:30,118 INFO ]: Start isEmpty. Operand 322 states and 513 transitions. [2018-06-22 01:48:30,137 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 01:48:30,137 INFO ]: Found error trace [2018-06-22 01:48:30,137 INFO ]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:30,137 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:30,137 INFO ]: Analyzing trace with hash 960039655, now seen corresponding path program 1 times [2018-06-22 01:48:30,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:30,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:30,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:30,138 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:30,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:30,172 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:30,337 INFO ]: Checked inductivity of 81 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 01:48:30,337 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:48:30,337 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 01:48:30,343 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:30,390 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:30,394 INFO ]: Computing forward predicates... [2018-06-22 01:48:30,404 INFO ]: Checked inductivity of 81 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 01:48:30,436 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:48:30,436 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:48:30,437 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:30,437 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:30,437 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:30,437 INFO ]: Start difference. First operand 322 states and 513 transitions. Second operand 4 states. [2018-06-22 01:48:30,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:30,671 INFO ]: Finished difference Result 377 states and 600 transitions. [2018-06-22 01:48:30,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:48:30,672 INFO ]: Start accepts. Automaton has 4 states. Word has length 69 [2018-06-22 01:48:30,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:30,686 INFO ]: With dead ends: 377 [2018-06-22 01:48:30,686 INFO ]: Without dead ends: 377 [2018-06-22 01:48:30,686 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:48:30,687 INFO ]: Start minimizeSevpa. Operand 377 states. [2018-06-22 01:48:30,709 INFO ]: Finished minimizeSevpa. Reduced states from 377 to 377. [2018-06-22 01:48:30,709 INFO ]: Start removeUnreachable. Operand 377 states. [2018-06-22 01:48:30,718 INFO ]: Finished removeUnreachable. Reduced from 377 states to 377 states and 600 transitions. [2018-06-22 01:48:30,718 INFO ]: Start accepts. Automaton has 377 states and 600 transitions. Word has length 69 [2018-06-22 01:48:30,718 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:30,718 INFO ]: Abstraction has 377 states and 600 transitions. [2018-06-22 01:48:30,718 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:48:30,718 INFO ]: Start isEmpty. Operand 377 states and 600 transitions. [2018-06-22 01:48:30,740 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:48:30,740 INFO ]: Found error trace [2018-06-22 01:48:30,740 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:30,740 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:30,740 INFO ]: Analyzing trace with hash -1079390082, now seen corresponding path program 1 times [2018-06-22 01:48:30,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:30,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:30,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:30,741 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:30,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:30,765 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:31,121 INFO ]: Checked inductivity of 30 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 01:48:31,121 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:48:31,121 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 01:48:31,127 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:31,157 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:31,161 INFO ]: Computing forward predicates... [2018-06-22 01:48:31,301 INFO ]: Checked inductivity of 30 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:48:31,329 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:48:31,329 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:48:31,329 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:48:31,329 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:48:31,329 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:48:31,329 INFO ]: Start difference. First operand 377 states and 600 transitions. Second operand 8 states. [2018-06-22 01:48:32,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:32,985 INFO ]: Finished difference Result 849 states and 1836 transitions. [2018-06-22 01:48:32,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:48:32,985 INFO ]: Start accepts. Automaton has 8 states. Word has length 48 [2018-06-22 01:48:32,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:33,040 INFO ]: With dead ends: 849 [2018-06-22 01:48:33,040 INFO ]: Without dead ends: 699 [2018-06-22 01:48:33,040 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:48:33,041 INFO ]: Start minimizeSevpa. Operand 699 states. [2018-06-22 01:48:33,132 INFO ]: Finished minimizeSevpa. Reduced states from 699 to 387. [2018-06-22 01:48:33,162 INFO ]: Start removeUnreachable. Operand 387 states. [2018-06-22 01:48:33,176 INFO ]: Finished removeUnreachable. Reduced from 387 states to 387 states and 638 transitions. [2018-06-22 01:48:33,176 INFO ]: Start accepts. Automaton has 387 states and 638 transitions. Word has length 48 [2018-06-22 01:48:33,176 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:33,176 INFO ]: Abstraction has 387 states and 638 transitions. [2018-06-22 01:48:33,176 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:48:33,176 INFO ]: Start isEmpty. Operand 387 states and 638 transitions. [2018-06-22 01:48:33,200 INFO ]: Finished isEmpty. Found accepting run of length 60 [2018-06-22 01:48:33,200 INFO ]: Found error trace [2018-06-22 01:48:33,200 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:33,200 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:33,200 INFO ]: Analyzing trace with hash 236148180, now seen corresponding path program 1 times [2018-06-22 01:48:33,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:33,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:33,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:33,205 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:33,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:33,219 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:33,369 INFO ]: Checked inductivity of 52 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:48:33,370 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:48:33,370 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:48:33,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:48:33,472 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:33,479 INFO ]: Computing forward predicates... [2018-06-22 01:48:33,508 INFO ]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 01:48:33,680 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:48:33,680 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 01:48:33,681 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:33,681 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:33,681 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:33,681 INFO ]: Start difference. First operand 387 states and 638 transitions. Second operand 4 states. [2018-06-22 01:48:33,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:33,935 INFO ]: Finished difference Result 527 states and 877 transitions. [2018-06-22 01:48:33,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:48:33,935 INFO ]: Start accepts. Automaton has 4 states. Word has length 59 [2018-06-22 01:48:33,935 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:33,945 INFO ]: With dead ends: 527 [2018-06-22 01:48:33,945 INFO ]: Without dead ends: 433 [2018-06-22 01:48:33,945 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:48:33,946 INFO ]: Start minimizeSevpa. Operand 433 states. [2018-06-22 01:48:33,971 INFO ]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-06-22 01:48:33,971 INFO ]: Start removeUnreachable. Operand 433 states. [2018-06-22 01:48:33,977 INFO ]: Finished removeUnreachable. Reduced from 433 states to 433 states and 699 transitions. [2018-06-22 01:48:33,977 INFO ]: Start accepts. Automaton has 433 states and 699 transitions. Word has length 59 [2018-06-22 01:48:33,978 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:33,978 INFO ]: Abstraction has 433 states and 699 transitions. [2018-06-22 01:48:33,978 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:48:33,978 INFO ]: Start isEmpty. Operand 433 states and 699 transitions. [2018-06-22 01:48:33,990 INFO ]: Finished isEmpty. Found accepting run of length 77 [2018-06-22 01:48:33,990 INFO ]: Found error trace [2018-06-22 01:48:33,990 INFO ]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:33,990 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:33,990 INFO ]: Analyzing trace with hash 1495479807, now seen corresponding path program 2 times [2018-06-22 01:48:33,990 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:33,990 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:33,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:33,991 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:33,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:34,016 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:34,337 INFO ]: Checked inductivity of 104 backedges. 39 proven. 17 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-22 01:48:34,337 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:48:34,337 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 01:48:34,345 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:48:34,467 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:48:34,467 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:34,471 INFO ]: Computing forward predicates... [2018-06-22 01:48:34,546 INFO ]: Checked inductivity of 104 backedges. 39 proven. 17 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-22 01:48:34,577 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:48:34,577 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 01:48:34,577 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:48:34,578 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:48:34,578 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:48:34,578 INFO ]: Start difference. First operand 433 states and 699 transitions. Second operand 13 states. [2018-06-22 01:48:42,326 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:42,327 INFO ]: Finished difference Result 952 states and 2324 transitions. [2018-06-22 01:48:42,327 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-06-22 01:48:42,327 INFO ]: Start accepts. Automaton has 13 states. Word has length 76 [2018-06-22 01:48:42,327 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:42,375 INFO ]: With dead ends: 952 [2018-06-22 01:48:42,375 INFO ]: Without dead ends: 815 [2018-06-22 01:48:42,376 INFO ]: 0 DeclaredPredicates, 149 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=501, Invalid=2921, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 01:48:42,377 INFO ]: Start minimizeSevpa. Operand 815 states. [2018-06-22 01:48:42,472 INFO ]: Finished minimizeSevpa. Reduced states from 815 to 547. [2018-06-22 01:48:42,472 INFO ]: Start removeUnreachable. Operand 547 states. [2018-06-22 01:48:42,483 INFO ]: Finished removeUnreachable. Reduced from 547 states to 547 states and 976 transitions. [2018-06-22 01:48:42,483 INFO ]: Start accepts. Automaton has 547 states and 976 transitions. Word has length 76 [2018-06-22 01:48:42,483 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:42,483 INFO ]: Abstraction has 547 states and 976 transitions. [2018-06-22 01:48:42,483 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:48:42,483 INFO ]: Start isEmpty. Operand 547 states and 976 transitions. [2018-06-22 01:48:42,500 INFO ]: Finished isEmpty. Found accepting run of length 77 [2018-06-22 01:48:42,502 INFO ]: Found error trace [2018-06-22 01:48:42,503 INFO ]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:42,503 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:42,503 INFO ]: Analyzing trace with hash 1052580667, now seen corresponding path program 1 times [2018-06-22 01:48:42,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:42,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:42,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:42,504 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:48:42,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:42,528 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:42,608 INFO ]: Checked inductivity of 103 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-22 01:48:42,608 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:48:42,608 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:48:42,608 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:42,608 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:42,608 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:42,608 INFO ]: Start difference. First operand 547 states and 976 transitions. Second operand 4 states. [2018-06-22 01:48:42,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:42,998 INFO ]: Finished difference Result 635 states and 1133 transitions. [2018-06-22 01:48:42,998 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:48:42,998 INFO ]: Start accepts. Automaton has 4 states. Word has length 76 [2018-06-22 01:48:42,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:43,016 INFO ]: With dead ends: 635 [2018-06-22 01:48:43,016 INFO ]: Without dead ends: 586 [2018-06-22 01:48:43,016 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:48:43,017 INFO ]: Start minimizeSevpa. Operand 586 states. [2018-06-22 01:48:43,057 INFO ]: Finished minimizeSevpa. Reduced states from 586 to 586. [2018-06-22 01:48:43,057 INFO ]: Start removeUnreachable. Operand 586 states. [2018-06-22 01:48:43,068 INFO ]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1041 transitions. [2018-06-22 01:48:43,068 INFO ]: Start accepts. Automaton has 586 states and 1041 transitions. Word has length 76 [2018-06-22 01:48:43,068 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:43,068 INFO ]: Abstraction has 586 states and 1041 transitions. [2018-06-22 01:48:43,068 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:48:43,068 INFO ]: Start isEmpty. Operand 586 states and 1041 transitions. [2018-06-22 01:48:43,090 INFO ]: Finished isEmpty. Found accepting run of length 95 [2018-06-22 01:48:43,090 INFO ]: Found error trace [2018-06-22 01:48:43,090 INFO ]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:43,090 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:43,090 INFO ]: Analyzing trace with hash -1544634417, now seen corresponding path program 1 times [2018-06-22 01:48:43,090 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:43,090 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:43,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:43,091 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:43,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:43,118 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:43,265 INFO ]: Checked inductivity of 167 backedges. 68 proven. 9 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-06-22 01:48:43,265 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:48:43,265 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 01:48:43,282 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:43,339 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:43,345 INFO ]: Computing forward predicates... [2018-06-22 01:48:43,365 INFO ]: Checked inductivity of 167 backedges. 68 proven. 9 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-06-22 01:48:43,400 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:48:43,400 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:48:43,400 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:43,400 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:43,400 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:43,400 INFO ]: Start difference. First operand 586 states and 1041 transitions. Second operand 4 states. [2018-06-22 01:48:45,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:45,034 INFO ]: Finished difference Result 635 states and 1127 transitions. [2018-06-22 01:48:45,034 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:48:45,034 INFO ]: Start accepts. Automaton has 4 states. Word has length 94 [2018-06-22 01:48:45,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:45,056 INFO ]: With dead ends: 635 [2018-06-22 01:48:45,056 INFO ]: Without dead ends: 586 [2018-06-22 01:48:45,056 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:48:45,057 INFO ]: Start minimizeSevpa. Operand 586 states. [2018-06-22 01:48:45,108 INFO ]: Finished minimizeSevpa. Reduced states from 586 to 586. [2018-06-22 01:48:45,108 INFO ]: Start removeUnreachable. Operand 586 states. [2018-06-22 01:48:45,142 INFO ]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1035 transitions. [2018-06-22 01:48:45,142 INFO ]: Start accepts. Automaton has 586 states and 1035 transitions. Word has length 94 [2018-06-22 01:48:45,142 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:45,142 INFO ]: Abstraction has 586 states and 1035 transitions. [2018-06-22 01:48:45,142 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:48:45,142 INFO ]: Start isEmpty. Operand 586 states and 1035 transitions. [2018-06-22 01:48:45,172 INFO ]: Finished isEmpty. Found accepting run of length 79 [2018-06-22 01:48:45,172 INFO ]: Found error trace [2018-06-22 01:48:45,172 INFO ]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:45,172 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:45,173 INFO ]: Analyzing trace with hash 970278393, now seen corresponding path program 2 times [2018-06-22 01:48:45,173 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:45,173 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:45,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:45,174 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:45,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:45,191 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:45,354 INFO ]: Checked inductivity of 99 backedges. 31 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-06-22 01:48:45,354 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:48:45,354 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) [2018-06-22 01:48:45,368 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:48:45,444 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:48:45,444 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:45,448 INFO ]: Computing forward predicates... [2018-06-22 01:48:45,464 INFO ]: Checked inductivity of 99 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:48:45,496 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:48:45,496 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:48:45,497 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:48:45,497 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:48:45,497 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:48:45,497 INFO ]: Start difference. First operand 586 states and 1035 transitions. Second operand 4 states. [2018-06-22 01:48:46,381 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:46,381 INFO ]: Finished difference Result 634 states and 1132 transitions. [2018-06-22 01:48:46,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:48:46,381 INFO ]: Start accepts. Automaton has 4 states. Word has length 78 [2018-06-22 01:48:46,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:46,400 INFO ]: With dead ends: 634 [2018-06-22 01:48:46,400 INFO ]: Without dead ends: 552 [2018-06-22 01:48:46,400 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:48:46,400 INFO ]: Start minimizeSevpa. Operand 552 states. [2018-06-22 01:48:46,442 INFO ]: Finished minimizeSevpa. Reduced states from 552 to 552. [2018-06-22 01:48:46,442 INFO ]: Start removeUnreachable. Operand 552 states. [2018-06-22 01:48:46,450 INFO ]: Finished removeUnreachable. Reduced from 552 states to 552 states and 965 transitions. [2018-06-22 01:48:46,450 INFO ]: Start accepts. Automaton has 552 states and 965 transitions. Word has length 78 [2018-06-22 01:48:46,450 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:46,450 INFO ]: Abstraction has 552 states and 965 transitions. [2018-06-22 01:48:46,450 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:48:46,450 INFO ]: Start isEmpty. Operand 552 states and 965 transitions. [2018-06-22 01:48:46,459 INFO ]: Finished isEmpty. Found accepting run of length 84 [2018-06-22 01:48:46,460 INFO ]: Found error trace [2018-06-22 01:48:46,460 INFO ]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:46,460 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:46,460 INFO ]: Analyzing trace with hash 1340532840, now seen corresponding path program 1 times [2018-06-22 01:48:46,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:46,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:46,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:46,460 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:48:46,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:46,482 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:46,746 INFO ]: Checked inductivity of 119 backedges. 26 proven. 22 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-22 01:48:46,746 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:48:46,746 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 01:48:46,753 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:46,788 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:46,792 INFO ]: Computing forward predicates... [2018-06-22 01:48:46,910 INFO ]: Checked inductivity of 119 backedges. 78 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 01:48:46,929 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:48:46,929 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 01:48:46,929 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:48:46,930 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:48:46,930 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:48:46,931 INFO ]: Start difference. First operand 552 states and 965 transitions. Second operand 16 states. [2018-06-22 01:48:49,206 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:48:49,206 INFO ]: Finished difference Result 1104 states and 2709 transitions. [2018-06-22 01:48:49,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:48:49,207 INFO ]: Start accepts. Automaton has 16 states. Word has length 83 [2018-06-22 01:48:49,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:48:49,237 INFO ]: With dead ends: 1104 [2018-06-22 01:48:49,237 INFO ]: Without dead ends: 1104 [2018-06-22 01:48:49,237 INFO ]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:48:49,238 INFO ]: Start minimizeSevpa. Operand 1104 states. [2018-06-22 01:48:49,344 INFO ]: Finished minimizeSevpa. Reduced states from 1104 to 587. [2018-06-22 01:48:49,344 INFO ]: Start removeUnreachable. Operand 587 states. [2018-06-22 01:48:49,352 INFO ]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1050 transitions. [2018-06-22 01:48:49,352 INFO ]: Start accepts. Automaton has 587 states and 1050 transitions. Word has length 83 [2018-06-22 01:48:49,353 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:48:49,353 INFO ]: Abstraction has 587 states and 1050 transitions. [2018-06-22 01:48:49,353 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:48:49,353 INFO ]: Start isEmpty. Operand 587 states and 1050 transitions. [2018-06-22 01:48:49,362 INFO ]: Finished isEmpty. Found accepting run of length 140 [2018-06-22 01:48:49,362 INFO ]: Found error trace [2018-06-22 01:48:49,364 INFO ]: trace histogram [10, 10, 10, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:48:49,365 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:48:49,365 INFO ]: Analyzing trace with hash -516538416, now seen corresponding path program 1 times [2018-06-22 01:48:49,365 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:48:49,365 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:48:49,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:49,365 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:49,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:48:49,409 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:49,532 INFO ]: Checked inductivity of 403 backedges. 46 proven. 71 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-06-22 01:48:49,532 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:48:49,532 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 01:48:49,537 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:48:49,610 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:48:49,616 INFO ]: Computing forward predicates... [2018-06-22 01:48:50,072 INFO ]: Checked inductivity of 403 backedges. 87 proven. 101 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-06-22 01:48:50,107 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:48:50,107 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16] total 18 [2018-06-22 01:48:50,107 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:48:50,107 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:48:50,107 INFO ]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:48:50,108 INFO ]: Start difference. First operand 587 states and 1050 transitions. Second operand 18 states. [2018-06-22 01:48:56,836 WARN ]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:49:00,973 WARN ]: Spent 346.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-06-22 01:49:03,119 WARN ]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 01:49:04,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:04,605 INFO ]: Finished difference Result 2409 states and 5300 transitions. [2018-06-22 01:49:04,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-06-22 01:49:04,605 INFO ]: Start accepts. Automaton has 18 states. Word has length 139 [2018-06-22 01:49:04,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:04,757 INFO ]: With dead ends: 2409 [2018-06-22 01:49:04,757 INFO ]: Without dead ends: 2081 [2018-06-22 01:49:04,762 INFO ]: 0 DeclaredPredicates, 367 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9255 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2186, Invalid=22620, Unknown=0, NotChecked=0, Total=24806 [2018-06-22 01:49:04,763 INFO ]: Start minimizeSevpa. Operand 2081 states. [2018-06-22 01:49:04,911 INFO ]: Finished minimizeSevpa. Reduced states from 2081 to 903. [2018-06-22 01:49:04,911 INFO ]: Start removeUnreachable. Operand 903 states. [2018-06-22 01:49:04,928 INFO ]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1621 transitions. [2018-06-22 01:49:04,928 INFO ]: Start accepts. Automaton has 903 states and 1621 transitions. Word has length 139 [2018-06-22 01:49:04,929 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:04,929 INFO ]: Abstraction has 903 states and 1621 transitions. [2018-06-22 01:49:04,929 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:49:04,929 INFO ]: Start isEmpty. Operand 903 states and 1621 transitions. [2018-06-22 01:49:04,941 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 01:49:04,941 INFO ]: Found error trace [2018-06-22 01:49:04,941 INFO ]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:04,941 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:04,941 INFO ]: Analyzing trace with hash 1193076312, now seen corresponding path program 1 times [2018-06-22 01:49:04,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:04,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:04,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:04,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:04,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:04,948 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:05,097 INFO ]: Checked inductivity of 128 backedges. 35 proven. 19 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-06-22 01:49:05,097 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:05,097 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) [2018-06-22 01:49:05,110 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:49:05,170 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:05,173 INFO ]: Computing forward predicates... [2018-06-22 01:49:05,182 INFO ]: Checked inductivity of 128 backedges. 88 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 01:49:05,204 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:05,204 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:49:05,205 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:49:05,205 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:49:05,205 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:49:05,205 INFO ]: Start difference. First operand 903 states and 1621 transitions. Second operand 4 states. [2018-06-22 01:49:05,766 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:05,766 INFO ]: Finished difference Result 1041 states and 1902 transitions. [2018-06-22 01:49:05,766 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:49:05,767 INFO ]: Start accepts. Automaton has 4 states. Word has length 85 [2018-06-22 01:49:05,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:05,780 INFO ]: With dead ends: 1041 [2018-06-22 01:49:05,780 INFO ]: Without dead ends: 846 [2018-06-22 01:49:05,780 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:49:05,780 INFO ]: Start minimizeSevpa. Operand 846 states. [2018-06-22 01:49:05,822 INFO ]: Finished minimizeSevpa. Reduced states from 846 to 846. [2018-06-22 01:49:05,822 INFO ]: Start removeUnreachable. Operand 846 states. [2018-06-22 01:49:05,836 INFO ]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1512 transitions. [2018-06-22 01:49:05,836 INFO ]: Start accepts. Automaton has 846 states and 1512 transitions. Word has length 85 [2018-06-22 01:49:05,837 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:05,837 INFO ]: Abstraction has 846 states and 1512 transitions. [2018-06-22 01:49:05,837 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:49:05,837 INFO ]: Start isEmpty. Operand 846 states and 1512 transitions. [2018-06-22 01:49:05,847 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 01:49:05,847 INFO ]: Found error trace [2018-06-22 01:49:05,848 INFO ]: trace histogram [7, 7, 7, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:05,848 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:05,848 INFO ]: Analyzing trace with hash -1848379399, now seen corresponding path program 1 times [2018-06-22 01:49:05,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:05,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:05,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:05,848 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:05,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:05,856 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:05,933 INFO ]: Checked inductivity of 189 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-06-22 01:49:05,933 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:05,933 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 01:49:05,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:05,991 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:05,995 INFO ]: Computing forward predicates... [2018-06-22 01:49:06,009 INFO ]: Checked inductivity of 189 backedges. 113 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 01:49:06,038 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:06,038 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:49:06,038 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:49:06,038 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:49:06,038 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:49:06,038 INFO ]: Start difference. First operand 846 states and 1512 transitions. Second operand 4 states. [2018-06-22 01:49:06,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:06,456 INFO ]: Finished difference Result 983 states and 1779 transitions. [2018-06-22 01:49:06,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:49:06,456 INFO ]: Start accepts. Automaton has 4 states. Word has length 101 [2018-06-22 01:49:06,457 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:06,470 INFO ]: With dead ends: 983 [2018-06-22 01:49:06,470 INFO ]: Without dead ends: 887 [2018-06-22 01:49:06,470 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:49:06,470 INFO ]: Start minimizeSevpa. Operand 887 states. [2018-06-22 01:49:06,520 INFO ]: Finished minimizeSevpa. Reduced states from 887 to 887. [2018-06-22 01:49:06,520 INFO ]: Start removeUnreachable. Operand 887 states. [2018-06-22 01:49:06,539 INFO ]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1582 transitions. [2018-06-22 01:49:06,539 INFO ]: Start accepts. Automaton has 887 states and 1582 transitions. Word has length 101 [2018-06-22 01:49:06,539 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:06,539 INFO ]: Abstraction has 887 states and 1582 transitions. [2018-06-22 01:49:06,539 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:49:06,539 INFO ]: Start isEmpty. Operand 887 states and 1582 transitions. [2018-06-22 01:49:06,549 INFO ]: Finished isEmpty. Found accepting run of length 112 [2018-06-22 01:49:06,549 INFO ]: Found error trace [2018-06-22 01:49:06,549 INFO ]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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 01:49:06,549 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:06,549 INFO ]: Analyzing trace with hash 477717417, now seen corresponding path program 2 times [2018-06-22 01:49:06,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:06,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:06,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:06,550 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:49:06,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:06,576 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:07,063 INFO ]: Checked inductivity of 239 backedges. 64 proven. 46 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-06-22 01:49:07,063 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:07,063 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:49:07,070 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:49:07,125 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:49:07,125 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:07,129 INFO ]: Computing forward predicates... [2018-06-22 01:49:07,387 INFO ]: Checked inductivity of 239 backedges. 139 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-22 01:49:07,407 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:07,407 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 25 [2018-06-22 01:49:07,407 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:49:07,408 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:49:07,408 INFO ]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:49:07,408 INFO ]: Start difference. First operand 887 states and 1582 transitions. Second operand 25 states. [2018-06-22 01:49:11,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:11,162 INFO ]: Finished difference Result 1557 states and 3958 transitions. [2018-06-22 01:49:11,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:49:11,163 INFO ]: Start accepts. Automaton has 25 states. Word has length 111 [2018-06-22 01:49:11,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:11,211 INFO ]: With dead ends: 1557 [2018-06-22 01:49:11,211 INFO ]: Without dead ends: 1557 [2018-06-22 01:49:11,211 INFO ]: 0 DeclaredPredicates, 166 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=1983, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:49:11,212 INFO ]: Start minimizeSevpa. Operand 1557 states. [2018-06-22 01:49:11,324 INFO ]: Finished minimizeSevpa. Reduced states from 1557 to 969. [2018-06-22 01:49:11,325 INFO ]: Start removeUnreachable. Operand 969 states. [2018-06-22 01:49:11,343 INFO ]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1746 transitions. [2018-06-22 01:49:11,343 INFO ]: Start accepts. Automaton has 969 states and 1746 transitions. Word has length 111 [2018-06-22 01:49:11,343 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:11,344 INFO ]: Abstraction has 969 states and 1746 transitions. [2018-06-22 01:49:11,344 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:49:11,344 INFO ]: Start isEmpty. Operand 969 states and 1746 transitions. [2018-06-22 01:49:11,357 INFO ]: Finished isEmpty. Found accepting run of length 133 [2018-06-22 01:49:11,357 INFO ]: Found error trace [2018-06-22 01:49:11,357 INFO ]: trace histogram [9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:11,357 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:11,357 INFO ]: Analyzing trace with hash -1440705505, now seen corresponding path program 3 times [2018-06-22 01:49:11,357 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:11,357 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:11,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:11,358 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:11,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:11,393 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:12,040 INFO ]: Checked inductivity of 384 backedges. 107 proven. 59 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-06-22 01:49:12,040 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:12,040 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:49:12,046 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:49:12,129 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:49:12,129 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:12,134 INFO ]: Computing forward predicates... [2018-06-22 01:49:12,370 INFO ]: Checked inductivity of 384 backedges. 105 proven. 28 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-06-22 01:49:12,394 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:12,394 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 20 [2018-06-22 01:49:12,394 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:49:12,394 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:49:12,394 INFO ]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:49:12,394 INFO ]: Start difference. First operand 969 states and 1746 transitions. Second operand 20 states. [2018-06-22 01:49:17,601 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:49:17,601 INFO ]: Finished difference Result 3154 states and 8236 transitions. [2018-06-22 01:49:17,601 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 01:49:17,601 INFO ]: Start accepts. Automaton has 20 states. Word has length 132 [2018-06-22 01:49:17,601 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:49:17,800 INFO ]: With dead ends: 3154 [2018-06-22 01:49:17,801 INFO ]: Without dead ends: 3154 [2018-06-22 01:49:17,802 INFO ]: 0 DeclaredPredicates, 211 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=640, Invalid=2782, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 01:49:17,803 INFO ]: Start minimizeSevpa. Operand 3154 states. [2018-06-22 01:49:18,043 INFO ]: Finished minimizeSevpa. Reduced states from 3154 to 1155. [2018-06-22 01:49:18,043 INFO ]: Start removeUnreachable. Operand 1155 states. [2018-06-22 01:49:18,066 INFO ]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2102 transitions. [2018-06-22 01:49:18,066 INFO ]: Start accepts. Automaton has 1155 states and 2102 transitions. Word has length 132 [2018-06-22 01:49:18,067 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:49:18,067 INFO ]: Abstraction has 1155 states and 2102 transitions. [2018-06-22 01:49:18,067 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:49:18,067 INFO ]: Start isEmpty. Operand 1155 states and 2102 transitions. [2018-06-22 01:49:18,080 INFO ]: Finished isEmpty. Found accepting run of length 140 [2018-06-22 01:49:18,080 INFO ]: Found error trace [2018-06-22 01:49:18,080 INFO ]: trace histogram [10, 10, 10, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:49:18,080 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:49:18,080 INFO ]: Analyzing trace with hash -289200760, now seen corresponding path program 3 times [2018-06-22 01:49:18,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:49:18,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:49:18,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:18,081 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:49:18,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:49:18,118 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:18,395 INFO ]: Checked inductivity of 403 backedges. 81 proven. 63 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-06-22 01:49:18,396 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:49:18,396 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:49:18,403 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:49:18,539 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:49:18,539 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:49:18,544 INFO ]: Computing forward predicates... [2018-06-22 01:49:18,875 INFO ]: Checked inductivity of 403 backedges. 235 proven. 13 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-06-22 01:49:18,909 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:49:18,909 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-06-22 01:49:18,909 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:49:18,909 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:49:18,909 INFO ]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:49:18,910 INFO ]: Start difference. First operand 1155 states and 2102 transitions. Second operand 25 states. Received shutdown request... [2018-06-22 01:49:20,280 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:49:20,280 WARN ]: Verification canceled [2018-06-22 01:49:20,438 WARN ]: Timeout [2018-06-22 01:49:20,439 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:49:20 BoogieIcfgContainer [2018-06-22 01:49:20,439 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:49:20,439 INFO ]: Toolchain (without parser) took 59687.29 ms. Allocated memory was 307.8 MB in the beginning and 1.0 GB in the end (delta: 706.7 MB). Free memory was 255.2 MB in the beginning and 972.5 MB in the end (delta: -717.4 MB). Peak memory consumption was 558.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:49:20,440 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 307.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:49:20,440 INFO ]: ChcToBoogie took 77.48 ms. Allocated memory is still 307.8 MB. Free memory was 255.2 MB in the beginning and 252.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:49:20,440 INFO ]: Boogie Preprocessor took 73.76 ms. Allocated memory is still 307.8 MB. Free memory was 252.2 MB in the beginning and 251.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:49:20,440 INFO ]: RCFGBuilder took 865.97 ms. Allocated memory is still 307.8 MB. Free memory was 251.1 MB in the beginning and 226.0 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:49:20,441 INFO ]: TraceAbstraction took 58654.57 ms. Allocated memory was 307.8 MB in the beginning and 1.0 GB in the end (delta: 706.7 MB). Free memory was 226.0 MB in the beginning and 972.5 MB in the end (delta: -746.5 MB). Peak memory consumption was 529.6 MB. Max. memory is 3.6 GB. [2018-06-22 01:49:20,445 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 307.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 77.48 ms. Allocated memory is still 307.8 MB. Free memory was 255.2 MB in the beginning and 252.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 73.76 ms. Allocated memory is still 307.8 MB. Free memory was 252.2 MB in the beginning and 251.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 865.97 ms. Allocated memory is still 307.8 MB. Free memory was 251.1 MB in the beginning and 226.0 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58654.57 ms. Allocated memory was 307.8 MB in the beginning and 1.0 GB in the end (delta: 706.7 MB). Free memory was 226.0 MB in the beginning and 972.5 MB in the end (delta: -746.5 MB). Peak memory consumption was 529.6 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 constructing difference of abstraction (1155states) and interpolant automaton (currently 29 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (342 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. TIMEOUT Result, 58.5s OverallTime, 20 OverallIterations, 10 TraceHistogramMax, 47.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3813 SDtfs, 3453 SDslu, 18656 SDs, 0 SdLazy, 32566 SolverSat, 7471 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1964 GetRequests, 1511 SyntacticMatches, 8 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11862 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1155occurred in iteration=19, 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: 1.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 5030 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 2871 NumberOfCodeBlocks, 2828 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2836 ConstructedInterpolants, 0 QuantifiedInterpolants, 401287 SizeOfPredicates, 104 NumberOfNonLiveVariables, 5373 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 35 InterpolantComputations, 6 PerfectInterpolantSequences, 4705/5309 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/inc4.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-49-20-454.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/inc4.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-49-20-454.csv Completed graceful shutdown