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/llreve-bench/smt2/loop__barthe2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:40:45,406 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:40:45,408 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:40:45,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:40:45,424 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:40:45,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:40:45,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:40:45,428 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:40:45,430 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:40:45,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:40:45,432 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:40:45,432 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:40:45,433 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:40:45,434 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:40:45,437 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:40:45,438 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:40:45,440 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:40:45,453 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:40:45,454 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:40:45,455 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:40:45,456 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:40:45,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:40:45,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:40:45,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:40:45,459 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:40:45,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:40:45,468 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:40:45,468 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:40:45,469 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:40:45,470 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:40:45,470 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:40:45,471 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:40:45,471 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:40:45,472 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:40:45,472 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:40:45,473 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:40:45,500 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:40:45,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:40:45,501 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:40:45,501 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:40:45,502 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:40:45,502 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:40:45,502 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:40:45,502 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:40:45,503 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:40:45,506 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:40:45,506 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:40:45,506 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:40:45,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:40:45,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:40:45,507 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:40:45,507 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:40:45,507 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:40:45,507 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:40:45,508 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:40:45,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:40:45,508 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:40:45,509 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:40:45,510 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:40:45,562 INFO ]: Repository-Root is: /tmp [2018-06-24 21:40:45,572 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:40:45,577 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:40:45,578 INFO ]: Initializing SmtParser... [2018-06-24 21:40:45,578 INFO ]: SmtParser initialized [2018-06-24 21:40:45,579 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2.smt2 [2018-06-24 21:40:45,580 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:40:45,668 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@62e780ba [2018-06-24 21:40:45,840 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2.smt2 [2018-06-24 21:40:45,845 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:40:45,859 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:40:45,859 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:40:45,859 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:40:45,859 INFO ]: ChcToBoogie initialized [2018-06-24 21:40:45,862 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:40:45" (1/1) ... [2018-06-24 21:40:45,919 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:45 Unit [2018-06-24 21:40:45,919 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:40:45,920 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:40:45,920 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:40:45,920 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:40:45,942 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:45" (1/1) ... [2018-06-24 21:40:45,943 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:45" (1/1) ... [2018-06-24 21:40:45,951 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:45" (1/1) ... [2018-06-24 21:40:45,951 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:45" (1/1) ... [2018-06-24 21:40:45,954 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:45" (1/1) ... [2018-06-24 21:40:45,955 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:45" (1/1) ... [2018-06-24 21:40:45,956 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:45" (1/1) ... [2018-06-24 21:40:45,957 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:40:45,958 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:40:45,958 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:40:45,958 INFO ]: RCFGBuilder initialized [2018-06-24 21:40:45,959 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:45" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:40:45,972 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:40:45,972 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:40:45,972 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:40:45,972 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:40:45,972 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:40:45,972 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:40:46,137 INFO ]: Using library mode [2018-06-24 21:40:46,137 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:40:46 BoogieIcfgContainer [2018-06-24 21:40:46,137 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:40:46,144 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:40:46,144 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:40:46,145 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:40:46,146 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:40:46" (1/1) ... [2018-06-24 21:40:46,170 INFO ]: Initial Icfg 10 locations, 12 edges [2018-06-24 21:40:46,172 INFO ]: Using Remove infeasible edges [2018-06-24 21:40:46,172 INFO ]: Using Maximize final states [2018-06-24 21:40:46,173 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:40:46,173 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:40:46,176 INFO ]: Using Remove sink states [2018-06-24 21:40:46,177 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:40:46,177 INFO ]: Using Use SBE [2018-06-24 21:40:46,182 INFO ]: SBE split 0 edges [2018-06-24 21:40:46,187 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:40:46,189 INFO ]: 0 new accepting states [2018-06-24 21:40:46,243 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 21:40:46,245 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:40:46,249 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:40:46,249 INFO ]: 0 new accepting states [2018-06-24 21:40:46,249 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:40:46,249 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:40:46,250 INFO ]: Encoded RCFG 6 locations, 8 edges [2018-06-24 21:40:46,250 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:40:46 BasicIcfg [2018-06-24 21:40:46,250 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:40:46,253 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:40:46,253 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:40:46,256 INFO ]: TraceAbstraction initialized [2018-06-24 21:40:46,270 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:40:45" (1/4) ... [2018-06-24 21:40:46,271 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4435bab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:40:46, skipping insertion in model container [2018-06-24 21:40:46,272 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:45" (2/4) ... [2018-06-24 21:40:46,272 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4435bab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:40:46, skipping insertion in model container [2018-06-24 21:40:46,272 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:40:46" (3/4) ... [2018-06-24 21:40:46,272 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4435bab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:40:46, skipping insertion in model container [2018-06-24 21:40:46,272 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:40:46" (4/4) ... [2018-06-24 21:40:46,274 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:40:46,284 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:40:46,290 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:40:46,323 INFO ]: Using default assertion order modulation [2018-06-24 21:40:46,324 INFO ]: Interprodecural is true [2018-06-24 21:40:46,324 INFO ]: Hoare is false [2018-06-24 21:40:46,324 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:40:46,324 INFO ]: Backedges is TWOTRACK [2018-06-24 21:40:46,324 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:40:46,324 INFO ]: Difference is false [2018-06-24 21:40:46,324 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:40:46,324 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:40:46,333 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 21:40:46,342 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:40:46,342 INFO ]: Found error trace [2018-06-24 21:40:46,343 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:40:46,343 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:46,348 INFO ]: Analyzing trace with hash 37311172, now seen corresponding path program 1 times [2018-06-24 21:40:46,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:46,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:46,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:46,385 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:46,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:46,420 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:46,473 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:40:46,474 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:40:46,474 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:40:46,475 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:40:46,486 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:40:46,487 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:40:46,489 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 21:40:46,585 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:46,585 INFO ]: Finished difference Result 7 states and 11 transitions. [2018-06-24 21:40:46,586 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:40:46,587 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:40:46,587 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:46,595 INFO ]: With dead ends: 7 [2018-06-24 21:40:46,595 INFO ]: Without dead ends: 7 [2018-06-24 21:40:46,597 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:40:46,609 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:40:46,628 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:40:46,629 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:40:46,630 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-24 21:40:46,632 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-06-24 21:40:46,632 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:46,632 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-24 21:40:46,632 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:40:46,632 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-24 21:40:46,632 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:40:46,632 INFO ]: Found error trace [2018-06-24 21:40:46,632 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:40:46,633 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:46,633 INFO ]: Analyzing trace with hash 1156261132, now seen corresponding path program 1 times [2018-06-24 21:40:46,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:46,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:46,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:46,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:46,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:46,670 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:46,997 WARN ]: Spent 234.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-06-24 21:40:47,126 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:40:47,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:47,126 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:40:47,133 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:47,161 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:47,168 INFO ]: Computing forward predicates... [2018-06-24 21:40:47,250 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:40:47,270 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:47,270 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 21:40:47,270 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:40:47,270 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:40:47,271 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:40:47,271 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 6 states. [2018-06-24 21:40:47,441 WARN ]: Spent 157.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-06-24 21:40:47,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:47,629 INFO ]: Finished difference Result 9 states and 17 transitions. [2018-06-24 21:40:47,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:40:47,629 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 21:40:47,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:47,630 INFO ]: With dead ends: 9 [2018-06-24 21:40:47,630 INFO ]: Without dead ends: 9 [2018-06-24 21:40:47,630 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:40:47,631 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:40:47,632 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-24 21:40:47,632 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:40:47,632 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-24 21:40:47,632 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 6 [2018-06-24 21:40:47,632 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:47,632 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-24 21:40:47,632 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:40:47,632 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-24 21:40:47,632 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:40:47,632 INFO ]: Found error trace [2018-06-24 21:40:47,632 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:40:47,633 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:47,633 INFO ]: Analyzing trace with hash 1156290923, now seen corresponding path program 1 times [2018-06-24 21:40:47,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:47,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:47,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:47,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:47,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:47,649 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:47,734 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:40:47,734 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:47,734 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:40:47,741 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:47,764 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:47,766 INFO ]: Computing forward predicates... [2018-06-24 21:40:47,882 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:40:47,903 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:40:47,903 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-06-24 21:40:47,903 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:40:47,903 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:40:47,904 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:40:47,904 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 6 states. [2018-06-24 21:40:47,996 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:47,996 INFO ]: Finished difference Result 10 states and 19 transitions. [2018-06-24 21:40:47,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:40:47,997 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 21:40:47,997 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:47,997 INFO ]: With dead ends: 10 [2018-06-24 21:40:47,997 INFO ]: Without dead ends: 10 [2018-06-24 21:40:47,997 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:40:47,998 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:40:47,999 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-24 21:40:47,999 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:40:48,000 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-06-24 21:40:48,000 INFO ]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 6 [2018-06-24 21:40:48,000 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:48,000 INFO ]: Abstraction has 9 states and 16 transitions. [2018-06-24 21:40:48,000 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:40:48,000 INFO ]: Start isEmpty. Operand 9 states and 16 transitions. [2018-06-24 21:40:48,000 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:40:48,000 INFO ]: Found error trace [2018-06-24 21:40:48,000 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:40:48,000 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:48,001 INFO ]: Analyzing trace with hash 1156320714, now seen corresponding path program 1 times [2018-06-24 21:40:48,001 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:48,001 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:48,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:48,001 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:48,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:48,011 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:48,092 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:40:48,092 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:48,092 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:40:48,099 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:48,139 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:48,141 INFO ]: Computing forward predicates... [2018-06-24 21:40:48,174 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:40:48,194 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:48,194 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 21:40:48,194 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:40:48,194 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:40:48,194 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:40:48,195 INFO ]: Start difference. First operand 9 states and 16 transitions. Second operand 5 states. [2018-06-24 21:40:48,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:48,259 INFO ]: Finished difference Result 12 states and 23 transitions. [2018-06-24 21:40:48,259 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:40:48,259 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 21:40:48,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:48,260 INFO ]: With dead ends: 12 [2018-06-24 21:40:48,260 INFO ]: Without dead ends: 12 [2018-06-24 21:40:48,260 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:40:48,260 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:40:48,262 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-24 21:40:48,262 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:40:48,262 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2018-06-24 21:40:48,262 INFO ]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 6 [2018-06-24 21:40:48,262 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:48,262 INFO ]: Abstraction has 11 states and 21 transitions. [2018-06-24 21:40:48,262 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:40:48,262 INFO ]: Start isEmpty. Operand 11 states and 21 transitions. [2018-06-24 21:40:48,263 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:40:48,263 INFO ]: Found error trace [2018-06-24 21:40:48,263 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:48,263 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:48,263 INFO ]: Analyzing trace with hash 1484031106, now seen corresponding path program 1 times [2018-06-24 21:40:48,263 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:48,263 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:48,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:48,264 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:48,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:48,279 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:48,656 WARN ]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-24 21:40:48,657 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:40:48,657 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:48,657 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:40:48,669 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:48,701 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:48,703 INFO ]: Computing forward predicates... [2018-06-24 21:40:48,814 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:40:48,835 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:48,836 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 21:40:48,836 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:40:48,836 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:40:48,836 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:40:48,836 INFO ]: Start difference. First operand 11 states and 21 transitions. Second operand 7 states. [2018-06-24 21:40:48,947 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:48,947 INFO ]: Finished difference Result 13 states and 27 transitions. [2018-06-24 21:40:48,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:40:48,947 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 21:40:48,948 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:48,948 INFO ]: With dead ends: 13 [2018-06-24 21:40:48,948 INFO ]: Without dead ends: 13 [2018-06-24 21:40:48,948 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:40:48,948 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:40:48,950 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-24 21:40:48,950 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:40:48,950 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-06-24 21:40:48,950 INFO ]: Start accepts. Automaton has 12 states and 24 transitions. Word has length 7 [2018-06-24 21:40:48,950 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:48,950 INFO ]: Abstraction has 12 states and 24 transitions. [2018-06-24 21:40:48,950 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:40:48,950 INFO ]: Start isEmpty. Operand 12 states and 24 transitions. [2018-06-24 21:40:48,951 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:40:48,951 INFO ]: Found error trace [2018-06-24 21:40:48,951 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:48,951 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:48,951 INFO ]: Analyzing trace with hash -1241848630, now seen corresponding path program 2 times [2018-06-24 21:40:48,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:48,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:48,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:48,952 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:48,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:48,965 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:49,038 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:49,039 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:49,039 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:40:49,048 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:40:49,084 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:40:49,085 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:49,087 INFO ]: Computing forward predicates... [2018-06-24 21:40:49,148 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:49,167 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:49,167 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-24 21:40:49,167 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:40:49,167 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:40:49,167 INFO ]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:40:49,167 INFO ]: Start difference. First operand 12 states and 24 transitions. Second operand 9 states. [2018-06-24 21:40:49,255 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:49,255 INFO ]: Finished difference Result 17 states and 29 transitions. [2018-06-24 21:40:49,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:40:49,255 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-24 21:40:49,256 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:49,256 INFO ]: With dead ends: 17 [2018-06-24 21:40:49,256 INFO ]: Without dead ends: 11 [2018-06-24 21:40:49,256 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:40:49,256 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:40:49,257 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-24 21:40:49,257 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:40:49,258 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-24 21:40:49,258 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 8 [2018-06-24 21:40:49,258 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:49,258 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-24 21:40:49,258 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:40:49,258 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-24 21:40:49,258 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:40:49,258 INFO ]: Found error trace [2018-06-24 21:40:49,259 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:49,259 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:49,259 INFO ]: Analyzing trace with hash -1240001588, now seen corresponding path program 3 times [2018-06-24 21:40:49,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:49,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:49,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:49,260 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:49,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:49,291 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:49,410 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:40:49,410 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:49,410 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:40:49,418 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:40:49,434 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:40:49,434 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:49,437 INFO ]: Computing forward predicates... [2018-06-24 21:40:49,609 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:40:49,628 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:49,628 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:40:49,628 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:40:49,628 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:40:49,628 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:40:49,628 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 10 states. [2018-06-24 21:40:49,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:49,855 INFO ]: Finished difference Result 13 states and 16 transitions. [2018-06-24 21:40:49,855 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:40:49,855 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-24 21:40:49,855 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:49,856 INFO ]: With dead ends: 13 [2018-06-24 21:40:49,856 INFO ]: Without dead ends: 13 [2018-06-24 21:40:49,856 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:40:49,856 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:40:49,857 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-24 21:40:49,857 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:40:49,858 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-06-24 21:40:49,858 INFO ]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2018-06-24 21:40:49,858 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:49,858 INFO ]: Abstraction has 11 states and 14 transitions. [2018-06-24 21:40:49,858 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:40:49,858 INFO ]: Start isEmpty. Operand 11 states and 14 transitions. [2018-06-24 21:40:49,859 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:40:49,859 INFO ]: Found error trace [2018-06-24 21:40:49,859 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-24 21:40:49,859 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:49,859 INFO ]: Analyzing trace with hash -1182743286, now seen corresponding path program 2 times [2018-06-24 21:40:49,859 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:49,859 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:49,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:49,860 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:49,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:49,869 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:50,044 INFO ]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:50,044 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:50,044 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:40:50,050 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:40:50,081 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:40:50,081 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:50,083 INFO ]: Computing forward predicates... [2018-06-24 21:40:50,121 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:40:50,140 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:50,140 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-06-24 21:40:50,140 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:40:50,140 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:40:50,140 INFO ]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:40:50,141 INFO ]: Start difference. First operand 11 states and 14 transitions. Second operand 8 states. [2018-06-24 21:40:50,270 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:50,270 INFO ]: Finished difference Result 20 states and 25 transitions. [2018-06-24 21:40:50,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:40:50,270 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-24 21:40:50,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:50,270 INFO ]: With dead ends: 20 [2018-06-24 21:40:50,270 INFO ]: Without dead ends: 10 [2018-06-24 21:40:50,271 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:40:50,271 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:40:50,272 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:40:50,272 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:40:50,272 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-24 21:40:50,272 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-24 21:40:50,272 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:50,272 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-24 21:40:50,272 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:40:50,272 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-24 21:40:50,272 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:40:50,272 INFO ]: Found error trace [2018-06-24 21:40:50,272 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:50,272 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:50,272 INFO ]: Analyzing trace with hash 214330818, now seen corresponding path program 4 times [2018-06-24 21:40:50,272 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:50,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:50,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:50,273 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:50,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:50,289 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:50,388 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:40:50,388 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:50,388 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:40:50,394 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:40:50,409 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:40:50,409 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:50,411 INFO ]: Computing forward predicates... [2018-06-24 21:40:50,440 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:40:50,459 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:50,459 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-24 21:40:50,459 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:40:50,459 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:40:50,460 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:40:50,460 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2018-06-24 21:40:50,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:50,486 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-24 21:40:50,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:40:50,486 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 21:40:50,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:50,487 INFO ]: With dead ends: 11 [2018-06-24 21:40:50,487 INFO ]: Without dead ends: 11 [2018-06-24 21:40:50,487 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:40:50,487 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:40:50,488 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 21:40:50,488 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:40:50,489 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-24 21:40:50,489 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-24 21:40:50,489 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:50,489 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-24 21:40:50,489 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:40:50,489 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-24 21:40:50,489 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:40:50,489 INFO ]: Found error trace [2018-06-24 21:40:50,489 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:50,489 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:50,489 INFO ]: Analyzing trace with hash -1946004852, now seen corresponding path program 5 times [2018-06-24 21:40:50,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:50,489 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:50,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:50,490 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:50,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:50,507 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:50,977 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:40:50,977 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:50,977 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:40:50,983 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:40:51,002 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:40:51,002 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:51,004 INFO ]: Computing forward predicates... [2018-06-24 21:40:51,087 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:40:51,114 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:51,114 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 21:40:51,114 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:40:51,114 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:40:51,115 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:40:51,115 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2018-06-24 21:40:51,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:51,149 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-24 21:40:51,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:40:51,150 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 21:40:51,150 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:51,150 INFO ]: With dead ends: 12 [2018-06-24 21:40:51,150 INFO ]: Without dead ends: 12 [2018-06-24 21:40:51,150 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:40:51,150 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:40:51,152 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 21:40:51,152 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:40:51,152 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-24 21:40:51,152 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-24 21:40:51,152 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:51,152 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-24 21:40:51,152 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:40:51,152 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-24 21:40:51,153 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:40:51,153 INFO ]: Found error trace [2018-06-24 21:40:51,153 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:51,153 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:51,153 INFO ]: Analyzing trace with hash -196933886, now seen corresponding path program 6 times [2018-06-24 21:40:51,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:51,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:51,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:51,153 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:51,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:51,177 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:51,475 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-24 21:40:51,552 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:40:51,552 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:51,552 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:40:51,564 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:40:51,617 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 21:40:51,617 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:51,620 INFO ]: Computing forward predicates... [2018-06-24 21:40:54,032 WARN ]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 26 [2018-06-24 21:40:58,214 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:40:58,236 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:58,236 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-24 21:40:58,236 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:40:58,236 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:40:58,236 INFO ]: CoverageRelationStatistics Valid=39, Invalid=193, Unknown=8, NotChecked=0, Total=240 [2018-06-24 21:40:58,237 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2018-06-24 21:41:02,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:02,992 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-24 21:41:02,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:41:02,993 INFO ]: Start accepts. Automaton has 16 states. Word has length 11 [2018-06-24 21:41:02,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:02,993 INFO ]: With dead ends: 13 [2018-06-24 21:41:02,993 INFO ]: Without dead ends: 13 [2018-06-24 21:41:02,994 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=48, Invalid=249, Unknown=9, NotChecked=0, Total=306 [2018-06-24 21:41:02,994 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:41:02,995 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 21:41:02,995 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:41:02,995 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-24 21:41:02,995 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-24 21:41:02,995 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:02,995 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-24 21:41:02,995 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:41:02,995 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-24 21:41:02,995 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:41:02,995 INFO ]: Found error trace [2018-06-24 21:41:02,995 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-24 21:41:02,995 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:02,996 INFO ]: Analyzing trace with hash -1810308788, now seen corresponding path program 7 times [2018-06-24 21:41:02,996 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:02,996 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:02,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:02,996 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:02,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:03,014 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:03,163 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:41:03,163 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:03,163 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:41:03,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:03,199 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:03,201 INFO ]: Computing forward predicates... [2018-06-24 21:41:03,253 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:41:03,276 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:03,276 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 21:41:03,276 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:41:03,276 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:41:03,276 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:41:03,276 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-06-24 21:41:03,366 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:03,367 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-24 21:41:03,367 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:41:03,367 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 21:41:03,367 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:03,367 INFO ]: With dead ends: 14 [2018-06-24 21:41:03,367 INFO ]: Without dead ends: 14 [2018-06-24 21:41:03,367 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:41:03,368 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:41:03,369 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 21:41:03,369 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:41:03,369 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-24 21:41:03,369 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-24 21:41:03,370 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:03,370 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-24 21:41:03,370 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:41:03,370 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-24 21:41:03,370 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:41:03,370 INFO ]: Found error trace [2018-06-24 21:41:03,370 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-24 21:41:03,370 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:03,370 INFO ]: Analyzing trace with hash -285323198, now seen corresponding path program 8 times [2018-06-24 21:41:03,370 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:03,370 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:03,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:03,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:03,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:03,390 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:03,668 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:41:03,668 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:03,668 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:41:03,673 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:41:03,698 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:41:03,698 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:03,702 INFO ]: Computing forward predicates... [2018-06-24 21:41:04,304 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:41:04,323 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:04,323 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-24 21:41:04,323 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:41:04,324 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:41:04,324 INFO ]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:41:04,324 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 20 states. [2018-06-24 21:41:04,698 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:04,698 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-24 21:41:04,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:41:04,698 INFO ]: Start accepts. Automaton has 20 states. Word has length 13 [2018-06-24 21:41:04,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:04,698 INFO ]: With dead ends: 15 [2018-06-24 21:41:04,698 INFO ]: Without dead ends: 15 [2018-06-24 21:41:04,698 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:41:04,698 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:41:04,700 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 21:41:04,700 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:41:04,700 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-24 21:41:04,700 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-24 21:41:04,700 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:04,700 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-24 21:41:04,700 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:41:04,700 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-24 21:41:04,700 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:41:04,700 INFO ]: Found error trace [2018-06-24 21:41:04,700 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-24 21:41:04,700 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:04,701 INFO ]: Analyzing trace with hash -255410164, now seen corresponding path program 9 times [2018-06-24 21:41:04,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:04,701 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:04,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:04,701 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:04,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:04,718 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:04,989 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:41:04,989 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:04,989 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:41:04,995 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:41:05,027 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:41:05,027 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:05,030 INFO ]: Computing forward predicates... [2018-06-24 21:41:05,484 WARN ]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-24 21:41:10,077 WARN ]: unable to prove that (exists ((v_gotoProc_hbv_INV_MAIN_1_2_Int_54 Int) (v_gotoProc_hhv_INV_MAIN_1_2_Int_51 Int)) (let ((.cse2 (+ v_gotoProc_hbv_INV_MAIN_1_2_Int_54 4)) (.cse1 (+ c_gotoProc_hhv_INV_MAIN_1_1_Int (* 2 c_gotoProc_hhv_INV_MAIN_1_0_Int) c_gotoProc_hhv_INV_MAIN_1_2_Int)) (.cse0 (+ v_gotoProc_hhv_INV_MAIN_1_2_Int_51 3))) (and (not (= (+ c_gotoProc_hhv_INV_MAIN_1_5_Int (* 8 c_gotoProc_hhv_INV_MAIN_1_0_Int) c_gotoProc_hhv_INV_MAIN_1_3_Int (* 5 v_gotoProc_hbv_INV_MAIN_1_2_Int_54) (* 4 c_gotoProc_hhv_INV_MAIN_1_2_Int) 4) (* 5 v_gotoProc_hhv_INV_MAIN_1_2_Int_51))) (<= .cse0 .cse1) (<= c_gotoProc_hhv_INV_MAIN_1_4_Int .cse2) (<= .cse2 c_gotoProc_hhv_INV_MAIN_1_4_Int) (<= .cse1 .cse0)))) is different from true [2018-06-24 21:41:10,455 WARN ]: unable to prove that (exists ((v_gotoProc_hbv_INV_MAIN_1_2_Int_54 Int) (v_gotoProc_hhv_INV_MAIN_1_2_Int_51 Int)) (let ((.cse1 (+ v_gotoProc_hhv_INV_MAIN_1_2_Int_51 1)) (.cse0 (+ c_gotoProc_hhv_INV_MAIN_1_1_Int (* 3 c_gotoProc_hhv_INV_MAIN_1_0_Int) c_gotoProc_hhv_INV_MAIN_1_2_Int)) (.cse2 (+ v_gotoProc_hbv_INV_MAIN_1_2_Int_54 4))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= c_gotoProc_hhv_INV_MAIN_1_4_Int .cse2) (not (= (* 5 v_gotoProc_hhv_INV_MAIN_1_2_Int_51) (+ c_gotoProc_hhv_INV_MAIN_1_5_Int (* 12 c_gotoProc_hhv_INV_MAIN_1_0_Int) (* 2 c_gotoProc_hhv_INV_MAIN_1_3_Int) (* 5 v_gotoProc_hbv_INV_MAIN_1_2_Int_54) (* 4 c_gotoProc_hhv_INV_MAIN_1_2_Int) 13))) (<= .cse2 c_gotoProc_hhv_INV_MAIN_1_4_Int)))) is different from true [2018-06-24 21:41:15,445 WARN ]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-24 21:41:15,449 INFO ]: Checked inductivity of 45 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2018-06-24 21:41:15,480 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:15,480 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-24 21:41:15,480 INFO ]: Interpolant automaton has 22 states [2018-06-24 21:41:15,480 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 21:41:15,480 INFO ]: CoverageRelationStatistics Valid=46, Invalid=329, Unknown=13, NotChecked=74, Total=462 [2018-06-24 21:41:15,481 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 22 states. [2018-06-24 21:41:23,528 WARN ]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-24 21:41:27,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:27,145 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-24 21:41:27,146 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:41:27,146 INFO ]: Start accepts. Automaton has 22 states. Word has length 14 [2018-06-24 21:41:27,146 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:27,146 INFO ]: With dead ends: 16 [2018-06-24 21:41:27,146 INFO ]: Without dead ends: 16 [2018-06-24 21:41:27,146 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=64, Invalid=530, Unknown=14, NotChecked=94, Total=702 [2018-06-24 21:41:27,146 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:41:27,148 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 21:41:27,148 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:41:27,148 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-24 21:41:27,148 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-24 21:41:27,148 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:27,148 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-24 21:41:27,148 INFO ]: Interpolant automaton has 22 states. [2018-06-24 21:41:27,148 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-24 21:41:27,149 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:41:27,149 INFO ]: Found error trace [2018-06-24 21:41:27,149 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2018-06-24 21:41:27,149 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:27,149 INFO ]: Analyzing trace with hash 671893890, now seen corresponding path program 10 times [2018-06-24 21:41:27,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:27,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:27,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:27,149 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:27,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:27,176 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:27,447 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:41:27,447 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:27,483 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:41:27,492 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:41:27,533 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:41:27,533 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:27,536 INFO ]: Computing forward predicates... [2018-06-24 21:41:27,842 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:41:27,861 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:27,861 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-24 21:41:27,861 INFO ]: Interpolant automaton has 24 states [2018-06-24 21:41:27,862 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 21:41:27,862 INFO ]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:41:27,862 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 24 states. [2018-06-24 21:41:28,385 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:28,385 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-24 21:41:28,386 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:41:28,386 INFO ]: Start accepts. Automaton has 24 states. Word has length 15 [2018-06-24 21:41:28,386 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:28,386 INFO ]: With dead ends: 17 [2018-06-24 21:41:28,386 INFO ]: Without dead ends: 17 [2018-06-24 21:41:28,387 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 21:41:28,387 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:41:28,388 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 21:41:28,388 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:41:28,388 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-24 21:41:28,388 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-24 21:41:28,389 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:28,389 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-24 21:41:28,389 INFO ]: Interpolant automaton has 24 states. [2018-06-24 21:41:28,389 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-24 21:41:28,389 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:41:28,389 INFO ]: Found error trace [2018-06-24 21:41:28,389 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2018-06-24 21:41:28,389 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:28,389 INFO ]: Analyzing trace with hash -646451508, now seen corresponding path program 11 times [2018-06-24 21:41:28,389 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:28,389 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:28,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:28,390 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:28,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:28,415 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:28,693 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:41:28,693 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:28,693 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:41:28,698 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:41:28,756 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 21:41:28,756 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:28,760 INFO ]: Computing forward predicates... [2018-06-24 21:41:31,441 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:41:31,462 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:31,462 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-24 21:41:31,463 INFO ]: Interpolant automaton has 26 states [2018-06-24 21:41:31,463 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 21:41:31,463 INFO ]: CoverageRelationStatistics Valid=51, Invalid=598, Unknown=1, NotChecked=0, Total=650 [2018-06-24 21:41:31,463 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 26 states. [2018-06-24 21:41:31,946 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:31,946 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-24 21:41:31,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:41:31,947 INFO ]: Start accepts. Automaton has 26 states. Word has length 16 [2018-06-24 21:41:31,947 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:31,947 INFO ]: With dead ends: 18 [2018-06-24 21:41:31,947 INFO ]: Without dead ends: 18 [2018-06-24 21:41:31,948 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=96, Invalid=1235, Unknown=1, NotChecked=0, Total=1332 [2018-06-24 21:41:31,948 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 21:41:31,950 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 21:41:31,950 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 21:41:31,950 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-24 21:41:31,950 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-24 21:41:31,950 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:31,950 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-24 21:41:31,950 INFO ]: Interpolant automaton has 26 states. [2018-06-24 21:41:31,951 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-24 21:41:31,951 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:41:31,951 INFO ]: Found error trace [2018-06-24 21:41:31,951 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2018-06-24 21:41:31,951 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:31,951 INFO ]: Analyzing trace with hash 1434514114, now seen corresponding path program 12 times [2018-06-24 21:41:31,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:31,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:31,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:31,952 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:31,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:31,976 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:32,323 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:41:32,323 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:32,323 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:41:32,330 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:41:32,368 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 21:41:32,368 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:32,375 INFO ]: Computing forward predicates... [2018-06-24 21:41:33,110 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:41:33,131 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:33,131 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-06-24 21:41:33,131 INFO ]: Interpolant automaton has 28 states [2018-06-24 21:41:33,132 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 21:41:33,132 INFO ]: CoverageRelationStatistics Valid=63, Invalid=693, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:41:33,132 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 28 states. [2018-06-24 21:41:33,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:33,448 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-24 21:41:33,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:41:33,448 INFO ]: Start accepts. Automaton has 28 states. Word has length 17 [2018-06-24 21:41:33,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:33,449 INFO ]: With dead ends: 19 [2018-06-24 21:41:33,449 INFO ]: Without dead ends: 19 [2018-06-24 21:41:33,449 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:41:33,449 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 21:41:33,450 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 21:41:33,450 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:41:33,450 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-24 21:41:33,450 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-24 21:41:33,450 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:33,450 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-24 21:41:33,450 INFO ]: Interpolant automaton has 28 states. [2018-06-24 21:41:33,451 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-24 21:41:33,451 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:41:33,451 INFO ]: Found error trace [2018-06-24 21:41:33,451 INFO ]: trace histogram [12, 1, 1, 1, 1, 1, 1] [2018-06-24 21:41:33,451 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:33,451 INFO ]: Analyzing trace with hash 1519938956, now seen corresponding path program 13 times [2018-06-24 21:41:33,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:33,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:33,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:33,452 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:33,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:33,566 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:34,181 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:41:34,181 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:34,181 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:41:34,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:34,232 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:34,239 INFO ]: Computing forward predicates... [2018-06-24 21:41:34,391 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:41:34,410 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:34,410 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 21:41:34,410 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:41:34,410 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:41:34,410 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:41:34,410 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2018-06-24 21:41:34,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:34,614 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-24 21:41:34,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:41:34,616 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 21:41:34,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:34,616 INFO ]: With dead ends: 20 [2018-06-24 21:41:34,616 INFO ]: Without dead ends: 20 [2018-06-24 21:41:34,616 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:41:34,617 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 21:41:34,618 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 21:41:34,618 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:41:34,618 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-24 21:41:34,618 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-24 21:41:34,618 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:34,618 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-24 21:41:34,618 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:41:34,618 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-24 21:41:34,619 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:41:34,619 INFO ]: Found error trace [2018-06-24 21:41:34,619 INFO ]: trace histogram [13, 1, 1, 1, 1, 1, 1] [2018-06-24 21:41:34,619 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:34,619 INFO ]: Analyzing trace with hash -126858238, now seen corresponding path program 14 times [2018-06-24 21:41:34,619 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:34,619 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:34,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:34,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:34,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:34,657 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:34,995 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-24 21:41:35,543 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:35,543 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:35,543 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:41:35,549 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:41:35,595 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:41:35,595 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:35,601 INFO ]: Computing forward predicates... [2018-06-24 21:41:36,203 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:36,222 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:36,222 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-06-24 21:41:36,223 INFO ]: Interpolant automaton has 32 states [2018-06-24 21:41:36,223 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 21:41:36,223 INFO ]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:41:36,223 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 32 states. [2018-06-24 21:41:36,558 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:36,558 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-24 21:41:36,559 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:41:36,559 INFO ]: Start accepts. Automaton has 32 states. Word has length 19 [2018-06-24 21:41:36,559 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:36,559 INFO ]: With dead ends: 21 [2018-06-24 21:41:36,559 INFO ]: Without dead ends: 21 [2018-06-24 21:41:36,559 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 21:41:36,559 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 21:41:36,561 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 21:41:36,561 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 21:41:36,561 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-24 21:41:36,561 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-24 21:41:36,561 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:36,561 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-24 21:41:36,561 INFO ]: Interpolant automaton has 32 states. [2018-06-24 21:41:36,561 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-24 21:41:36,562 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:41:36,562 INFO ]: Found error trace [2018-06-24 21:41:36,562 INFO ]: trace histogram [14, 1, 1, 1, 1, 1, 1] [2018-06-24 21:41:36,562 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:36,562 INFO ]: Analyzing trace with hash 362036300, now seen corresponding path program 15 times [2018-06-24 21:41:36,562 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:36,562 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:36,563 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:36,563 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:36,563 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:36,593 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:37,417 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:37,417 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:37,417 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:41:37,425 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:41:37,481 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 21:41:37,481 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:37,487 INFO ]: Computing forward predicates... [2018-06-24 21:41:38,254 WARN ]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-24 21:41:49,902 WARN ]: unable to prove that (exists ((v_gotoProc_hbv_INV_MAIN_1_2_Int_126 Int) (v_gotoProc_hhv_INV_MAIN_1_2_Int_123 Int)) (let ((.cse2 (+ v_gotoProc_hbv_INV_MAIN_1_2_Int_126 7)) (.cse1 (+ v_gotoProc_hhv_INV_MAIN_1_2_Int_123 6)) (.cse0 (+ c_gotoProc_hhv_INV_MAIN_1_1_Int (* 2 c_gotoProc_hhv_INV_MAIN_1_0_Int) c_gotoProc_hhv_INV_MAIN_1_2_Int))) (and (<= .cse0 .cse1) (<= .cse2 c_gotoProc_hhv_INV_MAIN_1_4_Int) (<= c_gotoProc_hhv_INV_MAIN_1_4_Int .cse2) (<= .cse1 .cse0) (not (= (* 8 v_gotoProc_hhv_INV_MAIN_1_2_Int_123) (+ c_gotoProc_hhv_INV_MAIN_1_5_Int (* 8 v_gotoProc_hbv_INV_MAIN_1_2_Int_126) (* 14 c_gotoProc_hhv_INV_MAIN_1_0_Int) c_gotoProc_hhv_INV_MAIN_1_3_Int (* 7 c_gotoProc_hhv_INV_MAIN_1_2_Int) 7)))))) is different from true Received shutdown request... [2018-06-24 21:41:59,902 INFO ]: Timeout while computing interpolants [2018-06-24 21:42:00,102 WARN ]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:00,102 WARN ]: Verification canceled [2018-06-24 21:42:00,104 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:42:00,105 WARN ]: Timeout [2018-06-24 21:42:00,105 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:42:00 BasicIcfg [2018-06-24 21:42:00,105 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:42:00,106 INFO ]: Toolchain (without parser) took 74260.66 ms. Allocated memory was 308.8 MB in the beginning and 564.1 MB in the end (delta: 255.3 MB). Free memory was 265.3 MB in the beginning and 447.8 MB in the end (delta: -182.5 MB). Peak memory consumption was 72.9 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:00,106 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:42:00,107 INFO ]: ChcToBoogie took 60.32 ms. Allocated memory is still 308.8 MB. Free memory was 265.3 MB in the beginning and 263.3 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:42:00,107 INFO ]: Boogie Preprocessor took 37.35 ms. Allocated memory is still 308.8 MB. Free memory was 263.3 MB in the beginning and 262.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:00,107 INFO ]: RCFGBuilder took 179.50 ms. Allocated memory is still 308.8 MB. Free memory was 262.3 MB in the beginning and 254.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:00,107 INFO ]: BlockEncodingV2 took 105.98 ms. Allocated memory is still 308.8 MB. Free memory was 254.3 MB in the beginning and 251.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:00,108 INFO ]: TraceAbstraction took 73852.71 ms. Allocated memory was 308.8 MB in the beginning and 564.1 MB in the end (delta: 255.3 MB). Free memory was 251.3 MB in the beginning and 447.8 MB in the end (delta: -196.5 MB). Peak memory consumption was 58.8 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:00,110 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 12 edges - StatisticsResult: Encoded RCFG 6 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.32 ms. Allocated memory is still 308.8 MB. Free memory was 265.3 MB in the beginning and 263.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.35 ms. Allocated memory is still 308.8 MB. Free memory was 263.3 MB in the beginning and 262.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 179.50 ms. Allocated memory is still 308.8 MB. Free memory was 262.3 MB in the beginning and 254.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 105.98 ms. Allocated memory is still 308.8 MB. Free memory was 254.3 MB in the beginning and 251.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 73852.71 ms. Allocated memory was 308.8 MB in the beginning and 564.1 MB in the end (delta: 255.3 MB). Free memory was 251.3 MB in the beginning and 447.8 MB in the end (delta: -196.5 MB). Peak memory consumption was 58.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 analyzing trace of length 21 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 73.7s OverallTime, 20 OverallIterations, 14 TraceHistogramMax, 20.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 94 SDtfs, 1 SDslu, 612 SDs, 0 SdLazy, 2461 SolverSat, 61 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 122 SyntacticMatches, 4 SemanticMatches, 277 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 32.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 8 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 28.3s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 374 ConstructedInterpolants, 14 QuantifiedInterpolants, 77788 SizeOfPredicates, 79 NumberOfNonLiveVariables, 3264 ConjunctsInSsa, 2031 ConjunctsInUnsatCore, 37 InterpolantComputations, 2 PerfectInterpolantSequences, 8/1148 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/loop__barthe2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-42-00-119.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-42-00-119.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-42-00-119.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-42-00-119.csv Completed graceful shutdown