java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:10:55,500 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:10:55,502 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:10:55,519 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:10:55,519 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:10:55,520 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:10:55,522 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:10:55,523 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:10:55,525 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:10:55,526 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:10:55,526 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:10:55,527 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:10:55,527 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:10:55,529 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:10:55,529 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:10:55,530 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:10:55,534 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:10:55,536 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:10:55,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:10:55,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:10:55,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:10:55,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:10:55,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:10:55,552 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:10:55,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:10:55,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:10:55,554 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:10:55,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:10:55,555 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:10:55,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:10:55,556 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:10:55,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:10:55,557 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:10:55,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:10:55,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:10:55,559 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:10:55,576 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:10:55,577 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:10:55,577 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:10:55,577 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:10:55,578 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:10:55,578 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:10:55,579 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:10:55,579 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:10:55,579 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:10:55,579 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:10:55,579 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:10:55,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:10:55,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:10:55,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:10:55,580 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:10:55,580 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:10:55,580 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:10:55,581 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:10:55,581 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:10:55,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:10:55,581 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:10:55,582 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:10:55,583 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:10:55,622 INFO ]: Repository-Root is: /tmp [2018-06-24 21:10:55,642 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:10:55,645 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:10:55,647 INFO ]: Initializing SmtParser... [2018-06-24 21:10:55,648 INFO ]: SmtParser initialized [2018-06-24 21:10:55,648 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 [2018-06-24 21:10:55,649 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:10:55,735 INFO ]: Executing SMT file /storage/chc-comp/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 unknown [2018-06-24 21:10:55,974 INFO ]: Succesfully executed SMT file /storage/chc-comp/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 [2018-06-24 21:10:55,978 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:10:55,992 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:10:55,993 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:10:55,993 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:10:55,993 INFO ]: ChcToBoogie initialized [2018-06-24 21:10:55,996 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:10:55" (1/1) ... [2018-06-24 21:10:56,067 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:56 Unit [2018-06-24 21:10:56,067 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:10:56,067 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:10:56,068 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:10:56,068 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:10:56,088 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:56" (1/1) ... [2018-06-24 21:10:56,088 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:56" (1/1) ... [2018-06-24 21:10:56,095 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:56" (1/1) ... [2018-06-24 21:10:56,095 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:56" (1/1) ... [2018-06-24 21:10:56,100 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:56" (1/1) ... [2018-06-24 21:10:56,102 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:56" (1/1) ... [2018-06-24 21:10:56,109 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:56" (1/1) ... [2018-06-24 21:10:56,111 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:10:56,112 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:10:56,112 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:10:56,112 INFO ]: RCFGBuilder initialized [2018-06-24 21:10:56,112 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:56" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:10:56,131 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:10:56,131 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:10:56,131 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:10:56,131 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:10:56,131 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:10:56,131 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:10:56,471 INFO ]: Using library mode [2018-06-24 21:10:56,471 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:10:56 BoogieIcfgContainer [2018-06-24 21:10:56,471 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:10:56,472 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:10:56,472 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:10:56,473 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:10:56,473 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:10:56" (1/1) ... [2018-06-24 21:10:56,487 INFO ]: Initial Icfg 23 locations, 32 edges [2018-06-24 21:10:56,488 INFO ]: Using Remove infeasible edges [2018-06-24 21:10:56,489 INFO ]: Using Maximize final states [2018-06-24 21:10:56,489 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:10:56,490 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:10:56,491 INFO ]: Using Remove sink states [2018-06-24 21:10:56,492 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:10:56,492 INFO ]: Using Use SBE [2018-06-24 21:10:56,512 INFO ]: SBE split 0 edges [2018-06-24 21:10:56,517 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:10:56,521 INFO ]: 0 new accepting states [2018-06-24 21:10:56,756 INFO ]: Removed 27 edges and 9 locations by large block encoding [2018-06-24 21:10:56,758 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:10:56,760 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:10:56,760 INFO ]: 0 new accepting states [2018-06-24 21:10:56,760 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:10:56,760 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:10:56,760 INFO ]: Encoded RCFG 12 locations, 22 edges [2018-06-24 21:10:56,761 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:10:56 BasicIcfg [2018-06-24 21:10:56,761 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:10:56,762 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:10:56,762 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:10:56,764 INFO ]: TraceAbstraction initialized [2018-06-24 21:10:56,765 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:10:55" (1/4) ... [2018-06-24 21:10:56,766 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69729717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:10:56, skipping insertion in model container [2018-06-24 21:10:56,766 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:56" (2/4) ... [2018-06-24 21:10:56,766 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69729717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:10:56, skipping insertion in model container [2018-06-24 21:10:56,766 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:10:56" (3/4) ... [2018-06-24 21:10:56,766 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69729717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:10:56, skipping insertion in model container [2018-06-24 21:10:56,766 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:10:56" (4/4) ... [2018-06-24 21:10:56,769 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:10:56,776 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:10:56,783 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:10:56,834 INFO ]: Using default assertion order modulation [2018-06-24 21:10:56,835 INFO ]: Interprodecural is true [2018-06-24 21:10:56,835 INFO ]: Hoare is false [2018-06-24 21:10:56,835 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:10:56,835 INFO ]: Backedges is TWOTRACK [2018-06-24 21:10:56,835 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:10:56,835 INFO ]: Difference is false [2018-06-24 21:10:56,835 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:10:56,835 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:10:56,844 INFO ]: Start isEmpty. Operand 12 states. [2018-06-24 21:10:56,854 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:10:56,854 INFO ]: Found error trace [2018-06-24 21:10:56,855 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:10:56,855 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:56,860 INFO ]: Analyzing trace with hash 37108018, now seen corresponding path program 1 times [2018-06-24 21:10:56,862 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:56,862 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:56,905 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:56,905 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:56,905 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:56,954 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:57,006 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:57,008 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:10:57,008 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:10:57,009 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:10:57,019 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:10:57,019 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:57,021 INFO ]: Start difference. First operand 12 states. Second operand 3 states. [2018-06-24 21:10:57,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:57,198 INFO ]: Finished difference Result 21 states and 40 transitions. [2018-06-24 21:10:57,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:10:57,199 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:10:57,199 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:57,208 INFO ]: With dead ends: 21 [2018-06-24 21:10:57,208 INFO ]: Without dead ends: 21 [2018-06-24 21:10:57,210 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:57,223 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 21:10:57,256 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 21:10:57,258 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 21:10:57,259 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 40 transitions. [2018-06-24 21:10:57,260 INFO ]: Start accepts. Automaton has 21 states and 40 transitions. Word has length 5 [2018-06-24 21:10:57,261 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:57,261 INFO ]: Abstraction has 21 states and 40 transitions. [2018-06-24 21:10:57,261 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:10:57,261 INFO ]: Start isEmpty. Operand 21 states and 40 transitions. [2018-06-24 21:10:57,263 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:10:57,263 INFO ]: Found error trace [2018-06-24 21:10:57,263 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:10:57,263 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:57,263 INFO ]: Analyzing trace with hash 37376137, now seen corresponding path program 1 times [2018-06-24 21:10:57,263 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:57,263 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:57,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:57,267 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:57,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:57,284 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:57,366 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:57,366 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:10:57,366 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:10:57,367 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:10:57,367 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:10:57,367 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:57,368 INFO ]: Start difference. First operand 21 states and 40 transitions. Second operand 3 states. [2018-06-24 21:10:57,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:57,589 INFO ]: Finished difference Result 37 states and 79 transitions. [2018-06-24 21:10:57,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:10:57,589 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:10:57,589 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:57,593 INFO ]: With dead ends: 37 [2018-06-24 21:10:57,593 INFO ]: Without dead ends: 37 [2018-06-24 21:10:57,594 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:57,594 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 21:10:57,603 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 23. [2018-06-24 21:10:57,603 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 21:10:57,604 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 50 transitions. [2018-06-24 21:10:57,604 INFO ]: Start accepts. Automaton has 23 states and 50 transitions. Word has length 5 [2018-06-24 21:10:57,604 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:57,604 INFO ]: Abstraction has 23 states and 50 transitions. [2018-06-24 21:10:57,604 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:10:57,604 INFO ]: Start isEmpty. Operand 23 states and 50 transitions. [2018-06-24 21:10:57,605 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:10:57,605 INFO ]: Found error trace [2018-06-24 21:10:57,605 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:10:57,605 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:57,605 INFO ]: Analyzing trace with hash 37377098, now seen corresponding path program 1 times [2018-06-24 21:10:57,605 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:57,605 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:57,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:57,606 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:57,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:57,635 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:57,756 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:57,756 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:10:57,756 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:10:57,756 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:10:57,756 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:10:57,757 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:57,757 INFO ]: Start difference. First operand 23 states and 50 transitions. Second operand 3 states. [2018-06-24 21:10:57,904 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:57,904 INFO ]: Finished difference Result 35 states and 68 transitions. [2018-06-24 21:10:57,904 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:10:57,904 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:10:57,904 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:57,906 INFO ]: With dead ends: 35 [2018-06-24 21:10:57,906 INFO ]: Without dead ends: 35 [2018-06-24 21:10:57,906 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:57,906 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:10:57,912 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-06-24 21:10:57,912 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 21:10:57,913 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2018-06-24 21:10:57,913 INFO ]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 5 [2018-06-24 21:10:57,913 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:57,913 INFO ]: Abstraction has 23 states and 48 transitions. [2018-06-24 21:10:57,913 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:10:57,913 INFO ]: Start isEmpty. Operand 23 states and 48 transitions. [2018-06-24 21:10:57,914 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:10:57,914 INFO ]: Found error trace [2018-06-24 21:10:57,914 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:10:57,914 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:57,915 INFO ]: Analyzing trace with hash 1151768074, now seen corresponding path program 1 times [2018-06-24 21:10:57,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:57,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:57,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:57,918 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:57,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:57,925 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:57,956 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:57,956 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:10:57,956 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:10:57,956 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:10:57,956 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:10:57,956 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:57,957 INFO ]: Start difference. First operand 23 states and 48 transitions. Second operand 3 states. [2018-06-24 21:10:58,000 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:58,001 INFO ]: Finished difference Result 33 states and 71 transitions. [2018-06-24 21:10:58,001 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:10:58,001 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:10:58,001 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:58,002 INFO ]: With dead ends: 33 [2018-06-24 21:10:58,003 INFO ]: Without dead ends: 33 [2018-06-24 21:10:58,003 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:58,003 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 21:10:58,008 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 21:10:58,008 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 21:10:58,009 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 71 transitions. [2018-06-24 21:10:58,009 INFO ]: Start accepts. Automaton has 33 states and 71 transitions. Word has length 6 [2018-06-24 21:10:58,010 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:58,010 INFO ]: Abstraction has 33 states and 71 transitions. [2018-06-24 21:10:58,010 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:10:58,010 INFO ]: Start isEmpty. Operand 33 states and 71 transitions. [2018-06-24 21:10:58,011 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:10:58,011 INFO ]: Found error trace [2018-06-24 21:10:58,011 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:58,011 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:58,011 INFO ]: Analyzing trace with hash 1026383911, now seen corresponding path program 1 times [2018-06-24 21:10:58,011 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:58,011 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:58,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:58,012 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:58,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:58,036 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:58,119 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:10:58,120 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:10:58,120 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:10:58,120 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:10:58,120 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:10:58,120 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:10:58,120 INFO ]: Start difference. First operand 33 states and 71 transitions. Second operand 5 states. [2018-06-24 21:10:59,046 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:59,046 INFO ]: Finished difference Result 123 states and 335 transitions. [2018-06-24 21:10:59,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:10:59,047 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 21:10:59,047 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:59,055 INFO ]: With dead ends: 123 [2018-06-24 21:10:59,055 INFO ]: Without dead ends: 123 [2018-06-24 21:10:59,055 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:10:59,055 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-24 21:10:59,089 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 42. [2018-06-24 21:10:59,089 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 21:10:59,091 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2018-06-24 21:10:59,091 INFO ]: Start accepts. Automaton has 42 states and 98 transitions. Word has length 8 [2018-06-24 21:10:59,091 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:59,091 INFO ]: Abstraction has 42 states and 98 transitions. [2018-06-24 21:10:59,091 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:10:59,091 INFO ]: Start isEmpty. Operand 42 states and 98 transitions. [2018-06-24 21:10:59,093 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:10:59,093 INFO ]: Found error trace [2018-06-24 21:10:59,093 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:59,093 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:59,093 INFO ]: Analyzing trace with hash 1026384872, now seen corresponding path program 1 times [2018-06-24 21:10:59,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:59,093 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:59,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:59,094 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:59,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:59,110 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:59,215 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:59,215 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:10:59,215 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:10:59,215 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:10:59,215 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:10:59,216 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:10:59,216 INFO ]: Start difference. First operand 42 states and 98 transitions. Second operand 4 states. [2018-06-24 21:10:59,321 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:59,321 INFO ]: Finished difference Result 66 states and 141 transitions. [2018-06-24 21:10:59,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:10:59,323 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-24 21:10:59,324 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:59,325 INFO ]: With dead ends: 66 [2018-06-24 21:10:59,325 INFO ]: Without dead ends: 54 [2018-06-24 21:10:59,325 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-24 21:10:59,326 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-24 21:10:59,332 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 36. [2018-06-24 21:10:59,332 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 21:10:59,333 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2018-06-24 21:10:59,334 INFO ]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 8 [2018-06-24 21:10:59,334 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:59,334 INFO ]: Abstraction has 36 states and 74 transitions. [2018-06-24 21:10:59,334 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:10:59,334 INFO ]: Start isEmpty. Operand 36 states and 74 transitions. [2018-06-24 21:10:59,335 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:10:59,335 INFO ]: Found error trace [2018-06-24 21:10:59,335 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:59,335 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:59,335 INFO ]: Analyzing trace with hash 997754760, now seen corresponding path program 1 times [2018-06-24 21:10:59,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:59,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:59,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:59,336 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:59,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:59,349 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:59,396 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:10:59,396 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:10:59,396 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:10:59,397 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:10:59,397 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:10:59,397 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:10:59,397 INFO ]: Start difference. First operand 36 states and 74 transitions. Second operand 5 states. [2018-06-24 21:10:59,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:59,533 INFO ]: Finished difference Result 102 states and 204 transitions. [2018-06-24 21:10:59,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:10:59,535 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 21:10:59,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:59,537 INFO ]: With dead ends: 102 [2018-06-24 21:10:59,537 INFO ]: Without dead ends: 102 [2018-06-24 21:10:59,537 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:10:59,537 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-24 21:10:59,547 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 60. [2018-06-24 21:10:59,547 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-24 21:10:59,549 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2018-06-24 21:10:59,549 INFO ]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 8 [2018-06-24 21:10:59,549 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:59,549 INFO ]: Abstraction has 60 states and 122 transitions. [2018-06-24 21:10:59,549 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:10:59,549 INFO ]: Start isEmpty. Operand 60 states and 122 transitions. [2018-06-24 21:10:59,551 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:10:59,551 INFO ]: Found error trace [2018-06-24 21:10:59,551 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:59,551 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:59,551 INFO ]: Analyzing trace with hash 997755721, now seen corresponding path program 1 times [2018-06-24 21:10:59,551 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:59,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:59,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:59,552 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:59,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:59,565 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:59,606 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:59,606 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:10:59,606 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:10:59,606 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:10:59,606 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:10:59,606 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:59,606 INFO ]: Start difference. First operand 60 states and 122 transitions. Second operand 3 states. [2018-06-24 21:10:59,627 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:59,627 INFO ]: Finished difference Result 111 states and 240 transitions. [2018-06-24 21:10:59,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:10:59,628 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 21:10:59,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:59,630 INFO ]: With dead ends: 111 [2018-06-24 21:10:59,630 INFO ]: Without dead ends: 111 [2018-06-24 21:10:59,630 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:59,630 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-24 21:10:59,641 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 66. [2018-06-24 21:10:59,641 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-24 21:10:59,643 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 128 transitions. [2018-06-24 21:10:59,643 INFO ]: Start accepts. Automaton has 66 states and 128 transitions. Word has length 8 [2018-06-24 21:10:59,643 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:59,643 INFO ]: Abstraction has 66 states and 128 transitions. [2018-06-24 21:10:59,643 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:10:59,643 INFO ]: Start isEmpty. Operand 66 states and 128 transitions. [2018-06-24 21:10:59,646 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:10:59,646 INFO ]: Found error trace [2018-06-24 21:10:59,646 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:59,646 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:59,646 INFO ]: Analyzing trace with hash 418197345, now seen corresponding path program 1 times [2018-06-24 21:10:59,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:59,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:59,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:59,647 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:59,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:59,666 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:59,761 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:10:59,761 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:59,761 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:59,770 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:59,817 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:59,827 INFO ]: Computing forward predicates... [2018-06-24 21:11:00,136 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:11:00,160 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:00,160 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-06-24 21:11:00,160 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:11:00,160 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:11:00,160 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:11:00,160 INFO ]: Start difference. First operand 66 states and 128 transitions. Second operand 12 states. [2018-06-24 21:11:02,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:02,053 INFO ]: Finished difference Result 193 states and 511 transitions. [2018-06-24 21:11:02,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 21:11:02,054 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-24 21:11:02,054 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:02,057 INFO ]: With dead ends: 193 [2018-06-24 21:11:02,057 INFO ]: Without dead ends: 164 [2018-06-24 21:11:02,058 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:11:02,058 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-24 21:11:02,089 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 83. [2018-06-24 21:11:02,089 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-24 21:11:02,090 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 171 transitions. [2018-06-24 21:11:02,090 INFO ]: Start accepts. Automaton has 83 states and 171 transitions. Word has length 13 [2018-06-24 21:11:02,091 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:02,091 INFO ]: Abstraction has 83 states and 171 transitions. [2018-06-24 21:11:02,091 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:11:02,091 INFO ]: Start isEmpty. Operand 83 states and 171 transitions. [2018-06-24 21:11:02,093 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:11:02,093 INFO ]: Found error trace [2018-06-24 21:11:02,093 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:02,093 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:02,093 INFO ]: Analyzing trace with hash 446826496, now seen corresponding path program 1 times [2018-06-24 21:11:02,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:02,093 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:02,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:02,094 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:02,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:02,110 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:02,227 INFO ]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:11:02,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:02,227 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:02,236 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:02,279 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:02,282 INFO ]: Computing forward predicates... [2018-06-24 21:11:02,369 INFO ]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:11:02,388 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:02,388 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-06-24 21:11:02,388 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:11:02,388 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:11:02,388 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:11:02,389 INFO ]: Start difference. First operand 83 states and 171 transitions. Second operand 11 states. [2018-06-24 21:11:03,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:03,507 INFO ]: Finished difference Result 236 states and 521 transitions. [2018-06-24 21:11:03,512 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 21:11:03,512 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 21:11:03,512 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:03,518 INFO ]: With dead ends: 236 [2018-06-24 21:11:03,518 INFO ]: Without dead ends: 233 [2018-06-24 21:11:03,519 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=1005, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:11:03,520 INFO ]: Start minimizeSevpa. Operand 233 states. [2018-06-24 21:11:03,562 INFO ]: Finished minimizeSevpa. Reduced states from 233 to 98. [2018-06-24 21:11:03,562 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-24 21:11:03,567 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 195 transitions. [2018-06-24 21:11:03,568 INFO ]: Start accepts. Automaton has 98 states and 195 transitions. Word has length 13 [2018-06-24 21:11:03,568 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:03,568 INFO ]: Abstraction has 98 states and 195 transitions. [2018-06-24 21:11:03,568 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:11:03,568 INFO ]: Start isEmpty. Operand 98 states and 195 transitions. [2018-06-24 21:11:03,569 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:11:03,569 INFO ]: Found error trace [2018-06-24 21:11:03,569 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:03,569 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:03,569 INFO ]: Analyzing trace with hash 1915739767, now seen corresponding path program 1 times [2018-06-24 21:11:03,569 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:03,569 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:03,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:03,570 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:03,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:03,592 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:04,062 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:11:04,063 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:11:04,063 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 21:11:04,063 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:11:04,063 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:11:04,063 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:11:04,063 INFO ]: Start difference. First operand 98 states and 195 transitions. Second operand 6 states. [2018-06-24 21:11:04,249 WARN ]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-24 21:11:04,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:04,705 INFO ]: Finished difference Result 217 states and 578 transitions. [2018-06-24 21:11:04,705 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:11:04,705 INFO ]: Start accepts. Automaton has 6 states. Word has length 14 [2018-06-24 21:11:04,705 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:04,707 INFO ]: With dead ends: 217 [2018-06-24 21:11:04,707 INFO ]: Without dead ends: 217 [2018-06-24 21:11:04,708 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:11:04,708 INFO ]: Start minimizeSevpa. Operand 217 states. [2018-06-24 21:11:04,725 INFO ]: Finished minimizeSevpa. Reduced states from 217 to 117. [2018-06-24 21:11:04,725 INFO ]: Start removeUnreachable. Operand 117 states. [2018-06-24 21:11:04,727 INFO ]: Finished removeUnreachable. Reduced from 117 states to 117 states and 232 transitions. [2018-06-24 21:11:04,727 INFO ]: Start accepts. Automaton has 117 states and 232 transitions. Word has length 14 [2018-06-24 21:11:04,727 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:04,727 INFO ]: Abstraction has 117 states and 232 transitions. [2018-06-24 21:11:04,727 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:11:04,727 INFO ]: Start isEmpty. Operand 117 states and 232 transitions. [2018-06-24 21:11:04,729 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:11:04,729 INFO ]: Found error trace [2018-06-24 21:11:04,729 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:04,729 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:04,729 INFO ]: Analyzing trace with hash 1657574329, now seen corresponding path program 1 times [2018-06-24 21:11:04,729 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:04,729 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:04,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:04,730 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:04,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:04,743 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:04,808 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:11:04,808 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:11:04,808 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:11:04,808 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:11:04,808 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:11:04,809 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:11:04,809 INFO ]: Start difference. First operand 117 states and 232 transitions. Second operand 4 states. [2018-06-24 21:11:04,853 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:04,853 INFO ]: Finished difference Result 224 states and 575 transitions. [2018-06-24 21:11:04,855 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:11:04,855 INFO ]: Start accepts. Automaton has 4 states. Word has length 14 [2018-06-24 21:11:04,855 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:04,860 INFO ]: With dead ends: 224 [2018-06-24 21:11:04,860 INFO ]: Without dead ends: 224 [2018-06-24 21:11:04,860 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-24 21:11:04,860 INFO ]: Start minimizeSevpa. Operand 224 states. [2018-06-24 21:11:04,876 INFO ]: Finished minimizeSevpa. Reduced states from 224 to 131. [2018-06-24 21:11:04,876 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-24 21:11:04,878 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 253 transitions. [2018-06-24 21:11:04,878 INFO ]: Start accepts. Automaton has 131 states and 253 transitions. Word has length 14 [2018-06-24 21:11:04,878 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:04,878 INFO ]: Abstraction has 131 states and 253 transitions. [2018-06-24 21:11:04,878 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:11:04,878 INFO ]: Start isEmpty. Operand 131 states and 253 transitions. [2018-06-24 21:11:04,881 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:11:04,881 INFO ]: Found error trace [2018-06-24 21:11:04,882 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:04,882 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:04,882 INFO ]: Analyzing trace with hash 1622198383, now seen corresponding path program 1 times [2018-06-24 21:11:04,882 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:04,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:04,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:04,882 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:04,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:04,894 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:05,019 INFO ]: Checked inductivity of 13 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:11:05,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:05,019 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-24 21:11:05,025 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:05,074 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:05,078 INFO ]: Computing forward predicates... [2018-06-24 21:11:05,235 INFO ]: Checked inductivity of 13 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:11:05,263 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:05,263 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-24 21:11:05,263 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:11:05,264 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:11:05,264 INFO ]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:11:05,264 INFO ]: Start difference. First operand 131 states and 253 transitions. Second operand 15 states. [2018-06-24 21:11:07,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:07,438 INFO ]: Finished difference Result 277 states and 926 transitions. [2018-06-24 21:11:07,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 21:11:07,439 INFO ]: Start accepts. Automaton has 15 states. Word has length 19 [2018-06-24 21:11:07,439 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:07,447 INFO ]: With dead ends: 277 [2018-06-24 21:11:07,447 INFO ]: Without dead ends: 277 [2018-06-24 21:11:07,448 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=884, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 21:11:07,448 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-24 21:11:07,492 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 154. [2018-06-24 21:11:07,492 INFO ]: Start removeUnreachable. Operand 154 states. [2018-06-24 21:11:07,495 INFO ]: Finished removeUnreachable. Reduced from 154 states to 154 states and 319 transitions. [2018-06-24 21:11:07,495 INFO ]: Start accepts. Automaton has 154 states and 319 transitions. Word has length 19 [2018-06-24 21:11:07,495 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:07,495 INFO ]: Abstraction has 154 states and 319 transitions. [2018-06-24 21:11:07,495 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:11:07,495 INFO ]: Start isEmpty. Operand 154 states and 319 transitions. [2018-06-24 21:11:07,501 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:11:07,501 INFO ]: Found error trace [2018-06-24 21:11:07,501 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:07,501 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:07,501 INFO ]: Analyzing trace with hash -1981778737, now seen corresponding path program 1 times [2018-06-24 21:11:07,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:07,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:07,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:07,502 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:07,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:07,524 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:07,839 INFO ]: Checked inductivity of 13 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:11:07,839 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:07,839 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:07,848 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:07,894 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:07,898 INFO ]: Computing forward predicates... [2018-06-24 21:11:08,188 INFO ]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:11:08,219 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:08,220 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-06-24 21:11:08,220 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:11:08,220 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:11:08,220 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:11:08,220 INFO ]: Start difference. First operand 154 states and 319 transitions. Second operand 13 states. [2018-06-24 21:11:10,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:10,510 INFO ]: Finished difference Result 423 states and 2120 transitions. [2018-06-24 21:11:10,510 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 21:11:10,510 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-24 21:11:10,510 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:10,526 INFO ]: With dead ends: 423 [2018-06-24 21:11:10,526 INFO ]: Without dead ends: 423 [2018-06-24 21:11:10,526 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 21:11:10,527 INFO ]: Start minimizeSevpa. Operand 423 states. [2018-06-24 21:11:10,606 INFO ]: Finished minimizeSevpa. Reduced states from 423 to 234. [2018-06-24 21:11:10,606 INFO ]: Start removeUnreachable. Operand 234 states. [2018-06-24 21:11:10,612 INFO ]: Finished removeUnreachable. Reduced from 234 states to 234 states and 525 transitions. [2018-06-24 21:11:10,612 INFO ]: Start accepts. Automaton has 234 states and 525 transitions. Word has length 19 [2018-06-24 21:11:10,612 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:10,612 INFO ]: Abstraction has 234 states and 525 transitions. [2018-06-24 21:11:10,612 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:11:10,612 INFO ]: Start isEmpty. Operand 234 states and 525 transitions. [2018-06-24 21:11:10,622 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:11:10,622 INFO ]: Found error trace [2018-06-24 21:11:10,622 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:10,622 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:10,622 INFO ]: Analyzing trace with hash -1981777776, now seen corresponding path program 1 times [2018-06-24 21:11:10,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:10,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:10,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:10,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:10,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:10,639 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:10,775 INFO ]: Checked inductivity of 13 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:11:10,775 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:10,775 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:10,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:10,831 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:10,835 INFO ]: Computing forward predicates... [2018-06-24 21:11:10,976 INFO ]: Checked inductivity of 13 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:11:10,995 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:10,995 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 21:11:10,995 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:11:10,996 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:11:10,996 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:11:10,996 INFO ]: Start difference. First operand 234 states and 525 transitions. Second operand 14 states. [2018-06-24 21:11:11,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:11,790 INFO ]: Finished difference Result 342 states and 1175 transitions. [2018-06-24 21:11:11,790 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:11:11,790 INFO ]: Start accepts. Automaton has 14 states. Word has length 19 [2018-06-24 21:11:11,790 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:11,798 INFO ]: With dead ends: 342 [2018-06-24 21:11:11,798 INFO ]: Without dead ends: 342 [2018-06-24 21:11:11,799 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:11:11,799 INFO ]: Start minimizeSevpa. Operand 342 states. [2018-06-24 21:11:11,832 INFO ]: Finished minimizeSevpa. Reduced states from 342 to 235. [2018-06-24 21:11:11,832 INFO ]: Start removeUnreachable. Operand 235 states. [2018-06-24 21:11:11,837 INFO ]: Finished removeUnreachable. Reduced from 235 states to 235 states and 547 transitions. [2018-06-24 21:11:11,837 INFO ]: Start accepts. Automaton has 235 states and 547 transitions. Word has length 19 [2018-06-24 21:11:11,837 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:11,837 INFO ]: Abstraction has 235 states and 547 transitions. [2018-06-24 21:11:11,837 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:11:11,837 INFO ]: Start isEmpty. Operand 235 states and 547 transitions. [2018-06-24 21:11:11,843 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:11:11,843 INFO ]: Found error trace [2018-06-24 21:11:11,843 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:11,843 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:11,843 INFO ]: Analyzing trace with hash 870193616, now seen corresponding path program 1 times [2018-06-24 21:11:11,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:11,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:11,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:11,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:11,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:11,856 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:11,988 INFO ]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:11:11,988 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:11,988 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:11,993 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:12,038 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:12,041 INFO ]: Computing forward predicates... [2018-06-24 21:11:12,108 INFO ]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:11:12,127 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:11:12,127 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2018-06-24 21:11:12,127 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:11:12,128 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:11:12,128 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:11:12,128 INFO ]: Start difference. First operand 235 states and 547 transitions. Second operand 12 states. [2018-06-24 21:11:13,548 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:13,549 INFO ]: Finished difference Result 552 states and 2116 transitions. [2018-06-24 21:11:13,552 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 21:11:13,552 INFO ]: Start accepts. Automaton has 12 states. Word has length 19 [2018-06-24 21:11:13,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:13,571 INFO ]: With dead ends: 552 [2018-06-24 21:11:13,571 INFO ]: Without dead ends: 498 [2018-06-24 21:11:13,572 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 21:11:13,572 INFO ]: Start minimizeSevpa. Operand 498 states. [2018-06-24 21:11:13,622 INFO ]: Finished minimizeSevpa. Reduced states from 498 to 261. [2018-06-24 21:11:13,622 INFO ]: Start removeUnreachable. Operand 261 states. [2018-06-24 21:11:13,627 INFO ]: Finished removeUnreachable. Reduced from 261 states to 261 states and 590 transitions. [2018-06-24 21:11:13,627 INFO ]: Start accepts. Automaton has 261 states and 590 transitions. Word has length 19 [2018-06-24 21:11:13,627 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:13,627 INFO ]: Abstraction has 261 states and 590 transitions. [2018-06-24 21:11:13,627 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:11:13,627 INFO ]: Start isEmpty. Operand 261 states and 590 transitions. [2018-06-24 21:11:13,632 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 21:11:13,632 INFO ]: Found error trace [2018-06-24 21:11:13,632 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-06-24 21:11:13,632 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:13,632 INFO ]: Analyzing trace with hash 508405174, now seen corresponding path program 2 times [2018-06-24 21:11:13,632 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:13,632 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:13,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:13,632 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:13,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:13,648 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:13,722 INFO ]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:11:13,722 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:13,722 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:13,739 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:11:13,794 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:11:13,794 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:13,797 INFO ]: Computing forward predicates... [2018-06-24 21:11:13,828 INFO ]: Checked inductivity of 20 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:11:13,847 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:13,847 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 6 [2018-06-24 21:11:13,847 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:11:13,847 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:11:13,847 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:11:13,847 INFO ]: Start difference. First operand 261 states and 590 transitions. Second operand 6 states. [2018-06-24 21:11:14,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:14,171 INFO ]: Finished difference Result 254 states and 535 transitions. [2018-06-24 21:11:14,172 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:11:14,172 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-24 21:11:14,172 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:14,175 INFO ]: With dead ends: 254 [2018-06-24 21:11:14,175 INFO ]: Without dead ends: 254 [2018-06-24 21:11:14,175 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:11:14,175 INFO ]: Start minimizeSevpa. Operand 254 states. [2018-06-24 21:11:14,190 INFO ]: Finished minimizeSevpa. Reduced states from 254 to 143. [2018-06-24 21:11:14,190 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-24 21:11:14,192 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 274 transitions. [2018-06-24 21:11:14,192 INFO ]: Start accepts. Automaton has 143 states and 274 transitions. Word has length 21 [2018-06-24 21:11:14,192 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:14,192 INFO ]: Abstraction has 143 states and 274 transitions. [2018-06-24 21:11:14,192 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:11:14,192 INFO ]: Start isEmpty. Operand 143 states and 274 transitions. [2018-06-24 21:11:14,196 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 21:11:14,196 INFO ]: Found error trace [2018-06-24 21:11:14,196 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:14,196 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:14,196 INFO ]: Analyzing trace with hash 733334075, now seen corresponding path program 1 times [2018-06-24 21:11:14,196 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:14,196 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:14,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:14,198 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:11:14,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:14,213 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:14,745 INFO ]: Checked inductivity of 25 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 21:11:14,745 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:14,770 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:14,776 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:14,810 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:14,813 INFO ]: Computing forward predicates... [2018-06-24 21:11:14,950 INFO ]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:11:14,980 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:14,980 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-24 21:11:14,980 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:11:14,981 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:11:14,981 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:11:14,981 INFO ]: Start difference. First operand 143 states and 274 transitions. Second operand 13 states. [2018-06-24 21:11:16,044 WARN ]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-24 21:11:16,754 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:16,754 INFO ]: Finished difference Result 341 states and 1260 transitions. [2018-06-24 21:11:16,754 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 21:11:16,754 INFO ]: Start accepts. Automaton has 13 states. Word has length 24 [2018-06-24 21:11:16,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:16,763 INFO ]: With dead ends: 341 [2018-06-24 21:11:16,763 INFO ]: Without dead ends: 341 [2018-06-24 21:11:16,764 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 21:11:16,764 INFO ]: Start minimizeSevpa. Operand 341 states. [2018-06-24 21:11:16,796 INFO ]: Finished minimizeSevpa. Reduced states from 341 to 151. [2018-06-24 21:11:16,796 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-24 21:11:16,798 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 290 transitions. [2018-06-24 21:11:16,798 INFO ]: Start accepts. Automaton has 151 states and 290 transitions. Word has length 24 [2018-06-24 21:11:16,798 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:16,798 INFO ]: Abstraction has 151 states and 290 transitions. [2018-06-24 21:11:16,798 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:11:16,798 INFO ]: Start isEmpty. Operand 151 states and 290 transitions. [2018-06-24 21:11:16,802 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 21:11:16,802 INFO ]: Found error trace [2018-06-24 21:11:16,802 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:16,802 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:16,802 INFO ]: Analyzing trace with hash 833787643, now seen corresponding path program 2 times [2018-06-24 21:11:16,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:16,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:16,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:16,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:16,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:16,820 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:17,552 INFO ]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 21:11:17,552 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:17,552 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:17,558 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:11:17,597 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:11:17,597 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:17,600 INFO ]: Computing forward predicates... [2018-06-24 21:11:17,807 INFO ]: Checked inductivity of 25 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:11:17,826 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:17,826 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-06-24 21:11:17,826 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:11:17,826 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:11:17,826 INFO ]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:11:17,826 INFO ]: Start difference. First operand 151 states and 290 transitions. Second operand 19 states. [2018-06-24 21:11:21,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:21,247 INFO ]: Finished difference Result 403 states and 1272 transitions. [2018-06-24 21:11:21,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 21:11:21,247 INFO ]: Start accepts. Automaton has 19 states. Word has length 24 [2018-06-24 21:11:21,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:21,253 INFO ]: With dead ends: 403 [2018-06-24 21:11:21,253 INFO ]: Without dead ends: 403 [2018-06-24 21:11:21,254 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=481, Invalid=3059, Unknown=0, NotChecked=0, Total=3540 [2018-06-24 21:11:21,255 INFO ]: Start minimizeSevpa. Operand 403 states. [2018-06-24 21:11:21,285 INFO ]: Finished minimizeSevpa. Reduced states from 403 to 184. [2018-06-24 21:11:21,285 INFO ]: Start removeUnreachable. Operand 184 states. [2018-06-24 21:11:21,288 INFO ]: Finished removeUnreachable. Reduced from 184 states to 184 states and 363 transitions. [2018-06-24 21:11:21,288 INFO ]: Start accepts. Automaton has 184 states and 363 transitions. Word has length 24 [2018-06-24 21:11:21,288 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:21,288 INFO ]: Abstraction has 184 states and 363 transitions. [2018-06-24 21:11:21,288 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:11:21,288 INFO ]: Start isEmpty. Operand 184 states and 363 transitions. [2018-06-24 21:11:21,293 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 21:11:21,293 INFO ]: Found error trace [2018-06-24 21:11:21,293 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:21,293 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:21,293 INFO ]: Analyzing trace with hash 862416794, now seen corresponding path program 3 times [2018-06-24 21:11:21,293 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:21,293 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:21,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:21,294 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:11:21,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:21,321 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:21,890 INFO ]: Checked inductivity of 25 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:11:21,890 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:21,890 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:21,899 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:11:21,937 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:11:21,937 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:21,941 INFO ]: Computing forward predicates... [2018-06-24 21:11:22,460 INFO ]: Checked inductivity of 25 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 21:11:22,480 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:22,480 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-24 21:11:22,481 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:11:22,481 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:11:22,481 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:11:22,481 INFO ]: Start difference. First operand 184 states and 363 transitions. Second operand 15 states. [2018-06-24 21:11:23,146 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-06-24 21:11:23,306 WARN ]: Spent 134.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2018-06-24 21:11:23,502 WARN ]: Spent 151.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2018-06-24 21:11:23,665 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 98 [2018-06-24 21:11:24,659 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:24,659 INFO ]: Finished difference Result 379 states and 958 transitions. [2018-06-24 21:11:24,659 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 21:11:24,659 INFO ]: Start accepts. Automaton has 15 states. Word has length 24 [2018-06-24 21:11:24,659 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:24,664 INFO ]: With dead ends: 379 [2018-06-24 21:11:24,664 INFO ]: Without dead ends: 379 [2018-06-24 21:11:24,664 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 21:11:24,665 INFO ]: Start minimizeSevpa. Operand 379 states. [2018-06-24 21:11:24,686 INFO ]: Finished minimizeSevpa. Reduced states from 379 to 196. [2018-06-24 21:11:24,686 INFO ]: Start removeUnreachable. Operand 196 states. [2018-06-24 21:11:24,689 INFO ]: Finished removeUnreachable. Reduced from 196 states to 196 states and 390 transitions. [2018-06-24 21:11:24,689 INFO ]: Start accepts. Automaton has 196 states and 390 transitions. Word has length 24 [2018-06-24 21:11:24,689 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:24,689 INFO ]: Abstraction has 196 states and 390 transitions. [2018-06-24 21:11:24,689 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:11:24,690 INFO ]: Start isEmpty. Operand 196 states and 390 transitions. [2018-06-24 21:11:24,695 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 21:11:24,695 INFO ]: Found error trace [2018-06-24 21:11:24,695 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:24,695 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:24,696 INFO ]: Analyzing trace with hash -1953627844, now seen corresponding path program 4 times [2018-06-24 21:11:24,696 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:24,696 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:24,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:24,696 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:11:24,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:24,721 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:25,270 INFO ]: Checked inductivity of 25 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 21:11:25,270 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:25,270 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:11:25,285 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:25,339 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:11:25,339 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:25,343 INFO ]: Computing forward predicates... [2018-06-24 21:11:25,477 INFO ]: Checked inductivity of 25 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 21:11:25,498 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:25,498 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 21:11:25,498 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:11:25,498 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:11:25,498 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:11:25,498 INFO ]: Start difference. First operand 196 states and 390 transitions. Second operand 7 states. [2018-06-24 21:11:25,768 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:25,768 INFO ]: Finished difference Result 257 states and 561 transitions. [2018-06-24 21:11:25,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:11:25,768 INFO ]: Start accepts. Automaton has 7 states. Word has length 24 [2018-06-24 21:11:25,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:25,771 INFO ]: With dead ends: 257 [2018-06-24 21:11:25,771 INFO ]: Without dead ends: 257 [2018-06-24 21:11:25,772 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:11:25,772 INFO ]: Start minimizeSevpa. Operand 257 states. [2018-06-24 21:11:25,783 INFO ]: Finished minimizeSevpa. Reduced states from 257 to 187. [2018-06-24 21:11:25,783 INFO ]: Start removeUnreachable. Operand 187 states. [2018-06-24 21:11:25,785 INFO ]: Finished removeUnreachable. Reduced from 187 states to 187 states and 372 transitions. [2018-06-24 21:11:25,785 INFO ]: Start accepts. Automaton has 187 states and 372 transitions. Word has length 24 [2018-06-24 21:11:25,785 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:25,785 INFO ]: Abstraction has 187 states and 372 transitions. [2018-06-24 21:11:25,785 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:11:25,785 INFO ]: Start isEmpty. Operand 187 states and 372 transitions. [2018-06-24 21:11:25,790 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 21:11:25,790 INFO ]: Found error trace [2018-06-24 21:11:25,790 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:25,790 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:25,790 INFO ]: Analyzing trace with hash -1904930407, now seen corresponding path program 1 times [2018-06-24 21:11:25,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:25,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:25,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:25,791 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:11:25,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:25,808 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:25,987 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-24 21:11:26,164 INFO ]: Checked inductivity of 33 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:11:26,164 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:26,164 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:26,170 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:26,218 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:26,222 INFO ]: Computing forward predicates... [2018-06-24 21:11:26,262 INFO ]: Checked inductivity of 33 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:11:26,286 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:26,286 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-24 21:11:26,286 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:11:26,286 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:11:26,286 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:11:26,287 INFO ]: Start difference. First operand 187 states and 372 transitions. Second operand 8 states. [2018-06-24 21:11:26,704 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:26,704 INFO ]: Finished difference Result 297 states and 709 transitions. [2018-06-24 21:11:26,705 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:11:26,705 INFO ]: Start accepts. Automaton has 8 states. Word has length 27 [2018-06-24 21:11:26,705 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:26,709 INFO ]: With dead ends: 297 [2018-06-24 21:11:26,709 INFO ]: Without dead ends: 266 [2018-06-24 21:11:26,709 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:11:26,709 INFO ]: Start minimizeSevpa. Operand 266 states. [2018-06-24 21:11:26,722 INFO ]: Finished minimizeSevpa. Reduced states from 266 to 206. [2018-06-24 21:11:26,722 INFO ]: Start removeUnreachable. Operand 206 states. [2018-06-24 21:11:26,724 INFO ]: Finished removeUnreachable. Reduced from 206 states to 206 states and 434 transitions. [2018-06-24 21:11:26,724 INFO ]: Start accepts. Automaton has 206 states and 434 transitions. Word has length 27 [2018-06-24 21:11:26,724 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:26,724 INFO ]: Abstraction has 206 states and 434 transitions. [2018-06-24 21:11:26,724 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:11:26,724 INFO ]: Start isEmpty. Operand 206 states and 434 transitions. [2018-06-24 21:11:26,730 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 21:11:26,730 INFO ]: Found error trace [2018-06-24 21:11:26,730 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:26,730 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:26,731 INFO ]: Analyzing trace with hash -1157168922, now seen corresponding path program 2 times [2018-06-24 21:11:26,731 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:26,731 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:26,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:26,731 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:26,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:26,744 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:26,912 INFO ]: Checked inductivity of 33 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:11:26,912 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:26,912 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-24 21:11:26,917 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:11:26,960 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:11:26,960 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:26,963 INFO ]: Computing forward predicates... [2018-06-24 21:11:26,977 INFO ]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:11:26,995 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:11:26,995 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2018-06-24 21:11:26,996 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:11:26,996 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:11:26,996 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:11:26,996 INFO ]: Start difference. First operand 206 states and 434 transitions. Second operand 11 states. [2018-06-24 21:11:27,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:27,507 INFO ]: Finished difference Result 242 states and 576 transitions. [2018-06-24 21:11:27,507 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 21:11:27,507 INFO ]: Start accepts. Automaton has 11 states. Word has length 27 [2018-06-24 21:11:27,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:27,510 INFO ]: With dead ends: 242 [2018-06-24 21:11:27,510 INFO ]: Without dead ends: 242 [2018-06-24 21:11:27,510 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 21:11:27,510 INFO ]: Start minimizeSevpa. Operand 242 states. [2018-06-24 21:11:27,520 INFO ]: Finished minimizeSevpa. Reduced states from 242 to 155. [2018-06-24 21:11:27,520 INFO ]: Start removeUnreachable. Operand 155 states. [2018-06-24 21:11:27,521 INFO ]: Finished removeUnreachable. Reduced from 155 states to 155 states and 309 transitions. [2018-06-24 21:11:27,521 INFO ]: Start accepts. Automaton has 155 states and 309 transitions. Word has length 27 [2018-06-24 21:11:27,521 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:27,521 INFO ]: Abstraction has 155 states and 309 transitions. [2018-06-24 21:11:27,521 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:11:27,521 INFO ]: Start isEmpty. Operand 155 states and 309 transitions. [2018-06-24 21:11:27,525 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 21:11:27,525 INFO ]: Found error trace [2018-06-24 21:11:27,525 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-06-24 21:11:27,525 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:27,526 INFO ]: Analyzing trace with hash -1230745750, now seen corresponding path program 2 times [2018-06-24 21:11:27,526 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:27,526 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:27,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:27,526 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:11:27,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:27,539 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:27,937 INFO ]: Checked inductivity of 52 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-24 21:11:27,937 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:27,937 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) [2018-06-24 21:11:27,951 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:28,003 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:11:28,003 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:28,005 INFO ]: Computing forward predicates... [2018-06-24 21:11:28,088 INFO ]: Checked inductivity of 52 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-24 21:11:28,118 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:28,118 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-06-24 21:11:28,119 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:11:28,119 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:11:28,119 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:11:28,119 INFO ]: Start difference. First operand 155 states and 309 transitions. Second operand 13 states. [2018-06-24 21:11:28,768 WARN ]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-24 21:11:30,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:30,226 INFO ]: Finished difference Result 298 states and 909 transitions. [2018-06-24 21:11:30,227 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 21:11:30,227 INFO ]: Start accepts. Automaton has 13 states. Word has length 33 [2018-06-24 21:11:30,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:30,231 INFO ]: With dead ends: 298 [2018-06-24 21:11:30,231 INFO ]: Without dead ends: 256 [2018-06-24 21:11:30,231 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:11:30,232 INFO ]: Start minimizeSevpa. Operand 256 states. [2018-06-24 21:11:30,250 INFO ]: Finished minimizeSevpa. Reduced states from 256 to 149. [2018-06-24 21:11:30,250 INFO ]: Start removeUnreachable. Operand 149 states. [2018-06-24 21:11:30,252 INFO ]: Finished removeUnreachable. Reduced from 149 states to 149 states and 297 transitions. [2018-06-24 21:11:30,252 INFO ]: Start accepts. Automaton has 149 states and 297 transitions. Word has length 33 [2018-06-24 21:11:30,252 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:30,252 INFO ]: Abstraction has 149 states and 297 transitions. [2018-06-24 21:11:30,252 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:11:30,252 INFO ]: Start isEmpty. Operand 149 states and 297 transitions. [2018-06-24 21:11:30,256 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 21:11:30,256 INFO ]: Found error trace [2018-06-24 21:11:30,256 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:30,256 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:30,256 INFO ]: Analyzing trace with hash -390454442, now seen corresponding path program 1 times [2018-06-24 21:11:30,256 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:30,256 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:30,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:30,257 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:11:30,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:30,274 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:30,622 INFO ]: Checked inductivity of 73 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-24 21:11:30,622 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:30,622 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:30,628 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:30,704 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:30,708 INFO ]: Computing forward predicates... [2018-06-24 21:11:30,939 INFO ]: Checked inductivity of 73 backedges. 19 proven. 36 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 21:11:30,957 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:30,957 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-24 21:11:30,957 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:11:30,957 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:11:30,957 INFO ]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:11:30,957 INFO ]: Start difference. First operand 149 states and 297 transitions. Second operand 20 states. [2018-06-24 21:11:34,045 WARN ]: Spent 186.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-06-24 21:11:34,392 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-06-24 21:11:35,442 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-24 21:11:36,575 WARN ]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-24 21:11:41,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:41,309 INFO ]: Finished difference Result 839 states and 3379 transitions. [2018-06-24 21:11:41,309 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-06-24 21:11:41,309 INFO ]: Start accepts. Automaton has 20 states. Word has length 38 [2018-06-24 21:11:41,309 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:41,325 INFO ]: With dead ends: 839 [2018-06-24 21:11:41,325 INFO ]: Without dead ends: 790 [2018-06-24 21:11:41,329 INFO ]: 0 DeclaredPredicates, 262 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11483 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3231, Invalid=26871, Unknown=0, NotChecked=0, Total=30102 [2018-06-24 21:11:41,330 INFO ]: Start minimizeSevpa. Operand 790 states. [2018-06-24 21:11:41,405 INFO ]: Finished minimizeSevpa. Reduced states from 790 to 282. [2018-06-24 21:11:41,405 INFO ]: Start removeUnreachable. Operand 282 states. [2018-06-24 21:11:41,408 INFO ]: Finished removeUnreachable. Reduced from 282 states to 282 states and 664 transitions. [2018-06-24 21:11:41,409 INFO ]: Start accepts. Automaton has 282 states and 664 transitions. Word has length 38 [2018-06-24 21:11:41,409 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:41,409 INFO ]: Abstraction has 282 states and 664 transitions. [2018-06-24 21:11:41,409 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:11:41,409 INFO ]: Start isEmpty. Operand 282 states and 664 transitions. [2018-06-24 21:11:41,415 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:11:41,415 INFO ]: Found error trace [2018-06-24 21:11:41,415 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:41,415 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:41,415 INFO ]: Analyzing trace with hash 831733859, now seen corresponding path program 1 times [2018-06-24 21:11:41,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:41,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:41,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:41,416 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:41,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:41,432 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:41,735 INFO ]: Checked inductivity of 51 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 21:11:41,735 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:41,735 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:41,740 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:41,798 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:41,800 INFO ]: Computing forward predicates... [2018-06-24 21:11:41,903 INFO ]: Checked inductivity of 51 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:11:41,926 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:41,926 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-24 21:11:41,927 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:11:41,927 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:11:41,927 INFO ]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:11:41,927 INFO ]: Start difference. First operand 282 states and 664 transitions. Second operand 18 states. [2018-06-24 21:11:46,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:46,003 INFO ]: Finished difference Result 1049 states and 5874 transitions. [2018-06-24 21:11:46,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-06-24 21:11:46,003 INFO ]: Start accepts. Automaton has 18 states. Word has length 32 [2018-06-24 21:11:46,003 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:46,058 INFO ]: With dead ends: 1049 [2018-06-24 21:11:46,058 INFO ]: Without dead ends: 1049 [2018-06-24 21:11:46,061 INFO ]: 0 DeclaredPredicates, 179 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4593 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1725, Invalid=11615, Unknown=0, NotChecked=0, Total=13340 [2018-06-24 21:11:46,061 INFO ]: Start minimizeSevpa. Operand 1049 states. [2018-06-24 21:11:46,219 INFO ]: Finished minimizeSevpa. Reduced states from 1049 to 500. [2018-06-24 21:11:46,219 INFO ]: Start removeUnreachable. Operand 500 states. [2018-06-24 21:11:46,226 INFO ]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1102 transitions. [2018-06-24 21:11:46,226 INFO ]: Start accepts. Automaton has 500 states and 1102 transitions. Word has length 32 [2018-06-24 21:11:46,226 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:46,226 INFO ]: Abstraction has 500 states and 1102 transitions. [2018-06-24 21:11:46,226 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:11:46,226 INFO ]: Start isEmpty. Operand 500 states and 1102 transitions. [2018-06-24 21:11:46,234 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 21:11:46,234 INFO ]: Found error trace [2018-06-24 21:11:46,234 INFO ]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:46,234 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:46,234 INFO ]: Analyzing trace with hash 2090480344, now seen corresponding path program 2 times [2018-06-24 21:11:46,234 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:46,234 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:46,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:46,235 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:46,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:46,252 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:47,160 INFO ]: Checked inductivity of 73 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 21:11:47,160 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:47,160 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-24 21:11:47,166 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:11:47,224 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:11:47,224 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:47,228 INFO ]: Computing forward predicates... [2018-06-24 21:11:47,410 INFO ]: Checked inductivity of 73 backedges. 20 proven. 38 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:11:47,429 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:47,429 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 20 [2018-06-24 21:11:47,430 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:11:47,430 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:11:47,430 INFO ]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:11:47,430 INFO ]: Start difference. First operand 500 states and 1102 transitions. Second operand 20 states. [2018-06-24 21:11:50,340 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:50,340 INFO ]: Finished difference Result 1335 states and 7087 transitions. [2018-06-24 21:11:50,340 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-24 21:11:50,340 INFO ]: Start accepts. Automaton has 20 states. Word has length 38 [2018-06-24 21:11:50,340 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:50,424 INFO ]: With dead ends: 1335 [2018-06-24 21:11:50,424 INFO ]: Without dead ends: 1335 [2018-06-24 21:11:50,425 INFO ]: 0 DeclaredPredicates, 143 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1877 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=724, Invalid=5438, Unknown=0, NotChecked=0, Total=6162 [2018-06-24 21:11:50,425 INFO ]: Start minimizeSevpa. Operand 1335 states. [2018-06-24 21:11:50,624 INFO ]: Finished minimizeSevpa. Reduced states from 1335 to 620. [2018-06-24 21:11:50,624 INFO ]: Start removeUnreachable. Operand 620 states. [2018-06-24 21:11:50,635 INFO ]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1588 transitions. [2018-06-24 21:11:50,635 INFO ]: Start accepts. Automaton has 620 states and 1588 transitions. Word has length 38 [2018-06-24 21:11:50,635 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:50,635 INFO ]: Abstraction has 620 states and 1588 transitions. [2018-06-24 21:11:50,635 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:11:50,635 INFO ]: Start isEmpty. Operand 620 states and 1588 transitions. [2018-06-24 21:11:50,644 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:11:50,644 INFO ]: Found error trace [2018-06-24 21:11:50,644 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:50,645 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:50,645 INFO ]: Analyzing trace with hash 290221573, now seen corresponding path program 2 times [2018-06-24 21:11:50,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:50,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:50,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:50,647 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:11:50,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:50,662 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:51,699 INFO ]: Checked inductivity of 51 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:11:51,699 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:51,699 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-24 21:11:51,707 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:11:51,756 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:11:51,756 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:51,760 INFO ]: Computing forward predicates... [2018-06-24 21:11:51,921 INFO ]: Checked inductivity of 51 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 21:11:51,939 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:51,939 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-06-24 21:11:51,940 INFO ]: Interpolant automaton has 21 states [2018-06-24 21:11:51,940 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 21:11:51,940 INFO ]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:11:51,940 INFO ]: Start difference. First operand 620 states and 1588 transitions. Second operand 21 states. Received shutdown request... [2018-06-24 21:11:52,647 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 21:11:52,647 WARN ]: Verification canceled [2018-06-24 21:11:52,650 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:11:52,651 WARN ]: Timeout [2018-06-24 21:11:52,651 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:11:52 BasicIcfg [2018-06-24 21:11:52,652 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:11:52,652 INFO ]: Toolchain (without parser) took 56673.67 ms. Allocated memory was 308.3 MB in the beginning and 856.7 MB in the end (delta: 548.4 MB). Free memory was 262.8 MB in the beginning and 494.5 MB in the end (delta: -231.7 MB). Peak memory consumption was 316.7 MB. Max. memory is 3.6 GB. [2018-06-24 21:11:52,653 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:11:52,653 INFO ]: ChcToBoogie took 74.59 ms. Allocated memory is still 308.3 MB. Free memory was 261.8 MB in the beginning and 259.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:11:52,653 INFO ]: Boogie Preprocessor took 43.61 ms. Allocated memory is still 308.3 MB. Free memory was 259.8 MB in the beginning and 258.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:11:52,657 INFO ]: RCFGBuilder took 359.94 ms. Allocated memory is still 308.3 MB. Free memory was 258.7 MB in the beginning and 244.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:11:52,658 INFO ]: BlockEncodingV2 took 288.98 ms. Allocated memory is still 308.3 MB. Free memory was 244.7 MB in the beginning and 233.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:11:52,658 INFO ]: TraceAbstraction took 55889.81 ms. Allocated memory was 308.3 MB in the beginning and 856.7 MB in the end (delta: 548.4 MB). Free memory was 232.7 MB in the beginning and 494.5 MB in the end (delta: -261.8 MB). Peak memory consumption was 286.6 MB. Max. memory is 3.6 GB. [2018-06-24 21:11:52,661 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 23 locations, 32 edges - StatisticsResult: Encoded RCFG 12 locations, 22 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 74.59 ms. Allocated memory is still 308.3 MB. Free memory was 261.8 MB in the beginning and 259.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 43.61 ms. Allocated memory is still 308.3 MB. Free memory was 259.8 MB in the beginning and 258.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 359.94 ms. Allocated memory is still 308.3 MB. Free memory was 258.7 MB in the beginning and 244.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 288.98 ms. Allocated memory is still 308.3 MB. Free memory was 244.7 MB in the beginning and 233.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55889.81 ms. Allocated memory was 308.3 MB in the beginning and 856.7 MB in the end (delta: 548.4 MB). Free memory was 232.7 MB in the beginning and 494.5 MB in the end (delta: -261.8 MB). Peak memory consumption was 286.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (620states) and interpolant automaton (currently 21 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (53 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. TIMEOUT Result, 55.8s OverallTime, 28 OverallIterations, 5 TraceHistogramMax, 41.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2164 SDtfs, 2921 SDslu, 8379 SDs, 0 SdLazy, 27706 SolverSat, 6573 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1464 GetRequests, 624 SyntacticMatches, 11 SemanticMatches, 829 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 20979 ImplicationChecksByTransitivity, 23.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=620occurred in iteration=27, 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.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 4076 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 973 NumberOfCodeBlocks, 970 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 927 ConstructedInterpolants, 70 QuantifiedInterpolants, 92864 SizeOfPredicates, 405 NumberOfNonLiveVariables, 7369 ConjunctsInSsa, 622 ConjunctsInUnsatCore, 46 InterpolantComputations, 12 PerfectInterpolantSequences, 791/1112 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/array_reverse_once1_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-11-52-671.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_reverse_once1_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-11-52-671.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_reverse_once1_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-11-52-671.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_reverse_once1_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-11-52-671.csv Completed graceful shutdown