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/eldarica-misc/LIA/reve/008-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:00:31,900 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:00:31,902 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:00:31,913 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:00:31,913 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:00:31,914 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:00:31,915 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:00:31,917 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:00:31,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:00:31,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:00:31,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:00:31,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:00:31,921 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:00:31,922 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:00:31,923 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:00:31,924 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:00:31,925 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:00:31,927 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:00:31,929 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:00:31,930 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:00:31,931 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:00:31,934 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:00:31,934 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:00:31,934 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:00:31,935 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:00:31,936 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:00:31,937 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:00:31,937 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:00:31,938 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:00:31,939 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:00:31,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:00:31,940 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:00:31,940 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:00:31,941 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:00:31,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:00:31,942 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:00:31,956 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:00:31,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:00:31,957 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:00:31,957 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:00:31,958 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:00:31,958 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:00:31,959 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:00:31,959 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:00:31,959 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:00:31,960 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:00:31,960 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:00:31,960 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:00:31,960 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:00:31,960 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:00:31,961 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:00:31,961 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:00:31,961 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:00:31,961 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:00:31,962 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:00:31,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:00:31,962 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:00:31,963 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:00:31,964 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:00:32,013 INFO ]: Repository-Root is: /tmp [2018-06-24 21:00:32,026 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:00:32,029 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:00:32,030 INFO ]: Initializing SmtParser... [2018-06-24 21:00:32,030 INFO ]: SmtParser initialized [2018-06-24 21:00:32,031 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 [2018-06-24 21:00:32,032 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:00:32,112 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 unknown [2018-06-24 21:00:32,324 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 [2018-06-24 21:00:32,329 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:00:32,335 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:00:32,335 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:00:32,336 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:00:32,336 INFO ]: ChcToBoogie initialized [2018-06-24 21:00:32,339 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:00:32" (1/1) ... [2018-06-24 21:00:32,398 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:32 Unit [2018-06-24 21:00:32,398 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:00:32,399 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:00:32,399 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:00:32,399 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:00:32,419 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:32" (1/1) ... [2018-06-24 21:00:32,419 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:32" (1/1) ... [2018-06-24 21:00:32,426 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:32" (1/1) ... [2018-06-24 21:00:32,426 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:32" (1/1) ... [2018-06-24 21:00:32,431 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:32" (1/1) ... [2018-06-24 21:00:32,445 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:32" (1/1) ... [2018-06-24 21:00:32,446 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:32" (1/1) ... [2018-06-24 21:00:32,448 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:00:32,448 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:00:32,448 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:00:32,449 INFO ]: RCFGBuilder initialized [2018-06-24 21:00:32,449 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:32" (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:00:32,468 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:00:32,468 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:00:32,468 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:00:32,468 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:00:32,469 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:00:32,469 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:00:32,899 INFO ]: Using library mode [2018-06-24 21:00:32,899 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:00:32 BoogieIcfgContainer [2018-06-24 21:00:32,899 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:00:32,900 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:00:32,900 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:00:32,906 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:00:32,907 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:00:32" (1/1) ... [2018-06-24 21:00:32,925 INFO ]: Initial Icfg 10 locations, 20 edges [2018-06-24 21:00:32,926 INFO ]: Using Remove infeasible edges [2018-06-24 21:00:32,927 INFO ]: Using Maximize final states [2018-06-24 21:00:32,927 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:00:32,927 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:00:32,930 INFO ]: Using Remove sink states [2018-06-24 21:00:32,930 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:00:32,930 INFO ]: Using Use SBE [2018-06-24 21:00:32,949 INFO ]: SBE split 0 edges [2018-06-24 21:00:32,954 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:00:32,957 INFO ]: 0 new accepting states [2018-06-24 21:00:33,005 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 21:00:33,007 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:00:33,011 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:00:33,011 INFO ]: 0 new accepting states [2018-06-24 21:00:33,011 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:00:33,012 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:00:33,012 INFO ]: Encoded RCFG 6 locations, 16 edges [2018-06-24 21:00:33,012 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:00:33 BasicIcfg [2018-06-24 21:00:33,012 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:00:33,013 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:00:33,013 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:00:33,018 INFO ]: TraceAbstraction initialized [2018-06-24 21:00:33,018 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:00:32" (1/4) ... [2018-06-24 21:00:33,019 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b9677a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:00:33, skipping insertion in model container [2018-06-24 21:00:33,019 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:32" (2/4) ... [2018-06-24 21:00:33,020 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b9677a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:00:33, skipping insertion in model container [2018-06-24 21:00:33,021 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:00:32" (3/4) ... [2018-06-24 21:00:33,021 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b9677a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:00:33, skipping insertion in model container [2018-06-24 21:00:33,021 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:00:33" (4/4) ... [2018-06-24 21:00:33,023 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:00:33,029 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:00:33,035 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:00:33,067 INFO ]: Using default assertion order modulation [2018-06-24 21:00:33,068 INFO ]: Interprodecural is true [2018-06-24 21:00:33,068 INFO ]: Hoare is false [2018-06-24 21:00:33,068 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:00:33,068 INFO ]: Backedges is TWOTRACK [2018-06-24 21:00:33,068 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:00:33,068 INFO ]: Difference is false [2018-06-24 21:00:33,068 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:00:33,068 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:00:33,076 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 21:00:33,085 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:00:33,085 INFO ]: Found error trace [2018-06-24 21:00:33,086 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:00:33,086 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:33,091 INFO ]: Analyzing trace with hash 44945612, now seen corresponding path program 1 times [2018-06-24 21:00:33,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:33,093 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:33,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:33,125 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:33,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:33,165 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:33,232 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:00:33,234 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:00:33,234 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:00:33,235 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:00:33,245 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:00:33,246 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:00:33,248 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 21:00:33,416 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:33,416 INFO ]: Finished difference Result 7 states and 27 transitions. [2018-06-24 21:00:33,417 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:00:33,418 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:00:33,418 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:33,428 INFO ]: With dead ends: 7 [2018-06-24 21:00:33,428 INFO ]: Without dead ends: 7 [2018-06-24 21:00:33,430 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:00:33,442 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:00:33,456 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:00:33,457 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:00:33,457 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-06-24 21:00:33,458 INFO ]: Start accepts. Automaton has 7 states and 27 transitions. Word has length 5 [2018-06-24 21:00:33,459 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:33,459 INFO ]: Abstraction has 7 states and 27 transitions. [2018-06-24 21:00:33,459 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:00:33,459 INFO ]: Start isEmpty. Operand 7 states and 27 transitions. [2018-06-24 21:00:33,460 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:00:33,460 INFO ]: Found error trace [2018-06-24 21:00:33,460 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:00:33,460 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:33,460 INFO ]: Analyzing trace with hash 1392750034, now seen corresponding path program 1 times [2018-06-24 21:00:33,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:33,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:33,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:33,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:33,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:33,474 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:33,525 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:00:33,525 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:00:33,525 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:00:33,526 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:00:33,526 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:00:33,526 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:00:33,526 INFO ]: Start difference. First operand 7 states and 27 transitions. Second operand 3 states. [2018-06-24 21:00:33,687 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:33,687 INFO ]: Finished difference Result 9 states and 41 transitions. [2018-06-24 21:00:33,688 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:00:33,688 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:00:33,688 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:33,688 INFO ]: With dead ends: 9 [2018-06-24 21:00:33,688 INFO ]: Without dead ends: 9 [2018-06-24 21:00:33,689 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:00:33,689 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:00:33,691 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 21:00:33,691 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:00:33,692 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2018-06-24 21:00:33,692 INFO ]: Start accepts. Automaton has 9 states and 41 transitions. Word has length 6 [2018-06-24 21:00:33,692 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:33,692 INFO ]: Abstraction has 9 states and 41 transitions. [2018-06-24 21:00:33,692 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:00:33,692 INFO ]: Start isEmpty. Operand 9 states and 41 transitions. [2018-06-24 21:00:33,693 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:00:33,693 INFO ]: Found error trace [2018-06-24 21:00:33,693 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:00:33,693 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:33,693 INFO ]: Analyzing trace with hash 1392779825, now seen corresponding path program 1 times [2018-06-24 21:00:33,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:33,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:33,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:33,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:33,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:33,718 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:33,746 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:00:33,747 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:00:33,747 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:00:33,747 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:00:33,747 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:00:33,747 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:00:33,747 INFO ]: Start difference. First operand 9 states and 41 transitions. Second operand 3 states. [2018-06-24 21:00:34,000 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:34,000 INFO ]: Finished difference Result 11 states and 61 transitions. [2018-06-24 21:00:34,001 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:00:34,001 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:00:34,001 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:34,001 INFO ]: With dead ends: 11 [2018-06-24 21:00:34,001 INFO ]: Without dead ends: 11 [2018-06-24 21:00:34,002 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:00:34,002 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:00:34,004 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-24 21:00:34,004 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:00:34,004 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2018-06-24 21:00:34,005 INFO ]: Start accepts. Automaton has 10 states and 51 transitions. Word has length 6 [2018-06-24 21:00:34,005 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:34,005 INFO ]: Abstraction has 10 states and 51 transitions. [2018-06-24 21:00:34,005 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:00:34,005 INFO ]: Start isEmpty. Operand 10 states and 51 transitions. [2018-06-24 21:00:34,005 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:00:34,005 INFO ]: Found error trace [2018-06-24 21:00:34,005 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:00:34,005 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:34,005 INFO ]: Analyzing trace with hash 1392839407, now seen corresponding path program 1 times [2018-06-24 21:00:34,005 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:34,005 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:34,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:34,006 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:34,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:34,037 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:34,201 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:34,201 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:34,201 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:00:34,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:34,231 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:34,236 INFO ]: Computing forward predicates... [2018-06-24 21:00:34,255 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:34,277 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:34,277 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 21:00:34,277 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:00:34,277 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:00:34,277 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:00:34,277 INFO ]: Start difference. First operand 10 states and 51 transitions. Second operand 4 states. [2018-06-24 21:00:34,602 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:34,602 INFO ]: Finished difference Result 14 states and 93 transitions. [2018-06-24 21:00:34,603 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:00:34,603 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:00:34,603 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:34,604 INFO ]: With dead ends: 14 [2018-06-24 21:00:34,604 INFO ]: Without dead ends: 14 [2018-06-24 21:00:34,604 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:00:34,604 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:00:34,607 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-24 21:00:34,607 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:00:34,608 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2018-06-24 21:00:34,608 INFO ]: Start accepts. Automaton has 13 states and 83 transitions. Word has length 6 [2018-06-24 21:00:34,608 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:34,608 INFO ]: Abstraction has 13 states and 83 transitions. [2018-06-24 21:00:34,608 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:00:34,608 INFO ]: Start isEmpty. Operand 13 states and 83 transitions. [2018-06-24 21:00:34,608 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:00:34,608 INFO ]: Found error trace [2018-06-24 21:00:34,608 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:00:34,608 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:34,608 INFO ]: Analyzing trace with hash 1392898989, now seen corresponding path program 1 times [2018-06-24 21:00:34,608 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:34,608 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:34,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:34,609 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:34,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:34,619 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:34,651 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:34,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:34,651 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:00:34,657 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:34,675 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:34,677 INFO ]: Computing forward predicates... [2018-06-24 21:00:34,815 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:34,835 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:34,835 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 21:00:34,835 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:00:34,835 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:00:34,835 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:00:34,835 INFO ]: Start difference. First operand 13 states and 83 transitions. Second operand 5 states. [2018-06-24 21:00:35,040 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:35,040 INFO ]: Finished difference Result 28 states and 195 transitions. [2018-06-24 21:00:35,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:00:35,040 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 21:00:35,041 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:35,044 INFO ]: With dead ends: 28 [2018-06-24 21:00:35,044 INFO ]: Without dead ends: 28 [2018-06-24 21:00:35,044 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:00:35,044 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 21:00:35,049 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 21. [2018-06-24 21:00:35,049 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 21:00:35,050 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 143 transitions. [2018-06-24 21:00:35,050 INFO ]: Start accepts. Automaton has 21 states and 143 transitions. Word has length 6 [2018-06-24 21:00:35,050 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:35,050 INFO ]: Abstraction has 21 states and 143 transitions. [2018-06-24 21:00:35,050 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:00:35,050 INFO ]: Start isEmpty. Operand 21 states and 143 transitions. [2018-06-24 21:00:35,051 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:00:35,051 INFO ]: Found error trace [2018-06-24 21:00:35,051 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:35,051 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:35,051 INFO ]: Analyzing trace with hash 225133320, now seen corresponding path program 1 times [2018-06-24 21:00:35,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:35,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:35,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:35,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:35,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:35,078 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:35,140 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:35,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:35,141 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:00:35,146 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:35,170 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:35,172 INFO ]: Computing forward predicates... [2018-06-24 21:00:35,224 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:35,243 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:35,243 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 21:00:35,244 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:00:35,244 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:00:35,244 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:00:35,244 INFO ]: Start difference. First operand 21 states and 143 transitions. Second operand 6 states. [2018-06-24 21:00:35,439 WARN ]: Spent 157.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-06-24 21:00:35,765 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:35,765 INFO ]: Finished difference Result 38 states and 243 transitions. [2018-06-24 21:00:35,766 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:00:35,766 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 21:00:35,766 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:35,767 INFO ]: With dead ends: 38 [2018-06-24 21:00:35,767 INFO ]: Without dead ends: 38 [2018-06-24 21:00:35,767 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:00:35,768 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 21:00:35,773 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-06-24 21:00:35,773 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 21:00:35,775 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 204 transitions. [2018-06-24 21:00:35,775 INFO ]: Start accepts. Automaton has 30 states and 204 transitions. Word has length 7 [2018-06-24 21:00:35,775 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:35,775 INFO ]: Abstraction has 30 states and 204 transitions. [2018-06-24 21:00:35,775 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:00:35,775 INFO ]: Start isEmpty. Operand 30 states and 204 transitions. [2018-06-24 21:00:35,776 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:00:35,776 INFO ]: Found error trace [2018-06-24 21:00:35,776 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:35,776 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:35,776 INFO ]: Analyzing trace with hash 226027050, now seen corresponding path program 1 times [2018-06-24 21:00:35,776 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:35,776 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:35,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:35,777 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:35,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:35,789 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:35,819 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:35,819 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:00:35,819 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:00:35,819 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:00:35,820 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:00:35,820 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:00:35,820 INFO ]: Start difference. First operand 30 states and 204 transitions. Second operand 3 states. [2018-06-24 21:00:35,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:35,863 INFO ]: Finished difference Result 22 states and 65 transitions. [2018-06-24 21:00:35,863 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:00:35,863 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:00:35,864 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:35,864 INFO ]: With dead ends: 22 [2018-06-24 21:00:35,864 INFO ]: Without dead ends: 11 [2018-06-24 21:00:35,864 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:00:35,864 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:00:35,865 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-24 21:00:35,865 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:00:35,866 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-24 21:00:35,866 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 7 [2018-06-24 21:00:35,866 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:35,866 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-24 21:00:35,866 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:00:35,866 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-24 21:00:35,866 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:00:35,866 INFO ]: Found error trace [2018-06-24 21:00:35,866 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:35,866 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:35,866 INFO ]: Analyzing trace with hash 226950571, now seen corresponding path program 1 times [2018-06-24 21:00:35,866 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:35,866 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:35,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:35,867 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:35,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:35,894 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:35,947 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:35,947 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:35,947 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:00:35,953 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:35,978 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:35,980 INFO ]: Computing forward predicates... [2018-06-24 21:00:36,112 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:36,131 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:00:36,131 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-06-24 21:00:36,131 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:00:36,131 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:00:36,131 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:00:36,132 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 5 states. [2018-06-24 21:00:36,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:36,171 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-24 21:00:36,171 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:00:36,171 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 21:00:36,171 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:36,172 INFO ]: With dead ends: 10 [2018-06-24 21:00:36,172 INFO ]: Without dead ends: 10 [2018-06-24 21:00:36,172 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:00:36,172 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:00:36,173 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-24 21:00:36,173 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:00:36,173 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-24 21:00:36,173 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-24 21:00:36,173 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:36,173 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-24 21:00:36,173 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:00:36,173 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-24 21:00:36,174 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:00:36,174 INFO ]: Found error trace [2018-06-24 21:00:36,174 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:36,174 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:36,174 INFO ]: Analyzing trace with hash 227010153, now seen corresponding path program 1 times [2018-06-24 21:00:36,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:36,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:36,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:36,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:36,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:36,185 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:36,243 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:36,243 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:36,243 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:00:36,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:36,266 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:36,268 INFO ]: Computing forward predicates... [2018-06-24 21:00:36,286 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:36,318 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:36,318 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 21:00:36,318 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:00:36,318 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:00:36,318 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:00:36,318 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 6 states. [2018-06-24 21:00:36,371 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:36,371 INFO ]: Finished difference Result 12 states and 21 transitions. [2018-06-24 21:00:36,371 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:00:36,371 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 21:00:36,371 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:36,372 INFO ]: With dead ends: 12 [2018-06-24 21:00:36,372 INFO ]: Without dead ends: 12 [2018-06-24 21:00:36,372 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:00:36,372 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:00:36,373 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-24 21:00:36,373 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:00:36,373 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-06-24 21:00:36,373 INFO ]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 7 [2018-06-24 21:00:36,373 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:36,373 INFO ]: Abstraction has 10 states and 18 transitions. [2018-06-24 21:00:36,373 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:00:36,373 INFO ]: Start isEmpty. Operand 10 states and 18 transitions. [2018-06-24 21:00:36,374 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:00:36,374 INFO ]: Found error trace [2018-06-24 21:00:36,374 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:36,374 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:36,374 INFO ]: Analyzing trace with hash 227099526, now seen corresponding path program 1 times [2018-06-24 21:00:36,374 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:36,374 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:36,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:36,374 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:36,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:36,383 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:36,412 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:36,412 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:36,412 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:00:36,423 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:36,449 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:36,451 INFO ]: Computing forward predicates... [2018-06-24 21:00:36,529 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:36,549 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:36,549 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 21:00:36,549 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:00:36,549 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:00:36,550 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:00:36,550 INFO ]: Start difference. First operand 10 states and 18 transitions. Second operand 6 states. [2018-06-24 21:00:36,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:36,606 INFO ]: Finished difference Result 12 states and 20 transitions. [2018-06-24 21:00:36,607 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:00:36,607 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 21:00:36,607 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:36,608 INFO ]: With dead ends: 12 [2018-06-24 21:00:36,608 INFO ]: Without dead ends: 10 [2018-06-24 21:00:36,608 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:00:36,608 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:00:36,609 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:00:36,609 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:00:36,609 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-06-24 21:00:36,609 INFO ]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 7 [2018-06-24 21:00:36,609 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:36,609 INFO ]: Abstraction has 10 states and 17 transitions. [2018-06-24 21:00:36,609 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:00:36,610 INFO ]: Start isEmpty. Operand 10 states and 17 transitions. [2018-06-24 21:00:36,610 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:00:36,610 INFO ]: Found error trace [2018-06-24 21:00:36,610 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:36,610 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:36,610 INFO ]: Analyzing trace with hash -1557682228, now seen corresponding path program 1 times [2018-06-24 21:00:36,610 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:36,610 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:36,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:36,611 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:36,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:36,625 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:36,668 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:36,668 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:36,668 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:00:36,677 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:36,705 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:36,707 INFO ]: Computing forward predicates... [2018-06-24 21:00:36,736 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:36,756 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:36,756 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 21:00:36,756 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:00:36,756 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:00:36,756 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:00:36,756 INFO ]: Start difference. First operand 10 states and 17 transitions. Second operand 7 states. [2018-06-24 21:00:36,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:36,863 INFO ]: Finished difference Result 14 states and 25 transitions. [2018-06-24 21:00:36,863 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:00:36,863 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 21:00:36,863 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:36,864 INFO ]: With dead ends: 14 [2018-06-24 21:00:36,864 INFO ]: Without dead ends: 11 [2018-06-24 21:00:36,864 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:00:36,864 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:00:36,865 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-24 21:00:36,865 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:00:36,865 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-24 21:00:36,865 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 8 [2018-06-24 21:00:36,865 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:36,865 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-24 21:00:36,865 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:00:36,865 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-24 21:00:36,865 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:00:36,865 INFO ]: Found error trace [2018-06-24 21:00:36,865 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:36,866 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:36,866 INFO ]: Analyzing trace with hash -1555805395, now seen corresponding path program 2 times [2018-06-24 21:00:36,866 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:36,866 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:36,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:36,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:36,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:36,874 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:36,944 INFO ]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:36,944 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:36,944 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:00:36,951 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:36,980 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:36,980 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:36,981 INFO ]: Computing forward predicates... [2018-06-24 21:00:37,042 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:37,061 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:00:37,061 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-06-24 21:00:37,061 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:00:37,061 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:00:37,061 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:00:37,061 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 6 states. [2018-06-24 21:00:37,091 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:37,092 INFO ]: Finished difference Result 11 states and 15 transitions. [2018-06-24 21:00:37,093 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:00:37,093 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 21:00:37,093 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:37,093 INFO ]: With dead ends: 11 [2018-06-24 21:00:37,093 INFO ]: Without dead ends: 11 [2018-06-24 21:00:37,093 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:00:37,093 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:00:37,094 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-24 21:00:37,095 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:00:37,095 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-24 21:00:37,095 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 8 [2018-06-24 21:00:37,095 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:37,095 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-24 21:00:37,095 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:00:37,095 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-24 21:00:37,095 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:00:37,095 INFO ]: Found error trace [2018-06-24 21:00:37,095 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:37,096 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:37,096 INFO ]: Analyzing trace with hash -1555716022, now seen corresponding path program 2 times [2018-06-24 21:00:37,096 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:37,096 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:37,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:37,096 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:37,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:37,105 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:37,159 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:37,159 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:37,159 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:00:37,165 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:37,207 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:37,207 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:37,209 INFO ]: Computing forward predicates... [2018-06-24 21:00:37,255 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:37,277 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:37,278 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 21:00:37,278 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:00:37,278 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:00:37,278 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:00:37,278 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 7 states. [2018-06-24 21:00:37,316 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:37,316 INFO ]: Finished difference Result 12 states and 20 transitions. [2018-06-24 21:00:37,332 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:00:37,332 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 21:00:37,332 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:37,333 INFO ]: With dead ends: 12 [2018-06-24 21:00:37,333 INFO ]: Without dead ends: 12 [2018-06-24 21:00:37,333 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:00:37,333 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:00:37,334 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-24 21:00:37,334 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:00:37,334 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-24 21:00:37,334 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-06-24 21:00:37,334 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:37,334 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-24 21:00:37,334 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:00:37,334 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-24 21:00:37,335 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:00:37,335 INFO ]: Found error trace [2018-06-24 21:00:37,335 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:37,335 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:37,335 INFO ]: Analyzing trace with hash -990389368, now seen corresponding path program 2 times [2018-06-24 21:00:37,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:37,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:37,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:37,336 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:37,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:37,361 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:37,556 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:37,557 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:37,557 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:00:37,565 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:37,582 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:37,582 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:37,583 INFO ]: Computing forward predicates... [2018-06-24 21:00:37,625 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:37,644 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:37,644 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 21:00:37,644 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:00:37,645 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:00:37,645 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:00:37,645 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-06-24 21:00:37,693 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:37,693 INFO ]: Finished difference Result 14 states and 22 transitions. [2018-06-24 21:00:37,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:00:37,693 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 21:00:37,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:37,693 INFO ]: With dead ends: 14 [2018-06-24 21:00:37,694 INFO ]: Without dead ends: 14 [2018-06-24 21:00:37,694 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:00:37,694 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:00:37,695 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-24 21:00:37,695 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:00:37,695 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2018-06-24 21:00:37,695 INFO ]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 9 [2018-06-24 21:00:37,695 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:37,695 INFO ]: Abstraction has 12 states and 20 transitions. [2018-06-24 21:00:37,695 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:00:37,695 INFO ]: Start isEmpty. Operand 12 states and 20 transitions. [2018-06-24 21:00:37,695 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:00:37,695 INFO ]: Found error trace [2018-06-24 21:00:37,695 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:37,695 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:37,696 INFO ]: Analyzing trace with hash -988423162, now seen corresponding path program 3 times [2018-06-24 21:00:37,696 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:37,696 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:37,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:37,696 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:37,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:37,704 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:37,762 INFO ]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:37,762 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:37,762 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:37,768 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:00:37,789 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:00:37,789 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:37,790 INFO ]: Computing forward predicates... [2018-06-24 21:00:37,821 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:37,843 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:00:37,843 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-06-24 21:00:37,843 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:00:37,844 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:00:37,844 INFO ]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:00:37,844 INFO ]: Start difference. First operand 12 states and 20 transitions. Second operand 7 states. [2018-06-24 21:00:37,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:37,884 INFO ]: Finished difference Result 15 states and 23 transitions. [2018-06-24 21:00:37,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:00:37,884 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 21:00:37,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:37,884 INFO ]: With dead ends: 15 [2018-06-24 21:00:37,884 INFO ]: Without dead ends: 15 [2018-06-24 21:00:37,884 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:00:37,884 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:00:37,886 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-24 21:00:37,886 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:00:37,886 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2018-06-24 21:00:37,886 INFO ]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 9 [2018-06-24 21:00:37,886 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:37,886 INFO ]: Abstraction has 12 states and 20 transitions. [2018-06-24 21:00:37,886 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:00:37,886 INFO ]: Start isEmpty. Operand 12 states and 20 transitions. [2018-06-24 21:00:37,886 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:00:37,886 INFO ]: Found error trace [2018-06-24 21:00:37,886 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:37,886 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:37,886 INFO ]: Analyzing trace with hash -987618805, now seen corresponding path program 1 times [2018-06-24 21:00:37,886 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:37,886 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:37,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:37,887 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:37,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:37,896 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:38,020 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:38,020 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:38,020 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:00:38,026 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:38,056 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:38,058 INFO ]: Computing forward predicates... [2018-06-24 21:00:38,165 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:38,183 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:38,183 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-24 21:00:38,183 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:00:38,183 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:00:38,184 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:00:38,184 INFO ]: Start difference. First operand 12 states and 20 transitions. Second operand 9 states. [2018-06-24 21:00:38,234 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:38,234 INFO ]: Finished difference Result 15 states and 23 transitions. [2018-06-24 21:00:38,234 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:00:38,235 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-24 21:00:38,235 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:38,235 INFO ]: With dead ends: 15 [2018-06-24 21:00:38,235 INFO ]: Without dead ends: 12 [2018-06-24 21:00:38,235 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:00:38,235 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:00:38,236 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 21:00:38,236 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:00:38,236 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-24 21:00:38,236 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 9 [2018-06-24 21:00:38,237 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:38,237 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-24 21:00:38,237 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:00:38,237 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-24 21:00:38,237 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:00:38,237 INFO ]: Found error trace [2018-06-24 21:00:38,237 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:38,237 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:38,237 INFO ]: Analyzing trace with hash -637744110, now seen corresponding path program 3 times [2018-06-24 21:00:38,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:38,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:38,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:38,238 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:38,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:38,258 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:38,380 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:38,381 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:38,381 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:00:38,387 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:00:38,406 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 21:00:38,406 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:38,407 INFO ]: Computing forward predicates... [2018-06-24 21:00:38,708 WARN ]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-24 21:00:38,712 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:38,731 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:38,731 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-24 21:00:38,731 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:00:38,731 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:00:38,731 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:00:38,731 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 10 states. [2018-06-24 21:00:39,001 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:39,001 INFO ]: Finished difference Result 18 states and 27 transitions. [2018-06-24 21:00:39,001 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:00:39,001 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 21:00:39,001 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:39,001 INFO ]: With dead ends: 18 [2018-06-24 21:00:39,001 INFO ]: Without dead ends: 12 [2018-06-24 21:00:39,002 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:00:39,002 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:00:39,002 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 21:00:39,002 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:00:39,003 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2018-06-24 21:00:39,003 INFO ]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 10 [2018-06-24 21:00:39,003 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:39,003 INFO ]: Abstraction has 12 states and 19 transitions. [2018-06-24 21:00:39,003 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:00:39,003 INFO ]: Start isEmpty. Operand 12 states and 19 transitions. [2018-06-24 21:00:39,003 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:00:39,003 INFO ]: Found error trace [2018-06-24 21:00:39,003 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:39,003 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:39,003 INFO ]: Analyzing trace with hash -584179892, now seen corresponding path program 4 times [2018-06-24 21:00:39,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:39,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:39,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:39,004 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:39,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:39,012 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:39,078 INFO ]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:39,078 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:39,078 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:39,083 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:00:39,101 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:00:39,101 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:39,102 INFO ]: Computing forward predicates... [2018-06-24 21:00:39,184 INFO ]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:39,216 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:39,216 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-24 21:00:39,216 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:00:39,216 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:00:39,216 INFO ]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:00:39,216 INFO ]: Start difference. First operand 12 states and 19 transitions. Second operand 9 states. [2018-06-24 21:00:39,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:39,294 INFO ]: Finished difference Result 14 states and 21 transitions. [2018-06-24 21:00:39,294 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:00:39,294 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 21:00:39,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:39,294 INFO ]: With dead ends: 14 [2018-06-24 21:00:39,294 INFO ]: Without dead ends: 14 [2018-06-24 21:00:39,294 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:00:39,294 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:00:39,295 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-24 21:00:39,295 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:00:39,296 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-06-24 21:00:39,296 INFO ]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 10 [2018-06-24 21:00:39,296 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:39,296 INFO ]: Abstraction has 13 states and 20 transitions. [2018-06-24 21:00:39,296 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:00:39,296 INFO ]: Start isEmpty. Operand 13 states and 20 transitions. [2018-06-24 21:00:39,296 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:00:39,296 INFO ]: Found error trace [2018-06-24 21:00:39,296 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:39,296 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:39,296 INFO ]: Analyzing trace with hash -581409329, now seen corresponding path program 2 times [2018-06-24 21:00:39,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:39,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:39,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:39,297 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:39,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:39,310 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:39,474 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:39,474 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:39,474 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:00:39,488 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:39,519 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:39,519 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:39,521 INFO ]: Computing forward predicates... [2018-06-24 21:00:39,541 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:39,560 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:39,560 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 21:00:39,560 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:00:39,560 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:00:39,560 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:00:39,561 INFO ]: Start difference. First operand 13 states and 20 transitions. Second operand 9 states. [2018-06-24 21:00:39,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:39,628 INFO ]: Finished difference Result 16 states and 23 transitions. [2018-06-24 21:00:39,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:00:39,628 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 21:00:39,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:39,629 INFO ]: With dead ends: 16 [2018-06-24 21:00:39,629 INFO ]: Without dead ends: 16 [2018-06-24 21:00:39,629 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:00:39,629 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:00:39,630 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-24 21:00:39,630 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:00:39,630 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-06-24 21:00:39,630 INFO ]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 10 [2018-06-24 21:00:39,630 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:39,630 INFO ]: Abstraction has 13 states and 20 transitions. [2018-06-24 21:00:39,630 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:00:39,630 INFO ]: Start isEmpty. Operand 13 states and 20 transitions. [2018-06-24 21:00:39,631 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:00:39,631 INFO ]: Found error trace [2018-06-24 21:00:39,631 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:39,631 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:39,631 INFO ]: Analyzing trace with hash -579562287, now seen corresponding path program 1 times [2018-06-24 21:00:39,631 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:39,631 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:39,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:39,631 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:39,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:39,638 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:39,683 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:39,683 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:39,683 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:00:39,689 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:39,707 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:39,708 INFO ]: Computing forward predicates... [2018-06-24 21:00:40,094 WARN ]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-24 21:00:40,114 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:40,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:40,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-24 21:00:40,145 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:00:40,145 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:00:40,145 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:00:40,145 INFO ]: Start difference. First operand 13 states and 20 transitions. Second operand 10 states. [2018-06-24 21:00:40,394 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:40,394 INFO ]: Finished difference Result 16 states and 23 transitions. [2018-06-24 21:00:40,394 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:00:40,394 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 21:00:40,394 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:40,395 INFO ]: With dead ends: 16 [2018-06-24 21:00:40,395 INFO ]: Without dead ends: 13 [2018-06-24 21:00:40,395 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:00:40,395 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:00:40,396 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 21:00:40,396 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:00:40,396 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-24 21:00:40,396 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 10 [2018-06-24 21:00:40,397 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:40,397 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-24 21:00:40,397 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:00:40,397 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-24 21:00:40,397 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:00:40,397 INFO ]: Found error trace [2018-06-24 21:00:40,397 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:40,397 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:40,397 INFO ]: Analyzing trace with hash -930152242, now seen corresponding path program 5 times [2018-06-24 21:00:40,397 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:40,397 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:40,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:40,398 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:40,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:40,407 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:40,580 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:40,580 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:40,580 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:00:40,586 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:00:40,630 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:00:40,630 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:40,632 INFO ]: Computing forward predicates... [2018-06-24 21:00:40,750 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:40,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:40,769 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-24 21:00:40,769 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:00:40,769 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:00:40,769 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:00:40,769 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 11 states. [2018-06-24 21:00:40,840 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:40,840 INFO ]: Finished difference Result 18 states and 28 transitions. [2018-06-24 21:00:40,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:00:40,840 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-24 21:00:40,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:40,840 INFO ]: With dead ends: 18 [2018-06-24 21:00:40,840 INFO ]: Without dead ends: 14 [2018-06-24 21:00:40,841 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:00:40,841 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:00:40,842 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-24 21:00:40,842 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:00:40,842 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-24 21:00:40,842 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2018-06-24 21:00:40,842 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:40,842 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-24 21:00:40,842 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:00:40,842 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-24 21:00:40,842 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:00:40,842 INFO ]: Found error trace [2018-06-24 21:00:40,842 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:40,842 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:40,843 INFO ]: Analyzing trace with hash -873817461, now seen corresponding path program 3 times [2018-06-24 21:00:40,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:40,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:40,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:40,843 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:40,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:40,861 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:41,456 INFO ]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:41,457 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:41,457 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) [2018-06-24 21:00:41,470 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:41,549 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 21:00:41,549 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:41,551 INFO ]: Computing forward predicates... [2018-06-24 21:00:42,177 INFO ]: Checked inductivity of 21 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:42,196 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:42,196 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-24 21:00:42,196 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:00:42,196 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:00:42,196 INFO ]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:00:42,196 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 10 states. [2018-06-24 21:00:42,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:42,254 INFO ]: Finished difference Result 16 states and 20 transitions. [2018-06-24 21:00:42,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:00:42,255 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 21:00:42,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:42,255 INFO ]: With dead ends: 16 [2018-06-24 21:00:42,255 INFO ]: Without dead ends: 16 [2018-06-24 21:00:42,255 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:00:42,255 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:00:42,256 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-24 21:00:42,256 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:00:42,257 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-24 21:00:42,257 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2018-06-24 21:00:42,257 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:42,257 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-24 21:00:42,257 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:00:42,257 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-24 21:00:42,257 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:00:42,257 INFO ]: Found error trace [2018-06-24 21:00:42,257 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:42,257 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:42,257 INFO ]: Analyzing trace with hash -871970419, now seen corresponding path program 2 times [2018-06-24 21:00:42,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:42,257 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:42,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:42,258 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:42,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:42,272 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:42,426 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:42,426 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:42,455 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:42,543 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:42,573 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:42,573 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:42,576 INFO ]: Computing forward predicates... [2018-06-24 21:00:42,610 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:42,642 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:42,642 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-24 21:00:42,643 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:00:42,643 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:00:42,643 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:00:42,643 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 10 states. [2018-06-24 21:00:42,721 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:42,721 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-24 21:00:42,721 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:00:42,721 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 21:00:42,721 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:42,721 INFO ]: With dead ends: 17 [2018-06-24 21:00:42,721 INFO ]: Without dead ends: 17 [2018-06-24 21:00:42,721 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:00:42,721 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:00:42,722 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-24 21:00:42,722 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:00:42,723 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2018-06-24 21:00:42,723 INFO ]: Start accepts. Automaton has 14 states and 22 transitions. Word has length 11 [2018-06-24 21:00:42,723 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:42,723 INFO ]: Abstraction has 14 states and 22 transitions. [2018-06-24 21:00:42,723 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:00:42,723 INFO ]: Start isEmpty. Operand 14 states and 22 transitions. [2018-06-24 21:00:42,723 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:00:42,723 INFO ]: Found error trace [2018-06-24 21:00:42,723 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:42,723 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:42,723 INFO ]: Analyzing trace with hash -869199856, now seen corresponding path program 1 times [2018-06-24 21:00:42,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:42,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:42,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:42,725 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:42,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:42,736 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:42,819 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:42,819 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:42,819 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:00:42,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:42,871 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:42,873 INFO ]: Computing forward predicates... [2018-06-24 21:00:43,605 WARN ]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-24 21:00:43,607 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:43,626 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:43,626 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-24 21:00:43,626 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:00:43,626 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:00:43,626 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:00:43,626 INFO ]: Start difference. First operand 14 states and 22 transitions. Second operand 11 states. [2018-06-24 21:00:43,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:43,684 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-24 21:00:43,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:00:43,684 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-24 21:00:43,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:43,685 INFO ]: With dead ends: 17 [2018-06-24 21:00:43,685 INFO ]: Without dead ends: 14 [2018-06-24 21:00:43,685 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:00:43,685 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:00:43,686 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 21:00:43,686 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:00:43,686 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2018-06-24 21:00:43,686 INFO ]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 11 [2018-06-24 21:00:43,686 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:43,686 INFO ]: Abstraction has 14 states and 21 transitions. [2018-06-24 21:00:43,686 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:00:43,686 INFO ]: Start isEmpty. Operand 14 states and 21 transitions. [2018-06-24 21:00:43,686 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:00:43,686 INFO ]: Found error trace [2018-06-24 21:00:43,687 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:43,687 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:43,687 INFO ]: Analyzing trace with hash -1404869742, now seen corresponding path program 6 times [2018-06-24 21:00:43,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:43,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:43,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:43,687 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:43,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:43,695 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:43,803 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:43,803 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:43,803 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:43,808 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:00:43,852 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 21:00:43,852 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:43,854 INFO ]: Computing forward predicates... [2018-06-24 21:00:44,600 WARN ]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-24 21:00:44,602 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:44,621 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:44,621 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-24 21:00:44,621 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:00:44,621 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:00:44,621 INFO ]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:00:44,622 INFO ]: Start difference. First operand 14 states and 21 transitions. Second operand 12 states. [2018-06-24 21:00:44,719 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:44,719 INFO ]: Finished difference Result 19 states and 30 transitions. [2018-06-24 21:00:44,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:00:44,719 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-24 21:00:44,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:44,720 INFO ]: With dead ends: 19 [2018-06-24 21:00:44,720 INFO ]: Without dead ends: 15 [2018-06-24 21:00:44,720 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:00:44,720 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:00:44,721 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-24 21:00:44,721 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:00:44,721 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-06-24 21:00:44,721 INFO ]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 12 [2018-06-24 21:00:44,721 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:44,721 INFO ]: Abstraction has 14 states and 18 transitions. [2018-06-24 21:00:44,721 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:00:44,721 INFO ]: Start isEmpty. Operand 14 states and 18 transitions. [2018-06-24 21:00:44,721 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:00:44,721 INFO ]: Found error trace [2018-06-24 21:00:44,722 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:44,722 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:44,722 INFO ]: Analyzing trace with hash -1346687919, now seen corresponding path program 3 times [2018-06-24 21:00:44,722 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:44,722 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:44,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:44,722 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:44,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:44,731 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:44,813 INFO ]: Checked inductivity of 28 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:44,813 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:44,813 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:44,819 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:00:44,846 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 21:00:44,846 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:44,848 INFO ]: Computing forward predicates... [2018-06-24 21:00:44,921 INFO ]: Checked inductivity of 28 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:44,940 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:44,940 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-24 21:00:44,940 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:00:44,940 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:00:44,940 INFO ]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:00:44,940 INFO ]: Start difference. First operand 14 states and 18 transitions. Second operand 11 states. [2018-06-24 21:00:45,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:45,038 INFO ]: Finished difference Result 17 states and 21 transitions. [2018-06-24 21:00:45,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:00:45,038 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 21:00:45,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:45,038 INFO ]: With dead ends: 17 [2018-06-24 21:00:45,038 INFO ]: Without dead ends: 17 [2018-06-24 21:00:45,039 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:00:45,039 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:00:45,040 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-24 21:00:45,040 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:00:45,040 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-06-24 21:00:45,040 INFO ]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 12 [2018-06-24 21:00:45,040 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:45,040 INFO ]: Abstraction has 14 states and 18 transitions. [2018-06-24 21:00:45,040 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:00:45,040 INFO ]: Start isEmpty. Operand 14 states and 18 transitions. [2018-06-24 21:00:45,041 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:00:45,041 INFO ]: Found error trace [2018-06-24 21:00:45,041 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:45,041 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:45,041 INFO ]: Analyzing trace with hash -1343917356, now seen corresponding path program 2 times [2018-06-24 21:00:45,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:45,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:45,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:45,041 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:45,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:45,058 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:45,162 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:45,162 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:45,162 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:45,170 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:45,192 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:45,192 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:45,193 INFO ]: Computing forward predicates... [2018-06-24 21:00:45,265 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:45,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:45,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 21:00:45,284 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:00:45,284 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:00:45,284 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:00:45,284 INFO ]: Start difference. First operand 14 states and 18 transitions. Second operand 11 states. [2018-06-24 21:00:45,426 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:45,426 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-24 21:00:45,426 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:00:45,426 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 21:00:45,426 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:45,426 INFO ]: With dead ends: 17 [2018-06-24 21:00:45,426 INFO ]: Without dead ends: 17 [2018-06-24 21:00:45,427 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:00:45,427 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:00:45,428 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-24 21:00:45,428 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:00:45,428 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2018-06-24 21:00:45,428 INFO ]: Start accepts. Automaton has 15 states and 23 transitions. Word has length 12 [2018-06-24 21:00:45,428 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:45,428 INFO ]: Abstraction has 15 states and 23 transitions. [2018-06-24 21:00:45,428 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:00:45,428 INFO ]: Start isEmpty. Operand 15 states and 23 transitions. [2018-06-24 21:00:45,428 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:00:45,428 INFO ]: Found error trace [2018-06-24 21:00:45,428 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:45,428 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:45,429 INFO ]: Analyzing trace with hash 1058756942, now seen corresponding path program 7 times [2018-06-24 21:00:45,429 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:45,429 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:45,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:45,429 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:45,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:45,459 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:45,592 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:45,592 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:45,592 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:45,597 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:45,619 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:45,622 INFO ]: Computing forward predicates... [2018-06-24 21:00:45,721 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:45,747 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:45,747 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 21:00:45,747 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:00:45,747 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:00:45,747 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:00:45,747 INFO ]: Start difference. First operand 15 states and 23 transitions. Second operand 11 states. [2018-06-24 21:00:45,853 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:45,853 INFO ]: Finished difference Result 20 states and 28 transitions. [2018-06-24 21:00:45,853 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:00:45,854 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 21:00:45,854 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:45,854 INFO ]: With dead ends: 20 [2018-06-24 21:00:45,854 INFO ]: Without dead ends: 20 [2018-06-24 21:00:45,854 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:00:45,854 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 21:00:45,855 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-06-24 21:00:45,855 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:00:45,855 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-06-24 21:00:45,855 INFO ]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 13 [2018-06-24 21:00:45,856 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:45,856 INFO ]: Abstraction has 16 states and 24 transitions. [2018-06-24 21:00:45,856 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:00:45,856 INFO ]: Start isEmpty. Operand 16 states and 24 transitions. [2018-06-24 21:00:45,856 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:00:45,856 INFO ]: Found error trace [2018-06-24 21:00:45,856 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:45,856 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:45,856 INFO ]: Analyzing trace with hash 1119709328, now seen corresponding path program 3 times [2018-06-24 21:00:45,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:45,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:45,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:45,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:45,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:45,868 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:45,925 INFO ]: Checked inductivity of 36 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:45,925 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:45,925 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:45,930 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:00:45,954 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 21:00:45,954 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:45,955 INFO ]: Computing forward predicates... [2018-06-24 21:00:46,111 INFO ]: Checked inductivity of 36 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:46,130 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:46,130 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-24 21:00:46,130 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:00:46,130 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:00:46,130 INFO ]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:00:46,131 INFO ]: Start difference. First operand 16 states and 24 transitions. Second operand 12 states. [2018-06-24 21:00:46,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:46,208 INFO ]: Finished difference Result 22 states and 30 transitions. [2018-06-24 21:00:46,208 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:00:46,208 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-24 21:00:46,208 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:46,208 INFO ]: With dead ends: 22 [2018-06-24 21:00:46,208 INFO ]: Without dead ends: 22 [2018-06-24 21:00:46,209 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:00:46,209 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:00:46,210 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-24 21:00:46,210 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:00:46,210 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-06-24 21:00:46,210 INFO ]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 13 [2018-06-24 21:00:46,210 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:46,210 INFO ]: Abstraction has 16 states and 24 transitions. [2018-06-24 21:00:46,210 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:00:46,210 INFO ]: Start isEmpty. Operand 16 states and 24 transitions. [2018-06-24 21:00:46,210 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:00:46,210 INFO ]: Found error trace [2018-06-24 21:00:46,211 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:46,211 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:46,211 INFO ]: Analyzing trace with hash 1144644395, now seen corresponding path program 4 times [2018-06-24 21:00:46,211 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:46,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:46,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:46,211 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:46,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:46,223 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:46,316 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:46,316 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:46,316 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:46,323 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:00:46,347 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:00:46,347 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:46,348 INFO ]: Computing forward predicates... [2018-06-24 21:00:47,101 WARN ]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-24 21:00:48,137 WARN ]: Spent 504.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-24 21:00:48,140 INFO ]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:48,184 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:48,184 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-24 21:00:48,184 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:00:48,185 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:00:48,185 INFO ]: CoverageRelationStatistics Valid=46, Invalid=135, Unknown=1, NotChecked=0, Total=182 [2018-06-24 21:00:48,185 INFO ]: Start difference. First operand 16 states and 24 transitions. Second operand 14 states. [2018-06-24 21:00:48,530 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:48,530 INFO ]: Finished difference Result 20 states and 28 transitions. [2018-06-24 21:00:48,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:00:48,532 INFO ]: Start accepts. Automaton has 14 states. Word has length 13 [2018-06-24 21:00:48,532 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:48,532 INFO ]: With dead ends: 20 [2018-06-24 21:00:48,532 INFO ]: Without dead ends: 16 [2018-06-24 21:00:48,533 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=52, Invalid=157, Unknown=1, NotChecked=0, Total=210 [2018-06-24 21:00:48,533 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:00:48,534 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 21:00:48,534 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:00:48,534 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-06-24 21:00:48,534 INFO ]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 13 [2018-06-24 21:00:48,534 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:48,534 INFO ]: Abstraction has 16 states and 21 transitions. [2018-06-24 21:00:48,534 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:00:48,534 INFO ]: Start isEmpty. Operand 16 states and 21 transitions. [2018-06-24 21:00:48,534 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:00:48,534 INFO ]: Found error trace [2018-06-24 21:00:48,535 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:48,535 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:48,535 INFO ]: Analyzing trace with hash -1538717940, now seen corresponding path program 8 times [2018-06-24 21:00:48,535 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:48,535 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:48,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:48,535 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:48,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:48,558 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:48,690 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:48,691 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:48,691 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:48,697 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:48,744 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:48,744 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:48,746 INFO ]: Computing forward predicates... [2018-06-24 21:00:50,108 WARN ]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-24 21:00:50,111 INFO ]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:50,129 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:50,129 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-24 21:00:50,129 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:00:50,129 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:00:50,129 INFO ]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2018-06-24 21:00:50,129 INFO ]: Start difference. First operand 16 states and 21 transitions. Second operand 15 states. [2018-06-24 21:00:50,993 WARN ]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-24 21:00:51,530 WARN ]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-06-24 21:00:51,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:51,639 INFO ]: Finished difference Result 24 states and 33 transitions. [2018-06-24 21:00:51,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:00:51,639 INFO ]: Start accepts. Automaton has 15 states. Word has length 14 [2018-06-24 21:00:51,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:51,639 INFO ]: With dead ends: 24 [2018-06-24 21:00:51,639 INFO ]: Without dead ends: 16 [2018-06-24 21:00:51,640 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=72, Invalid=268, Unknown=2, NotChecked=0, Total=342 [2018-06-24 21:00:51,640 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:00:51,641 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 21:00:51,641 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:00:51,641 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-06-24 21:00:51,641 INFO ]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 14 [2018-06-24 21:00:51,641 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:51,641 INFO ]: Abstraction has 16 states and 23 transitions. [2018-06-24 21:00:51,641 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:00:51,641 INFO ]: Start isEmpty. Operand 16 states and 23 transitions. [2018-06-24 21:00:51,641 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:00:51,641 INFO ]: Found error trace [2018-06-24 21:00:51,641 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:51,641 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:51,641 INFO ]: Analyzing trace with hash 121772818, now seen corresponding path program 9 times [2018-06-24 21:00:51,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:51,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:51,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:51,642 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:51,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:51,654 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:52,177 INFO ]: Checked inductivity of 45 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:52,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:52,177 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:52,183 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:00:52,210 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:00:52,211 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:52,212 INFO ]: Computing forward predicates... [2018-06-24 21:00:52,501 WARN ]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-24 21:00:52,513 INFO ]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:52,531 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:52,531 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-24 21:00:52,532 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:00:52,532 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:00:52,532 INFO ]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:00:52,532 INFO ]: Start difference. First operand 16 states and 23 transitions. Second operand 14 states. [2018-06-24 21:00:52,695 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:52,695 INFO ]: Finished difference Result 19 states and 26 transitions. [2018-06-24 21:00:52,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:00:52,695 INFO ]: Start accepts. Automaton has 14 states. Word has length 14 [2018-06-24 21:00:52,695 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:52,695 INFO ]: With dead ends: 19 [2018-06-24 21:00:52,695 INFO ]: Without dead ends: 19 [2018-06-24 21:00:52,695 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:00:52,695 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 21:00:52,696 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-24 21:00:52,696 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:00:52,697 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-06-24 21:00:52,697 INFO ]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 14 [2018-06-24 21:00:52,697 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:52,697 INFO ]: Abstraction has 17 states and 24 transitions. [2018-06-24 21:00:52,697 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:00:52,697 INFO ]: Start isEmpty. Operand 17 states and 24 transitions. [2018-06-24 21:00:52,697 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:00:52,697 INFO ]: Found error trace [2018-06-24 21:00:52,697 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:52,697 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:52,697 INFO ]: Analyzing trace with hash 207660271, now seen corresponding path program 5 times [2018-06-24 21:00:52,697 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:52,697 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:52,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:52,698 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:52,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:52,727 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:52,967 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:52,967 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:52,967 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:52,972 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:00:53,003 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 21:00:53,003 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:53,005 INFO ]: Computing forward predicates... [2018-06-24 21:00:53,078 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:53,097 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:53,097 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 21:00:53,097 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:00:53,097 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:00:53,098 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:00:53,098 INFO ]: Start difference. First operand 17 states and 24 transitions. Second operand 13 states. [2018-06-24 21:00:53,231 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:53,231 INFO ]: Finished difference Result 21 states and 28 transitions. [2018-06-24 21:00:53,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:00:53,255 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-24 21:00:53,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:53,255 INFO ]: With dead ends: 21 [2018-06-24 21:00:53,255 INFO ]: Without dead ends: 21 [2018-06-24 21:00:53,256 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:00:53,256 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 21:00:53,257 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-24 21:00:53,257 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:00:53,257 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-06-24 21:00:53,257 INFO ]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 14 [2018-06-24 21:00:53,257 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:53,257 INFO ]: Abstraction has 17 states and 24 transitions. [2018-06-24 21:00:53,257 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:00:53,257 INFO ]: Start isEmpty. Operand 17 states and 24 transitions. [2018-06-24 21:00:53,257 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:00:53,258 INFO ]: Found error trace [2018-06-24 21:00:53,258 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:53,258 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:53,258 INFO ]: Analyzing trace with hash 264918573, now seen corresponding path program 4 times [2018-06-24 21:00:53,258 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:53,258 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:53,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:53,258 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:53,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:53,273 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:53,571 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:53,571 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:53,571 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:53,577 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:00:53,601 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:00:53,601 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:53,603 INFO ]: Computing forward predicates... [2018-06-24 21:00:54,183 WARN ]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-24 21:00:55,098 WARN ]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-24 21:00:55,101 INFO ]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:55,130 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:55,130 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-24 21:00:55,131 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:00:55,131 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:00:55,131 INFO ]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2018-06-24 21:00:55,131 INFO ]: Start difference. First operand 17 states and 24 transitions. Second operand 15 states. [2018-06-24 21:00:57,330 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:57,330 INFO ]: Finished difference Result 21 states and 28 transitions. [2018-06-24 21:00:57,332 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:00:57,332 INFO ]: Start accepts. Automaton has 15 states. Word has length 14 [2018-06-24 21:00:57,332 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:57,333 INFO ]: With dead ends: 21 [2018-06-24 21:00:57,333 INFO ]: Without dead ends: 17 [2018-06-24 21:00:57,333 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2018-06-24 21:00:57,333 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:00:57,334 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 21:00:57,334 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:00:57,334 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-06-24 21:00:57,334 INFO ]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 14 [2018-06-24 21:00:57,334 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:57,334 INFO ]: Abstraction has 17 states and 23 transitions. [2018-06-24 21:00:57,334 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:00:57,334 INFO ]: Start isEmpty. Operand 17 states and 23 transitions. [2018-06-24 21:00:57,335 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:00:57,335 INFO ]: Found error trace [2018-06-24 21:00:57,335 INFO ]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:57,335 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:57,335 INFO ]: Analyzing trace with hash -520454712, now seen corresponding path program 10 times [2018-06-24 21:00:57,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:57,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:57,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:57,335 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:57,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:57,346 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:57,437 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:57,437 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:57,438 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:57,443 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:00:57,504 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:00:57,504 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:57,507 INFO ]: Computing forward predicates... [2018-06-24 21:00:58,178 INFO ]: Checked inductivity of 55 backedges. 0 proven. 54 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:58,196 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:58,196 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-24 21:00:58,196 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:00:58,197 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:00:58,197 INFO ]: CoverageRelationStatistics Valid=63, Invalid=176, Unknown=1, NotChecked=0, Total=240 [2018-06-24 21:00:58,197 INFO ]: Start difference. First operand 17 states and 23 transitions. Second operand 16 states. [2018-06-24 21:00:58,297 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:58,297 INFO ]: Finished difference Result 23 states and 33 transitions. [2018-06-24 21:00:58,311 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:00:58,311 INFO ]: Start accepts. Automaton has 16 states. Word has length 15 [2018-06-24 21:00:58,311 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:58,312 INFO ]: With dead ends: 23 [2018-06-24 21:00:58,312 INFO ]: Without dead ends: 18 [2018-06-24 21:00:58,312 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=202, Unknown=1, NotChecked=0, Total=272 [2018-06-24 21:00:58,312 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 21:00:58,313 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-06-24 21:00:58,313 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:00:58,313 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-06-24 21:00:58,313 INFO ]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 15 [2018-06-24 21:00:58,313 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:58,313 INFO ]: Abstraction has 17 states and 21 transitions. [2018-06-24 21:00:58,313 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:00:58,313 INFO ]: Start isEmpty. Operand 17 states and 21 transitions. [2018-06-24 21:00:58,314 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:00:58,314 INFO ]: Found error trace [2018-06-24 21:00:58,314 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:58,314 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:58,314 INFO ]: Analyzing trace with hash 1225923499, now seen corresponding path program 6 times [2018-06-24 21:00:58,314 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:58,314 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:58,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:58,314 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:58,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:58,324 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:58,432 INFO ]: Checked inductivity of 55 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:58,432 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:58,432 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:58,437 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:00:58,466 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 21:00:58,466 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:58,467 INFO ]: Computing forward predicates... [2018-06-24 21:00:59,057 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-24 21:00:59,073 INFO ]: Checked inductivity of 55 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:59,103 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:59,103 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-24 21:00:59,103 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:00:59,103 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:00:59,103 INFO ]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:00:59,103 INFO ]: Start difference. First operand 17 states and 21 transitions. Second operand 15 states. [2018-06-24 21:00:59,228 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:59,229 INFO ]: Finished difference Result 22 states and 26 transitions. [2018-06-24 21:00:59,229 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:00:59,229 INFO ]: Start accepts. Automaton has 15 states. Word has length 15 [2018-06-24 21:00:59,229 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:59,229 INFO ]: With dead ends: 22 [2018-06-24 21:00:59,229 INFO ]: Without dead ends: 22 [2018-06-24 21:00:59,229 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:00:59,229 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:00:59,230 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-06-24 21:00:59,230 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:00:59,230 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-06-24 21:00:59,230 INFO ]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 15 [2018-06-24 21:00:59,230 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:59,230 INFO ]: Abstraction has 17 states and 21 transitions. [2018-06-24 21:00:59,230 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:00:59,231 INFO ]: Start isEmpty. Operand 17 states and 21 transitions. [2018-06-24 21:00:59,231 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:00:59,231 INFO ]: Found error trace [2018-06-24 21:00:59,231 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:59,231 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:59,231 INFO ]: Analyzing trace with hash 1283181801, now seen corresponding path program 5 times [2018-06-24 21:00:59,231 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:59,231 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:59,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:59,231 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:59,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:59,254 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:00,271 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:00,271 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:00,271 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:00,276 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:01:00,383 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 21:01:00,383 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:00,386 INFO ]: Computing forward predicates... [2018-06-24 21:01:00,707 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:00,734 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:00,734 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-24 21:01:00,734 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:01:00,734 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:01:00,734 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:01:00,734 INFO ]: Start difference. First operand 17 states and 21 transitions. Second operand 14 states. [2018-06-24 21:01:00,856 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:00,856 INFO ]: Finished difference Result 22 states and 30 transitions. [2018-06-24 21:01:00,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:01:00,856 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-24 21:01:00,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:00,856 INFO ]: With dead ends: 22 [2018-06-24 21:01:00,856 INFO ]: Without dead ends: 22 [2018-06-24 21:01:00,856 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:01:00,856 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:01:00,857 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-06-24 21:01:00,857 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 21:01:00,858 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2018-06-24 21:01:00,858 INFO ]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 15 [2018-06-24 21:01:00,858 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:00,858 INFO ]: Abstraction has 18 states and 26 transitions. [2018-06-24 21:01:00,858 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:01:00,858 INFO ]: Start isEmpty. Operand 18 states and 26 transitions. [2018-06-24 21:01:00,858 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:01:00,858 INFO ]: Found error trace [2018-06-24 21:01:00,858 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:00,859 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:00,859 INFO ]: Analyzing trace with hash 1369069254, now seen corresponding path program 4 times [2018-06-24 21:01:00,859 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:00,859 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:00,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:00,859 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:01:00,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:00,880 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:01,224 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:01,224 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:01,224 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:01,230 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:01:01,258 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:01:01,258 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:01,259 INFO ]: Computing forward predicates... [2018-06-24 21:01:01,852 WARN ]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-24 21:01:02,715 WARN ]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-24 21:01:02,717 INFO ]: Checked inductivity of 55 backedges. 0 proven. 54 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:02,736 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:02,736 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-24 21:01:02,736 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:01:02,736 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:01:02,736 INFO ]: CoverageRelationStatistics Valid=63, Invalid=176, Unknown=1, NotChecked=0, Total=240 [2018-06-24 21:01:02,737 INFO ]: Start difference. First operand 18 states and 26 transitions. Second operand 16 states. [2018-06-24 21:01:03,421 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:03,421 INFO ]: Finished difference Result 22 states and 30 transitions. [2018-06-24 21:01:03,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:01:03,434 INFO ]: Start accepts. Automaton has 16 states. Word has length 15 [2018-06-24 21:01:03,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:03,434 INFO ]: With dead ends: 22 [2018-06-24 21:01:03,434 INFO ]: Without dead ends: 18 [2018-06-24 21:01:03,434 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=69, Invalid=202, Unknown=1, NotChecked=0, Total=272 [2018-06-24 21:01:03,434 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 21:01:03,435 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 21:01:03,435 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 21:01:03,435 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-06-24 21:01:03,436 INFO ]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2018-06-24 21:01:03,436 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:03,436 INFO ]: Abstraction has 18 states and 25 transitions. [2018-06-24 21:01:03,436 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:01:03,436 INFO ]: Start isEmpty. Operand 18 states and 25 transitions. [2018-06-24 21:01:03,436 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:01:03,436 INFO ]: Found error trace [2018-06-24 21:01:03,436 INFO ]: trace histogram [7, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:03,436 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:03,436 INFO ]: Analyzing trace with hash 980934284, now seen corresponding path program 11 times [2018-06-24 21:01:03,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:03,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:03,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:03,437 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:01:03,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:03,447 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:03,971 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:03,972 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:03,972 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:03,978 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:01:04,018 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 21:01:04,018 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:04,020 INFO ]: Computing forward predicates... [2018-06-24 21:01:04,677 WARN ]: Spent 481.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-24 21:01:04,728 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:04,746 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:04,746 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-06-24 21:01:04,747 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:01:04,747 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:01:04,747 INFO ]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:01:04,747 INFO ]: Start difference. First operand 18 states and 25 transitions. Second operand 17 states. [2018-06-24 21:01:05,612 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:05,612 INFO ]: Finished difference Result 24 states and 35 transitions. [2018-06-24 21:01:05,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:01:05,613 INFO ]: Start accepts. Automaton has 17 states. Word has length 16 [2018-06-24 21:01:05,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:05,613 INFO ]: With dead ends: 24 [2018-06-24 21:01:05,613 INFO ]: Without dead ends: 19 [2018-06-24 21:01:05,613 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:01:05,613 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 21:01:05,614 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-06-24 21:01:05,614 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 21:01:05,614 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-06-24 21:01:05,614 INFO ]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 16 [2018-06-24 21:01:05,614 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:05,614 INFO ]: Abstraction has 18 states and 22 transitions. [2018-06-24 21:01:05,614 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:01:05,614 INFO ]: Start isEmpty. Operand 18 states and 22 transitions. [2018-06-24 21:01:05,614 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:01:05,614 INFO ]: Found error trace [2018-06-24 21:01:05,615 INFO ]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:05,615 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:05,615 INFO ]: Analyzing trace with hash -1510396499, now seen corresponding path program 6 times [2018-06-24 21:01:05,615 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:05,615 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:05,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:05,615 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:01:05,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:05,624 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:06,441 INFO ]: Checked inductivity of 66 backedges. 39 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:06,441 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:06,441 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:06,446 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:01:06,495 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 21:01:06,495 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:06,497 INFO ]: Computing forward predicates... [2018-06-24 21:01:06,913 WARN ]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-24 21:01:06,915 INFO ]: Checked inductivity of 66 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:06,933 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:06,934 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-24 21:01:06,934 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:01:06,934 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:01:06,934 INFO ]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:01:06,934 INFO ]: Start difference. First operand 18 states and 22 transitions. Second operand 16 states. [2018-06-24 21:01:07,015 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:07,015 INFO ]: Finished difference Result 23 states and 27 transitions. [2018-06-24 21:01:07,015 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:01:07,015 INFO ]: Start accepts. Automaton has 16 states. Word has length 16 [2018-06-24 21:01:07,015 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:07,015 INFO ]: With dead ends: 23 [2018-06-24 21:01:07,015 INFO ]: Without dead ends: 23 [2018-06-24 21:01:07,016 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:01:07,016 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 21:01:07,016 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-06-24 21:01:07,016 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 21:01:07,017 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-06-24 21:01:07,017 INFO ]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 16 [2018-06-24 21:01:07,017 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:07,017 INFO ]: Abstraction has 18 states and 22 transitions. [2018-06-24 21:01:07,017 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:01:07,017 INFO ]: Start isEmpty. Operand 18 states and 22 transitions. [2018-06-24 21:01:07,017 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:01:07,017 INFO ]: Found error trace [2018-06-24 21:01:07,017 INFO ]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:07,017 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:07,017 INFO ]: Analyzing trace with hash -1424509046, now seen corresponding path program 5 times [2018-06-24 21:01:07,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:07,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:07,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:07,018 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:01:07,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:07,040 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:07,757 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:07,757 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:07,757 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:07,762 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:01:07,793 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 21:01:07,793 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:07,795 INFO ]: Computing forward predicates... [2018-06-24 21:01:07,853 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:07,871 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:07,871 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-24 21:01:07,871 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:01:07,871 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:01:07,871 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:01:07,871 INFO ]: Start difference. First operand 18 states and 22 transitions. Second operand 15 states. [2018-06-24 21:01:07,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:07,989 INFO ]: Finished difference Result 22 states and 30 transitions. [2018-06-24 21:01:07,989 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:01:07,989 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-24 21:01:07,989 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:07,989 INFO ]: With dead ends: 22 [2018-06-24 21:01:07,989 INFO ]: Without dead ends: 22 [2018-06-24 21:01:07,989 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:01:07,989 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:01:07,990 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-06-24 21:01:07,990 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:01:07,990 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2018-06-24 21:01:07,990 INFO ]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 16 [2018-06-24 21:01:07,990 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:07,990 INFO ]: Abstraction has 19 states and 27 transitions. [2018-06-24 21:01:07,990 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:01:07,991 INFO ]: Start isEmpty. Operand 19 states and 27 transitions. [2018-06-24 21:01:07,991 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:01:07,991 INFO ]: Found error trace [2018-06-24 21:01:07,991 INFO ]: trace histogram [8, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:07,991 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:07,991 INFO ]: Analyzing trace with hash 279352904, now seen corresponding path program 12 times [2018-06-24 21:01:07,991 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:07,991 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:07,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:07,991 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:01:07,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:08,014 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:08,827 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:08,828 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:08,868 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:08,874 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:01:08,918 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 21:01:08,918 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:08,920 INFO ]: Computing forward predicates... [2018-06-24 21:01:08,996 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:09,026 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:09,026 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-24 21:01:09,026 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:01:09,027 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:01:09,027 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:01:09,027 INFO ]: Start difference. First operand 19 states and 27 transitions. Second operand 15 states. [2018-06-24 21:01:09,170 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:09,170 INFO ]: Finished difference Result 26 states and 34 transitions. [2018-06-24 21:01:09,170 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:01:09,170 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-24 21:01:09,171 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:09,171 INFO ]: With dead ends: 26 [2018-06-24 21:01:09,171 INFO ]: Without dead ends: 26 [2018-06-24 21:01:09,171 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 10 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:01:09,171 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 21:01:09,172 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-06-24 21:01:09,172 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:01:09,172 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-06-24 21:01:09,172 INFO ]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-06-24 21:01:09,172 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:09,172 INFO ]: Abstraction has 20 states and 28 transitions. [2018-06-24 21:01:09,172 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:01:09,172 INFO ]: Start isEmpty. Operand 20 states and 28 transitions. [2018-06-24 21:01:09,173 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:01:09,173 INFO ]: Found error trace [2018-06-24 21:01:09,173 INFO ]: trace histogram [9, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:09,173 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:09,173 INFO ]: Analyzing trace with hash -2126090426, now seen corresponding path program 6 times [2018-06-24 21:01:09,173 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:09,173 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:09,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:09,173 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:01:09,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:09,183 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:09,403 INFO ]: Checked inductivity of 78 backedges. 48 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:09,403 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:09,403 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:09,408 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:01:09,442 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 21:01:09,442 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:09,444 INFO ]: Computing forward predicates... [2018-06-24 21:01:09,842 WARN ]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-24 21:01:09,844 INFO ]: Checked inductivity of 78 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:09,862 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:09,862 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-06-24 21:01:09,862 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:01:09,862 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:01:09,862 INFO ]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:01:09,862 INFO ]: Start difference. First operand 20 states and 28 transitions. Second operand 17 states. [2018-06-24 21:01:10,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:10,055 INFO ]: Finished difference Result 29 states and 37 transitions. [2018-06-24 21:01:10,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:01:10,055 INFO ]: Start accepts. Automaton has 17 states. Word has length 17 [2018-06-24 21:01:10,055 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:10,055 INFO ]: With dead ends: 29 [2018-06-24 21:01:10,055 INFO ]: Without dead ends: 29 [2018-06-24 21:01:10,056 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=232, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:01:10,056 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 21:01:10,057 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-06-24 21:01:10,057 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:01:10,057 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-06-24 21:01:10,057 INFO ]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-06-24 21:01:10,057 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:10,057 INFO ]: Abstraction has 20 states and 28 transitions. [2018-06-24 21:01:10,057 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:01:10,057 INFO ]: Start isEmpty. Operand 20 states and 28 transitions. [2018-06-24 21:01:10,057 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:01:10,057 INFO ]: Found error trace [2018-06-24 21:01:10,057 INFO ]: trace histogram [8, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:10,057 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:10,057 INFO ]: Analyzing trace with hash -1353103349, now seen corresponding path program 7 times [2018-06-24 21:01:10,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:10,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:10,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:10,058 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:01:10,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:10,069 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:10,255 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:10,255 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:10,255 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:10,261 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:01:10,290 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:10,292 INFO ]: Computing forward predicates... [2018-06-24 21:01:10,781 WARN ]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-24 21:01:11,147 WARN ]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-24 21:01:12,995 WARN ]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-24 21:01:12,998 INFO ]: Checked inductivity of 78 backedges. 0 proven. 76 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:13,016 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:13,016 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-06-24 21:01:13,016 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:01:13,016 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:01:13,016 INFO ]: CoverageRelationStatistics Valid=81, Invalid=259, Unknown=2, NotChecked=0, Total=342 [2018-06-24 21:01:13,016 INFO ]: Start difference. First operand 20 states and 28 transitions. Second operand 19 states. [2018-06-24 21:01:13,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:13,991 INFO ]: Finished difference Result 25 states and 33 transitions. [2018-06-24 21:01:13,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:01:13,992 INFO ]: Start accepts. Automaton has 19 states. Word has length 17 [2018-06-24 21:01:13,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:13,992 INFO ]: With dead ends: 25 [2018-06-24 21:01:13,992 INFO ]: Without dead ends: 20 [2018-06-24 21:01:13,992 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=88, Invalid=290, Unknown=2, NotChecked=0, Total=380 [2018-06-24 21:01:13,992 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 21:01:13,993 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 21:01:13,993 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:01:13,993 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-06-24 21:01:13,993 INFO ]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 17 [2018-06-24 21:01:13,993 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:13,993 INFO ]: Abstraction has 20 states and 25 transitions. [2018-06-24 21:01:13,993 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:01:13,993 INFO ]: Start isEmpty. Operand 20 states and 25 transitions. [2018-06-24 21:01:13,993 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:01:13,993 INFO ]: Found error trace [2018-06-24 21:01:13,993 INFO ]: trace histogram [8, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:13,993 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:13,994 INFO ]: Analyzing trace with hash 69560658, now seen corresponding path program 13 times [2018-06-24 21:01:13,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:13,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:13,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:13,994 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:01:13,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:14,005 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:14,419 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:14,420 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:14,420 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:14,425 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:01:14,476 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:14,479 INFO ]: Computing forward predicates... [2018-06-24 21:01:14,908 WARN ]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-24 21:01:16,016 WARN ]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-24 21:01:17,501 WARN ]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-24 21:01:17,504 INFO ]: Checked inductivity of 91 backedges. 0 proven. 89 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:17,523 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:17,523 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2018-06-24 21:01:17,523 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:01:17,523 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:01:17,524 INFO ]: CoverageRelationStatistics Valid=88, Invalid=290, Unknown=2, NotChecked=0, Total=380 [2018-06-24 21:01:17,524 INFO ]: Start difference. First operand 20 states and 25 transitions. Second operand 20 states. [2018-06-24 21:01:18,161 WARN ]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-24 21:01:21,075 WARN ]: Spent 656.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-24 21:01:26,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:26,103 INFO ]: Finished difference Result 30 states and 39 transitions. [2018-06-24 21:01:26,148 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 21:01:26,148 INFO ]: Start accepts. Automaton has 20 states. Word has length 18 [2018-06-24 21:01:26,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:26,148 INFO ]: With dead ends: 30 [2018-06-24 21:01:26,148 INFO ]: Without dead ends: 20 [2018-06-24 21:01:26,148 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=117, Invalid=474, Unknown=9, NotChecked=0, Total=600 [2018-06-24 21:01:26,148 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 21:01:26,149 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 21:01:26,149 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:01:26,149 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-24 21:01:26,149 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 18 [2018-06-24 21:01:26,149 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:26,149 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-24 21:01:26,149 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:01:26,149 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-24 21:01:26,150 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:01:26,150 INFO ]: Found error trace [2018-06-24 21:01:26,150 INFO ]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:26,150 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:26,150 INFO ]: Analyzing trace with hash 5166604, now seen corresponding path program 14 times [2018-06-24 21:01:26,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:26,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:26,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:26,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:01:26,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:26,161 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:26,435 INFO ]: Checked inductivity of 91 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:26,435 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:26,435 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:26,441 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:01:26,475 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:01:26,475 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:26,477 INFO ]: Computing forward predicates... [2018-06-24 21:01:27,023 WARN ]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-24 21:01:27,066 INFO ]: Checked inductivity of 91 backedges. 85 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:27,085 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:27,085 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-06-24 21:01:27,085 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:01:27,085 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:01:27,085 INFO ]: CoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:01:27,085 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 19 states. [2018-06-24 21:01:27,244 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:27,244 INFO ]: Finished difference Result 24 states and 31 transitions. [2018-06-24 21:01:27,244 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 21:01:27,244 INFO ]: Start accepts. Automaton has 19 states. Word has length 18 [2018-06-24 21:01:27,244 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:27,245 INFO ]: With dead ends: 24 [2018-06-24 21:01:27,245 INFO ]: Without dead ends: 24 [2018-06-24 21:01:27,245 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:01:27,245 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 21:01:27,245 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-06-24 21:01:27,245 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 21:01:27,245 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-06-24 21:01:27,246 INFO ]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 18 [2018-06-24 21:01:27,246 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:27,246 INFO ]: Abstraction has 21 states and 28 transitions. [2018-06-24 21:01:27,246 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:01:27,246 INFO ]: Start isEmpty. Operand 21 states and 28 transitions. [2018-06-24 21:01:27,246 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:01:27,246 INFO ]: Found error trace [2018-06-24 21:01:27,246 INFO ]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:27,246 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:27,246 INFO ]: Analyzing trace with hash -1627289649, now seen corresponding path program 8 times [2018-06-24 21:01:27,246 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:27,246 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:27,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:27,247 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:01:27,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:27,265 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:28,195 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:28,195 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:28,195 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:28,200 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:01:28,232 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:01:28,232 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:28,234 INFO ]: Computing forward predicates... [2018-06-24 21:01:28,435 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:28,454 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:28,455 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 21:01:28,455 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:01:28,455 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:01:28,455 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:01:28,455 INFO ]: Start difference. First operand 21 states and 28 transitions. Second operand 17 states. [2018-06-24 21:01:28,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:28,689 INFO ]: Finished difference Result 26 states and 33 transitions. [2018-06-24 21:01:28,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 21:01:28,689 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 21:01:28,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:28,689 INFO ]: With dead ends: 26 [2018-06-24 21:01:28,690 INFO ]: Without dead ends: 26 [2018-06-24 21:01:28,690 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:01:28,690 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 21:01:28,690 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-06-24 21:01:28,690 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 21:01:28,690 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-06-24 21:01:28,690 INFO ]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 18 [2018-06-24 21:01:28,690 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:28,690 INFO ]: Abstraction has 21 states and 28 transitions. [2018-06-24 21:01:28,690 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:01:28,691 INFO ]: Start isEmpty. Operand 21 states and 28 transitions. [2018-06-24 21:01:28,691 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:01:28,691 INFO ]: Found error trace [2018-06-24 21:01:28,691 INFO ]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:28,691 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:28,691 INFO ]: Analyzing trace with hash 147717713, now seen corresponding path program 7 times [2018-06-24 21:01:28,691 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:28,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:28,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:28,691 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:01:28,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:28,704 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:30,177 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:30,178 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:30,178 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:30,183 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:01:30,216 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:30,218 INFO ]: Computing forward predicates... [2018-06-24 21:01:30,584 WARN ]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-24 21:01:31,402 WARN ]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-24 21:01:33,521 WARN ]: Spent 677.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-24 21:01:33,523 INFO ]: Checked inductivity of 91 backedges. 0 proven. 88 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:33,542 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:33,542 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2018-06-24 21:01:33,542 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:01:33,542 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:01:33,542 INFO ]: CoverageRelationStatistics Valid=92, Invalid=285, Unknown=3, NotChecked=0, Total=380 [2018-06-24 21:01:33,542 INFO ]: Start difference. First operand 21 states and 28 transitions. Second operand 20 states. Received shutdown request... [2018-06-24 21:01:36,903 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:01:36,903 WARN ]: Verification canceled [2018-06-24 21:01:36,905 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:01:36,905 WARN ]: Timeout [2018-06-24 21:01:36,906 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:01:36 BasicIcfg [2018-06-24 21:01:36,906 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:01:36,906 INFO ]: Toolchain (without parser) took 64576.83 ms. Allocated memory was 304.6 MB in the beginning and 608.7 MB in the end (delta: 304.1 MB). Free memory was 259.0 MB in the beginning and 493.3 MB in the end (delta: -234.3 MB). Peak memory consumption was 69.8 MB. Max. memory is 3.6 GB. [2018-06-24 21:01:36,910 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.6 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:01:36,910 INFO ]: ChcToBoogie took 63.26 ms. Allocated memory is still 304.6 MB. Free memory was 257.0 MB in the beginning and 255.0 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:01:36,910 INFO ]: Boogie Preprocessor took 48.82 ms. Allocated memory is still 304.6 MB. Free memory is still 255.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:01:36,910 INFO ]: RCFGBuilder took 450.94 ms. Allocated memory is still 304.6 MB. Free memory was 255.0 MB in the beginning and 241.0 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:01:36,913 INFO ]: BlockEncodingV2 took 112.39 ms. Allocated memory is still 304.6 MB. Free memory was 241.0 MB in the beginning and 237.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:01:36,913 INFO ]: TraceAbstraction took 63892.15 ms. Allocated memory was 304.6 MB in the beginning and 608.7 MB in the end (delta: 304.1 MB). Free memory was 237.0 MB in the beginning and 493.3 MB in the end (delta: -256.3 MB). Peak memory consumption was 47.8 MB. Max. memory is 3.6 GB. [2018-06-24 21:01:36,915 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 20 edges - StatisticsResult: Encoded RCFG 6 locations, 16 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 304.6 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.26 ms. Allocated memory is still 304.6 MB. Free memory was 257.0 MB in the beginning and 255.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.82 ms. Allocated memory is still 304.6 MB. Free memory is still 255.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 450.94 ms. Allocated memory is still 304.6 MB. Free memory was 255.0 MB in the beginning and 241.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 112.39 ms. Allocated memory is still 304.6 MB. Free memory was 241.0 MB in the beginning and 237.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 63892.15 ms. Allocated memory was 304.6 MB in the beginning and 608.7 MB in the end (delta: 304.1 MB). Free memory was 237.0 MB in the beginning and 493.3 MB in the end (delta: -256.3 MB). Peak memory consumption was 47.8 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 (21states) and interpolant automaton (currently 16 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 63.8s OverallTime, 48 OverallIterations, 9 TraceHistogramMax, 23.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 293 SDtfs, 68 SDslu, 939 SDs, 0 SdLazy, 4510 SolverSat, 947 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1001 GetRequests, 299 SyntacticMatches, 208 SemanticMatches, 493 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 42.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 47 MinimizatonAttempts, 104 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 36.1s InterpolantComputationTime, 1098 NumberOfCodeBlocks, 1098 NumberOfCodeBlocksAsserted, 179 NumberOfCheckSat, 1006 ConstructedInterpolants, 73 QuantifiedInterpolants, 69640 SizeOfPredicates, 119 NumberOfNonLiveVariables, 9661 ConjunctsInSsa, 1423 ConjunctsInUnsatCore, 92 InterpolantComputations, 7 PerfectInterpolantSequences, 701/3193 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/008-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-01-36-927.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-01-36-927.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-01-36-927.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-01-36-927.csv Completed graceful shutdown