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/enc-zip_unzip.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:45:27,211 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:45:27,213 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:45:27,224 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:45:27,224 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:45:27,225 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:45:27,226 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:45:27,228 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:45:27,230 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:45:27,231 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:45:27,231 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:45:27,232 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:45:27,233 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:45:27,234 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:45:27,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:45:27,235 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:45:27,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:45:27,240 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:45:27,242 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:45:27,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:45:27,244 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:45:27,246 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:45:27,247 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:45:27,247 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:45:27,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:45:27,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:45:27,249 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:45:27,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:45:27,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:45:27,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:45:27,252 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:45:27,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:45:27,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:45:27,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:45:27,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:45:27,255 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:45:27,273 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:45:27,273 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:45:27,273 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:45:27,274 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:45:27,275 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:45:27,275 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:45:27,275 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:45:27,275 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:45:27,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:45:27,276 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:45:27,276 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:45:27,276 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:45:27,277 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:45:27,277 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:45:27,277 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:45:27,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:45:27,278 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:45:27,279 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:45:27,279 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:45:27,317 INFO ]: Repository-Root is: /tmp [2018-06-22 01:45:27,334 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:45:27,340 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:45:27,341 INFO ]: Initializing SmtParser... [2018-06-22 01:45:27,342 INFO ]: SmtParser initialized [2018-06-22 01:45:27,342 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 [2018-06-22 01:45:27,344 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:45:27,442 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 unknown [2018-06-22 01:45:27,745 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 [2018-06-22 01:45:27,749 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:45:27,758 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:45:27,758 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:45:27,758 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:45:27,759 INFO ]: ChcToBoogie initialized [2018-06-22 01:45:27,762 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:45:27" (1/1) ... [2018-06-22 01:45:27,818 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:45:27 Unit [2018-06-22 01:45:27,818 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:45:27,819 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:45:27,819 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:45:27,819 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:45:27,839 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:45:27" (1/1) ... [2018-06-22 01:45:27,839 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:45:27" (1/1) ... [2018-06-22 01:45:27,846 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:45:27" (1/1) ... [2018-06-22 01:45:27,846 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:45:27" (1/1) ... [2018-06-22 01:45:27,854 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:45:27" (1/1) ... [2018-06-22 01:45:27,858 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:45:27" (1/1) ... [2018-06-22 01:45:27,859 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:45:27" (1/1) ... [2018-06-22 01:45:27,862 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:45:27,862 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:45:27,862 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:45:27,862 INFO ]: RCFGBuilder initialized [2018-06-22 01:45:27,863 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:45:27" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:45:27,881 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:45:27,881 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:45:27,881 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:45:27,881 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:45:27,881 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:45:27,881 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:45:28,233 INFO ]: Using library mode [2018-06-22 01:45:28,234 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:45:28 BoogieIcfgContainer [2018-06-22 01:45:28,234 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:45:28,238 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:45:28,238 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:45:28,250 INFO ]: TraceAbstraction initialized [2018-06-22 01:45:28,250 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:45:27" (1/3) ... [2018-06-22 01:45:28,251 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34d4d564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:45:28, skipping insertion in model container [2018-06-22 01:45:28,251 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:45:27" (2/3) ... [2018-06-22 01:45:28,251 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34d4d564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:45:28, skipping insertion in model container [2018-06-22 01:45:28,252 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:45:28" (3/3) ... [2018-06-22 01:45:28,253 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:45:28,264 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:45:28,274 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:45:28,313 INFO ]: Using default assertion order modulation [2018-06-22 01:45:28,313 INFO ]: Interprodecural is true [2018-06-22 01:45:28,313 INFO ]: Hoare is false [2018-06-22 01:45:28,313 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:45:28,313 INFO ]: Backedges is TWOTRACK [2018-06-22 01:45:28,313 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:45:28,313 INFO ]: Difference is false [2018-06-22 01:45:28,313 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:45:28,314 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:45:28,327 INFO ]: Start isEmpty. Operand 20 states. [2018-06-22 01:45:28,340 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:45:28,340 INFO ]: Found error trace [2018-06-22 01:45:28,343 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:28,343 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:28,347 INFO ]: Analyzing trace with hash 83609652, now seen corresponding path program 1 times [2018-06-22 01:45:28,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:28,349 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:28,382 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:28,382 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:28,382 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:28,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:28,432 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:45:28,433 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:45:28,434 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:45:28,435 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:45:28,448 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:45:28,448 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:45:28,452 INFO ]: Start difference. First operand 20 states. Second operand 2 states. [2018-06-22 01:45:28,472 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:28,474 INFO ]: Finished difference Result 18 states and 25 transitions. [2018-06-22 01:45:28,474 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:45:28,475 INFO ]: Start accepts. Automaton has 2 states. Word has length 8 [2018-06-22 01:45:28,476 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:28,483 INFO ]: With dead ends: 18 [2018-06-22 01:45:28,483 INFO ]: Without dead ends: 18 [2018-06-22 01:45:28,485 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:45:28,500 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:45:28,518 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 01:45:28,520 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:45:28,521 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-06-22 01:45:28,522 INFO ]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 8 [2018-06-22 01:45:28,522 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:28,522 INFO ]: Abstraction has 18 states and 25 transitions. [2018-06-22 01:45:28,522 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:45:28,522 INFO ]: Start isEmpty. Operand 18 states and 25 transitions. [2018-06-22 01:45:28,523 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:45:28,524 INFO ]: Found error trace [2018-06-22 01:45:28,524 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:28,524 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:28,524 INFO ]: Analyzing trace with hash -1746512661, now seen corresponding path program 1 times [2018-06-22 01:45:28,524 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:28,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:28,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:28,525 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:28,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:28,533 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:28,596 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:45:28,596 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:45:28,596 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:45:28,598 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:45:28,598 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:45:28,598 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:45:28,598 INFO ]: Start difference. First operand 18 states and 25 transitions. Second operand 4 states. [2018-06-22 01:45:28,695 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:28,695 INFO ]: Finished difference Result 29 states and 42 transitions. [2018-06-22 01:45:28,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:45:28,695 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:45:28,696 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:28,696 INFO ]: With dead ends: 29 [2018-06-22 01:45:28,696 INFO ]: Without dead ends: 29 [2018-06-22 01:45:28,697 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:45:28,697 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:45:28,703 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-22 01:45:28,703 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:45:28,705 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2018-06-22 01:45:28,705 INFO ]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 9 [2018-06-22 01:45:28,705 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:28,705 INFO ]: Abstraction has 29 states and 42 transitions. [2018-06-22 01:45:28,705 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:45:28,705 INFO ]: Start isEmpty. Operand 29 states and 42 transitions. [2018-06-22 01:45:28,706 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:45:28,706 INFO ]: Found error trace [2018-06-22 01:45:28,706 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:28,706 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:28,706 INFO ]: Analyzing trace with hash 2091439698, now seen corresponding path program 1 times [2018-06-22 01:45:28,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:28,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:28,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:28,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:28,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:28,720 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:28,790 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:45:28,790 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:45:28,790 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:45:28,790 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:45:28,790 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:45:28,790 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:45:28,791 INFO ]: Start difference. First operand 29 states and 42 transitions. Second operand 4 states. [2018-06-22 01:45:28,982 WARN ]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 01:45:29,059 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:29,059 INFO ]: Finished difference Result 43 states and 66 transitions. [2018-06-22 01:45:29,060 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:45:29,060 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 01:45:29,061 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:29,063 INFO ]: With dead ends: 43 [2018-06-22 01:45:29,063 INFO ]: Without dead ends: 43 [2018-06-22 01:45:29,067 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:45:29,067 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:45:29,075 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 33. [2018-06-22 01:45:29,075 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:45:29,077 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2018-06-22 01:45:29,079 INFO ]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 11 [2018-06-22 01:45:29,079 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:29,079 INFO ]: Abstraction has 33 states and 48 transitions. [2018-06-22 01:45:29,079 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:45:29,079 INFO ]: Start isEmpty. Operand 33 states and 48 transitions. [2018-06-22 01:45:29,080 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:45:29,080 INFO ]: Found error trace [2018-06-22 01:45:29,080 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:29,080 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:29,080 INFO ]: Analyzing trace with hash -866909, now seen corresponding path program 1 times [2018-06-22 01:45:29,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:29,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:29,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:29,081 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:29,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:29,100 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:29,206 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:45:29,206 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:45:29,206 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:45:29,206 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:45:29,206 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:45:29,206 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:45:29,207 INFO ]: Start difference. First operand 33 states and 48 transitions. Second operand 4 states. [2018-06-22 01:45:29,295 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:29,295 INFO ]: Finished difference Result 48 states and 72 transitions. [2018-06-22 01:45:29,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:45:29,296 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 01:45:29,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:29,297 INFO ]: With dead ends: 48 [2018-06-22 01:45:29,297 INFO ]: Without dead ends: 48 [2018-06-22 01:45:29,298 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:45:29,298 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:45:29,305 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 30. [2018-06-22 01:45:29,305 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:45:29,308 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-06-22 01:45:29,308 INFO ]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 11 [2018-06-22 01:45:29,308 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:29,308 INFO ]: Abstraction has 30 states and 42 transitions. [2018-06-22 01:45:29,308 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:45:29,308 INFO ]: Start isEmpty. Operand 30 states and 42 transitions. [2018-06-22 01:45:29,309 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:45:29,309 INFO ]: Found error trace [2018-06-22 01:45:29,309 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:29,309 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:29,309 INFO ]: Analyzing trace with hash 1969745215, now seen corresponding path program 1 times [2018-06-22 01:45:29,309 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:29,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:29,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:29,310 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:29,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:29,324 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:29,351 INFO ]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:45:29,351 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:45:29,351 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:45:29,351 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:45:29,351 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:45:29,351 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:45:29,352 INFO ]: Start difference. First operand 30 states and 42 transitions. Second operand 4 states. [2018-06-22 01:45:29,494 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:29,494 INFO ]: Finished difference Result 45 states and 63 transitions. [2018-06-22 01:45:29,495 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:45:29,495 INFO ]: Start accepts. Automaton has 4 states. Word has length 20 [2018-06-22 01:45:29,495 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:29,496 INFO ]: With dead ends: 45 [2018-06-22 01:45:29,496 INFO ]: Without dead ends: 45 [2018-06-22 01:45:29,496 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:45:29,496 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:45:29,503 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-22 01:45:29,503 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:45:29,504 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2018-06-22 01:45:29,505 INFO ]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 20 [2018-06-22 01:45:29,506 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:29,506 INFO ]: Abstraction has 45 states and 63 transitions. [2018-06-22 01:45:29,506 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:45:29,506 INFO ]: Start isEmpty. Operand 45 states and 63 transitions. [2018-06-22 01:45:29,508 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:45:29,508 INFO ]: Found error trace [2018-06-22 01:45:29,508 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:29,508 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:29,508 INFO ]: Analyzing trace with hash -1464222922, now seen corresponding path program 1 times [2018-06-22 01:45:29,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:29,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:29,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:29,509 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:29,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:29,528 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:29,681 INFO ]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:45:29,681 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:29,682 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:45:29,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:29,729 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:29,737 INFO ]: Computing forward predicates... [2018-06-22 01:45:30,676 INFO ]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:45:30,700 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:30,700 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 01:45:30,701 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:45:30,701 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:45:30,701 INFO ]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:45:30,701 INFO ]: Start difference. First operand 45 states and 63 transitions. Second operand 16 states. [2018-06-22 01:45:32,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:32,036 INFO ]: Finished difference Result 183 states and 305 transitions. [2018-06-22 01:45:32,036 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:45:32,036 INFO ]: Start accepts. Automaton has 16 states. Word has length 29 [2018-06-22 01:45:32,036 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:32,040 INFO ]: With dead ends: 183 [2018-06-22 01:45:32,040 INFO ]: Without dead ends: 173 [2018-06-22 01:45:32,041 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:45:32,041 INFO ]: Start minimizeSevpa. Operand 173 states. [2018-06-22 01:45:32,071 INFO ]: Finished minimizeSevpa. Reduced states from 173 to 120. [2018-06-22 01:45:32,071 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-22 01:45:32,074 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2018-06-22 01:45:32,074 INFO ]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 29 [2018-06-22 01:45:32,074 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:32,074 INFO ]: Abstraction has 120 states and 176 transitions. [2018-06-22 01:45:32,074 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:45:32,074 INFO ]: Start isEmpty. Operand 120 states and 176 transitions. [2018-06-22 01:45:32,078 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:45:32,078 INFO ]: Found error trace [2018-06-22 01:45:32,078 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:32,078 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:32,078 INFO ]: Analyzing trace with hash 1877923911, now seen corresponding path program 1 times [2018-06-22 01:45:32,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:32,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:32,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:32,079 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:32,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:32,097 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:32,167 INFO ]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:45:32,168 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:32,168 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:45:32,181 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:32,201 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:32,204 INFO ]: Computing forward predicates... [2018-06-22 01:45:32,261 INFO ]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:45:32,280 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:32,280 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-22 01:45:32,281 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:45:32,281 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:45:32,281 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:45:32,281 INFO ]: Start difference. First operand 120 states and 176 transitions. Second operand 12 states. [2018-06-22 01:45:32,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:32,615 INFO ]: Finished difference Result 191 states and 319 transitions. [2018-06-22 01:45:32,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:45:32,616 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 01:45:32,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:32,618 INFO ]: With dead ends: 191 [2018-06-22 01:45:32,618 INFO ]: Without dead ends: 191 [2018-06-22 01:45:32,619 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:45:32,619 INFO ]: Start minimizeSevpa. Operand 191 states. [2018-06-22 01:45:32,658 INFO ]: Finished minimizeSevpa. Reduced states from 191 to 138. [2018-06-22 01:45:32,659 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 01:45:32,661 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 206 transitions. [2018-06-22 01:45:32,661 INFO ]: Start accepts. Automaton has 138 states and 206 transitions. Word has length 29 [2018-06-22 01:45:32,661 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:32,661 INFO ]: Abstraction has 138 states and 206 transitions. [2018-06-22 01:45:32,661 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:45:32,662 INFO ]: Start isEmpty. Operand 138 states and 206 transitions. [2018-06-22 01:45:32,665 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:45:32,665 INFO ]: Found error trace [2018-06-22 01:45:32,665 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:32,666 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:32,666 INFO ]: Analyzing trace with hash 1474714010, now seen corresponding path program 1 times [2018-06-22 01:45:32,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:32,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:32,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:32,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:32,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:32,680 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:32,833 INFO ]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:45:32,833 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:32,833 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:45:32,839 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:32,883 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:32,886 INFO ]: Computing forward predicates... [2018-06-22 01:45:32,982 INFO ]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:45:33,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:33,002 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 01:45:33,002 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:45:33,002 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:45:33,002 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:45:33,002 INFO ]: Start difference. First operand 138 states and 206 transitions. Second operand 11 states. [2018-06-22 01:45:33,527 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:33,527 INFO ]: Finished difference Result 245 states and 446 transitions. [2018-06-22 01:45:33,528 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:45:33,528 INFO ]: Start accepts. Automaton has 11 states. Word has length 30 [2018-06-22 01:45:33,528 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:33,532 INFO ]: With dead ends: 245 [2018-06-22 01:45:33,532 INFO ]: Without dead ends: 245 [2018-06-22 01:45:33,532 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:45:33,533 INFO ]: Start minimizeSevpa. Operand 245 states. [2018-06-22 01:45:33,566 INFO ]: Finished minimizeSevpa. Reduced states from 245 to 163. [2018-06-22 01:45:33,566 INFO ]: Start removeUnreachable. Operand 163 states. [2018-06-22 01:45:33,569 INFO ]: Finished removeUnreachable. Reduced from 163 states to 163 states and 258 transitions. [2018-06-22 01:45:33,569 INFO ]: Start accepts. Automaton has 163 states and 258 transitions. Word has length 30 [2018-06-22 01:45:33,569 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:33,569 INFO ]: Abstraction has 163 states and 258 transitions. [2018-06-22 01:45:33,570 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:45:33,570 INFO ]: Start isEmpty. Operand 163 states and 258 transitions. [2018-06-22 01:45:33,574 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:45:33,574 INFO ]: Found error trace [2018-06-22 01:45:33,574 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:33,574 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:33,574 INFO ]: Analyzing trace with hash 2002050729, now seen corresponding path program 1 times [2018-06-22 01:45:33,574 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:33,574 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:33,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:33,575 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:33,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:33,588 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:34,109 INFO ]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:45:34,109 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:34,109 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:45:34,127 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:45:34,150 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:34,153 INFO ]: Computing forward predicates... [2018-06-22 01:45:34,308 INFO ]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:45:34,329 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:34,329 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 01:45:34,329 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:45:34,329 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:45:34,330 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:45:34,330 INFO ]: Start difference. First operand 163 states and 258 transitions. Second operand 11 states. [2018-06-22 01:45:34,914 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:34,914 INFO ]: Finished difference Result 263 states and 494 transitions. [2018-06-22 01:45:34,915 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:45:34,915 INFO ]: Start accepts. Automaton has 11 states. Word has length 30 [2018-06-22 01:45:34,915 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:34,918 INFO ]: With dead ends: 263 [2018-06-22 01:45:34,918 INFO ]: Without dead ends: 263 [2018-06-22 01:45:34,918 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:45:34,918 INFO ]: Start minimizeSevpa. Operand 263 states. [2018-06-22 01:45:34,952 INFO ]: Finished minimizeSevpa. Reduced states from 263 to 145. [2018-06-22 01:45:34,952 INFO ]: Start removeUnreachable. Operand 145 states. [2018-06-22 01:45:34,954 INFO ]: Finished removeUnreachable. Reduced from 145 states to 145 states and 216 transitions. [2018-06-22 01:45:34,954 INFO ]: Start accepts. Automaton has 145 states and 216 transitions. Word has length 30 [2018-06-22 01:45:34,955 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:34,955 INFO ]: Abstraction has 145 states and 216 transitions. [2018-06-22 01:45:34,955 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:45:34,955 INFO ]: Start isEmpty. Operand 145 states and 216 transitions. [2018-06-22 01:45:34,962 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:45:34,962 INFO ]: Found error trace [2018-06-22 01:45:34,962 INFO ]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:34,962 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:34,962 INFO ]: Analyzing trace with hash -347295969, now seen corresponding path program 2 times [2018-06-22 01:45:34,962 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:34,962 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:34,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:34,963 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:34,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:34,974 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:35,024 INFO ]: Checked inductivity of 37 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:45:35,024 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:35,024 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:45:35,031 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:45:35,067 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:45:35,067 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:35,069 INFO ]: Computing forward predicates... [2018-06-22 01:45:35,074 INFO ]: Checked inductivity of 37 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:45:35,093 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:35,093 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:45:35,094 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:45:35,094 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:45:35,094 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:45:35,094 INFO ]: Start difference. First operand 145 states and 216 transitions. Second operand 4 states. [2018-06-22 01:45:35,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:35,171 INFO ]: Finished difference Result 164 states and 240 transitions. [2018-06-22 01:45:35,171 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:45:35,171 INFO ]: Start accepts. Automaton has 4 states. Word has length 39 [2018-06-22 01:45:35,172 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:35,174 INFO ]: With dead ends: 164 [2018-06-22 01:45:35,174 INFO ]: Without dead ends: 136 [2018-06-22 01:45:35,175 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 41 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:45:35,175 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-22 01:45:35,186 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-06-22 01:45:35,186 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-22 01:45:35,188 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2018-06-22 01:45:35,188 INFO ]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 39 [2018-06-22 01:45:35,188 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:35,188 INFO ]: Abstraction has 136 states and 199 transitions. [2018-06-22 01:45:35,188 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:45:35,188 INFO ]: Start isEmpty. Operand 136 states and 199 transitions. [2018-06-22 01:45:35,191 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:45:35,194 INFO ]: Found error trace [2018-06-22 01:45:35,194 INFO ]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:35,194 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:35,195 INFO ]: Analyzing trace with hash 2084336638, now seen corresponding path program 3 times [2018-06-22 01:45:35,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:35,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:35,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:35,195 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:45:35,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:35,213 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:35,374 INFO ]: Checked inductivity of 63 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 01:45:35,374 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:35,374 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:45:35,388 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:45:35,423 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:45:35,423 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:35,427 INFO ]: Computing forward predicates... [2018-06-22 01:45:35,696 INFO ]: Checked inductivity of 63 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 01:45:35,721 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:35,721 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-06-22 01:45:35,722 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:45:35,722 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:45:35,722 INFO ]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:45:35,722 INFO ]: Start difference. First operand 136 states and 199 transitions. Second operand 23 states. [2018-06-22 01:45:37,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:37,358 INFO ]: Finished difference Result 301 states and 534 transitions. [2018-06-22 01:45:37,358 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:45:37,358 INFO ]: Start accepts. Automaton has 23 states. Word has length 48 [2018-06-22 01:45:37,358 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:37,362 INFO ]: With dead ends: 301 [2018-06-22 01:45:37,362 INFO ]: Without dead ends: 301 [2018-06-22 01:45:37,362 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=300, Invalid=2052, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:45:37,364 INFO ]: Start minimizeSevpa. Operand 301 states. [2018-06-22 01:45:37,384 INFO ]: Finished minimizeSevpa. Reduced states from 301 to 202. [2018-06-22 01:45:37,384 INFO ]: Start removeUnreachable. Operand 202 states. [2018-06-22 01:45:37,385 INFO ]: Finished removeUnreachable. Reduced from 202 states to 202 states and 301 transitions. [2018-06-22 01:45:37,386 INFO ]: Start accepts. Automaton has 202 states and 301 transitions. Word has length 48 [2018-06-22 01:45:37,387 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:37,387 INFO ]: Abstraction has 202 states and 301 transitions. [2018-06-22 01:45:37,387 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:45:37,387 INFO ]: Start isEmpty. Operand 202 states and 301 transitions. [2018-06-22 01:45:37,392 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:45:37,392 INFO ]: Found error trace [2018-06-22 01:45:37,392 INFO ]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:37,392 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:37,392 INFO ]: Analyzing trace with hash 1844409165, now seen corresponding path program 2 times [2018-06-22 01:45:37,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:37,392 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:37,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:37,393 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:45:37,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:37,417 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:37,551 INFO ]: Checked inductivity of 63 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 01:45:37,551 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:37,551 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:45:37,560 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:45:37,584 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:45:37,584 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:37,587 INFO ]: Computing forward predicates... [2018-06-22 01:45:37,685 INFO ]: Checked inductivity of 63 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 01:45:37,705 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:37,705 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 15 [2018-06-22 01:45:37,705 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:45:37,705 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:45:37,705 INFO ]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:45:37,706 INFO ]: Start difference. First operand 202 states and 301 transitions. Second operand 15 states. [2018-06-22 01:45:38,203 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:38,203 INFO ]: Finished difference Result 317 states and 576 transitions. [2018-06-22 01:45:38,203 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:45:38,203 INFO ]: Start accepts. Automaton has 15 states. Word has length 48 [2018-06-22 01:45:38,204 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:38,207 INFO ]: With dead ends: 317 [2018-06-22 01:45:38,207 INFO ]: Without dead ends: 317 [2018-06-22 01:45:38,207 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:45:38,208 INFO ]: Start minimizeSevpa. Operand 317 states. [2018-06-22 01:45:38,225 INFO ]: Finished minimizeSevpa. Reduced states from 317 to 210. [2018-06-22 01:45:38,226 INFO ]: Start removeUnreachable. Operand 210 states. [2018-06-22 01:45:38,227 INFO ]: Finished removeUnreachable. Reduced from 210 states to 210 states and 317 transitions. [2018-06-22 01:45:38,227 INFO ]: Start accepts. Automaton has 210 states and 317 transitions. Word has length 48 [2018-06-22 01:45:38,228 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:38,228 INFO ]: Abstraction has 210 states and 317 transitions. [2018-06-22 01:45:38,228 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:45:38,228 INFO ]: Start isEmpty. Operand 210 states and 317 transitions. [2018-06-22 01:45:38,231 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 01:45:38,231 INFO ]: Found error trace [2018-06-22 01:45:38,231 INFO ]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:38,231 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:38,231 INFO ]: Analyzing trace with hash -1558785254, now seen corresponding path program 4 times [2018-06-22 01:45:38,231 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:38,231 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:38,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:38,232 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:45:38,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:38,244 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:38,395 INFO ]: Checked inductivity of 65 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:45:38,395 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:38,395 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:45:38,401 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:45:38,439 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:45:38,439 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:38,443 INFO ]: Computing forward predicates... [2018-06-22 01:45:38,561 INFO ]: Checked inductivity of 65 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 01:45:38,594 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:38,594 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2018-06-22 01:45:38,594 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:45:38,594 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:45:38,594 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:45:38,595 INFO ]: Start difference. First operand 210 states and 317 transitions. Second operand 13 states. [2018-06-22 01:45:39,084 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 01:45:39,893 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:39,894 INFO ]: Finished difference Result 413 states and 842 transitions. [2018-06-22 01:45:39,894 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:45:39,894 INFO ]: Start accepts. Automaton has 13 states. Word has length 49 [2018-06-22 01:45:39,894 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:39,899 INFO ]: With dead ends: 413 [2018-06-22 01:45:39,899 INFO ]: Without dead ends: 413 [2018-06-22 01:45:39,899 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:45:39,899 INFO ]: Start minimizeSevpa. Operand 413 states. [2018-06-22 01:45:39,933 INFO ]: Finished minimizeSevpa. Reduced states from 413 to 242. [2018-06-22 01:45:39,934 INFO ]: Start removeUnreachable. Operand 242 states. [2018-06-22 01:45:39,936 INFO ]: Finished removeUnreachable. Reduced from 242 states to 242 states and 383 transitions. [2018-06-22 01:45:39,936 INFO ]: Start accepts. Automaton has 242 states and 383 transitions. Word has length 49 [2018-06-22 01:45:39,936 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:39,936 INFO ]: Abstraction has 242 states and 383 transitions. [2018-06-22 01:45:39,936 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:45:39,936 INFO ]: Start isEmpty. Operand 242 states and 383 transitions. [2018-06-22 01:45:39,940 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 01:45:39,940 INFO ]: Found error trace [2018-06-22 01:45:39,940 INFO ]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:39,940 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:39,940 INFO ]: Analyzing trace with hash -406602325, now seen corresponding path program 3 times [2018-06-22 01:45:39,940 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:39,940 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:39,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:39,941 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:45:39,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:39,952 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:40,181 INFO ]: Checked inductivity of 65 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:45:40,181 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:40,181 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:45:40,187 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:45:40,229 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:45:40,229 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:40,232 INFO ]: Computing forward predicates... [2018-06-22 01:45:40,284 INFO ]: Checked inductivity of 65 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 01:45:40,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:40,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2018-06-22 01:45:40,304 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:45:40,304 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:45:40,304 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:45:40,304 INFO ]: Start difference. First operand 242 states and 383 transitions. Second operand 13 states. [2018-06-22 01:45:41,095 WARN ]: Spent 209.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-06-22 01:45:41,516 WARN ]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 01:45:42,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:42,072 INFO ]: Finished difference Result 437 states and 922 transitions. [2018-06-22 01:45:42,075 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:45:42,075 INFO ]: Start accepts. Automaton has 13 states. Word has length 49 [2018-06-22 01:45:42,076 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:42,080 INFO ]: With dead ends: 437 [2018-06-22 01:45:42,080 INFO ]: Without dead ends: 437 [2018-06-22 01:45:42,081 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:45:42,081 INFO ]: Start minimizeSevpa. Operand 437 states. [2018-06-22 01:45:42,109 INFO ]: Finished minimizeSevpa. Reduced states from 437 to 218. [2018-06-22 01:45:42,109 INFO ]: Start removeUnreachable. Operand 218 states. [2018-06-22 01:45:42,111 INFO ]: Finished removeUnreachable. Reduced from 218 states to 218 states and 327 transitions. [2018-06-22 01:45:42,111 INFO ]: Start accepts. Automaton has 218 states and 327 transitions. Word has length 49 [2018-06-22 01:45:42,111 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:42,111 INFO ]: Abstraction has 218 states and 327 transitions. [2018-06-22 01:45:42,111 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:45:42,111 INFO ]: Start isEmpty. Operand 218 states and 327 transitions. [2018-06-22 01:45:42,116 INFO ]: Finished isEmpty. Found accepting run of length 68 [2018-06-22 01:45:42,116 INFO ]: Found error trace [2018-06-22 01:45:42,116 INFO ]: trace histogram [7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:42,116 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:42,116 INFO ]: Analyzing trace with hash 1010205950, now seen corresponding path program 5 times [2018-06-22 01:45:42,116 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:42,116 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:42,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:42,117 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:45:42,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:42,139 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:42,508 INFO ]: Checked inductivity of 138 backedges. 50 proven. 27 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 01:45:42,508 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:42,508 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:45:42,513 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:45:42,543 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:45:42,543 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:42,548 INFO ]: Computing forward predicates... [2018-06-22 01:45:42,737 INFO ]: Checked inductivity of 138 backedges. 20 proven. 51 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 01:45:42,765 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:42,765 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2018-06-22 01:45:42,765 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:45:42,765 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:45:42,765 INFO ]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:45:42,766 INFO ]: Start difference. First operand 218 states and 327 transitions. Second operand 26 states. [2018-06-22 01:45:44,722 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:44,723 INFO ]: Finished difference Result 501 states and 961 transitions. [2018-06-22 01:45:44,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-06-22 01:45:44,723 INFO ]: Start accepts. Automaton has 26 states. Word has length 67 [2018-06-22 01:45:44,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:44,726 INFO ]: With dead ends: 501 [2018-06-22 01:45:44,726 INFO ]: Without dead ends: 501 [2018-06-22 01:45:44,731 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=510, Invalid=4320, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 01:45:44,731 INFO ]: Start minimizeSevpa. Operand 501 states. [2018-06-22 01:45:44,758 INFO ]: Finished minimizeSevpa. Reduced states from 501 to 324. [2018-06-22 01:45:44,758 INFO ]: Start removeUnreachable. Operand 324 states. [2018-06-22 01:45:44,761 INFO ]: Finished removeUnreachable. Reduced from 324 states to 324 states and 494 transitions. [2018-06-22 01:45:44,761 INFO ]: Start accepts. Automaton has 324 states and 494 transitions. Word has length 67 [2018-06-22 01:45:44,761 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:44,761 INFO ]: Abstraction has 324 states and 494 transitions. [2018-06-22 01:45:44,761 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:45:44,761 INFO ]: Start isEmpty. Operand 324 states and 494 transitions. [2018-06-22 01:45:44,767 INFO ]: Finished isEmpty. Found accepting run of length 68 [2018-06-22 01:45:44,767 INFO ]: Found error trace [2018-06-22 01:45:44,767 INFO ]: trace histogram [7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:44,767 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:44,767 INFO ]: Analyzing trace with hash 1757302095, now seen corresponding path program 4 times [2018-06-22 01:45:44,767 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:44,767 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:44,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:44,769 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:45:44,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:44,783 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:45,404 INFO ]: Checked inductivity of 138 backedges. 50 proven. 27 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 01:45:45,404 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:45,404 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:45:45,411 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:45:45,446 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:45:45,466 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:45,470 INFO ]: Computing forward predicates... [2018-06-22 01:45:45,554 INFO ]: Checked inductivity of 138 backedges. 63 proven. 8 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 01:45:45,575 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:45,575 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2018-06-22 01:45:45,575 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:45:45,575 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:45:45,575 INFO ]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:45:45,575 INFO ]: Start difference. First operand 324 states and 494 transitions. Second operand 17 states. [2018-06-22 01:45:46,037 WARN ]: Spent 158.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-06-22 01:45:47,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:47,214 INFO ]: Finished difference Result 548 states and 1103 transitions. [2018-06-22 01:45:47,214 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:45:47,214 INFO ]: Start accepts. Automaton has 17 states. Word has length 67 [2018-06-22 01:45:47,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:47,217 INFO ]: With dead ends: 548 [2018-06-22 01:45:47,218 INFO ]: Without dead ends: 548 [2018-06-22 01:45:47,218 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:45:47,218 INFO ]: Start minimizeSevpa. Operand 548 states. [2018-06-22 01:45:47,252 INFO ]: Finished minimizeSevpa. Reduced states from 548 to 335. [2018-06-22 01:45:47,252 INFO ]: Start removeUnreachable. Operand 335 states. [2018-06-22 01:45:47,255 INFO ]: Finished removeUnreachable. Reduced from 335 states to 335 states and 516 transitions. [2018-06-22 01:45:47,255 INFO ]: Start accepts. Automaton has 335 states and 516 transitions. Word has length 67 [2018-06-22 01:45:47,255 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:47,256 INFO ]: Abstraction has 335 states and 516 transitions. [2018-06-22 01:45:47,256 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:45:47,256 INFO ]: Start isEmpty. Operand 335 states and 516 transitions. [2018-06-22 01:45:47,262 INFO ]: Finished isEmpty. Found accepting run of length 69 [2018-06-22 01:45:47,262 INFO ]: Found error trace [2018-06-22 01:45:47,262 INFO ]: trace histogram [7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:47,262 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:47,262 INFO ]: Analyzing trace with hash 1197291618, now seen corresponding path program 6 times [2018-06-22 01:45:47,262 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:47,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:47,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:47,263 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:45:47,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:47,278 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:47,499 INFO ]: Checked inductivity of 141 backedges. 20 proven. 58 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-22 01:45:47,499 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:47,499 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:45:47,504 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:45:47,542 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:45:47,575 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:47,578 INFO ]: Computing forward predicates... [2018-06-22 01:45:47,697 INFO ]: Checked inductivity of 141 backedges. 20 proven. 54 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 01:45:47,717 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:47,717 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 15 [2018-06-22 01:45:47,717 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:45:47,717 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:45:47,717 INFO ]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:45:47,717 INFO ]: Start difference. First operand 335 states and 516 transitions. Second operand 15 states. [2018-06-22 01:45:49,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:49,117 INFO ]: Finished difference Result 721 states and 1663 transitions. [2018-06-22 01:45:49,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:45:49,118 INFO ]: Start accepts. Automaton has 15 states. Word has length 68 [2018-06-22 01:45:49,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:49,123 INFO ]: With dead ends: 721 [2018-06-22 01:45:49,123 INFO ]: Without dead ends: 721 [2018-06-22 01:45:49,124 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 65 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=277, Invalid=1615, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:45:49,124 INFO ]: Start minimizeSevpa. Operand 721 states. [2018-06-22 01:45:49,188 INFO ]: Finished minimizeSevpa. Reduced states from 721 to 376. [2018-06-22 01:45:49,188 INFO ]: Start removeUnreachable. Operand 376 states. [2018-06-22 01:45:49,190 INFO ]: Finished removeUnreachable. Reduced from 376 states to 376 states and 603 transitions. [2018-06-22 01:45:49,190 INFO ]: Start accepts. Automaton has 376 states and 603 transitions. Word has length 68 [2018-06-22 01:45:49,191 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:49,191 INFO ]: Abstraction has 376 states and 603 transitions. [2018-06-22 01:45:49,191 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:45:49,191 INFO ]: Start isEmpty. Operand 376 states and 603 transitions. [2018-06-22 01:45:49,198 INFO ]: Finished isEmpty. Found accepting run of length 69 [2018-06-22 01:45:49,199 INFO ]: Found error trace [2018-06-22 01:45:49,199 INFO ]: trace histogram [7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:49,199 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:49,199 INFO ]: Analyzing trace with hash -1412531663, now seen corresponding path program 5 times [2018-06-22 01:45:49,199 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:49,199 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:49,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:49,199 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:45:49,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:49,214 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:49,476 INFO ]: Checked inductivity of 141 backedges. 20 proven. 58 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-22 01:45:49,555 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:49,555 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:45:49,565 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:45:49,648 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:45:49,648 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:49,651 INFO ]: Computing forward predicates... [2018-06-22 01:45:49,735 INFO ]: Checked inductivity of 141 backedges. 20 proven. 54 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 01:45:49,762 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:49,762 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 15 [2018-06-22 01:45:49,762 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:45:49,762 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:45:49,762 INFO ]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:45:49,762 INFO ]: Start difference. First operand 376 states and 603 transitions. Second operand 15 states. [2018-06-22 01:45:50,802 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:50,822 INFO ]: Finished difference Result 754 states and 1795 transitions. [2018-06-22 01:45:50,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:45:50,823 INFO ]: Start accepts. Automaton has 15 states. Word has length 68 [2018-06-22 01:45:50,823 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:50,830 INFO ]: With dead ends: 754 [2018-06-22 01:45:50,830 INFO ]: Without dead ends: 754 [2018-06-22 01:45:50,831 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 66 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=1615, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:45:50,831 INFO ]: Start minimizeSevpa. Operand 754 states. [2018-06-22 01:45:50,883 INFO ]: Finished minimizeSevpa. Reduced states from 754 to 343. [2018-06-22 01:45:50,883 INFO ]: Start removeUnreachable. Operand 343 states. [2018-06-22 01:45:50,885 INFO ]: Finished removeUnreachable. Reduced from 343 states to 343 states and 526 transitions. [2018-06-22 01:45:50,885 INFO ]: Start accepts. Automaton has 343 states and 526 transitions. Word has length 68 [2018-06-22 01:45:50,885 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:50,885 INFO ]: Abstraction has 343 states and 526 transitions. [2018-06-22 01:45:50,885 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:45:50,885 INFO ]: Start isEmpty. Operand 343 states and 526 transitions. [2018-06-22 01:45:50,891 INFO ]: Finished isEmpty. Found accepting run of length 87 [2018-06-22 01:45:50,891 INFO ]: Found error trace [2018-06-22 01:45:50,891 INFO ]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:50,891 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:50,892 INFO ]: Analyzing trace with hash -1272012858, now seen corresponding path program 7 times [2018-06-22 01:45:50,892 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:50,892 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:50,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:50,892 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:45:50,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:50,912 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:51,313 INFO ]: Checked inductivity of 242 backedges. 93 proven. 40 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-06-22 01:45:51,313 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:51,313 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:45:51,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:51,354 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:51,359 INFO ]: Computing forward predicates... [2018-06-22 01:45:51,553 INFO ]: Checked inductivity of 242 backedges. 27 proven. 97 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-22 01:45:51,572 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:51,573 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2018-06-22 01:45:51,573 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:45:51,573 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:45:51,573 INFO ]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:45:51,573 INFO ]: Start difference. First operand 343 states and 526 transitions. Second operand 30 states. [2018-06-22 01:45:52,697 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 01:45:54,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:54,620 INFO ]: Finished difference Result 850 states and 1747 transitions. [2018-06-22 01:45:54,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-06-22 01:45:54,620 INFO ]: Start accepts. Automaton has 30 states. Word has length 86 [2018-06-22 01:45:54,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:54,626 INFO ]: With dead ends: 850 [2018-06-22 01:45:54,626 INFO ]: Without dead ends: 850 [2018-06-22 01:45:54,629 INFO ]: 0 DeclaredPredicates, 178 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3098 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=823, Invalid=8297, Unknown=0, NotChecked=0, Total=9120 [2018-06-22 01:45:54,629 INFO ]: Start minimizeSevpa. Operand 850 states. [2018-06-22 01:45:54,668 INFO ]: Finished minimizeSevpa. Reduced states from 850 to 532. [2018-06-22 01:45:54,668 INFO ]: Start removeUnreachable. Operand 532 states. [2018-06-22 01:45:54,671 INFO ]: Finished removeUnreachable. Reduced from 532 states to 532 states and 827 transitions. [2018-06-22 01:45:54,671 INFO ]: Start accepts. Automaton has 532 states and 827 transitions. Word has length 86 [2018-06-22 01:45:54,671 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:54,671 INFO ]: Abstraction has 532 states and 827 transitions. [2018-06-22 01:45:54,671 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:45:54,671 INFO ]: Start isEmpty. Operand 532 states and 827 transitions. [2018-06-22 01:45:54,681 INFO ]: Finished isEmpty. Found accepting run of length 87 [2018-06-22 01:45:54,681 INFO ]: Found error trace [2018-06-22 01:45:54,681 INFO ]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:54,681 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:54,682 INFO ]: Analyzing trace with hash -839472171, now seen corresponding path program 6 times [2018-06-22 01:45:54,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:54,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:54,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:54,682 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:54,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:54,696 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:55,262 INFO ]: Checked inductivity of 242 backedges. 93 proven. 40 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-06-22 01:45:55,263 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:55,263 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:45:55,275 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:45:55,314 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 01:45:55,314 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:55,316 INFO ]: Computing forward predicates... [2018-06-22 01:45:55,392 INFO ]: Checked inductivity of 242 backedges. 111 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-22 01:45:55,413 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:55,413 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 19 [2018-06-22 01:45:55,413 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:45:55,413 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:45:55,413 INFO ]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:45:55,413 INFO ]: Start difference. First operand 532 states and 827 transitions. Second operand 19 states. [2018-06-22 01:45:56,665 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:56,666 INFO ]: Finished difference Result 954 states and 2113 transitions. [2018-06-22 01:45:56,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:45:56,666 INFO ]: Start accepts. Automaton has 19 states. Word has length 86 [2018-06-22 01:45:56,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:56,672 INFO ]: With dead ends: 954 [2018-06-22 01:45:56,672 INFO ]: Without dead ends: 954 [2018-06-22 01:45:56,672 INFO ]: 0 DeclaredPredicates, 134 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:45:56,673 INFO ]: Start minimizeSevpa. Operand 954 states. [2018-06-22 01:45:56,716 INFO ]: Finished minimizeSevpa. Reduced states from 954 to 548. [2018-06-22 01:45:56,716 INFO ]: Start removeUnreachable. Operand 548 states. [2018-06-22 01:45:56,719 INFO ]: Finished removeUnreachable. Reduced from 548 states to 548 states and 859 transitions. [2018-06-22 01:45:56,719 INFO ]: Start accepts. Automaton has 548 states and 859 transitions. Word has length 86 [2018-06-22 01:45:56,720 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:56,720 INFO ]: Abstraction has 548 states and 859 transitions. [2018-06-22 01:45:56,720 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:45:56,720 INFO ]: Start isEmpty. Operand 548 states and 859 transitions. [2018-06-22 01:45:56,730 INFO ]: Finished isEmpty. Found accepting run of length 88 [2018-06-22 01:45:56,730 INFO ]: Found error trace [2018-06-22 01:45:56,730 INFO ]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:56,730 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:56,730 INFO ]: Analyzing trace with hash 1063569890, now seen corresponding path program 8 times [2018-06-22 01:45:56,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:56,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:56,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:56,732 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:45:56,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:56,747 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:56,948 INFO ]: Checked inductivity of 246 backedges. 27 proven. 107 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-06-22 01:45:56,949 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:56,949 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:45:56,954 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:45:56,988 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:45:56,988 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:56,991 INFO ]: Computing forward predicates... [2018-06-22 01:45:57,444 INFO ]: Checked inductivity of 246 backedges. 27 proven. 101 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-22 01:45:57,464 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:57,464 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 17 [2018-06-22 01:45:57,464 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:45:57,464 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:45:57,464 INFO ]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:45:57,464 INFO ]: Start difference. First operand 548 states and 859 transitions. Second operand 17 states. [2018-06-22 01:45:59,184 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:45:59,185 INFO ]: Finished difference Result 1266 states and 3275 transitions. [2018-06-22 01:45:59,185 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 01:45:59,185 INFO ]: Start accepts. Automaton has 17 states. Word has length 87 [2018-06-22 01:45:59,185 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:45:59,198 INFO ]: With dead ends: 1266 [2018-06-22 01:45:59,198 INFO ]: Without dead ends: 1266 [2018-06-22 01:45:59,199 INFO ]: 0 DeclaredPredicates, 151 GetRequests, 85 SyntacticMatches, 14 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=392, Invalid=2470, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:45:59,200 INFO ]: Start minimizeSevpa. Operand 1266 states. [2018-06-22 01:45:59,333 INFO ]: Finished minimizeSevpa. Reduced states from 1266 to 604. [2018-06-22 01:45:59,333 INFO ]: Start removeUnreachable. Operand 604 states. [2018-06-22 01:45:59,336 INFO ]: Finished removeUnreachable. Reduced from 604 states to 604 states and 981 transitions. [2018-06-22 01:45:59,336 INFO ]: Start accepts. Automaton has 604 states and 981 transitions. Word has length 87 [2018-06-22 01:45:59,336 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:45:59,336 INFO ]: Abstraction has 604 states and 981 transitions. [2018-06-22 01:45:59,336 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:45:59,336 INFO ]: Start isEmpty. Operand 604 states and 981 transitions. [2018-06-22 01:45:59,350 INFO ]: Finished isEmpty. Found accepting run of length 88 [2018-06-22 01:45:59,350 INFO ]: Found error trace [2018-06-22 01:45:59,350 INFO ]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:45:59,350 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:45:59,350 INFO ]: Analyzing trace with hash 1587429299, now seen corresponding path program 7 times [2018-06-22 01:45:59,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:45:59,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:45:59,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:59,351 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:45:59,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:45:59,365 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:59,630 INFO ]: Checked inductivity of 246 backedges. 27 proven. 107 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-06-22 01:45:59,630 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:45:59,630 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:45:59,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:45:59,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:45:59,697 INFO ]: Computing forward predicates... [2018-06-22 01:45:59,912 INFO ]: Checked inductivity of 246 backedges. 27 proven. 101 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-22 01:45:59,947 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:45:59,947 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 17 [2018-06-22 01:45:59,948 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:45:59,948 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:45:59,948 INFO ]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:45:59,948 INFO ]: Start difference. First operand 604 states and 981 transitions. Second operand 17 states. [2018-06-22 01:46:00,840 WARN ]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 01:46:02,126 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:02,126 INFO ]: Finished difference Result 1314 states and 3499 transitions. [2018-06-22 01:46:02,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 01:46:02,128 INFO ]: Start accepts. Automaton has 17 states. Word has length 87 [2018-06-22 01:46:02,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:02,141 INFO ]: With dead ends: 1314 [2018-06-22 01:46:02,141 INFO ]: Without dead ends: 1314 [2018-06-22 01:46:02,142 INFO ]: 0 DeclaredPredicates, 151 GetRequests, 86 SyntacticMatches, 13 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=392, Invalid=2470, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:46:02,143 INFO ]: Start minimizeSevpa. Operand 1314 states. [2018-06-22 01:46:02,303 INFO ]: Finished minimizeSevpa. Reduced states from 1314 to 556. [2018-06-22 01:46:02,303 INFO ]: Start removeUnreachable. Operand 556 states. [2018-06-22 01:46:02,306 INFO ]: Finished removeUnreachable. Reduced from 556 states to 556 states and 869 transitions. [2018-06-22 01:46:02,306 INFO ]: Start accepts. Automaton has 556 states and 869 transitions. Word has length 87 [2018-06-22 01:46:02,306 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:02,306 INFO ]: Abstraction has 556 states and 869 transitions. [2018-06-22 01:46:02,306 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:46:02,306 INFO ]: Start isEmpty. Operand 556 states and 869 transitions. [2018-06-22 01:46:02,330 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 01:46:02,331 INFO ]: Found error trace [2018-06-22 01:46:02,331 INFO ]: trace histogram [11, 11, 11, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:02,331 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:02,331 INFO ]: Analyzing trace with hash 613075142, now seen corresponding path program 9 times [2018-06-22 01:46:02,331 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:02,331 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:02,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:02,332 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:46:02,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:02,348 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:02,882 INFO ]: Checked inductivity of 375 backedges. 150 proven. 54 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-06-22 01:46:02,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:02,882 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:02,888 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:46:02,943 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 01:46:02,943 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:02,948 INFO ]: Computing forward predicates... [2018-06-22 01:46:03,418 INFO ]: Checked inductivity of 375 backedges. 38 proven. 158 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-06-22 01:46:03,438 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:03,438 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2018-06-22 01:46:03,438 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:46:03,438 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:46:03,439 INFO ]: CoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:46:03,439 INFO ]: Start difference. First operand 556 states and 869 transitions. Second operand 35 states. [2018-06-22 01:46:07,315 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:07,316 INFO ]: Finished difference Result 1396 states and 3054 transitions. [2018-06-22 01:46:07,316 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-06-22 01:46:07,316 INFO ]: Start accepts. Automaton has 35 states. Word has length 105 [2018-06-22 01:46:07,316 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:07,324 INFO ]: With dead ends: 1396 [2018-06-22 01:46:07,324 INFO ]: Without dead ends: 1396 [2018-06-22 01:46:07,327 INFO ]: 0 DeclaredPredicates, 229 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5793 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1266, Invalid=14736, Unknown=0, NotChecked=0, Total=16002 [2018-06-22 01:46:07,328 INFO ]: Start minimizeSevpa. Operand 1396 states. [2018-06-22 01:46:07,380 INFO ]: Finished minimizeSevpa. Reduced states from 1396 to 850. [2018-06-22 01:46:07,380 INFO ]: Start removeUnreachable. Operand 850 states. [2018-06-22 01:46:07,383 INFO ]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1342 transitions. [2018-06-22 01:46:07,383 INFO ]: Start accepts. Automaton has 850 states and 1342 transitions. Word has length 105 [2018-06-22 01:46:07,383 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:07,383 INFO ]: Abstraction has 850 states and 1342 transitions. [2018-06-22 01:46:07,383 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:46:07,383 INFO ]: Start isEmpty. Operand 850 states and 1342 transitions. [2018-06-22 01:46:07,401 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 01:46:07,402 INFO ]: Found error trace [2018-06-22 01:46:07,402 INFO ]: trace histogram [11, 11, 11, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:07,402 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:07,402 INFO ]: Analyzing trace with hash 239782999, now seen corresponding path program 8 times [2018-06-22 01:46:07,402 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:07,402 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:07,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:07,402 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:46:07,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:07,419 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:07,956 INFO ]: Checked inductivity of 375 backedges. 150 proven. 54 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-06-22 01:46:07,957 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:07,957 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:07,963 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:46:08,006 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:46:08,006 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:08,009 INFO ]: Computing forward predicates... [2018-06-22 01:46:08,082 INFO ]: Checked inductivity of 375 backedges. 173 proven. 19 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-06-22 01:46:08,101 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:08,102 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 21 [2018-06-22 01:46:08,102 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:46:08,102 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:46:08,102 INFO ]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:46:08,102 INFO ]: Start difference. First operand 850 states and 1342 transitions. Second operand 21 states. [2018-06-22 01:46:08,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:08,638 INFO ]: Finished difference Result 1595 states and 3858 transitions. [2018-06-22 01:46:08,638 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:46:08,638 INFO ]: Start accepts. Automaton has 21 states. Word has length 105 [2018-06-22 01:46:08,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:08,653 INFO ]: With dead ends: 1595 [2018-06-22 01:46:08,653 INFO ]: Without dead ends: 1595 [2018-06-22 01:46:08,654 INFO ]: 0 DeclaredPredicates, 164 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=372, Invalid=1884, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:46:08,654 INFO ]: Start minimizeSevpa. Operand 1595 states. [2018-06-22 01:46:08,726 INFO ]: Finished minimizeSevpa. Reduced states from 1595 to 873. [2018-06-22 01:46:08,726 INFO ]: Start removeUnreachable. Operand 873 states. [2018-06-22 01:46:08,738 INFO ]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1388 transitions. [2018-06-22 01:46:08,738 INFO ]: Start accepts. Automaton has 873 states and 1388 transitions. Word has length 105 [2018-06-22 01:46:08,739 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:08,739 INFO ]: Abstraction has 873 states and 1388 transitions. [2018-06-22 01:46:08,739 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:46:08,739 INFO ]: Start isEmpty. Operand 873 states and 1388 transitions. [2018-06-22 01:46:08,752 INFO ]: Finished isEmpty. Found accepting run of length 107 [2018-06-22 01:46:08,752 INFO ]: Found error trace [2018-06-22 01:46:08,752 INFO ]: trace histogram [11, 11, 11, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:08,753 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:08,753 INFO ]: Analyzing trace with hash -730607318, now seen corresponding path program 10 times [2018-06-22 01:46:08,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:08,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:08,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:08,753 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:46:08,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:08,772 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:09,909 INFO ]: Checked inductivity of 380 backedges. 34 proven. 171 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-22 01:46:09,909 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:09,909 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:09,916 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:46:09,960 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:46:09,960 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:09,963 INFO ]: Computing forward predicates... [2018-06-22 01:46:10,101 INFO ]: Checked inductivity of 380 backedges. 34 proven. 163 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-06-22 01:46:10,121 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:10,121 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 19 [2018-06-22 01:46:10,121 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:46:10,121 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:46:10,121 INFO ]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:46:10,121 INFO ]: Start difference. First operand 873 states and 1388 transitions. Second operand 19 states. [2018-06-22 01:46:12,446 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:12,446 INFO ]: Finished difference Result 2132 states and 6122 transitions. [2018-06-22 01:46:12,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-22 01:46:12,447 INFO ]: Start accepts. Automaton has 19 states. Word has length 106 [2018-06-22 01:46:12,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:12,464 INFO ]: With dead ends: 2132 [2018-06-22 01:46:12,464 INFO ]: Without dead ends: 2132 [2018-06-22 01:46:12,465 INFO ]: 0 DeclaredPredicates, 184 GetRequests, 105 SyntacticMatches, 17 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=526, Invalid=3506, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:46:12,465 INFO ]: Start minimizeSevpa. Operand 2132 states. [2018-06-22 01:46:12,713 INFO ]: Finished minimizeSevpa. Reduced states from 2132 to 950. [2018-06-22 01:46:12,713 INFO ]: Start removeUnreachable. Operand 950 states. [2018-06-22 01:46:12,717 INFO ]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1559 transitions. [2018-06-22 01:46:12,717 INFO ]: Start accepts. Automaton has 950 states and 1559 transitions. Word has length 106 [2018-06-22 01:46:12,717 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:12,717 INFO ]: Abstraction has 950 states and 1559 transitions. [2018-06-22 01:46:12,717 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:46:12,717 INFO ]: Start isEmpty. Operand 950 states and 1559 transitions. [2018-06-22 01:46:12,730 INFO ]: Finished isEmpty. Found accepting run of length 107 [2018-06-22 01:46:12,730 INFO ]: Found error trace [2018-06-22 01:46:12,730 INFO ]: trace histogram [11, 11, 11, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:12,730 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:12,730 INFO ]: Analyzing trace with hash 582238137, now seen corresponding path program 9 times [2018-06-22 01:46:12,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:12,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:12,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:12,731 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:46:12,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:12,748 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:14,753 INFO ]: Checked inductivity of 380 backedges. 34 proven. 171 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-22 01:46:14,753 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:14,753 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:14,759 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:46:14,919 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 01:46:14,919 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:14,924 INFO ]: Computing forward predicates... [2018-06-22 01:46:15,249 INFO ]: Checked inductivity of 380 backedges. 34 proven. 163 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-06-22 01:46:15,269 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:15,269 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 19 [2018-06-22 01:46:15,269 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:46:15,269 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:46:15,270 INFO ]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:46:15,270 INFO ]: Start difference. First operand 950 states and 1559 transitions. Second operand 19 states. [2018-06-22 01:46:17,327 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:46:17,327 INFO ]: Finished difference Result 2201 states and 6490 transitions. [2018-06-22 01:46:17,327 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-22 01:46:17,327 INFO ]: Start accepts. Automaton has 19 states. Word has length 106 [2018-06-22 01:46:17,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:46:17,349 INFO ]: With dead ends: 2201 [2018-06-22 01:46:17,349 INFO ]: Without dead ends: 2201 [2018-06-22 01:46:17,350 INFO ]: 0 DeclaredPredicates, 184 GetRequests, 106 SyntacticMatches, 16 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=526, Invalid=3506, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:46:17,351 INFO ]: Start minimizeSevpa. Operand 2201 states. [2018-06-22 01:46:17,500 INFO ]: Finished minimizeSevpa. Reduced states from 2201 to 881. [2018-06-22 01:46:17,500 INFO ]: Start removeUnreachable. Operand 881 states. [2018-06-22 01:46:17,503 INFO ]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1398 transitions. [2018-06-22 01:46:17,504 INFO ]: Start accepts. Automaton has 881 states and 1398 transitions. Word has length 106 [2018-06-22 01:46:17,506 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:46:17,506 INFO ]: Abstraction has 881 states and 1398 transitions. [2018-06-22 01:46:17,506 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:46:17,506 INFO ]: Start isEmpty. Operand 881 states and 1398 transitions. [2018-06-22 01:46:17,512 INFO ]: Finished isEmpty. Found accepting run of length 125 [2018-06-22 01:46:17,512 INFO ]: Found error trace [2018-06-22 01:46:17,512 INFO ]: trace histogram [13, 13, 13, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:46:17,513 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:46:17,513 INFO ]: Analyzing trace with hash -28834418, now seen corresponding path program 11 times [2018-06-22 01:46:17,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:46:17,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:46:17,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:17,514 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:46:17,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:46:17,532 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:18,589 INFO ]: Checked inductivity of 537 backedges. 221 proven. 69 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-06-22 01:46:18,590 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:46:18,590 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:46:18,596 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:46:18,658 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 01:46:18,658 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:46:18,667 INFO ]: Computing forward predicates... [2018-06-22 01:46:19,631 INFO ]: Checked inductivity of 537 backedges. 41 proven. 234 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-06-22 01:46:19,651 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:46:19,651 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2018-06-22 01:46:19,651 INFO ]: Interpolant automaton has 38 states [2018-06-22 01:46:19,651 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 01:46:19,651 INFO ]: CoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:46:19,651 INFO ]: Start difference. First operand 881 states and 1398 transitions. Second operand 38 states. Received shutdown request... [2018-06-22 01:46:25,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-06-22 01:46:25,518 WARN ]: Verification canceled [2018-06-22 01:46:25,523 WARN ]: Timeout [2018-06-22 01:46:25,523 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:46:25 BoogieIcfgContainer [2018-06-22 01:46:25,523 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:46:25,524 INFO ]: Toolchain (without parser) took 57774.43 ms. Allocated memory was 305.7 MB in the beginning and 677.4 MB in the end (delta: 371.7 MB). Free memory was 258.2 MB in the beginning and 434.7 MB in the end (delta: -176.5 MB). Peak memory consumption was 195.2 MB. Max. memory is 3.6 GB. [2018-06-22 01:46:25,525 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 305.7 MB. Free memory is still 271.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:46:25,525 INFO ]: ChcToBoogie took 60.16 ms. Allocated memory is still 305.7 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:46:25,525 INFO ]: Boogie Preprocessor took 42.85 ms. Allocated memory is still 305.7 MB. Free memory was 256.2 MB in the beginning and 254.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:46:25,525 INFO ]: RCFGBuilder took 371.91 ms. Allocated memory is still 305.7 MB. Free memory was 254.2 MB in the beginning and 244.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:46:25,526 INFO ]: TraceAbstraction took 57285.00 ms. Allocated memory was 305.7 MB in the beginning and 677.4 MB in the end (delta: 371.7 MB). Free memory was 244.2 MB in the beginning and 434.7 MB in the end (delta: -190.5 MB). Peak memory consumption was 181.2 MB. Max. memory is 3.6 GB. [2018-06-22 01:46:25,623 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 305.7 MB. Free memory is still 271.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.16 ms. Allocated memory is still 305.7 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 42.85 ms. Allocated memory is still 305.7 MB. Free memory was 256.2 MB in the beginning and 254.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 371.91 ms. Allocated memory is still 305.7 MB. Free memory was 254.2 MB in the beginning and 244.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57285.00 ms. Allocated memory was 305.7 MB in the beginning and 677.4 MB in the end (delta: 371.7 MB). Free memory was 244.2 MB in the beginning and 434.7 MB in the end (delta: -190.5 MB). Peak memory consumption was 181.2 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 (881states) and interpolant automaton (currently 139 states, 38 states before enhancement), while ReachableStatesComputation was computing reachable states (2187 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. TIMEOUT Result, 57.2s OverallTime, 27 OverallIterations, 13 TraceHistogramMax, 37.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3364 SDtfs, 5977 SDslu, 24282 SDs, 0 SdLazy, 31695 SolverSat, 7099 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2726 GetRequests, 1504 SyntacticMatches, 110 SemanticMatches, 1112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26719 ImplicationChecksByTransitivity, 26.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=950occurred in iteration=25, 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.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 7990 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 3085 NumberOfCodeBlocks, 3077 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 3036 ConstructedInterpolants, 0 QuantifiedInterpolants, 955502 SizeOfPredicates, 319 NumberOfNonLiveVariables, 6111 ConjunctsInSsa, 1422 ConjunctsInUnsatCore, 49 InterpolantComputations, 5 PerfectInterpolantSequences, 5518/7895 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/enc-zip_unzip.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-46-25-633.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_unzip.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-46-25-633.csv Completed graceful shutdown