java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/loop_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:50:40,670 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:50:40,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:50:40,682 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:50:40,682 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:50:40,683 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:50:40,684 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:50:40,686 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:50:40,687 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:50:40,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:50:40,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:50:40,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:50:40,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:50:40,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:50:40,692 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:50:40,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:50:40,697 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:50:40,699 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:50:40,709 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:50:40,711 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:50:40,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:50:40,714 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:50:40,714 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:50:40,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:50:40,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:50:40,716 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:50:40,717 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:50:40,718 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:50:40,719 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:50:40,719 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:50:40,720 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:50:40,721 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:50:40,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:50:40,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:50:40,722 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:50:40,722 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:50:40,737 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:50:40,738 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:50:40,738 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:50:40,738 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:50:40,739 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:50:40,739 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:50:40,739 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:50:40,740 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:50:40,740 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:50:40,740 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:50:40,740 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:50:40,740 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:50:40,740 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:50:40,741 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:50:40,741 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:50:40,741 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:50:40,741 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:50:40,741 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:50:40,742 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:50:40,745 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:50:40,746 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:50:40,747 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:50:40,747 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:50:40,783 INFO ]: Repository-Root is: /tmp [2018-06-24 20:50:40,801 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:50:40,806 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:50:40,807 INFO ]: Initializing SmtParser... [2018-06-24 20:50:40,807 INFO ]: SmtParser initialized [2018-06-24 20:50:40,808 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/loop_merged_safe.c-1.smt2 [2018-06-24 20:50:40,809 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 20:50:40,897 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop_merged_safe.c-1.smt2 unknown [2018-06-24 20:50:41,068 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop_merged_safe.c-1.smt2 [2018-06-24 20:50:41,073 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:50:41,080 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:50:41,080 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:50:41,080 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:50:41,080 INFO ]: ChcToBoogie initialized [2018-06-24 20:50:41,083 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:50:41" (1/1) ... [2018-06-24 20:50:41,140 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:41 Unit [2018-06-24 20:50:41,140 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:50:41,141 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:50:41,141 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:50:41,141 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:50:41,161 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:41" (1/1) ... [2018-06-24 20:50:41,161 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:41" (1/1) ... [2018-06-24 20:50:41,167 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:41" (1/1) ... [2018-06-24 20:50:41,167 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:41" (1/1) ... [2018-06-24 20:50:41,171 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:41" (1/1) ... [2018-06-24 20:50:41,172 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:41" (1/1) ... [2018-06-24 20:50:41,173 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:41" (1/1) ... [2018-06-24 20:50:41,175 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:50:41,176 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:50:41,176 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:50:41,176 INFO ]: RCFGBuilder initialized [2018-06-24 20:50:41,177 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:41" (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 20:50:41,191 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:50:41,191 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:50:41,191 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:50:41,191 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:50:41,191 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:50:41,191 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 20:50:41,510 INFO ]: Using library mode [2018-06-24 20:50:41,511 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:50:41 BoogieIcfgContainer [2018-06-24 20:50:41,511 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:50:41,512 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:50:41,512 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:50:41,518 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:50:41,519 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:50:41" (1/1) ... [2018-06-24 20:50:41,533 INFO ]: Initial Icfg 14 locations, 18 edges [2018-06-24 20:50:41,534 INFO ]: Using Remove infeasible edges [2018-06-24 20:50:41,535 INFO ]: Using Maximize final states [2018-06-24 20:50:41,535 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:50:41,535 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:50:41,537 INFO ]: Using Remove sink states [2018-06-24 20:50:41,538 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:50:41,538 INFO ]: Using Use SBE [2018-06-24 20:50:41,543 INFO ]: SBE split 0 edges [2018-06-24 20:50:41,547 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:50:41,549 INFO ]: 0 new accepting states [2018-06-24 20:50:41,633 INFO ]: Removed 15 edges and 5 locations by large block encoding [2018-06-24 20:50:41,635 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:50:41,636 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:50:41,637 INFO ]: 0 new accepting states [2018-06-24 20:50:41,637 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:50:41,637 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:50:41,637 INFO ]: Encoded RCFG 7 locations, 11 edges [2018-06-24 20:50:41,637 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:50:41 BasicIcfg [2018-06-24 20:50:41,638 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:50:41,638 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:50:41,639 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:50:41,641 INFO ]: TraceAbstraction initialized [2018-06-24 20:50:41,641 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:50:41" (1/4) ... [2018-06-24 20:50:41,641 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f70fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:50:41, skipping insertion in model container [2018-06-24 20:50:41,642 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:41" (2/4) ... [2018-06-24 20:50:41,642 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f70fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:50:41, skipping insertion in model container [2018-06-24 20:50:41,642 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:50:41" (3/4) ... [2018-06-24 20:50:41,642 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f70fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:50:41, skipping insertion in model container [2018-06-24 20:50:41,642 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:50:41" (4/4) ... [2018-06-24 20:50:41,645 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:50:41,653 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:50:41,660 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:50:41,696 INFO ]: Using default assertion order modulation [2018-06-24 20:50:41,696 INFO ]: Interprodecural is true [2018-06-24 20:50:41,696 INFO ]: Hoare is false [2018-06-24 20:50:41,696 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:50:41,696 INFO ]: Backedges is TWOTRACK [2018-06-24 20:50:41,696 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:50:41,696 INFO ]: Difference is false [2018-06-24 20:50:41,696 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:50:41,696 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:50:41,705 INFO ]: Start isEmpty. Operand 7 states. [2018-06-24 20:50:41,715 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:50:41,715 INFO ]: Found error trace [2018-06-24 20:50:41,716 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:50:41,716 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:41,721 INFO ]: Analyzing trace with hash 32914791, now seen corresponding path program 1 times [2018-06-24 20:50:41,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:41,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:41,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:41,761 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:41,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:41,801 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:41,858 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:41,859 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:50:41,859 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:50:41,860 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:50:41,871 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:50:41,871 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:50:41,873 INFO ]: Start difference. First operand 7 states. Second operand 3 states. [2018-06-24 20:50:41,940 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:41,940 INFO ]: Finished difference Result 8 states and 12 transitions. [2018-06-24 20:50:41,941 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:50:41,941 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:50:41,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:41,948 INFO ]: With dead ends: 8 [2018-06-24 20:50:41,948 INFO ]: Without dead ends: 7 [2018-06-24 20:50:41,949 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 20:50:41,963 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 20:50:41,982 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 20:50:41,984 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 20:50:41,984 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-06-24 20:50:41,985 INFO ]: Start accepts. Automaton has 7 states and 10 transitions. Word has length 5 [2018-06-24 20:50:41,985 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:41,985 INFO ]: Abstraction has 7 states and 10 transitions. [2018-06-24 20:50:41,985 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:50:41,985 INFO ]: Start isEmpty. Operand 7 states and 10 transitions. [2018-06-24 20:50:41,986 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:50:41,986 INFO ]: Found error trace [2018-06-24 20:50:41,986 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:50:41,986 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:41,987 INFO ]: Analyzing trace with hash 32975334, now seen corresponding path program 1 times [2018-06-24 20:50:41,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:41,987 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:41,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:41,987 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:41,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:41,998 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:42,071 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:42,071 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:50:42,071 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:50:42,072 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:50:42,072 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:50:42,072 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:50:42,073 INFO ]: Start difference. First operand 7 states and 10 transitions. Second operand 3 states. [2018-06-24 20:50:42,159 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:42,159 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-24 20:50:42,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:50:42,160 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:50:42,160 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:42,162 INFO ]: With dead ends: 10 [2018-06-24 20:50:42,162 INFO ]: Without dead ends: 10 [2018-06-24 20:50:42,163 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 20:50:42,163 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:50:42,166 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-24 20:50:42,166 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:50:42,166 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-24 20:50:42,167 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 5 [2018-06-24 20:50:42,167 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:42,167 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-24 20:50:42,167 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:50:42,167 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-24 20:50:42,167 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:50:42,167 INFO ]: Found error trace [2018-06-24 20:50:42,167 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:50:42,167 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:42,167 INFO ]: Analyzing trace with hash 33034916, now seen corresponding path program 1 times [2018-06-24 20:50:42,167 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:42,167 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:42,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:42,168 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:42,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:42,194 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:42,436 WARN ]: Spent 178.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-06-24 20:50:42,437 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:42,437 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:50:42,437 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:50:42,437 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:50:42,437 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:50:42,437 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:50:42,438 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 3 states. [2018-06-24 20:50:42,495 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:42,495 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-24 20:50:42,495 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:50:42,495 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:50:42,495 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:42,495 INFO ]: With dead ends: 10 [2018-06-24 20:50:42,496 INFO ]: Without dead ends: 10 [2018-06-24 20:50:42,496 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:50:42,496 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:50:42,497 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 7. [2018-06-24 20:50:42,497 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 20:50:42,498 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-06-24 20:50:42,498 INFO ]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 5 [2018-06-24 20:50:42,498 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:42,498 INFO ]: Abstraction has 7 states and 9 transitions. [2018-06-24 20:50:42,498 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:50:42,498 INFO ]: Start isEmpty. Operand 7 states and 9 transitions. [2018-06-24 20:50:42,498 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:50:42,498 INFO ]: Found error trace [2018-06-24 20:50:42,498 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:50:42,498 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:42,498 INFO ]: Analyzing trace with hash 1021469544, now seen corresponding path program 1 times [2018-06-24 20:50:42,498 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:42,498 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:42,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:42,499 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:42,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:42,512 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:42,635 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:42,635 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:50:42,635 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:50:42,636 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:50:42,636 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:50:42,636 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:50:42,636 INFO ]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2018-06-24 20:50:42,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:42,737 INFO ]: Finished difference Result 9 states and 12 transitions. [2018-06-24 20:50:42,737 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:50:42,737 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:50:42,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:42,738 INFO ]: With dead ends: 9 [2018-06-24 20:50:42,738 INFO ]: Without dead ends: 8 [2018-06-24 20:50:42,738 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:50:42,738 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:50:42,739 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:50:42,739 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:50:42,739 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-06-24 20:50:42,739 INFO ]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 6 [2018-06-24 20:50:42,740 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:42,740 INFO ]: Abstraction has 8 states and 10 transitions. [2018-06-24 20:50:42,740 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:50:42,740 INFO ]: Start isEmpty. Operand 8 states and 10 transitions. [2018-06-24 20:50:42,740 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:50:42,740 INFO ]: Found error trace [2018-06-24 20:50:42,740 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:50:42,740 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:42,740 INFO ]: Analyzing trace with hash 1023316586, now seen corresponding path program 1 times [2018-06-24 20:50:42,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:42,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:42,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:42,741 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:42,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:42,757 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:42,812 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:42,812 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:50:42,812 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:50:42,812 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:50:42,812 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:50:42,813 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:50:42,813 INFO ]: Start difference. First operand 8 states and 10 transitions. Second operand 4 states. [2018-06-24 20:50:42,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:42,882 INFO ]: Finished difference Result 10 states and 13 transitions. [2018-06-24 20:50:42,882 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:50:42,882 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:50:42,882 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:42,882 INFO ]: With dead ends: 10 [2018-06-24 20:50:42,882 INFO ]: Without dead ends: 8 [2018-06-24 20:50:42,883 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:50:42,883 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:50:42,884 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:50:42,884 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:50:42,884 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-06-24 20:50:42,884 INFO ]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-06-24 20:50:42,884 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:42,884 INFO ]: Abstraction has 8 states and 9 transitions. [2018-06-24 20:50:42,884 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:50:42,884 INFO ]: Start isEmpty. Operand 8 states and 9 transitions. [2018-06-24 20:50:42,884 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:50:42,884 INFO ]: Found error trace [2018-06-24 20:50:42,884 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:42,884 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:42,885 INFO ]: Analyzing trace with hash 1619442714, now seen corresponding path program 1 times [2018-06-24 20:50:42,885 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:42,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:42,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:42,886 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:42,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:42,897 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:43,012 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:43,012 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:43,012 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 20:50:43,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:43,044 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:43,050 INFO ]: Computing forward predicates... [2018-06-24 20:50:43,084 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:43,104 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:43,104 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:50:43,104 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:50:43,105 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:50:43,105 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:50:43,105 INFO ]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2018-06-24 20:50:43,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:43,288 INFO ]: Finished difference Result 12 states and 15 transitions. [2018-06-24 20:50:43,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:50:43,289 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:50:43,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:43,289 INFO ]: With dead ends: 12 [2018-06-24 20:50:43,289 INFO ]: Without dead ends: 12 [2018-06-24 20:50:43,289 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:50:43,289 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:50:43,291 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-24 20:50:43,291 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:50:43,291 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-24 20:50:43,291 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2018-06-24 20:50:43,291 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:43,291 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-24 20:50:43,291 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:50:43,291 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-24 20:50:43,292 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:50:43,292 INFO ]: Found error trace [2018-06-24 20:50:43,292 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:43,292 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:43,292 INFO ]: Analyzing trace with hash -1337321527, now seen corresponding path program 1 times [2018-06-24 20:50:43,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:43,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:43,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:43,293 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:43,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:43,306 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:43,597 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:43,597 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:43,597 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 20:50:43,613 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:43,653 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:43,655 INFO ]: Computing forward predicates... [2018-06-24 20:50:43,786 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:43,806 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:43,806 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 20:50:43,806 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:50:43,806 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:50:43,807 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:50:43,807 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 7 states. [2018-06-24 20:50:43,947 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:43,947 INFO ]: Finished difference Result 11 states and 13 transitions. [2018-06-24 20:50:43,948 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:50:43,948 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 20:50:43,948 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:43,949 INFO ]: With dead ends: 11 [2018-06-24 20:50:43,949 INFO ]: Without dead ends: 9 [2018-06-24 20:50:43,949 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:50:43,949 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:50:43,950 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:50:43,950 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:50:43,950 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-06-24 20:50:43,950 INFO ]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2018-06-24 20:50:43,951 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:43,951 INFO ]: Abstraction has 9 states and 10 transitions. [2018-06-24 20:50:43,951 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:50:43,951 INFO ]: Start isEmpty. Operand 9 states and 10 transitions. [2018-06-24 20:50:43,951 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:50:43,951 INFO ]: Found error trace [2018-06-24 20:50:43,951 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:43,951 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:43,951 INFO ]: Analyzing trace with hash -1318225496, now seen corresponding path program 2 times [2018-06-24 20:50:43,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:43,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:43,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:43,952 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:43,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:43,974 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:44,273 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:44,273 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:50:44,273 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:50:44,274 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:50:44,274 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:50:44,274 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:50:44,274 INFO ]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-06-24 20:50:44,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:44,364 INFO ]: Finished difference Result 10 states and 11 transitions. [2018-06-24 20:50:44,365 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:50:44,365 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 20:50:44,365 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:44,365 INFO ]: With dead ends: 10 [2018-06-24 20:50:44,365 INFO ]: Without dead ends: 10 [2018-06-24 20:50:44,365 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:50:44,365 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:50:44,366 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:50:44,366 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:50:44,367 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-06-24 20:50:44,367 INFO ]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-06-24 20:50:44,367 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:44,367 INFO ]: Abstraction has 10 states and 11 transitions. [2018-06-24 20:50:44,367 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:50:44,367 INFO ]: Start isEmpty. Operand 10 states and 11 transitions. [2018-06-24 20:50:44,367 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:50:44,367 INFO ]: Found error trace [2018-06-24 20:50:44,367 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:44,367 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:44,367 INFO ]: Analyzing trace with hash 2084244475, now seen corresponding path program 2 times [2018-06-24 20:50:44,367 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:44,367 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:44,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:44,368 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:44,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:44,383 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:44,559 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:44,559 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:44,559 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 20:50:44,566 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:50:44,593 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:50:44,593 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:44,596 INFO ]: Computing forward predicates... [2018-06-24 20:50:44,774 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:44,794 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:44,794 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-24 20:50:44,794 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:50:44,795 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:50:44,795 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:50:44,795 INFO ]: Start difference. First operand 10 states and 11 transitions. Second operand 10 states. [2018-06-24 20:50:44,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:44,885 INFO ]: Finished difference Result 15 states and 18 transitions. [2018-06-24 20:50:44,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:50:44,886 INFO ]: Start accepts. Automaton has 10 states. Word has length 9 [2018-06-24 20:50:44,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:44,887 INFO ]: With dead ends: 15 [2018-06-24 20:50:44,887 INFO ]: Without dead ends: 15 [2018-06-24 20:50:44,887 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:50:44,887 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:50:44,889 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-24 20:50:44,889 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:50:44,890 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-06-24 20:50:44,890 INFO ]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-06-24 20:50:44,890 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:44,890 INFO ]: Abstraction has 12 states and 14 transitions. [2018-06-24 20:50:44,890 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:50:44,890 INFO ]: Start isEmpty. Operand 12 states and 14 transitions. [2018-06-24 20:50:44,890 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:50:44,890 INFO ]: Found error trace [2018-06-24 20:50:44,890 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:44,890 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:44,890 INFO ]: Analyzing trace with hash 186631176, now seen corresponding path program 3 times [2018-06-24 20:50:44,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:44,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:44,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:44,891 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:44,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:44,902 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:44,962 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:44,963 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:44,963 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:44,973 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:50:45,002 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:50:45,002 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:45,004 INFO ]: Computing forward predicates... [2018-06-24 20:50:45,068 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:45,088 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:45,088 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-24 20:50:45,088 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:50:45,088 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:50:45,088 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:50:45,088 INFO ]: Start difference. First operand 12 states and 14 transitions. Second operand 10 states. [2018-06-24 20:50:45,175 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:45,175 INFO ]: Finished difference Result 14 states and 16 transitions. [2018-06-24 20:50:45,176 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:50:45,176 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:50:45,176 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:45,176 INFO ]: With dead ends: 14 [2018-06-24 20:50:45,176 INFO ]: Without dead ends: 11 [2018-06-24 20:50:45,176 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:50:45,177 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:50:45,178 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:50:45,178 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:50:45,178 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-06-24 20:50:45,178 INFO ]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2018-06-24 20:50:45,178 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:45,178 INFO ]: Abstraction has 11 states and 12 transitions. [2018-06-24 20:50:45,178 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:50:45,178 INFO ]: Start isEmpty. Operand 11 states and 12 transitions. [2018-06-24 20:50:45,178 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:50:45,178 INFO ]: Found error trace [2018-06-24 20:50:45,178 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:45,179 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:45,179 INFO ]: Analyzing trace with hash 778608137, now seen corresponding path program 4 times [2018-06-24 20:50:45,179 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:45,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:45,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:45,179 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:45,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:45,190 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:45,250 INFO ]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:45,250 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:45,250 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 20:50:45,261 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:50:45,289 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:50:45,289 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:45,291 INFO ]: Computing forward predicates... [2018-06-24 20:50:45,323 INFO ]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:45,342 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:45,342 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-24 20:50:45,342 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:50:45,343 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:50:45,343 INFO ]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:50:45,343 INFO ]: Start difference. First operand 11 states and 12 transitions. Second operand 9 states. [2018-06-24 20:50:45,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:45,389 INFO ]: Finished difference Result 12 states and 13 transitions. [2018-06-24 20:50:45,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:50:45,390 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 20:50:45,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:45,390 INFO ]: With dead ends: 12 [2018-06-24 20:50:45,390 INFO ]: Without dead ends: 12 [2018-06-24 20:50:45,391 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:50:45,391 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:50:45,392 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 20:50:45,392 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:50:45,392 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-24 20:50:45,392 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-06-24 20:50:45,392 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:45,392 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-24 20:50:45,392 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:50:45,392 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-24 20:50:45,392 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:50:45,393 INFO ]: Found error trace [2018-06-24 20:50:45,393 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:45,393 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:45,393 INFO ]: Analyzing trace with hash -1633389638, now seen corresponding path program 5 times [2018-06-24 20:50:45,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:45,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:45,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:45,393 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:45,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:45,407 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:45,545 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:45,545 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:45,545 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 20:50:45,564 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:50:45,601 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:50:45,601 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:45,604 INFO ]: Computing forward predicates... [2018-06-24 20:50:45,669 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:45,689 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:45,689 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-24 20:50:45,690 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:50:45,690 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:50:45,690 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:50:45,690 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 13 states. [2018-06-24 20:50:45,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:45,797 INFO ]: Finished difference Result 18 states and 21 transitions. [2018-06-24 20:50:45,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:50:45,797 INFO ]: Start accepts. Automaton has 13 states. Word has length 11 [2018-06-24 20:50:45,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:45,797 INFO ]: With dead ends: 18 [2018-06-24 20:50:45,797 INFO ]: Without dead ends: 18 [2018-06-24 20:50:45,798 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:50:45,798 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:50:45,799 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-06-24 20:50:45,799 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:50:45,800 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-24 20:50:45,800 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-06-24 20:50:45,800 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:45,800 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-24 20:50:45,800 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:50:45,800 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-24 20:50:45,800 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:50:45,800 INFO ]: Found error trace [2018-06-24 20:50:45,800 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:45,800 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:45,800 INFO ]: Analyzing trace with hash 904090665, now seen corresponding path program 6 times [2018-06-24 20:50:45,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:45,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:45,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:45,801 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:45,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:45,812 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:45,949 INFO ]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:45,949 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:45,949 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 20:50:45,956 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:50:46,014 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:50:46,014 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:46,016 INFO ]: Computing forward predicates... [2018-06-24 20:50:46,172 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:46,191 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:46,191 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-24 20:50:46,191 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:50:46,191 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:50:46,192 INFO ]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:50:46,192 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 13 states. [2018-06-24 20:50:46,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:46,247 INFO ]: Finished difference Result 17 states and 19 transitions. [2018-06-24 20:50:46,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:50:46,248 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-24 20:50:46,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:46,248 INFO ]: With dead ends: 17 [2018-06-24 20:50:46,248 INFO ]: Without dead ends: 13 [2018-06-24 20:50:46,249 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:50:46,249 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:50:46,250 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:50:46,250 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:50:46,250 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-24 20:50:46,250 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2018-06-24 20:50:46,250 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:46,250 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-24 20:50:46,250 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:50:46,250 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-24 20:50:46,251 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:50:46,251 INFO ]: Found error trace [2018-06-24 20:50:46,251 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:46,251 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:46,251 INFO ]: Analyzing trace with hash 2075507272, now seen corresponding path program 7 times [2018-06-24 20:50:46,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:46,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:46,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:46,251 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:46,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:46,261 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:46,392 INFO ]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:46,392 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:46,392 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:50:46,407 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:46,430 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:46,432 INFO ]: Computing forward predicates... [2018-06-24 20:50:46,499 INFO ]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:46,522 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:46,522 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-24 20:50:46,522 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:50:46,522 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:50:46,522 INFO ]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:50:46,523 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 12 states. [2018-06-24 20:50:46,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:46,576 INFO ]: Finished difference Result 14 states and 15 transitions. [2018-06-24 20:50:46,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:50:46,576 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-24 20:50:46,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:46,577 INFO ]: With dead ends: 14 [2018-06-24 20:50:46,577 INFO ]: Without dead ends: 14 [2018-06-24 20:50:46,577 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:50:46,577 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:50:46,578 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:50:46,578 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:50:46,579 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-24 20:50:46,579 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-06-24 20:50:46,579 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:46,579 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-24 20:50:46,579 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:50:46,579 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-24 20:50:46,579 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:50:46,579 INFO ]: Found error trace [2018-06-24 20:50:46,579 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:46,579 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:46,579 INFO ]: Analyzing trace with hash -84222117, now seen corresponding path program 8 times [2018-06-24 20:50:46,579 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:46,579 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:46,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:46,580 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:46,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:46,593 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:46,988 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:46,988 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:46,988 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 20:50:46,995 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:50:47,025 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:50:47,025 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:47,027 INFO ]: Computing forward predicates... [2018-06-24 20:50:47,126 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:47,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:47,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-24 20:50:47,145 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:50:47,145 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:50:47,145 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:50:47,145 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 16 states. [2018-06-24 20:50:47,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:47,503 INFO ]: Finished difference Result 21 states and 24 transitions. [2018-06-24 20:50:47,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:50:47,504 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-24 20:50:47,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:47,504 INFO ]: With dead ends: 21 [2018-06-24 20:50:47,504 INFO ]: Without dead ends: 21 [2018-06-24 20:50:47,504 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:50:47,504 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:50:47,506 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-06-24 20:50:47,506 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:50:47,506 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-24 20:50:47,506 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-06-24 20:50:47,506 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:47,506 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-24 20:50:47,506 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:50:47,506 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-24 20:50:47,507 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:50:47,507 INFO ]: Found error trace [2018-06-24 20:50:47,507 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:47,507 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:47,507 INFO ]: Analyzing trace with hash 1683643560, now seen corresponding path program 9 times [2018-06-24 20:50:47,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:47,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:47,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:47,508 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:47,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:47,518 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:47,665 INFO ]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:47,665 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:47,692 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 20:50:47,699 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:50:47,748 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:50:47,748 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:47,751 INFO ]: Computing forward predicates... [2018-06-24 20:50:47,813 INFO ]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:47,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:47,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-06-24 20:50:47,833 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:50:47,833 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:50:47,833 INFO ]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:50:47,833 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 16 states. [2018-06-24 20:50:47,907 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:47,907 INFO ]: Finished difference Result 20 states and 22 transitions. [2018-06-24 20:50:47,908 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:50:47,908 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-24 20:50:47,908 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:47,908 INFO ]: With dead ends: 20 [2018-06-24 20:50:47,908 INFO ]: Without dead ends: 15 [2018-06-24 20:50:47,909 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:50:47,909 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:50:47,910 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 20:50:47,910 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:50:47,911 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-24 20:50:47,911 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2018-06-24 20:50:47,911 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:47,911 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-24 20:50:47,911 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:50:47,911 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-24 20:50:47,911 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:50:47,911 INFO ]: Found error trace [2018-06-24 20:50:47,911 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:47,911 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:47,911 INFO ]: Analyzing trace with hash -657147287, now seen corresponding path program 10 times [2018-06-24 20:50:47,911 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:47,911 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:47,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:47,912 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:47,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:47,922 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:48,130 INFO ]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:48,130 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:48,130 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 20:50:48,136 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:50:48,161 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:50:48,161 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:48,163 INFO ]: Computing forward predicates... [2018-06-24 20:50:48,230 INFO ]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:48,262 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:48,262 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-24 20:50:48,263 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:50:48,263 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:50:48,263 INFO ]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:50:48,263 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 15 states. [2018-06-24 20:50:48,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:48,359 INFO ]: Finished difference Result 16 states and 17 transitions. [2018-06-24 20:50:48,360 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:50:48,360 INFO ]: Start accepts. Automaton has 15 states. Word has length 14 [2018-06-24 20:50:48,360 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:48,361 INFO ]: With dead ends: 16 [2018-06-24 20:50:48,361 INFO ]: Without dead ends: 16 [2018-06-24 20:50:48,361 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:50:48,361 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:50:48,362 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:50:48,362 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:50:48,363 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-24 20:50:48,363 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-06-24 20:50:48,363 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:48,363 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-24 20:50:48,363 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:50:48,363 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-24 20:50:48,363 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:50:48,363 INFO ]: Found error trace [2018-06-24 20:50:48,363 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:48,363 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:48,363 INFO ]: Analyzing trace with hash 1102832474, now seen corresponding path program 11 times [2018-06-24 20:50:48,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:48,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:48,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:48,364 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:48,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:48,377 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:48,784 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:48,784 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:48,784 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 20:50:48,789 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:50:48,820 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:50:48,820 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:48,823 INFO ]: Computing forward predicates... [2018-06-24 20:50:48,960 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:48,979 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:48,979 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-06-24 20:50:48,979 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:50:48,980 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:50:48,980 INFO ]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:50:48,980 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 19 states. [2018-06-24 20:50:49,157 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:49,157 INFO ]: Finished difference Result 24 states and 27 transitions. [2018-06-24 20:50:49,157 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:50:49,157 INFO ]: Start accepts. Automaton has 19 states. Word has length 15 [2018-06-24 20:50:49,157 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:49,157 INFO ]: With dead ends: 24 [2018-06-24 20:50:49,157 INFO ]: Without dead ends: 24 [2018-06-24 20:50:49,158 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:50:49,158 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:50:49,159 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 18. [2018-06-24 20:50:49,159 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:50:49,160 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-24 20:50:49,160 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-06-24 20:50:49,160 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:49,160 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-24 20:50:49,160 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:50:49,160 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-24 20:50:49,160 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:50:49,160 INFO ]: Found error trace [2018-06-24 20:50:49,160 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:49,161 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:49,161 INFO ]: Analyzing trace with hash -172369783, now seen corresponding path program 12 times [2018-06-24 20:50:49,161 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:49,161 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:49,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:49,161 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:49,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:49,171 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:49,327 INFO ]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:49,328 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:49,328 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 20:50:49,335 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:50:49,364 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:50:49,364 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:49,366 INFO ]: Computing forward predicates... [2018-06-24 20:50:49,796 INFO ]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:49,816 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:49,816 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2018-06-24 20:50:49,816 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:50:49,816 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:50:49,816 INFO ]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:50:49,817 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 19 states. [2018-06-24 20:50:49,909 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:49,909 INFO ]: Finished difference Result 23 states and 25 transitions. [2018-06-24 20:50:49,910 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:50:49,910 INFO ]: Start accepts. Automaton has 19 states. Word has length 16 [2018-06-24 20:50:49,911 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:49,911 INFO ]: With dead ends: 23 [2018-06-24 20:50:49,911 INFO ]: Without dead ends: 17 [2018-06-24 20:50:49,911 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:50:49,911 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:50:49,912 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:50:49,912 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:50:49,913 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-24 20:50:49,913 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2018-06-24 20:50:49,913 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:49,913 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-24 20:50:49,913 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:50:49,913 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-24 20:50:49,914 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:50:49,914 INFO ]: Found error trace [2018-06-24 20:50:49,914 INFO ]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:49,914 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:49,914 INFO ]: Analyzing trace with hash 277557992, now seen corresponding path program 13 times [2018-06-24 20:50:49,914 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:49,914 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:49,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:49,915 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:49,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:49,925 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:50,136 INFO ]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:50,136 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:50,136 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 20:50:50,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:50,169 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:50,172 INFO ]: Computing forward predicates... [2018-06-24 20:50:50,252 INFO ]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:50,271 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:50,271 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-24 20:50:50,271 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:50:50,272 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:50:50,272 INFO ]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:50:50,272 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 18 states. [2018-06-24 20:50:50,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:50,486 INFO ]: Finished difference Result 18 states and 19 transitions. [2018-06-24 20:50:50,487 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:50:50,487 INFO ]: Start accepts. Automaton has 18 states. Word has length 16 [2018-06-24 20:50:50,487 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:50,487 INFO ]: With dead ends: 18 [2018-06-24 20:50:50,487 INFO ]: Without dead ends: 18 [2018-06-24 20:50:50,488 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:50:50,488 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:50:50,489 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 20:50:50,489 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:50:50,490 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-24 20:50:50,490 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-06-24 20:50:50,490 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:50,490 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-24 20:50:50,490 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:50:50,490 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-24 20:50:50,490 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:50:50,490 INFO ]: Found error trace [2018-06-24 20:50:50,490 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:50,490 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:50,490 INFO ]: Analyzing trace with hash 13925051, now seen corresponding path program 14 times [2018-06-24 20:50:50,490 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:50,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:50,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:50,491 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:50,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:50,506 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:50,804 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:50,804 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:50,804 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 20:50:50,810 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:50:50,842 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:50:50,842 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:50,845 INFO ]: Computing forward predicates... [2018-06-24 20:50:50,983 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:51,002 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:51,002 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-06-24 20:50:51,002 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:50:51,002 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:50:51,002 INFO ]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:50:51,002 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 22 states. [2018-06-24 20:50:51,217 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:51,217 INFO ]: Finished difference Result 27 states and 30 transitions. [2018-06-24 20:50:51,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:50:51,217 INFO ]: Start accepts. Automaton has 22 states. Word has length 17 [2018-06-24 20:50:51,218 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:51,218 INFO ]: With dead ends: 27 [2018-06-24 20:50:51,218 INFO ]: Without dead ends: 27 [2018-06-24 20:50:51,219 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:50:51,219 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:50:51,220 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-06-24 20:50:51,220 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:50:51,221 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-06-24 20:50:51,221 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-06-24 20:50:51,221 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:51,221 INFO ]: Abstraction has 20 states and 22 transitions. [2018-06-24 20:50:51,221 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:50:51,221 INFO ]: Start isEmpty. Operand 20 states and 22 transitions. [2018-06-24 20:50:51,221 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:50:51,221 INFO ]: Found error trace [2018-06-24 20:50:51,221 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:51,221 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:51,221 INFO ]: Analyzing trace with hash 431238472, now seen corresponding path program 15 times [2018-06-24 20:50:51,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:51,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:51,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:51,222 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:51,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:51,232 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:51,580 INFO ]: Checked inductivity of 42 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:51,580 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:51,580 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 20:50:51,585 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:50:51,622 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:50:51,622 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:51,625 INFO ]: Computing forward predicates... [2018-06-24 20:50:51,721 INFO ]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:51,740 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:51,740 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22 [2018-06-24 20:50:51,740 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:50:51,740 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:50:51,740 INFO ]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:50:51,740 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 22 states. [2018-06-24 20:50:51,924 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:51,924 INFO ]: Finished difference Result 26 states and 28 transitions. [2018-06-24 20:50:51,925 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:50:51,925 INFO ]: Start accepts. Automaton has 22 states. Word has length 18 [2018-06-24 20:50:51,925 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:51,925 INFO ]: With dead ends: 26 [2018-06-24 20:50:51,925 INFO ]: Without dead ends: 19 [2018-06-24 20:50:51,926 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:50:51,926 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:50:51,927 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 20:50:51,927 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:50:51,927 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-24 20:50:51,927 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2018-06-24 20:50:51,927 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:51,927 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-24 20:50:51,927 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:50:51,928 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-24 20:50:51,928 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:50:51,928 INFO ]: Found error trace [2018-06-24 20:50:51,928 INFO ]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:51,928 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:51,928 INFO ]: Analyzing trace with hash 1494097609, now seen corresponding path program 16 times [2018-06-24 20:50:51,928 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:51,928 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:51,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:51,929 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:51,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:51,939 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:52,446 INFO ]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:52,446 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:52,446 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 20:50:52,452 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:50:52,510 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:50:52,510 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:52,513 INFO ]: Computing forward predicates... [2018-06-24 20:50:52,605 INFO ]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:52,624 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:52,624 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-06-24 20:50:52,624 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:50:52,624 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:50:52,624 INFO ]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:50:52,624 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 21 states. [2018-06-24 20:50:52,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:52,729 INFO ]: Finished difference Result 20 states and 21 transitions. [2018-06-24 20:50:52,775 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:50:52,775 INFO ]: Start accepts. Automaton has 21 states. Word has length 18 [2018-06-24 20:50:52,775 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:52,775 INFO ]: With dead ends: 20 [2018-06-24 20:50:52,775 INFO ]: Without dead ends: 20 [2018-06-24 20:50:52,776 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=480, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:50:52,776 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:50:52,777 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 20:50:52,777 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:50:52,777 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-24 20:50:52,777 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-06-24 20:50:52,778 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:52,778 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-24 20:50:52,778 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:50:52,778 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-24 20:50:52,778 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:50:52,778 INFO ]: Found error trace [2018-06-24 20:50:52,778 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:52,778 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:52,778 INFO ]: Analyzing trace with hash -928052486, now seen corresponding path program 17 times [2018-06-24 20:50:52,778 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:52,778 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:52,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:52,779 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:52,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:52,792 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:53,064 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:53,064 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:53,064 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 20:50:53,077 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:50:53,122 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 20:50:53,122 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:53,126 INFO ]: Computing forward predicates... [2018-06-24 20:50:53,298 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:53,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:53,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-24 20:50:53,317 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:50:53,318 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:50:53,318 INFO ]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:50:53,318 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 25 states. [2018-06-24 20:50:53,583 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:53,584 INFO ]: Finished difference Result 30 states and 33 transitions. [2018-06-24 20:50:53,584 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:50:53,584 INFO ]: Start accepts. Automaton has 25 states. Word has length 19 [2018-06-24 20:50:53,584 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:53,584 INFO ]: With dead ends: 30 [2018-06-24 20:50:53,584 INFO ]: Without dead ends: 30 [2018-06-24 20:50:53,584 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:50:53,584 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:50:53,586 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 22. [2018-06-24 20:50:53,586 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:50:53,587 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-06-24 20:50:53,587 INFO ]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-06-24 20:50:53,587 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:53,587 INFO ]: Abstraction has 22 states and 24 transitions. [2018-06-24 20:50:53,587 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:50:53,587 INFO ]: Start isEmpty. Operand 22 states and 24 transitions. [2018-06-24 20:50:53,587 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:50:53,587 INFO ]: Found error trace [2018-06-24 20:50:53,587 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:53,587 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:53,587 INFO ]: Analyzing trace with hash 1294705897, now seen corresponding path program 18 times [2018-06-24 20:50:53,587 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:53,587 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:53,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:53,588 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:53,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:53,602 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:54,544 INFO ]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:54,544 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:54,544 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 20:50:54,555 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:50:54,601 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:50:54,601 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:54,604 INFO ]: Computing forward predicates... [2018-06-24 20:50:54,761 INFO ]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:54,780 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:54,780 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25 [2018-06-24 20:50:54,780 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:50:54,780 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:50:54,780 INFO ]: CoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:50:54,780 INFO ]: Start difference. First operand 22 states and 24 transitions. Second operand 25 states. [2018-06-24 20:50:54,937 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:54,937 INFO ]: Finished difference Result 29 states and 31 transitions. [2018-06-24 20:50:54,937 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:50:54,937 INFO ]: Start accepts. Automaton has 25 states. Word has length 20 [2018-06-24 20:50:54,937 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:54,938 INFO ]: With dead ends: 29 [2018-06-24 20:50:54,938 INFO ]: Without dead ends: 21 [2018-06-24 20:50:54,938 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:50:54,938 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:50:54,939 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 20:50:54,939 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:50:54,940 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-24 20:50:54,940 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2018-06-24 20:50:54,940 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:54,940 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-24 20:50:54,940 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:50:54,940 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-24 20:50:54,940 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:50:54,940 INFO ]: Found error trace [2018-06-24 20:50:54,940 INFO ]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:54,940 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:54,940 INFO ]: Analyzing trace with hash -116399224, now seen corresponding path program 19 times [2018-06-24 20:50:54,940 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:54,940 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:54,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:54,941 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:54,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:54,952 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:55,318 INFO ]: Checked inductivity of 57 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:55,318 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:55,318 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:55,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:55,359 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:55,362 INFO ]: Computing forward predicates... [2018-06-24 20:50:55,569 INFO ]: Checked inductivity of 57 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:55,588 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:55,588 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-06-24 20:50:55,588 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:50:55,588 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:50:55,588 INFO ]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:50:55,589 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 24 states. [2018-06-24 20:50:55,912 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:55,912 INFO ]: Finished difference Result 22 states and 23 transitions. [2018-06-24 20:50:55,914 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:50:55,914 INFO ]: Start accepts. Automaton has 24 states. Word has length 20 [2018-06-24 20:50:55,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:55,914 INFO ]: With dead ends: 22 [2018-06-24 20:50:55,914 INFO ]: Without dead ends: 22 [2018-06-24 20:50:55,914 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=290, Invalid=640, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:50:55,914 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:50:55,916 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-24 20:50:55,916 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:50:55,916 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-06-24 20:50:55,916 INFO ]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-06-24 20:50:55,916 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:55,916 INFO ]: Abstraction has 22 states and 23 transitions. [2018-06-24 20:50:55,916 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:50:55,916 INFO ]: Start isEmpty. Operand 22 states and 23 transitions. [2018-06-24 20:50:55,917 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:50:55,917 INFO ]: Found error trace [2018-06-24 20:50:55,917 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:55,917 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:55,917 INFO ]: Analyzing trace with hash 686153243, now seen corresponding path program 20 times [2018-06-24 20:50:55,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:55,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:55,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:55,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:55,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:55,933 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:56,288 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:56,288 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:56,288 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:56,293 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:50:56,334 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:50:56,335 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:56,339 INFO ]: Computing forward predicates... [2018-06-24 20:50:56,532 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:56,555 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:56,555 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-24 20:50:56,555 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:50:56,555 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:50:56,555 INFO ]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:50:56,555 INFO ]: Start difference. First operand 22 states and 23 transitions. Second operand 28 states. [2018-06-24 20:50:57,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:57,154 INFO ]: Finished difference Result 33 states and 36 transitions. [2018-06-24 20:50:57,154 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:50:57,154 INFO ]: Start accepts. Automaton has 28 states. Word has length 21 [2018-06-24 20:50:57,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:57,155 INFO ]: With dead ends: 33 [2018-06-24 20:50:57,155 INFO ]: Without dead ends: 33 [2018-06-24 20:50:57,155 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=1254, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:50:57,155 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:50:57,157 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-06-24 20:50:57,157 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:50:57,157 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-24 20:50:57,157 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-06-24 20:50:57,158 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:57,158 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-24 20:50:57,158 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:50:57,158 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-24 20:50:57,158 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:50:57,158 INFO ]: Found error trace [2018-06-24 20:50:57,158 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:57,158 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:57,158 INFO ]: Analyzing trace with hash -204524056, now seen corresponding path program 21 times [2018-06-24 20:50:57,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:57,158 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:57,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:57,159 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:57,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:57,173 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:57,503 INFO ]: Checked inductivity of 72 backedges. 21 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:57,503 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:57,503 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:57,510 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:50:57,560 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:50:57,560 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:57,562 INFO ]: Computing forward predicates... [2018-06-24 20:50:58,188 INFO ]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:58,207 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:58,207 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2018-06-24 20:50:58,207 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:50:58,207 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:50:58,208 INFO ]: CoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:50:58,208 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 28 states. [2018-06-24 20:50:58,405 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:58,405 INFO ]: Finished difference Result 32 states and 34 transitions. [2018-06-24 20:50:58,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:50:58,407 INFO ]: Start accepts. Automaton has 28 states. Word has length 22 [2018-06-24 20:50:58,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:58,407 INFO ]: With dead ends: 32 [2018-06-24 20:50:58,407 INFO ]: Without dead ends: 23 [2018-06-24 20:50:58,407 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=326, Invalid=1006, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:50:58,407 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:50:58,409 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 20:50:58,409 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:50:58,409 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-24 20:50:58,409 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2018-06-24 20:50:58,409 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:58,409 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-24 20:50:58,409 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:50:58,409 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-24 20:50:58,409 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:50:58,409 INFO ]: Found error trace [2018-06-24 20:50:58,409 INFO ]: trace histogram [9, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:58,410 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:58,410 INFO ]: Analyzing trace with hash -999109847, now seen corresponding path program 22 times [2018-06-24 20:50:58,410 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:58,410 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:58,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:58,410 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:58,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:58,424 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:58,622 INFO ]: Checked inductivity of 73 backedges. 45 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:58,622 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:58,622 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:58,627 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:50:58,672 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:50:58,672 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:58,676 INFO ]: Computing forward predicates... [2018-06-24 20:50:59,188 INFO ]: Checked inductivity of 73 backedges. 45 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:59,207 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:59,207 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-06-24 20:50:59,207 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:50:59,207 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:50:59,208 INFO ]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:50:59,208 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 27 states. [2018-06-24 20:50:59,340 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:59,340 INFO ]: Finished difference Result 24 states and 25 transitions. [2018-06-24 20:50:59,340 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:50:59,340 INFO ]: Start accepts. Automaton has 27 states. Word has length 22 [2018-06-24 20:50:59,340 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:59,341 INFO ]: With dead ends: 24 [2018-06-24 20:50:59,341 INFO ]: Without dead ends: 24 [2018-06-24 20:50:59,341 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=367, Invalid=823, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:50:59,341 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:50:59,342 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 20:50:59,342 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:50:59,343 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-24 20:50:59,343 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-24 20:50:59,343 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:59,343 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-24 20:50:59,343 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:50:59,343 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-24 20:50:59,344 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:50:59,344 INFO ]: Found error trace [2018-06-24 20:50:59,344 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:59,344 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:59,344 INFO ]: Analyzing trace with hash -908072294, now seen corresponding path program 23 times [2018-06-24 20:50:59,344 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:59,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:59,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:59,344 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:59,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:59,359 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:59,712 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:59,712 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:59,712 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:59,718 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:50:59,763 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:50:59,763 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:59,767 INFO ]: Computing forward predicates... [2018-06-24 20:50:59,992 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:00,012 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:00,012 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-24 20:51:00,013 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:51:00,013 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:51:00,013 INFO ]: CoverageRelationStatistics Valid=69, Invalid=861, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:51:00,013 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 31 states. [2018-06-24 20:51:00,464 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:00,464 INFO ]: Finished difference Result 36 states and 39 transitions. [2018-06-24 20:51:00,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:51:00,464 INFO ]: Start accepts. Automaton has 31 states. Word has length 23 [2018-06-24 20:51:00,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:00,464 INFO ]: With dead ends: 36 [2018-06-24 20:51:00,464 INFO ]: Without dead ends: 36 [2018-06-24 20:51:00,466 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=1552, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 20:51:00,466 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:51:00,467 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 26. [2018-06-24 20:51:00,467 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:51:00,467 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-24 20:51:00,467 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-06-24 20:51:00,468 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:00,468 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-24 20:51:00,468 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:51:00,468 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-24 20:51:00,468 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:51:00,468 INFO ]: Found error trace [2018-06-24 20:51:00,468 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:00,468 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:00,468 INFO ]: Analyzing trace with hash 1914091849, now seen corresponding path program 24 times [2018-06-24 20:51:00,468 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:00,468 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:00,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:00,469 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:00,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:00,487 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:00,749 INFO ]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:00,749 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:00,749 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:00,755 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:51:00,804 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:51:00,804 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:00,807 INFO ]: Computing forward predicates... [2018-06-24 20:51:01,346 INFO ]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:01,365 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:01,365 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 31 [2018-06-24 20:51:01,366 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:51:01,366 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:51:01,366 INFO ]: CoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:51:01,366 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 31 states. [2018-06-24 20:51:01,539 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:01,539 INFO ]: Finished difference Result 35 states and 37 transitions. [2018-06-24 20:51:01,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:51:01,542 INFO ]: Start accepts. Automaton has 31 states. Word has length 24 [2018-06-24 20:51:01,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:01,542 INFO ]: With dead ends: 35 [2018-06-24 20:51:01,542 INFO ]: Without dead ends: 25 [2018-06-24 20:51:01,543 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=397, Invalid=1243, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:51:01,543 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:51:01,544 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 20:51:01,544 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:51:01,641 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-24 20:51:01,641 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2018-06-24 20:51:01,641 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:01,641 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-24 20:51:01,641 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:51:01,641 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-24 20:51:01,642 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:51:01,642 INFO ]: Found error trace [2018-06-24 20:51:01,642 INFO ]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:01,642 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:01,642 INFO ]: Analyzing trace with hash -1243231192, now seen corresponding path program 25 times [2018-06-24 20:51:01,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:01,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:01,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:01,642 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:01,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:01,653 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:01,864 INFO ]: Checked inductivity of 91 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:01,864 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:01,864 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:01,872 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:01,932 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:01,936 INFO ]: Computing forward predicates... [2018-06-24 20:51:02,256 INFO ]: Checked inductivity of 91 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:02,274 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:02,274 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2018-06-24 20:51:02,274 INFO ]: Interpolant automaton has 30 states [2018-06-24 20:51:02,275 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 20:51:02,275 INFO ]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:51:02,275 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 30 states. [2018-06-24 20:51:02,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:02,424 INFO ]: Finished difference Result 26 states and 27 transitions. [2018-06-24 20:51:02,424 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:51:02,424 INFO ]: Start accepts. Automaton has 30 states. Word has length 24 [2018-06-24 20:51:02,424 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:02,424 INFO ]: With dead ends: 26 [2018-06-24 20:51:02,424 INFO ]: Without dead ends: 26 [2018-06-24 20:51:02,425 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=453, Invalid=1029, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:51:02,425 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:51:02,427 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:51:02,427 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:51:02,428 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-24 20:51:02,428 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-06-24 20:51:02,428 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:02,428 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-24 20:51:02,428 INFO ]: Interpolant automaton has 30 states. [2018-06-24 20:51:02,428 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-24 20:51:02,428 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:51:02,428 INFO ]: Found error trace [2018-06-24 20:51:02,428 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:02,428 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:02,429 INFO ]: Analyzing trace with hash 114100603, now seen corresponding path program 26 times [2018-06-24 20:51:02,429 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:02,429 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:02,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:02,429 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:02,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:02,456 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:03,194 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:03,194 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:03,194 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:03,200 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:03,244 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:03,244 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:03,249 INFO ]: Computing forward predicates... [2018-06-24 20:51:03,564 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:03,583 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:03,583 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2018-06-24 20:51:03,583 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:51:03,583 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:51:03,584 INFO ]: CoverageRelationStatistics Valid=76, Invalid=1046, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:51:03,584 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 34 states. [2018-06-24 20:51:04,102 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:04,102 INFO ]: Finished difference Result 39 states and 42 transitions. [2018-06-24 20:51:04,102 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:51:04,102 INFO ]: Start accepts. Automaton has 34 states. Word has length 25 [2018-06-24 20:51:04,102 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:04,102 INFO ]: With dead ends: 39 [2018-06-24 20:51:04,102 INFO ]: Without dead ends: 39 [2018-06-24 20:51:04,103 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=188, Invalid=1882, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:51:04,103 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:51:04,104 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-06-24 20:51:04,104 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:51:04,105 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-24 20:51:04,105 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-06-24 20:51:04,105 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:04,105 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-24 20:51:04,105 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:51:04,105 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-24 20:51:04,105 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:51:04,105 INFO ]: Found error trace [2018-06-24 20:51:04,105 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:04,105 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:04,105 INFO ]: Analyzing trace with hash -758286712, now seen corresponding path program 27 times [2018-06-24 20:51:04,105 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:04,106 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:04,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:04,106 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:04,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:04,119 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:04,379 INFO ]: Checked inductivity of 110 backedges. 36 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:04,379 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:04,379 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:04,385 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:51:04,437 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:51:04,437 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:04,440 INFO ]: Computing forward predicates... [2018-06-24 20:51:05,273 INFO ]: Checked inductivity of 110 backedges. 55 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:05,292 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:05,292 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 34 [2018-06-24 20:51:05,292 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:51:05,293 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:51:05,293 INFO ]: CoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:51:05,293 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 34 states. [2018-06-24 20:51:05,487 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:05,487 INFO ]: Finished difference Result 38 states and 40 transitions. [2018-06-24 20:51:05,487 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:51:05,487 INFO ]: Start accepts. Automaton has 34 states. Word has length 26 [2018-06-24 20:51:05,487 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:05,488 INFO ]: With dead ends: 38 [2018-06-24 20:51:05,488 INFO ]: Without dead ends: 27 [2018-06-24 20:51:05,488 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=475, Invalid=1505, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:51:05,488 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:51:05,489 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 20:51:05,489 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:51:05,489 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-24 20:51:05,489 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2018-06-24 20:51:05,490 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:05,490 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-24 20:51:05,490 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:51:05,490 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-24 20:51:05,490 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:51:05,490 INFO ]: Found error trace [2018-06-24 20:51:05,490 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:05,490 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:05,490 INFO ]: Analyzing trace with hash 148946825, now seen corresponding path program 28 times [2018-06-24 20:51:05,490 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:05,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:05,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:05,491 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:05,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:05,504 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:06,413 INFO ]: Checked inductivity of 111 backedges. 66 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:06,413 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:06,413 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:06,426 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:51:06,473 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:51:06,473 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:06,476 INFO ]: Computing forward predicates... [2018-06-24 20:51:06,975 INFO ]: Checked inductivity of 111 backedges. 66 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:06,994 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:06,994 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2018-06-24 20:51:06,994 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:51:06,995 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:51:06,995 INFO ]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:51:06,995 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 33 states. [2018-06-24 20:51:07,200 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:07,200 INFO ]: Finished difference Result 28 states and 29 transitions. [2018-06-24 20:51:07,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:51:07,200 INFO ]: Start accepts. Automaton has 33 states. Word has length 26 [2018-06-24 20:51:07,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:07,201 INFO ]: With dead ends: 28 [2018-06-24 20:51:07,201 INFO ]: Without dead ends: 28 [2018-06-24 20:51:07,201 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=548, Invalid=1258, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:51:07,201 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:51:07,202 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-24 20:51:07,202 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:51:07,202 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-24 20:51:07,202 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-06-24 20:51:07,202 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:07,202 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-24 20:51:07,202 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:51:07,202 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-24 20:51:07,203 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:51:07,203 INFO ]: Found error trace [2018-06-24 20:51:07,203 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:07,203 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:07,203 INFO ]: Analyzing trace with hash 321946170, now seen corresponding path program 29 times [2018-06-24 20:51:07,203 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:07,203 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:07,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:07,203 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:07,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:07,218 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:07,754 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:07,754 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:07,754 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:07,759 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:51:07,810 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:51:07,811 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:07,815 INFO ]: Computing forward predicates... [2018-06-24 20:51:08,137 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:08,160 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:08,160 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2018-06-24 20:51:08,160 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:51:08,160 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:51:08,160 INFO ]: CoverageRelationStatistics Valid=83, Invalid=1249, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:51:08,160 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 37 states. [2018-06-24 20:51:08,755 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:08,755 INFO ]: Finished difference Result 42 states and 45 transitions. [2018-06-24 20:51:08,755 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:51:08,755 INFO ]: Start accepts. Automaton has 37 states. Word has length 27 [2018-06-24 20:51:08,755 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:08,755 INFO ]: With dead ends: 42 [2018-06-24 20:51:08,755 INFO ]: Without dead ends: 42 [2018-06-24 20:51:08,756 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=2244, Unknown=0, NotChecked=0, Total=2450 [2018-06-24 20:51:08,756 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 20:51:08,757 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-06-24 20:51:08,757 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:51:08,758 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-06-24 20:51:08,758 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-06-24 20:51:08,758 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:08,758 INFO ]: Abstraction has 30 states and 32 transitions. [2018-06-24 20:51:08,758 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:51:08,758 INFO ]: Start isEmpty. Operand 30 states and 32 transitions. [2018-06-24 20:51:08,758 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:51:08,758 INFO ]: Found error trace [2018-06-24 20:51:08,758 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:08,758 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:08,758 INFO ]: Analyzing trace with hash 1389958569, now seen corresponding path program 30 times [2018-06-24 20:51:08,758 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:08,758 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:08,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:08,759 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:08,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:08,775 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:09,225 INFO ]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:09,226 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:09,226 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:09,233 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:51:09,289 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:51:09,289 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:09,292 INFO ]: Computing forward predicates... [2018-06-24 20:51:09,550 INFO ]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:09,579 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:09,579 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 37 [2018-06-24 20:51:09,580 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:51:09,580 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:51:09,580 INFO ]: CoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:51:09,580 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 37 states. [2018-06-24 20:51:10,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:10,036 INFO ]: Finished difference Result 41 states and 43 transitions. [2018-06-24 20:51:10,036 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:51:10,036 INFO ]: Start accepts. Automaton has 37 states. Word has length 28 [2018-06-24 20:51:10,036 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:10,037 INFO ]: With dead ends: 41 [2018-06-24 20:51:10,037 INFO ]: Without dead ends: 29 [2018-06-24 20:51:10,037 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=560, Invalid=1792, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:51:10,037 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:51:10,038 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:51:10,038 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:51:10,039 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-24 20:51:10,039 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2018-06-24 20:51:10,039 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:10,039 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-24 20:51:10,039 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:51:10,039 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-24 20:51:10,039 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:51:10,039 INFO ]: Found error trace [2018-06-24 20:51:10,039 INFO ]: trace histogram [12, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:10,039 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:10,039 INFO ]: Analyzing trace with hash -550572856, now seen corresponding path program 31 times [2018-06-24 20:51:10,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:10,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:10,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:10,040 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:10,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:10,051 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:10,942 INFO ]: Checked inductivity of 133 backedges. 78 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:10,942 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:10,942 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:10,947 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:10,995 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:10,999 INFO ]: Computing forward predicates... [2018-06-24 20:51:11,171 INFO ]: Checked inductivity of 133 backedges. 78 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:11,190 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:11,190 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2018-06-24 20:51:11,190 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:51:11,190 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:51:11,191 INFO ]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:51:11,191 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 36 states. [2018-06-24 20:51:11,413 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:11,413 INFO ]: Finished difference Result 30 states and 31 transitions. [2018-06-24 20:51:11,413 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:51:11,413 INFO ]: Start accepts. Automaton has 36 states. Word has length 28 [2018-06-24 20:51:11,413 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:11,414 INFO ]: With dead ends: 30 [2018-06-24 20:51:11,414 INFO ]: Without dead ends: 30 [2018-06-24 20:51:11,414 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=652, Invalid=1510, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 20:51:11,414 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:51:11,415 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-24 20:51:11,415 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:51:11,415 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-24 20:51:11,415 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-24 20:51:11,415 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:11,415 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-24 20:51:11,415 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:51:11,415 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-24 20:51:11,415 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:51:11,415 INFO ]: Found error trace [2018-06-24 20:51:11,415 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:11,415 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:11,415 INFO ]: Analyzing trace with hash 111672539, now seen corresponding path program 32 times [2018-06-24 20:51:11,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:11,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:11,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:11,416 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:11,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:11,431 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:11,917 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:11,917 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:11,917 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:11,923 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:11,974 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:11,974 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:11,978 INFO ]: Computing forward predicates... [2018-06-24 20:51:12,379 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:12,398 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:12,398 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 40 [2018-06-24 20:51:12,398 INFO ]: Interpolant automaton has 40 states [2018-06-24 20:51:12,398 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 20:51:12,399 INFO ]: CoverageRelationStatistics Valid=90, Invalid=1470, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:51:12,399 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 40 states. [2018-06-24 20:51:12,982 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:12,982 INFO ]: Finished difference Result 45 states and 48 transitions. [2018-06-24 20:51:12,982 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:51:12,982 INFO ]: Start accepts. Automaton has 40 states. Word has length 29 [2018-06-24 20:51:12,982 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:12,982 INFO ]: With dead ends: 45 [2018-06-24 20:51:12,982 INFO ]: Without dead ends: 45 [2018-06-24 20:51:12,983 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=224, Invalid=2638, Unknown=0, NotChecked=0, Total=2862 [2018-06-24 20:51:12,983 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 20:51:12,984 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-06-24 20:51:12,984 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:51:12,984 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-24 20:51:12,985 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-06-24 20:51:12,985 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:12,985 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-24 20:51:12,985 INFO ]: Interpolant automaton has 40 states. [2018-06-24 20:51:12,985 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-24 20:51:12,985 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:51:12,985 INFO ]: Found error trace [2018-06-24 20:51:12,985 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:12,985 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:12,985 INFO ]: Analyzing trace with hash -833556696, now seen corresponding path program 33 times [2018-06-24 20:51:12,985 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:12,985 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:12,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:12,986 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:12,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:12,999 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:13,508 INFO ]: Checked inductivity of 156 backedges. 55 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:13,508 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:13,526 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:13,532 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:51:13,589 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:51:13,589 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:13,593 INFO ]: Computing forward predicates... [2018-06-24 20:51:13,885 INFO ]: Checked inductivity of 156 backedges. 78 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:13,904 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:13,904 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 40 [2018-06-24 20:51:13,904 INFO ]: Interpolant automaton has 40 states [2018-06-24 20:51:13,905 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 20:51:13,905 INFO ]: CoverageRelationStatistics Valid=366, Invalid=1194, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:51:13,905 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 40 states. [2018-06-24 20:51:14,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:14,149 INFO ]: Finished difference Result 44 states and 46 transitions. [2018-06-24 20:51:14,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:51:14,150 INFO ]: Start accepts. Automaton has 40 states. Word has length 30 [2018-06-24 20:51:14,150 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:14,150 INFO ]: With dead ends: 44 [2018-06-24 20:51:14,150 INFO ]: Without dead ends: 31 [2018-06-24 20:51:14,150 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=652, Invalid=2104, Unknown=0, NotChecked=0, Total=2756 [2018-06-24 20:51:14,150 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:51:14,151 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 20:51:14,151 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:51:14,151 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-24 20:51:14,151 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 30 [2018-06-24 20:51:14,151 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:14,151 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-24 20:51:14,151 INFO ]: Interpolant automaton has 40 states. [2018-06-24 20:51:14,151 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-24 20:51:14,152 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:51:14,152 INFO ]: Found error trace [2018-06-24 20:51:14,152 INFO ]: trace histogram [13, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:14,152 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:14,152 INFO ]: Analyzing trace with hash -860488727, now seen corresponding path program 34 times [2018-06-24 20:51:14,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:14,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:14,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:14,152 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:14,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:14,161 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:14,456 INFO ]: Checked inductivity of 157 backedges. 91 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:14,456 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:14,456 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:14,463 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:51:14,524 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:51:14,524 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:14,529 INFO ]: Computing forward predicates... [2018-06-24 20:51:14,739 INFO ]: Checked inductivity of 157 backedges. 91 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:14,758 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:14,758 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 39 [2018-06-24 20:51:14,758 INFO ]: Interpolant automaton has 39 states [2018-06-24 20:51:14,758 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 20:51:14,759 INFO ]: CoverageRelationStatistics Valid=363, Invalid=1119, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:51:14,759 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 39 states. [2018-06-24 20:51:15,046 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:15,046 INFO ]: Finished difference Result 32 states and 33 transitions. [2018-06-24 20:51:15,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:51:15,046 INFO ]: Start accepts. Automaton has 39 states. Word has length 30 [2018-06-24 20:51:15,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:15,046 INFO ]: With dead ends: 32 [2018-06-24 20:51:15,046 INFO ]: Without dead ends: 32 [2018-06-24 20:51:15,047 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=765, Invalid=1785, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:51:15,047 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:51:15,048 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 20:51:15,048 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:51:15,048 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-24 20:51:15,048 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-06-24 20:51:15,048 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:15,048 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-24 20:51:15,048 INFO ]: Interpolant automaton has 39 states. [2018-06-24 20:51:15,048 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-24 20:51:15,049 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:51:15,049 INFO ]: Found error trace [2018-06-24 20:51:15,049 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:15,049 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:15,049 INFO ]: Analyzing trace with hash -905784870, now seen corresponding path program 35 times [2018-06-24 20:51:15,049 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:15,049 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:15,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:15,049 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:15,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:15,062 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:15,539 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:15,539 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:15,539 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:15,544 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:51:15,606 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-24 20:51:15,606 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:15,611 INFO ]: Computing forward predicates... [2018-06-24 20:51:16,050 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:16,069 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:16,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 43 [2018-06-24 20:51:16,069 INFO ]: Interpolant automaton has 43 states [2018-06-24 20:51:16,069 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-24 20:51:16,070 INFO ]: CoverageRelationStatistics Valid=97, Invalid=1709, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:51:16,070 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 43 states. [2018-06-24 20:51:16,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:16,769 INFO ]: Finished difference Result 48 states and 51 transitions. [2018-06-24 20:51:16,769 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:51:16,769 INFO ]: Start accepts. Automaton has 43 states. Word has length 31 [2018-06-24 20:51:16,769 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:16,770 INFO ]: With dead ends: 48 [2018-06-24 20:51:16,770 INFO ]: Without dead ends: 48 [2018-06-24 20:51:16,770 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 8 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=242, Invalid=3064, Unknown=0, NotChecked=0, Total=3306 [2018-06-24 20:51:16,770 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-24 20:51:16,771 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-06-24 20:51:16,771 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:51:16,771 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-06-24 20:51:16,771 INFO ]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2018-06-24 20:51:16,771 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:16,771 INFO ]: Abstraction has 34 states and 36 transitions. [2018-06-24 20:51:16,771 INFO ]: Interpolant automaton has 43 states. [2018-06-24 20:51:16,771 INFO ]: Start isEmpty. Operand 34 states and 36 transitions. [2018-06-24 20:51:16,771 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:51:16,771 INFO ]: Found error trace [2018-06-24 20:51:16,771 INFO ]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:16,771 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:16,771 INFO ]: Analyzing trace with hash 1985001993, now seen corresponding path program 36 times [2018-06-24 20:51:16,771 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:16,771 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:16,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:16,772 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:16,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:16,784 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:17,162 INFO ]: Checked inductivity of 182 backedges. 66 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:17,162 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:17,162 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:17,169 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:51:17,236 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 20:51:17,236 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:17,239 INFO ]: Computing forward predicates... [2018-06-24 20:51:17,552 INFO ]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:17,572 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:17,572 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 43 [2018-06-24 20:51:17,572 INFO ]: Interpolant automaton has 43 states [2018-06-24 20:51:17,572 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-24 20:51:17,573 INFO ]: CoverageRelationStatistics Valid=422, Invalid=1384, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:51:17,573 INFO ]: Start difference. First operand 34 states and 36 transitions. Second operand 43 states. [2018-06-24 20:51:17,861 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:17,862 INFO ]: Finished difference Result 47 states and 49 transitions. [2018-06-24 20:51:17,862 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:51:17,862 INFO ]: Start accepts. Automaton has 43 states. Word has length 32 [2018-06-24 20:51:17,862 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:17,862 INFO ]: With dead ends: 47 [2018-06-24 20:51:17,862 INFO ]: Without dead ends: 33 [2018-06-24 20:51:17,862 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=751, Invalid=2441, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 20:51:17,862 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:51:17,863 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 20:51:17,863 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:51:17,863 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-24 20:51:17,863 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2018-06-24 20:51:17,863 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:17,864 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-24 20:51:17,864 INFO ]: Interpolant automaton has 43 states. [2018-06-24 20:51:17,864 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-24 20:51:17,864 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:51:17,864 INFO ]: Found error trace [2018-06-24 20:51:17,864 INFO ]: trace histogram [14, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:17,864 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:17,864 INFO ]: Analyzing trace with hash 1150109032, now seen corresponding path program 37 times [2018-06-24 20:51:17,864 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:17,864 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:17,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:17,864 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:17,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:17,873 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:18,233 INFO ]: Checked inductivity of 183 backedges. 105 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:18,234 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:18,234 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:18,238 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:18,301 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:18,305 INFO ]: Computing forward predicates... [2018-06-24 20:51:18,498 INFO ]: Checked inductivity of 183 backedges. 105 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:18,517 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:18,517 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 42 [2018-06-24 20:51:18,518 INFO ]: Interpolant automaton has 42 states [2018-06-24 20:51:18,518 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-24 20:51:18,518 INFO ]: CoverageRelationStatistics Valid=419, Invalid=1303, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 20:51:18,518 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 42 states. [2018-06-24 20:51:18,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:18,822 INFO ]: Finished difference Result 34 states and 35 transitions. [2018-06-24 20:51:18,822 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:51:18,822 INFO ]: Start accepts. Automaton has 42 states. Word has length 32 [2018-06-24 20:51:18,822 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:18,822 INFO ]: With dead ends: 34 [2018-06-24 20:51:18,822 INFO ]: Without dead ends: 34 [2018-06-24 20:51:18,822 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=887, Invalid=2083, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 20:51:18,823 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:51:18,824 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:51:18,824 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:51:18,824 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-06-24 20:51:18,824 INFO ]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-06-24 20:51:18,824 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:18,824 INFO ]: Abstraction has 34 states and 35 transitions. [2018-06-24 20:51:18,824 INFO ]: Interpolant automaton has 42 states. [2018-06-24 20:51:18,824 INFO ]: Start isEmpty. Operand 34 states and 35 transitions. [2018-06-24 20:51:18,824 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:51:18,824 INFO ]: Found error trace [2018-06-24 20:51:18,824 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:18,824 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:18,825 INFO ]: Analyzing trace with hash 1293203515, now seen corresponding path program 38 times [2018-06-24 20:51:18,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:18,825 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:18,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:18,825 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:18,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:18,843 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:19,901 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:19,901 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:19,901 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:19,906 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:19,966 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:19,966 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:19,972 INFO ]: Computing forward predicates... [2018-06-24 20:51:20,483 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:20,502 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:20,502 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2018-06-24 20:51:20,502 INFO ]: Interpolant automaton has 46 states [2018-06-24 20:51:20,502 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-24 20:51:20,502 INFO ]: CoverageRelationStatistics Valid=104, Invalid=1966, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:51:20,502 INFO ]: Start difference. First operand 34 states and 35 transitions. Second operand 46 states. [2018-06-24 20:51:21,235 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:21,235 INFO ]: Finished difference Result 51 states and 54 transitions. [2018-06-24 20:51:21,235 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:51:21,235 INFO ]: Start accepts. Automaton has 46 states. Word has length 33 [2018-06-24 20:51:21,236 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:21,236 INFO ]: With dead ends: 51 [2018-06-24 20:51:21,236 INFO ]: Without dead ends: 51 [2018-06-24 20:51:21,236 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 8 SyntacticMatches, 11 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=260, Invalid=3522, Unknown=0, NotChecked=0, Total=3782 [2018-06-24 20:51:21,236 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 20:51:21,237 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 36. [2018-06-24 20:51:21,237 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:51:21,237 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-06-24 20:51:21,237 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-06-24 20:51:21,238 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:21,238 INFO ]: Abstraction has 36 states and 38 transitions. [2018-06-24 20:51:21,238 INFO ]: Interpolant automaton has 46 states. [2018-06-24 20:51:21,238 INFO ]: Start isEmpty. Operand 36 states and 38 transitions. [2018-06-24 20:51:21,238 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:51:21,238 INFO ]: Found error trace [2018-06-24 20:51:21,238 INFO ]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:21,238 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:21,238 INFO ]: Analyzing trace with hash 1434165192, now seen corresponding path program 39 times [2018-06-24 20:51:21,238 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:21,238 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:21,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:21,239 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:21,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:21,247 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:22,135 INFO ]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:22,135 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:22,135 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:22,141 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:51:22,209 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-24 20:51:22,209 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:22,213 INFO ]: Computing forward predicates... [2018-06-24 20:51:22,733 INFO ]: Checked inductivity of 210 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:22,752 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:22,752 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 46 [2018-06-24 20:51:22,753 INFO ]: Interpolant automaton has 46 states [2018-06-24 20:51:22,753 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-24 20:51:22,753 INFO ]: CoverageRelationStatistics Valid=482, Invalid=1588, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:51:22,753 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 46 states. [2018-06-24 20:51:23,099 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:23,099 INFO ]: Finished difference Result 50 states and 52 transitions. [2018-06-24 20:51:23,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:51:23,099 INFO ]: Start accepts. Automaton has 46 states. Word has length 34 [2018-06-24 20:51:23,099 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:23,099 INFO ]: With dead ends: 50 [2018-06-24 20:51:23,099 INFO ]: Without dead ends: 35 [2018-06-24 20:51:23,100 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=857, Invalid=2803, Unknown=0, NotChecked=0, Total=3660 [2018-06-24 20:51:23,100 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:51:23,100 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 20:51:23,100 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:51:23,100 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-24 20:51:23,100 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 34 [2018-06-24 20:51:23,100 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:23,100 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-24 20:51:23,100 INFO ]: Interpolant automaton has 46 states. [2018-06-24 20:51:23,100 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-24 20:51:23,101 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:51:23,101 INFO ]: Found error trace [2018-06-24 20:51:23,101 INFO ]: trace histogram [15, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:23,101 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:23,101 INFO ]: Analyzing trace with hash 1322287177, now seen corresponding path program 40 times [2018-06-24 20:51:23,101 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:23,101 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:23,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:23,101 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:23,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:23,116 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:23,430 INFO ]: Checked inductivity of 211 backedges. 120 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:23,430 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:23,430 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:23,436 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:51:23,494 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:51:23,494 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:23,498 INFO ]: Computing forward predicates... [2018-06-24 20:51:23,854 INFO ]: Checked inductivity of 211 backedges. 120 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:23,873 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:23,873 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 45 [2018-06-24 20:51:23,873 INFO ]: Interpolant automaton has 45 states [2018-06-24 20:51:23,873 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-24 20:51:23,873 INFO ]: CoverageRelationStatistics Valid=479, Invalid=1501, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:51:23,874 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 45 states. [2018-06-24 20:51:24,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:24,211 INFO ]: Finished difference Result 36 states and 37 transitions. [2018-06-24 20:51:24,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:51:24,212 INFO ]: Start accepts. Automaton has 45 states. Word has length 34 [2018-06-24 20:51:24,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:24,212 INFO ]: With dead ends: 36 [2018-06-24 20:51:24,212 INFO ]: Without dead ends: 36 [2018-06-24 20:51:24,213 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1018, Invalid=2404, Unknown=0, NotChecked=0, Total=3422 [2018-06-24 20:51:24,213 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:51:24,213 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 20:51:24,213 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:51:24,213 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-24 20:51:24,213 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-06-24 20:51:24,213 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:24,214 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-24 20:51:24,214 INFO ]: Interpolant automaton has 45 states. [2018-06-24 20:51:24,214 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-24 20:51:24,214 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:51:24,214 INFO ]: Found error trace [2018-06-24 20:51:24,214 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:24,214 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:24,214 INFO ]: Analyzing trace with hash -1959208582, now seen corresponding path program 41 times [2018-06-24 20:51:24,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:24,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:24,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:24,214 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:24,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:24,230 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:25,495 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:25,496 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:25,496 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:25,502 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:51:25,577 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-24 20:51:25,577 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:25,587 INFO ]: Computing forward predicates... [2018-06-24 20:51:26,618 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:26,637 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:26,638 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 49 [2018-06-24 20:51:26,638 INFO ]: Interpolant automaton has 49 states [2018-06-24 20:51:26,638 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-24 20:51:26,638 INFO ]: CoverageRelationStatistics Valid=111, Invalid=2241, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:51:26,638 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 49 states. [2018-06-24 20:51:27,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:27,477 INFO ]: Finished difference Result 54 states and 57 transitions. [2018-06-24 20:51:27,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:51:27,477 INFO ]: Start accepts. Automaton has 49 states. Word has length 35 [2018-06-24 20:51:27,477 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:27,477 INFO ]: With dead ends: 54 [2018-06-24 20:51:27,477 INFO ]: Without dead ends: 54 [2018-06-24 20:51:27,478 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 8 SyntacticMatches, 12 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=278, Invalid=4012, Unknown=0, NotChecked=0, Total=4290 [2018-06-24 20:51:27,478 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-24 20:51:27,479 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-06-24 20:51:27,479 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:51:27,479 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-24 20:51:27,479 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-06-24 20:51:27,479 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:27,479 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-24 20:51:27,479 INFO ]: Interpolant automaton has 49 states. [2018-06-24 20:51:27,479 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-24 20:51:27,479 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:51:27,479 INFO ]: Found error trace [2018-06-24 20:51:27,479 INFO ]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:27,479 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:27,480 INFO ]: Analyzing trace with hash -606362007, now seen corresponding path program 42 times [2018-06-24 20:51:27,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:27,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:27,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:27,480 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:27,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:27,493 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:28,529 INFO ]: Checked inductivity of 240 backedges. 91 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:28,530 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:28,530 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:28,535 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:51:28,613 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-24 20:51:28,613 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:28,617 INFO ]: Computing forward predicates... [2018-06-24 20:51:29,029 INFO ]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:29,048 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:29,048 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 49 [2018-06-24 20:51:29,049 INFO ]: Interpolant automaton has 49 states [2018-06-24 20:51:29,049 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-24 20:51:29,049 INFO ]: CoverageRelationStatistics Valid=546, Invalid=1806, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:51:29,049 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 49 states. [2018-06-24 20:51:29,405 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:29,405 INFO ]: Finished difference Result 53 states and 55 transitions. [2018-06-24 20:51:29,405 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:51:29,405 INFO ]: Start accepts. Automaton has 49 states. Word has length 36 [2018-06-24 20:51:29,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:29,405 INFO ]: With dead ends: 53 [2018-06-24 20:51:29,405 INFO ]: Without dead ends: 37 [2018-06-24 20:51:29,406 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=970, Invalid=3190, Unknown=0, NotChecked=0, Total=4160 [2018-06-24 20:51:29,406 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:51:29,407 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-24 20:51:29,407 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:51:29,407 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-24 20:51:29,407 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2018-06-24 20:51:29,407 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:29,407 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-24 20:51:29,407 INFO ]: Interpolant automaton has 49 states. [2018-06-24 20:51:29,407 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-24 20:51:29,407 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:51:29,407 INFO ]: Found error trace [2018-06-24 20:51:29,407 INFO ]: trace histogram [16, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:29,407 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:29,407 INFO ]: Analyzing trace with hash 220386824, now seen corresponding path program 43 times [2018-06-24 20:51:29,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:29,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:29,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:29,408 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:29,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:29,426 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:29,861 INFO ]: Checked inductivity of 241 backedges. 136 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:29,861 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:29,861 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:29,867 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:29,931 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:29,936 INFO ]: Computing forward predicates... [2018-06-24 20:51:30,272 INFO ]: Checked inductivity of 241 backedges. 136 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:30,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:30,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 48 [2018-06-24 20:51:30,291 INFO ]: Interpolant automaton has 48 states [2018-06-24 20:51:30,292 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-24 20:51:30,292 INFO ]: CoverageRelationStatistics Valid=543, Invalid=1713, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:51:30,292 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 48 states. [2018-06-24 20:51:30,742 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:30,742 INFO ]: Finished difference Result 38 states and 39 transitions. [2018-06-24 20:51:30,742 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:51:30,742 INFO ]: Start accepts. Automaton has 48 states. Word has length 36 [2018-06-24 20:51:30,742 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:30,742 INFO ]: With dead ends: 38 [2018-06-24 20:51:30,742 INFO ]: Without dead ends: 38 [2018-06-24 20:51:30,743 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1158, Invalid=2748, Unknown=0, NotChecked=0, Total=3906 [2018-06-24 20:51:30,743 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:51:30,744 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 20:51:30,744 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:51:30,745 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-06-24 20:51:30,745 INFO ]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2018-06-24 20:51:30,745 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:30,745 INFO ]: Abstraction has 38 states and 39 transitions. [2018-06-24 20:51:30,745 INFO ]: Interpolant automaton has 48 states. [2018-06-24 20:51:30,745 INFO ]: Start isEmpty. Operand 38 states and 39 transitions. [2018-06-24 20:51:30,745 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:51:30,745 INFO ]: Found error trace [2018-06-24 20:51:30,745 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:30,745 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:30,745 INFO ]: Analyzing trace with hash -1758381157, now seen corresponding path program 44 times [2018-06-24 20:51:30,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:30,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:30,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:30,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,766 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:31,436 INFO ]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:31,436 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:31,436 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:31,442 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:31,517 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:31,517 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:31,524 INFO ]: Computing forward predicates... [2018-06-24 20:51:32,369 INFO ]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:32,388 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:32,388 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 52 [2018-06-24 20:51:32,388 INFO ]: Interpolant automaton has 52 states [2018-06-24 20:51:32,388 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-24 20:51:32,388 INFO ]: CoverageRelationStatistics Valid=118, Invalid=2534, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:51:32,389 INFO ]: Start difference. First operand 38 states and 39 transitions. Second operand 52 states. [2018-06-24 20:51:33,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:33,486 INFO ]: Finished difference Result 57 states and 60 transitions. [2018-06-24 20:51:33,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:51:33,486 INFO ]: Start accepts. Automaton has 52 states. Word has length 37 [2018-06-24 20:51:33,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:33,487 INFO ]: With dead ends: 57 [2018-06-24 20:51:33,487 INFO ]: Without dead ends: 57 [2018-06-24 20:51:33,487 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 8 SyntacticMatches, 13 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=296, Invalid=4534, Unknown=0, NotChecked=0, Total=4830 [2018-06-24 20:51:33,487 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 20:51:33,488 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 40. [2018-06-24 20:51:33,488 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:51:33,489 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-06-24 20:51:33,489 INFO ]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2018-06-24 20:51:33,489 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:33,489 INFO ]: Abstraction has 40 states and 42 transitions. [2018-06-24 20:51:33,489 INFO ]: Interpolant automaton has 52 states. [2018-06-24 20:51:33,489 INFO ]: Start isEmpty. Operand 40 states and 42 transitions. [2018-06-24 20:51:33,489 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:51:33,489 INFO ]: Found error trace [2018-06-24 20:51:33,489 INFO ]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:33,489 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:33,489 INFO ]: Analyzing trace with hash 1324320872, now seen corresponding path program 45 times [2018-06-24 20:51:33,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:33,489 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:33,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:33,490 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:33,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:33,500 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:34,051 INFO ]: Checked inductivity of 272 backedges. 105 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:34,051 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:34,051 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:34,056 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:51:34,186 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 20:51:34,186 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:34,191 INFO ]: Computing forward predicates... [2018-06-24 20:51:34,618 INFO ]: Checked inductivity of 272 backedges. 136 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:34,638 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:34,638 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 52 [2018-06-24 20:51:34,638 INFO ]: Interpolant automaton has 52 states [2018-06-24 20:51:34,638 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-24 20:51:34,638 INFO ]: CoverageRelationStatistics Valid=614, Invalid=2038, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:51:34,638 INFO ]: Start difference. First operand 40 states and 42 transitions. Second operand 52 states. [2018-06-24 20:51:35,015 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:35,015 INFO ]: Finished difference Result 56 states and 58 transitions. [2018-06-24 20:51:35,015 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:51:35,015 INFO ]: Start accepts. Automaton has 52 states. Word has length 38 [2018-06-24 20:51:35,015 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:35,016 INFO ]: With dead ends: 56 [2018-06-24 20:51:35,016 INFO ]: Without dead ends: 39 [2018-06-24 20:51:35,016 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1090, Invalid=3602, Unknown=0, NotChecked=0, Total=4692 [2018-06-24 20:51:35,016 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:51:35,017 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-24 20:51:35,017 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:51:35,017 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-24 20:51:35,017 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 38 [2018-06-24 20:51:35,017 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:35,017 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-24 20:51:35,017 INFO ]: Interpolant automaton has 52 states. [2018-06-24 20:51:35,017 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-24 20:51:35,017 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:51:35,017 INFO ]: Found error trace [2018-06-24 20:51:35,017 INFO ]: trace histogram [17, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:35,017 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:35,018 INFO ]: Analyzing trace with hash 1183730857, now seen corresponding path program 46 times [2018-06-24 20:51:35,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:35,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:35,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:35,018 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:35,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:35,034 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:35,413 INFO ]: Checked inductivity of 273 backedges. 153 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:35,413 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:35,413 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:35,418 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:51:35,493 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:51:35,493 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:35,499 INFO ]: Computing forward predicates... [2018-06-24 20:51:36,941 INFO ]: Checked inductivity of 273 backedges. 153 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:36,966 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:36,966 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 51 [2018-06-24 20:51:36,966 INFO ]: Interpolant automaton has 51 states [2018-06-24 20:51:36,967 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-24 20:51:36,967 INFO ]: CoverageRelationStatistics Valid=611, Invalid=1939, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:51:36,967 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 51 states. [2018-06-24 20:51:37,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:37,425 INFO ]: Finished difference Result 40 states and 41 transitions. [2018-06-24 20:51:37,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:51:37,425 INFO ]: Start accepts. Automaton has 51 states. Word has length 38 [2018-06-24 20:51:37,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:37,425 INFO ]: With dead ends: 40 [2018-06-24 20:51:37,425 INFO ]: Without dead ends: 40 [2018-06-24 20:51:37,426 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1307, Invalid=3115, Unknown=0, NotChecked=0, Total=4422 [2018-06-24 20:51:37,426 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:51:37,427 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-24 20:51:37,427 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:51:37,427 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-24 20:51:37,427 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-06-24 20:51:37,428 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:37,428 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-24 20:51:37,428 INFO ]: Interpolant automaton has 51 states. [2018-06-24 20:51:37,428 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-24 20:51:37,428 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:51:37,428 INFO ]: Found error trace [2018-06-24 20:51:37,428 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:37,428 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:37,428 INFO ]: Analyzing trace with hash -1959487206, now seen corresponding path program 47 times [2018-06-24 20:51:37,428 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:37,428 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:37,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:37,429 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:37,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:37,453 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-24 20:51:37,971 WARN ]: Removed 1 from assertion stack [2018-06-24 20:51:37,971 WARN ]: Verification canceled [2018-06-24 20:51:37,974 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:51:37,976 WARN ]: Timeout [2018-06-24 20:51:37,977 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:51:37 BasicIcfg [2018-06-24 20:51:37,977 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:51:37,978 INFO ]: Toolchain (without parser) took 56904.75 ms. Allocated memory was 304.1 MB in the beginning and 856.2 MB in the end (delta: 552.1 MB). Free memory was 257.5 MB in the beginning and 691.7 MB in the end (delta: -434.3 MB). Peak memory consumption was 117.8 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:37,979 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:51:37,979 INFO ]: ChcToBoogie took 60.14 ms. Allocated memory is still 304.1 MB. Free memory was 257.5 MB in the beginning and 255.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:37,980 INFO ]: Boogie Preprocessor took 34.02 ms. Allocated memory is still 304.1 MB. Free memory was 255.5 MB in the beginning and 253.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:37,980 INFO ]: RCFGBuilder took 335.37 ms. Allocated memory is still 304.1 MB. Free memory was 253.5 MB in the beginning and 244.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:37,980 INFO ]: BlockEncodingV2 took 125.99 ms. Allocated memory is still 304.1 MB. Free memory was 244.5 MB in the beginning and 238.5 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:37,987 INFO ]: TraceAbstraction took 56338.60 ms. Allocated memory was 304.1 MB in the beginning and 856.2 MB in the end (delta: 552.1 MB). Free memory was 238.5 MB in the beginning and 691.7 MB in the end (delta: -453.2 MB). Peak memory consumption was 98.9 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:37,990 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 14 locations, 18 edges - StatisticsResult: Encoded RCFG 7 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.14 ms. Allocated memory is still 304.1 MB. Free memory was 257.5 MB in the beginning and 255.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.02 ms. Allocated memory is still 304.1 MB. Free memory was 255.5 MB in the beginning and 253.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 335.37 ms. Allocated memory is still 304.1 MB. Free memory was 253.5 MB in the beginning and 244.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 125.99 ms. Allocated memory is still 304.1 MB. Free memory was 244.5 MB in the beginning and 238.5 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56338.60 ms. Allocated memory was 304.1 MB in the beginning and 856.2 MB in the end (delta: 552.1 MB). Free memory was 238.5 MB in the beginning and 691.7 MB in the end (delta: -453.2 MB). Peak memory consumption was 98.9 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 40 with TraceHistMax 17, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 6. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. TIMEOUT Result, 56.2s OverallTime, 54 OverallIterations, 17 TraceHistogramMax, 14.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 531 SDslu, 3224 SDs, 0 SdLazy, 13777 SolverSat, 2364 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2480 GetRequests, 617 SyntacticMatches, 101 SemanticMatches, 1762 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15193 ImplicationChecksByTransitivity, 39.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=51, 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.2s AutomataMinimizationTime, 53 MinimizatonAttempts, 157 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 35.9s InterpolantComputationTime, 2195 NumberOfCodeBlocks, 2195 NumberOfCodeBlocksAsserted, 214 NumberOfCheckSat, 2095 ConstructedInterpolants, 0 QuantifiedInterpolants, 316621 SizeOfPredicates, 856 NumberOfNonLiveVariables, 19574 ConjunctsInSsa, 4515 ConjunctsInUnsatCore, 100 InterpolantComputations, 6 PerfectInterpolantSequences, 3309/9549 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_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-51-38-008.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-51-38-008.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-51-38-008.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-51-38-008.csv Completed graceful shutdown