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/hopv/lia/mochi/queen.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:23:32,725 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:23:32,727 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:23:32,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:23:32,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:23:32,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:23:32,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:23:32,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:23:32,747 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:23:32,749 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:23:32,750 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:23:32,750 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:23:32,751 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:23:32,755 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:23:32,756 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:23:32,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:23:32,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:23:32,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:23:32,772 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:23:32,773 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:23:32,774 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:23:32,776 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:23:32,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:23:32,777 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:23:32,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:23:32,778 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:23:32,783 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:23:32,784 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:23:32,785 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:23:32,785 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:23:32,791 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:23:32,792 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:23:32,792 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:23:32,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:23:32,794 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:23:32,794 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:23:32,818 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:23:32,819 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:23:32,819 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:23:32,819 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:23:32,820 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:23:32,820 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:23:32,821 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:23:32,821 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:23:32,821 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:23:32,821 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:23:32,821 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:23:32,822 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:23:32,825 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:23:32,825 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:23:32,825 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:23:32,826 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:23:32,826 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:23:32,826 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:23:32,826 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:23:32,826 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:23:32,827 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:23:32,828 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:23:32,828 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:23:32,870 INFO ]: Repository-Root is: /tmp [2018-06-24 21:23:32,887 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:23:32,892 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:23:32,893 INFO ]: Initializing SmtParser... [2018-06-24 21:23:32,894 INFO ]: SmtParser initialized [2018-06-24 21:23:32,894 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/queen.smt2 [2018-06-24 21:23:32,896 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:23:32,986 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/queen.smt2 unknown [2018-06-24 21:23:33,669 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/queen.smt2 [2018-06-24 21:23:33,673 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:23:33,680 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:23:33,681 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:23:33,681 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:23:33,681 INFO ]: ChcToBoogie initialized [2018-06-24 21:23:33,684 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:23:33" (1/1) ... [2018-06-24 21:23:33,773 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:23:33 Unit [2018-06-24 21:23:33,773 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:23:33,774 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:23:33,774 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:23:33,774 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:23:33,793 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:23:33" (1/1) ... [2018-06-24 21:23:33,793 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:23:33" (1/1) ... [2018-06-24 21:23:33,813 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:23:33" (1/1) ... [2018-06-24 21:23:33,814 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:23:33" (1/1) ... [2018-06-24 21:23:33,833 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:23:33" (1/1) ... [2018-06-24 21:23:33,837 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:23:33" (1/1) ... [2018-06-24 21:23:33,844 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:23:33" (1/1) ... [2018-06-24 21:23:33,848 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:23:33,849 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:23:33,849 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:23:33,849 INFO ]: RCFGBuilder initialized [2018-06-24 21:23:33,850 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:23:33" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:23:33,868 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:23:33,868 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:23:33,868 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:23:33,868 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:23:33,868 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:23:33,868 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:23:35,026 INFO ]: Using library mode [2018-06-24 21:23:35,027 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:23:35 BoogieIcfgContainer [2018-06-24 21:23:35,027 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:23:35,027 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:23:35,027 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:23:35,028 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:23:35,029 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:23:35" (1/1) ... [2018-06-24 21:23:35,058 INFO ]: Initial Icfg 123 locations, 205 edges [2018-06-24 21:23:35,059 INFO ]: Using Remove infeasible edges [2018-06-24 21:23:35,060 INFO ]: Using Maximize final states [2018-06-24 21:23:35,060 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:23:35,060 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:23:35,062 INFO ]: Using Remove sink states [2018-06-24 21:23:35,063 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:23:35,063 INFO ]: Using Use SBE [2018-06-24 21:23:35,118 INFO ]: SBE split 1 edges [2018-06-24 21:23:35,132 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 21:23:35,134 INFO ]: 0 new accepting states [2018-06-24 21:23:36,214 INFO ]: Removed 149 edges and 37 locations by large block encoding [2018-06-24 21:23:36,217 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:23:36,219 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:23:36,219 INFO ]: 0 new accepting states [2018-06-24 21:23:36,222 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:23:36,222 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:23:36,224 INFO ]: Encoded RCFG 84 locations, 169 edges [2018-06-24 21:23:36,224 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:23:36 BasicIcfg [2018-06-24 21:23:36,224 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:23:36,228 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:23:36,228 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:23:36,231 INFO ]: TraceAbstraction initialized [2018-06-24 21:23:36,231 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:23:33" (1/4) ... [2018-06-24 21:23:36,233 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40167bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:23:36, skipping insertion in model container [2018-06-24 21:23:36,233 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:23:33" (2/4) ... [2018-06-24 21:23:36,233 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40167bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:23:36, skipping insertion in model container [2018-06-24 21:23:36,233 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:23:35" (3/4) ... [2018-06-24 21:23:36,233 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40167bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:23:36, skipping insertion in model container [2018-06-24 21:23:36,233 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:23:36" (4/4) ... [2018-06-24 21:23:36,235 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:23:36,247 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:23:36,254 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:23:36,295 INFO ]: Using default assertion order modulation [2018-06-24 21:23:36,296 INFO ]: Interprodecural is true [2018-06-24 21:23:36,296 INFO ]: Hoare is false [2018-06-24 21:23:36,296 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:23:36,296 INFO ]: Backedges is TWOTRACK [2018-06-24 21:23:36,296 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:23:36,296 INFO ]: Difference is false [2018-06-24 21:23:36,296 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:23:36,296 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:23:36,308 INFO ]: Start isEmpty. Operand 84 states. [2018-06-24 21:23:36,330 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 21:23:36,330 INFO ]: Found error trace [2018-06-24 21:23:36,331 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 21:23:36,331 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:36,336 INFO ]: Analyzing trace with hash 4820052, now seen corresponding path program 1 times [2018-06-24 21:23:36,337 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:36,338 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:36,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:36,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:36,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:36,423 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:36,504 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:23:36,506 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:23:36,506 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:23:36,507 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:36,518 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:36,519 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:36,521 INFO ]: Start difference. First operand 84 states. Second operand 3 states. [2018-06-24 21:23:37,670 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:37,670 INFO ]: Finished difference Result 142 states and 277 transitions. [2018-06-24 21:23:37,674 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:37,675 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 21:23:37,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:37,711 INFO ]: With dead ends: 142 [2018-06-24 21:23:37,711 INFO ]: Without dead ends: 142 [2018-06-24 21:23:37,713 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:37,731 INFO ]: Start minimizeSevpa. Operand 142 states. [2018-06-24 21:23:37,825 INFO ]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-06-24 21:23:37,828 INFO ]: Start removeUnreachable. Operand 142 states. [2018-06-24 21:23:37,841 INFO ]: Finished removeUnreachable. Reduced from 142 states to 142 states and 277 transitions. [2018-06-24 21:23:37,842 INFO ]: Start accepts. Automaton has 142 states and 277 transitions. Word has length 4 [2018-06-24 21:23:37,843 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:37,843 INFO ]: Abstraction has 142 states and 277 transitions. [2018-06-24 21:23:37,843 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:37,843 INFO ]: Start isEmpty. Operand 142 states and 277 transitions. [2018-06-24 21:23:37,852 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 21:23:37,852 INFO ]: Found error trace [2018-06-24 21:23:37,852 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 21:23:37,852 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:37,852 INFO ]: Analyzing trace with hash 4882517, now seen corresponding path program 1 times [2018-06-24 21:23:37,852 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:37,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:37,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:37,853 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:37,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:37,860 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:37,915 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:23:37,915 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:23:37,915 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:23:37,917 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:37,917 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:37,917 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:37,917 INFO ]: Start difference. First operand 142 states and 277 transitions. Second operand 3 states. [2018-06-24 21:23:38,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:38,599 INFO ]: Finished difference Result 197 states and 459 transitions. [2018-06-24 21:23:38,600 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:38,600 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 21:23:38,600 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:38,623 INFO ]: With dead ends: 197 [2018-06-24 21:23:38,623 INFO ]: Without dead ends: 197 [2018-06-24 21:23:38,624 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:38,625 INFO ]: Start minimizeSevpa. Operand 197 states. [2018-06-24 21:23:38,673 INFO ]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-06-24 21:23:38,673 INFO ]: Start removeUnreachable. Operand 197 states. [2018-06-24 21:23:38,683 INFO ]: Finished removeUnreachable. Reduced from 197 states to 197 states and 459 transitions. [2018-06-24 21:23:38,683 INFO ]: Start accepts. Automaton has 197 states and 459 transitions. Word has length 4 [2018-06-24 21:23:38,683 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:38,683 INFO ]: Abstraction has 197 states and 459 transitions. [2018-06-24 21:23:38,683 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:38,683 INFO ]: Start isEmpty. Operand 197 states and 459 transitions. [2018-06-24 21:23:38,685 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 21:23:38,685 INFO ]: Found error trace [2018-06-24 21:23:38,685 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 21:23:38,685 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:38,685 INFO ]: Analyzing trace with hash 4888283, now seen corresponding path program 1 times [2018-06-24 21:23:38,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:38,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:38,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:38,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:38,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:38,692 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:38,735 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:23:38,736 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:23:38,736 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:23:38,736 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:38,736 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:38,736 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:38,736 INFO ]: Start difference. First operand 197 states and 459 transitions. Second operand 3 states. [2018-06-24 21:23:39,133 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:39,133 INFO ]: Finished difference Result 256 states and 604 transitions. [2018-06-24 21:23:39,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:39,136 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 21:23:39,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:39,161 INFO ]: With dead ends: 256 [2018-06-24 21:23:39,162 INFO ]: Without dead ends: 256 [2018-06-24 21:23:39,162 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:39,162 INFO ]: Start minimizeSevpa. Operand 256 states. [2018-06-24 21:23:39,209 INFO ]: Finished minimizeSevpa. Reduced states from 256 to 201. [2018-06-24 21:23:39,209 INFO ]: Start removeUnreachable. Operand 201 states. [2018-06-24 21:23:39,218 INFO ]: Finished removeUnreachable. Reduced from 201 states to 201 states and 424 transitions. [2018-06-24 21:23:39,218 INFO ]: Start accepts. Automaton has 201 states and 424 transitions. Word has length 4 [2018-06-24 21:23:39,218 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:39,218 INFO ]: Abstraction has 201 states and 424 transitions. [2018-06-24 21:23:39,218 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:39,218 INFO ]: Start isEmpty. Operand 201 states and 424 transitions. [2018-06-24 21:23:39,221 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:23:39,221 INFO ]: Found error trace [2018-06-24 21:23:39,221 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:23:39,221 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:39,221 INFO ]: Analyzing trace with hash 151861701, now seen corresponding path program 1 times [2018-06-24 21:23:39,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:39,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:39,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:39,222 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:39,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:39,229 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:39,279 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:23:39,279 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:23:39,279 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:23:39,299 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:39,299 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:39,299 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:39,299 INFO ]: Start difference. First operand 201 states and 424 transitions. Second operand 3 states. [2018-06-24 21:23:39,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:39,701 INFO ]: Finished difference Result 259 states and 550 transitions. [2018-06-24 21:23:39,701 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:39,701 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:23:39,701 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:39,719 INFO ]: With dead ends: 259 [2018-06-24 21:23:39,720 INFO ]: Without dead ends: 259 [2018-06-24 21:23:39,720 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:39,720 INFO ]: Start minimizeSevpa. Operand 259 states. [2018-06-24 21:23:39,746 INFO ]: Finished minimizeSevpa. Reduced states from 259 to 258. [2018-06-24 21:23:39,746 INFO ]: Start removeUnreachable. Operand 258 states. [2018-06-24 21:23:39,754 INFO ]: Finished removeUnreachable. Reduced from 258 states to 258 states and 523 transitions. [2018-06-24 21:23:39,754 INFO ]: Start accepts. Automaton has 258 states and 523 transitions. Word has length 5 [2018-06-24 21:23:39,754 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:39,754 INFO ]: Abstraction has 258 states and 523 transitions. [2018-06-24 21:23:39,754 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:39,755 INFO ]: Start isEmpty. Operand 258 states and 523 transitions. [2018-06-24 21:23:39,777 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:23:39,777 INFO ]: Found error trace [2018-06-24 21:23:39,777 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:23:39,777 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:39,777 INFO ]: Analyzing trace with hash -118708574, now seen corresponding path program 1 times [2018-06-24 21:23:39,777 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:39,777 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:39,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:39,778 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:39,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:39,787 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:39,867 INFO ]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:23:39,867 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:23:39,867 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:23:39,867 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:39,867 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:39,867 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:39,867 INFO ]: Start difference. First operand 258 states and 523 transitions. Second operand 3 states. [2018-06-24 21:23:40,515 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:40,515 INFO ]: Finished difference Result 316 states and 649 transitions. [2018-06-24 21:23:40,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:40,516 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 21:23:40,516 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:40,539 INFO ]: With dead ends: 316 [2018-06-24 21:23:40,539 INFO ]: Without dead ends: 316 [2018-06-24 21:23:40,539 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:40,540 INFO ]: Start minimizeSevpa. Operand 316 states. [2018-06-24 21:23:40,567 INFO ]: Finished minimizeSevpa. Reduced states from 316 to 316. [2018-06-24 21:23:40,567 INFO ]: Start removeUnreachable. Operand 316 states. [2018-06-24 21:23:40,578 INFO ]: Finished removeUnreachable. Reduced from 316 states to 316 states and 649 transitions. [2018-06-24 21:23:40,578 INFO ]: Start accepts. Automaton has 316 states and 649 transitions. Word has length 17 [2018-06-24 21:23:40,578 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:40,578 INFO ]: Abstraction has 316 states and 649 transitions. [2018-06-24 21:23:40,578 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:40,578 INFO ]: Start isEmpty. Operand 316 states and 649 transitions. [2018-06-24 21:23:40,614 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 21:23:40,614 INFO ]: Found error trace [2018-06-24 21:23:40,614 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:23:40,614 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:40,614 INFO ]: Analyzing trace with hash -470649982, now seen corresponding path program 1 times [2018-06-24 21:23:40,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:40,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:40,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:40,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:40,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:40,627 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:40,681 INFO ]: Checked inductivity of 20 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:23:40,681 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:23:40,681 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:23:40,689 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:40,742 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:40,752 INFO ]: Computing forward predicates... [2018-06-24 21:23:40,799 INFO ]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:23:40,834 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:23:40,834 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:23:40,834 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:40,835 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:40,835 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:40,835 INFO ]: Start difference. First operand 316 states and 649 transitions. Second operand 3 states. [2018-06-24 21:23:41,926 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:41,926 INFO ]: Finished difference Result 374 states and 752 transitions. [2018-06-24 21:23:41,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:41,926 INFO ]: Start accepts. Automaton has 3 states. Word has length 21 [2018-06-24 21:23:41,926 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:41,950 INFO ]: With dead ends: 374 [2018-06-24 21:23:41,950 INFO ]: Without dead ends: 374 [2018-06-24 21:23:41,950 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:41,950 INFO ]: Start minimizeSevpa. Operand 374 states. [2018-06-24 21:23:41,981 INFO ]: Finished minimizeSevpa. Reduced states from 374 to 374. [2018-06-24 21:23:41,981 INFO ]: Start removeUnreachable. Operand 374 states. [2018-06-24 21:23:41,995 INFO ]: Finished removeUnreachable. Reduced from 374 states to 374 states and 752 transitions. [2018-06-24 21:23:41,995 INFO ]: Start accepts. Automaton has 374 states and 752 transitions. Word has length 21 [2018-06-24 21:23:41,995 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:41,995 INFO ]: Abstraction has 374 states and 752 transitions. [2018-06-24 21:23:41,995 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:41,995 INFO ]: Start isEmpty. Operand 374 states and 752 transitions. [2018-06-24 21:23:42,043 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-24 21:23:42,043 INFO ]: Found error trace [2018-06-24 21:23:42,044 INFO ]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:23:42,044 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:42,044 INFO ]: Analyzing trace with hash -63916546, now seen corresponding path program 1 times [2018-06-24 21:23:42,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:42,044 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:42,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:42,045 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:42,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:42,071 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:42,175 INFO ]: Checked inductivity of 156 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-06-24 21:23:42,175 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:23:42,175 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) [2018-06-24 21:23:42,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:23:42,277 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:42,282 INFO ]: Computing forward predicates... [2018-06-24 21:23:42,291 INFO ]: Checked inductivity of 156 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-06-24 21:23:42,322 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:23:42,322 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:23:42,323 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:42,323 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:42,323 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:42,323 INFO ]: Start difference. First operand 374 states and 752 transitions. Second operand 3 states. [2018-06-24 21:23:42,556 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:42,557 INFO ]: Finished difference Result 432 states and 822 transitions. [2018-06-24 21:23:42,557 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:42,557 INFO ]: Start accepts. Automaton has 3 states. Word has length 52 [2018-06-24 21:23:42,557 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:42,569 INFO ]: With dead ends: 432 [2018-06-24 21:23:42,569 INFO ]: Without dead ends: 432 [2018-06-24 21:23:42,569 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:42,569 INFO ]: Start minimizeSevpa. Operand 432 states. [2018-06-24 21:23:42,606 INFO ]: Finished minimizeSevpa. Reduced states from 432 to 432. [2018-06-24 21:23:42,606 INFO ]: Start removeUnreachable. Operand 432 states. [2018-06-24 21:23:42,642 INFO ]: Finished removeUnreachable. Reduced from 432 states to 432 states and 822 transitions. [2018-06-24 21:23:42,642 INFO ]: Start accepts. Automaton has 432 states and 822 transitions. Word has length 52 [2018-06-24 21:23:42,642 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:42,642 INFO ]: Abstraction has 432 states and 822 transitions. [2018-06-24 21:23:42,642 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:42,642 INFO ]: Start isEmpty. Operand 432 states and 822 transitions. [2018-06-24 21:23:42,692 INFO ]: Finished isEmpty. Found accepting run of length 63 [2018-06-24 21:23:42,692 INFO ]: Found error trace [2018-06-24 21:23:42,692 INFO ]: trace histogram [8, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:23:42,692 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:42,693 INFO ]: Analyzing trace with hash 1184344464, now seen corresponding path program 1 times [2018-06-24 21:23:42,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:42,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:42,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:42,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:42,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:42,704 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:42,786 INFO ]: Checked inductivity of 219 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-06-24 21:23:42,786 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:23:42,786 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) [2018-06-24 21:23:42,800 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:23:42,898 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:42,903 INFO ]: Computing forward predicates... [2018-06-24 21:23:42,921 INFO ]: Checked inductivity of 219 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-06-24 21:23:42,954 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:23:42,954 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:23:42,954 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:42,954 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:42,954 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:42,954 INFO ]: Start difference. First operand 432 states and 822 transitions. Second operand 3 states. [2018-06-24 21:23:43,422 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:43,422 INFO ]: Finished difference Result 490 states and 943 transitions. [2018-06-24 21:23:43,422 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:43,422 INFO ]: Start accepts. Automaton has 3 states. Word has length 62 [2018-06-24 21:23:43,423 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:43,438 INFO ]: With dead ends: 490 [2018-06-24 21:23:43,438 INFO ]: Without dead ends: 490 [2018-06-24 21:23:43,438 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:43,438 INFO ]: Start minimizeSevpa. Operand 490 states. [2018-06-24 21:23:43,470 INFO ]: Finished minimizeSevpa. Reduced states from 490 to 490. [2018-06-24 21:23:43,470 INFO ]: Start removeUnreachable. Operand 490 states. [2018-06-24 21:23:43,481 INFO ]: Finished removeUnreachable. Reduced from 490 states to 490 states and 943 transitions. [2018-06-24 21:23:43,481 INFO ]: Start accepts. Automaton has 490 states and 943 transitions. Word has length 62 [2018-06-24 21:23:43,481 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:43,481 INFO ]: Abstraction has 490 states and 943 transitions. [2018-06-24 21:23:43,481 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:43,481 INFO ]: Start isEmpty. Operand 490 states and 943 transitions. [2018-06-24 21:23:43,507 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-24 21:23:43,507 INFO ]: Found error trace [2018-06-24 21:23:43,508 INFO ]: trace histogram [9, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:23:43,508 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:43,508 INFO ]: Analyzing trace with hash -884529134, now seen corresponding path program 1 times [2018-06-24 21:23:43,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:43,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:43,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:43,509 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:43,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:43,523 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:43,609 INFO ]: Checked inductivity of 284 backedges. 34 proven. 29 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-06-24 21:23:43,609 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:23:43,609 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:23:43,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:23:43,727 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:43,733 INFO ]: Computing forward predicates... [2018-06-24 21:23:43,743 INFO ]: Checked inductivity of 284 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-06-24 21:23:43,776 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:23:43,776 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:23:43,776 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:43,776 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:43,776 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:43,776 INFO ]: Start difference. First operand 490 states and 943 transitions. Second operand 3 states. [2018-06-24 21:23:44,324 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:44,324 INFO ]: Finished difference Result 548 states and 1021 transitions. [2018-06-24 21:23:44,324 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:44,324 INFO ]: Start accepts. Automaton has 3 states. Word has length 69 [2018-06-24 21:23:44,324 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:44,339 INFO ]: With dead ends: 548 [2018-06-24 21:23:44,339 INFO ]: Without dead ends: 548 [2018-06-24 21:23:44,340 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:44,340 INFO ]: Start minimizeSevpa. Operand 548 states. [2018-06-24 21:23:44,386 INFO ]: Finished minimizeSevpa. Reduced states from 548 to 548. [2018-06-24 21:23:44,386 INFO ]: Start removeUnreachable. Operand 548 states. [2018-06-24 21:23:44,398 INFO ]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1021 transitions. [2018-06-24 21:23:44,399 INFO ]: Start accepts. Automaton has 548 states and 1021 transitions. Word has length 69 [2018-06-24 21:23:44,399 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:44,399 INFO ]: Abstraction has 548 states and 1021 transitions. [2018-06-24 21:23:44,399 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:44,399 INFO ]: Start isEmpty. Operand 548 states and 1021 transitions. [2018-06-24 21:23:44,423 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-24 21:23:44,423 INFO ]: Found error trace [2018-06-24 21:23:44,423 INFO ]: trace histogram [9, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:23:44,423 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:44,423 INFO ]: Analyzing trace with hash 291144533, now seen corresponding path program 1 times [2018-06-24 21:23:44,423 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:44,423 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:44,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:44,424 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:44,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:44,440 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:44,546 INFO ]: Checked inductivity of 284 backedges. 34 proven. 29 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-06-24 21:23:44,547 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:23:44,547 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:23:44,563 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:44,664 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:44,669 INFO ]: Computing forward predicates... [2018-06-24 21:23:44,688 INFO ]: Checked inductivity of 284 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-06-24 21:23:44,719 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:23:44,719 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:23:44,719 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:44,719 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:44,719 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:44,720 INFO ]: Start difference. First operand 548 states and 1021 transitions. Second operand 3 states. [2018-06-24 21:23:45,386 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:45,386 INFO ]: Finished difference Result 606 states and 1132 transitions. [2018-06-24 21:23:45,386 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:45,386 INFO ]: Start accepts. Automaton has 3 states. Word has length 69 [2018-06-24 21:23:45,386 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:45,406 INFO ]: With dead ends: 606 [2018-06-24 21:23:45,406 INFO ]: Without dead ends: 606 [2018-06-24 21:23:45,406 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:45,406 INFO ]: Start minimizeSevpa. Operand 606 states. [2018-06-24 21:23:45,451 INFO ]: Finished minimizeSevpa. Reduced states from 606 to 606. [2018-06-24 21:23:45,451 INFO ]: Start removeUnreachable. Operand 606 states. [2018-06-24 21:23:45,466 INFO ]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1132 transitions. [2018-06-24 21:23:45,466 INFO ]: Start accepts. Automaton has 606 states and 1132 transitions. Word has length 69 [2018-06-24 21:23:45,467 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:45,467 INFO ]: Abstraction has 606 states and 1132 transitions. [2018-06-24 21:23:45,467 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:45,467 INFO ]: Start isEmpty. Operand 606 states and 1132 transitions. [2018-06-24 21:23:45,494 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-24 21:23:45,494 INFO ]: Found error trace [2018-06-24 21:23:45,494 INFO ]: trace histogram [8, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:23:45,494 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:45,495 INFO ]: Analyzing trace with hash 1403186311, now seen corresponding path program 1 times [2018-06-24 21:23:45,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:45,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:45,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:45,495 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:45,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:45,510 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:45,609 INFO ]: Checked inductivity of 284 backedges. 34 proven. 29 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-06-24 21:23:45,609 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:23:45,609 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) [2018-06-24 21:23:45,627 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:23:45,733 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:45,738 INFO ]: Computing forward predicates... [2018-06-24 21:23:45,807 INFO ]: Checked inductivity of 284 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-06-24 21:23:45,840 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:23:45,840 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:23:45,841 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:45,841 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:45,841 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:45,841 INFO ]: Start difference. First operand 606 states and 1132 transitions. Second operand 3 states. [2018-06-24 21:23:47,304 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:47,304 INFO ]: Finished difference Result 664 states and 1244 transitions. [2018-06-24 21:23:47,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:47,304 INFO ]: Start accepts. Automaton has 3 states. Word has length 69 [2018-06-24 21:23:47,304 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:47,327 INFO ]: With dead ends: 664 [2018-06-24 21:23:47,327 INFO ]: Without dead ends: 664 [2018-06-24 21:23:47,327 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:47,328 INFO ]: Start minimizeSevpa. Operand 664 states. [2018-06-24 21:23:47,371 INFO ]: Finished minimizeSevpa. Reduced states from 664 to 664. [2018-06-24 21:23:47,371 INFO ]: Start removeUnreachable. Operand 664 states. [2018-06-24 21:23:47,387 INFO ]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1244 transitions. [2018-06-24 21:23:47,387 INFO ]: Start accepts. Automaton has 664 states and 1244 transitions. Word has length 69 [2018-06-24 21:23:47,387 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:47,387 INFO ]: Abstraction has 664 states and 1244 transitions. [2018-06-24 21:23:47,387 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:47,387 INFO ]: Start isEmpty. Operand 664 states and 1244 transitions. [2018-06-24 21:23:47,415 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-24 21:23:47,415 INFO ]: Found error trace [2018-06-24 21:23:47,415 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:23:47,415 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:47,415 INFO ]: Analyzing trace with hash -1929299201, now seen corresponding path program 1 times [2018-06-24 21:23:47,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:47,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:47,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:47,417 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:47,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:47,442 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:47,549 INFO ]: Checked inductivity of 462 backedges. 55 proven. 37 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-06-24 21:23:47,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:23:47,549 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) [2018-06-24 21:23:47,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:23:47,683 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:47,688 INFO ]: Computing forward predicates... [2018-06-24 21:23:47,708 INFO ]: Checked inductivity of 462 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-06-24 21:23:47,739 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:23:47,740 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:23:47,740 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:47,740 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:47,740 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:47,740 INFO ]: Start difference. First operand 664 states and 1244 transitions. Second operand 3 states. [2018-06-24 21:23:49,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:49,207 INFO ]: Finished difference Result 722 states and 1344 transitions. [2018-06-24 21:23:49,208 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:49,208 INFO ]: Start accepts. Automaton has 3 states. Word has length 89 [2018-06-24 21:23:49,208 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:49,232 INFO ]: With dead ends: 722 [2018-06-24 21:23:49,232 INFO ]: Without dead ends: 722 [2018-06-24 21:23:49,232 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:49,233 INFO ]: Start minimizeSevpa. Operand 722 states. [2018-06-24 21:23:49,279 INFO ]: Finished minimizeSevpa. Reduced states from 722 to 722. [2018-06-24 21:23:49,279 INFO ]: Start removeUnreachable. Operand 722 states. [2018-06-24 21:23:49,297 INFO ]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1344 transitions. [2018-06-24 21:23:49,297 INFO ]: Start accepts. Automaton has 722 states and 1344 transitions. Word has length 89 [2018-06-24 21:23:49,297 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:49,297 INFO ]: Abstraction has 722 states and 1344 transitions. [2018-06-24 21:23:49,297 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:49,297 INFO ]: Start isEmpty. Operand 722 states and 1344 transitions. [2018-06-24 21:23:49,333 INFO ]: Finished isEmpty. Found accepting run of length 144 [2018-06-24 21:23:49,335 INFO ]: Found error trace [2018-06-24 21:23:49,335 INFO ]: trace histogram [11, 11, 11, 11, 11, 7, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:23:49,335 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:49,336 INFO ]: Analyzing trace with hash -648453991, now seen corresponding path program 1 times [2018-06-24 21:23:49,336 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:49,336 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:49,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:49,336 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:49,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:49,359 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:49,497 INFO ]: Checked inductivity of 1257 backedges. 109 proven. 96 refuted. 0 times theorem prover too weak. 1052 trivial. 0 not checked. [2018-06-24 21:23:49,497 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:23:49,497 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 21:23:49,550 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 21:23:49,732 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:49,741 INFO ]: Computing forward predicates... [2018-06-24 21:23:49,781 INFO ]: Checked inductivity of 1257 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2018-06-24 21:23:49,814 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:23:49,814 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:23:49,815 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:49,815 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:49,815 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:49,815 INFO ]: Start difference. First operand 722 states and 1344 transitions. Second operand 3 states. [2018-06-24 21:23:50,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:50,504 INFO ]: Finished difference Result 780 states and 1451 transitions. [2018-06-24 21:23:50,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:50,504 INFO ]: Start accepts. Automaton has 3 states. Word has length 143 [2018-06-24 21:23:50,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:50,533 INFO ]: With dead ends: 780 [2018-06-24 21:23:50,533 INFO ]: Without dead ends: 780 [2018-06-24 21:23:50,533 INFO ]: 0 DeclaredPredicates, 145 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:50,534 INFO ]: Start minimizeSevpa. Operand 780 states. [2018-06-24 21:23:50,579 INFO ]: Finished minimizeSevpa. Reduced states from 780 to 780. [2018-06-24 21:23:50,579 INFO ]: Start removeUnreachable. Operand 780 states. [2018-06-24 21:23:50,599 INFO ]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1451 transitions. [2018-06-24 21:23:50,599 INFO ]: Start accepts. Automaton has 780 states and 1451 transitions. Word has length 143 [2018-06-24 21:23:50,599 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:50,599 INFO ]: Abstraction has 780 states and 1451 transitions. [2018-06-24 21:23:50,599 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:50,599 INFO ]: Start isEmpty. Operand 780 states and 1451 transitions. [2018-06-24 21:23:50,643 INFO ]: Finished isEmpty. Found accepting run of length 285 [2018-06-24 21:23:50,643 INFO ]: Found error trace [2018-06-24 21:23:50,644 INFO ]: trace histogram [20, 20, 20, 20, 20, 13, 13, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2018-06-24 21:23:50,645 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:50,645 INFO ]: Analyzing trace with hash -465386947, now seen corresponding path program 1 times [2018-06-24 21:23:50,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:50,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:50,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:50,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:50,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:50,672 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:50,889 INFO ]: Checked inductivity of 5058 backedges. 156 proven. 309 refuted. 0 times theorem prover too weak. 4593 trivial. 0 not checked. [2018-06-24 21:23:50,889 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:23:50,889 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:23:50,948 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:51,300 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:51,313 INFO ]: Computing forward predicates... [2018-06-24 21:23:51,356 INFO ]: Checked inductivity of 5058 backedges. 1380 proven. 0 refuted. 0 times theorem prover too weak. 3678 trivial. 0 not checked. [2018-06-24 21:23:51,376 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:23:51,377 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:23:51,377 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:51,377 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:51,377 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:51,378 INFO ]: Start difference. First operand 780 states and 1451 transitions. Second operand 3 states. [2018-06-24 21:23:51,601 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:51,601 INFO ]: Finished difference Result 838 states and 1559 transitions. [2018-06-24 21:23:51,602 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:51,602 INFO ]: Start accepts. Automaton has 3 states. Word has length 284 [2018-06-24 21:23:51,602 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:51,631 INFO ]: With dead ends: 838 [2018-06-24 21:23:51,631 INFO ]: Without dead ends: 838 [2018-06-24 21:23:51,631 INFO ]: 0 DeclaredPredicates, 286 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:51,632 INFO ]: Start minimizeSevpa. Operand 838 states. [2018-06-24 21:23:51,680 INFO ]: Finished minimizeSevpa. Reduced states from 838 to 838. [2018-06-24 21:23:51,680 INFO ]: Start removeUnreachable. Operand 838 states. [2018-06-24 21:23:51,700 INFO ]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1559 transitions. [2018-06-24 21:23:51,700 INFO ]: Start accepts. Automaton has 838 states and 1559 transitions. Word has length 284 [2018-06-24 21:23:51,701 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:51,701 INFO ]: Abstraction has 838 states and 1559 transitions. [2018-06-24 21:23:51,701 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:51,701 INFO ]: Start isEmpty. Operand 838 states and 1559 transitions. [2018-06-24 21:23:51,751 INFO ]: Finished isEmpty. Found accepting run of length 345 [2018-06-24 21:23:51,751 INFO ]: Found error trace [2018-06-24 21:23:51,751 INFO ]: trace histogram [25, 25, 25, 25, 25, 18, 18, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2018-06-24 21:23:51,751 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:51,751 INFO ]: Analyzing trace with hash -571870379, now seen corresponding path program 1 times [2018-06-24 21:23:51,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:51,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:51,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:51,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:51,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:52,193 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:52,507 INFO ]: Checked inductivity of 7608 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 7414 trivial. 0 not checked. [2018-06-24 21:23:52,508 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:23:52,508 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:23:52,508 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:52,508 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:52,508 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:52,508 INFO ]: Start difference. First operand 838 states and 1559 transitions. Second operand 3 states. [2018-06-24 21:23:52,829 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:52,829 INFO ]: Finished difference Result 881 states and 1644 transitions. [2018-06-24 21:23:52,829 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:23:52,829 INFO ]: Start accepts. Automaton has 3 states. Word has length 344 [2018-06-24 21:23:52,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:52,855 INFO ]: With dead ends: 881 [2018-06-24 21:23:52,855 INFO ]: Without dead ends: 881 [2018-06-24 21:23:52,855 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:52,856 INFO ]: Start minimizeSevpa. Operand 881 states. [2018-06-24 21:23:52,906 INFO ]: Finished minimizeSevpa. Reduced states from 881 to 881. [2018-06-24 21:23:52,906 INFO ]: Start removeUnreachable. Operand 881 states. [2018-06-24 21:23:52,920 INFO ]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1644 transitions. [2018-06-24 21:23:52,920 INFO ]: Start accepts. Automaton has 881 states and 1644 transitions. Word has length 344 [2018-06-24 21:23:52,921 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:52,921 INFO ]: Abstraction has 881 states and 1644 transitions. [2018-06-24 21:23:52,921 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:23:52,921 INFO ]: Start isEmpty. Operand 881 states and 1644 transitions. [2018-06-24 21:23:52,967 INFO ]: Finished isEmpty. Found accepting run of length 192 [2018-06-24 21:23:52,967 INFO ]: Found error trace [2018-06-24 21:23:52,967 INFO ]: trace histogram [14, 14, 14, 14, 14, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:23:52,967 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:52,967 INFO ]: Analyzing trace with hash -1607246601, now seen corresponding path program 2 times [2018-06-24 21:23:52,967 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:52,967 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:52,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:52,968 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:52,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:53,014 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:53,227 INFO ]: Checked inductivity of 2310 backedges. 135 proven. 60 refuted. 0 times theorem prover too weak. 2115 trivial. 0 not checked. [2018-06-24 21:23:53,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:23:53,227 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:23:53,232 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:23:53,438 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:23:53,438 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:53,449 INFO ]: Computing forward predicates... [2018-06-24 21:23:53,777 INFO ]: Checked inductivity of 2310 backedges. 1044 proven. 53 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2018-06-24 21:23:53,809 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:23:53,809 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2018-06-24 21:23:53,810 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:23:53,810 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:23:53,810 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:23:53,810 INFO ]: Start difference. First operand 881 states and 1644 transitions. Second operand 11 states. [2018-06-24 21:23:56,687 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:56,687 INFO ]: Finished difference Result 1324 states and 3582 transitions. [2018-06-24 21:23:56,687 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:23:56,687 INFO ]: Start accepts. Automaton has 11 states. Word has length 191 [2018-06-24 21:23:56,688 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:56,757 INFO ]: With dead ends: 1324 [2018-06-24 21:23:56,757 INFO ]: Without dead ends: 1324 [2018-06-24 21:23:56,757 INFO ]: 0 DeclaredPredicates, 207 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:23:56,759 INFO ]: Start minimizeSevpa. Operand 1324 states. [2018-06-24 21:23:56,887 INFO ]: Finished minimizeSevpa. Reduced states from 1324 to 1027. [2018-06-24 21:23:56,887 INFO ]: Start removeUnreachable. Operand 1027 states. [2018-06-24 21:23:56,918 INFO ]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 2084 transitions. [2018-06-24 21:23:56,918 INFO ]: Start accepts. Automaton has 1027 states and 2084 transitions. Word has length 191 [2018-06-24 21:23:56,919 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:56,919 INFO ]: Abstraction has 1027 states and 2084 transitions. [2018-06-24 21:23:56,919 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:23:56,919 INFO ]: Start isEmpty. Operand 1027 states and 2084 transitions. [2018-06-24 21:23:56,998 INFO ]: Finished isEmpty. Found accepting run of length 192 [2018-06-24 21:23:56,998 INFO ]: Found error trace [2018-06-24 21:23:56,998 INFO ]: trace histogram [14, 14, 14, 14, 14, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:23:56,998 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:56,998 INFO ]: Analyzing trace with hash -1843864426, now seen corresponding path program 1 times [2018-06-24 21:23:56,999 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:56,999 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:56,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:56,999 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:23:56,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:57,048 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:57,202 INFO ]: Checked inductivity of 2310 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 2257 trivial. 0 not checked. [2018-06-24 21:23:57,202 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:23:57,202 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:23:57,202 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:23:57,202 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:23:57,202 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:23:57,202 INFO ]: Start difference. First operand 1027 states and 2084 transitions. Second operand 4 states. [2018-06-24 21:23:57,240 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:57,240 INFO ]: Finished difference Result 1097 states and 2154 transitions. [2018-06-24 21:23:57,240 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:23:57,240 INFO ]: Start accepts. Automaton has 4 states. Word has length 191 [2018-06-24 21:23:57,240 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:57,270 INFO ]: With dead ends: 1097 [2018-06-24 21:23:57,270 INFO ]: Without dead ends: 1013 [2018-06-24 21:23:57,270 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:23:57,271 INFO ]: Start minimizeSevpa. Operand 1013 states. [2018-06-24 21:23:57,360 INFO ]: Finished minimizeSevpa. Reduced states from 1013 to 1013. [2018-06-24 21:23:57,360 INFO ]: Start removeUnreachable. Operand 1013 states. [2018-06-24 21:23:57,391 INFO ]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2012 transitions. [2018-06-24 21:23:57,391 INFO ]: Start accepts. Automaton has 1013 states and 2012 transitions. Word has length 191 [2018-06-24 21:23:57,391 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:57,391 INFO ]: Abstraction has 1013 states and 2012 transitions. [2018-06-24 21:23:57,391 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:23:57,392 INFO ]: Start isEmpty. Operand 1013 states and 2012 transitions. [2018-06-24 21:23:57,495 INFO ]: Finished isEmpty. Found accepting run of length 210 [2018-06-24 21:23:57,495 INFO ]: Found error trace [2018-06-24 21:23:57,495 INFO ]: trace histogram [16, 16, 16, 16, 16, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:23:57,495 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:57,496 INFO ]: Analyzing trace with hash -1487741907, now seen corresponding path program 1 times [2018-06-24 21:23:57,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:57,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:57,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:57,497 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:57,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:57,531 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:57,708 INFO ]: Checked inductivity of 2771 backedges. 180 proven. 116 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-06-24 21:23:57,709 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:23:57,709 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:23:57,714 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:57,962 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:57,971 INFO ]: Computing forward predicates... [2018-06-24 21:23:58,133 INFO ]: Checked inductivity of 2771 backedges. 385 proven. 1 refuted. 0 times theorem prover too weak. 2385 trivial. 0 not checked. [2018-06-24 21:23:58,166 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:23:58,167 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2018-06-24 21:23:58,167 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:23:58,167 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:23:58,167 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:23:58,167 INFO ]: Start difference. First operand 1013 states and 2012 transitions. Second operand 10 states. [2018-06-24 21:23:58,766 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:23:58,766 INFO ]: Finished difference Result 1073 states and 2161 transitions. [2018-06-24 21:23:58,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:23:58,767 INFO ]: Start accepts. Automaton has 10 states. Word has length 209 [2018-06-24 21:23:58,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:23:58,813 INFO ]: With dead ends: 1073 [2018-06-24 21:23:58,813 INFO ]: Without dead ends: 1014 [2018-06-24 21:23:58,813 INFO ]: 0 DeclaredPredicates, 216 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:23:58,814 INFO ]: Start minimizeSevpa. Operand 1014 states. [2018-06-24 21:23:58,903 INFO ]: Finished minimizeSevpa. Reduced states from 1014 to 1013. [2018-06-24 21:23:58,903 INFO ]: Start removeUnreachable. Operand 1013 states. [2018-06-24 21:23:58,938 INFO ]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2008 transitions. [2018-06-24 21:23:58,938 INFO ]: Start accepts. Automaton has 1013 states and 2008 transitions. Word has length 209 [2018-06-24 21:23:58,938 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:23:58,938 INFO ]: Abstraction has 1013 states and 2008 transitions. [2018-06-24 21:23:58,938 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:23:58,938 INFO ]: Start isEmpty. Operand 1013 states and 2008 transitions. [2018-06-24 21:23:58,976 INFO ]: Finished isEmpty. Found accepting run of length 341 [2018-06-24 21:23:58,976 INFO ]: Found error trace [2018-06-24 21:23:58,976 INFO ]: trace histogram [24, 24, 24, 24, 24, 17, 17, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:23:58,976 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:23:58,976 INFO ]: Analyzing trace with hash 275896183, now seen corresponding path program 1 times [2018-06-24 21:23:58,976 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:23:58,976 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:23:58,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:58,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:23:58,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:23:59,035 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:59,243 INFO ]: Checked inductivity of 7510 backedges. 113 proven. 46 refuted. 0 times theorem prover too weak. 7351 trivial. 0 not checked. [2018-06-24 21:23:59,243 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:23:59,243 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) [2018-06-24 21:23:59,256 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:23:59,702 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:23:59,729 INFO ]: Computing forward predicates... [2018-06-24 21:23:59,892 INFO ]: Checked inductivity of 7510 backedges. 3782 proven. 0 refuted. 0 times theorem prover too weak. 3728 trivial. 0 not checked. [2018-06-24 21:23:59,913 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:23:59,913 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:23:59,913 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:23:59,914 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:23:59,914 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:23:59,914 INFO ]: Start difference. First operand 1013 states and 2008 transitions. Second operand 3 states. [2018-06-24 21:24:00,206 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:00,206 INFO ]: Finished difference Result 1073 states and 2123 transitions. [2018-06-24 21:24:00,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:24:00,206 INFO ]: Start accepts. Automaton has 3 states. Word has length 340 [2018-06-24 21:24:00,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:00,232 INFO ]: With dead ends: 1073 [2018-06-24 21:24:00,232 INFO ]: Without dead ends: 1073 [2018-06-24 21:24:00,232 INFO ]: 0 DeclaredPredicates, 342 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:24:00,232 INFO ]: Start minimizeSevpa. Operand 1073 states. [2018-06-24 21:24:00,312 INFO ]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2018-06-24 21:24:00,312 INFO ]: Start removeUnreachable. Operand 1073 states. [2018-06-24 21:24:00,346 INFO ]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 2123 transitions. [2018-06-24 21:24:00,346 INFO ]: Start accepts. Automaton has 1073 states and 2123 transitions. Word has length 340 [2018-06-24 21:24:00,347 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:00,347 INFO ]: Abstraction has 1073 states and 2123 transitions. [2018-06-24 21:24:00,347 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:24:00,347 INFO ]: Start isEmpty. Operand 1073 states and 2123 transitions. [2018-06-24 21:24:00,399 INFO ]: Finished isEmpty. Found accepting run of length 342 [2018-06-24 21:24:00,399 INFO ]: Found error trace [2018-06-24 21:24:00,399 INFO ]: trace histogram [24, 24, 24, 24, 24, 17, 17, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:00,399 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:00,399 INFO ]: Analyzing trace with hash 2007770751, now seen corresponding path program 1 times [2018-06-24 21:24:00,399 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:00,399 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:00,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:00,400 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:00,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:00,498 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:00,798 INFO ]: Checked inductivity of 7511 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 7429 trivial. 0 not checked. [2018-06-24 21:24:00,798 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:24:00,798 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:24:00,805 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:01,140 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:01,159 INFO ]: Computing forward predicates... [2018-06-24 21:24:01,527 INFO ]: Checked inductivity of 7511 backedges. 248 proven. 285 refuted. 0 times theorem prover too weak. 6978 trivial. 0 not checked. [2018-06-24 21:24:01,549 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:24:01,549 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13] total 14 [2018-06-24 21:24:01,549 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:24:01,550 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:24:01,550 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:24:01,550 INFO ]: Start difference. First operand 1073 states and 2123 transitions. Second operand 14 states. [2018-06-24 21:24:05,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:05,772 INFO ]: Finished difference Result 1566 states and 3954 transitions. [2018-06-24 21:24:05,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 21:24:05,772 INFO ]: Start accepts. Automaton has 14 states. Word has length 341 [2018-06-24 21:24:05,773 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:05,837 INFO ]: With dead ends: 1566 [2018-06-24 21:24:05,838 INFO ]: Without dead ends: 1506 [2018-06-24 21:24:05,838 INFO ]: 0 DeclaredPredicates, 360 GetRequests, 335 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:24:05,838 INFO ]: Start minimizeSevpa. Operand 1506 states. [2018-06-24 21:24:05,982 INFO ]: Finished minimizeSevpa. Reduced states from 1506 to 931. [2018-06-24 21:24:05,982 INFO ]: Start removeUnreachable. Operand 931 states. [2018-06-24 21:24:06,018 INFO ]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1851 transitions. [2018-06-24 21:24:06,018 INFO ]: Start accepts. Automaton has 931 states and 1851 transitions. Word has length 341 [2018-06-24 21:24:06,019 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:06,019 INFO ]: Abstraction has 931 states and 1851 transitions. [2018-06-24 21:24:06,019 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:24:06,019 INFO ]: Start isEmpty. Operand 931 states and 1851 transitions. [2018-06-24 21:24:06,090 INFO ]: Finished isEmpty. Found accepting run of length 303 [2018-06-24 21:24:06,091 INFO ]: Found error trace [2018-06-24 21:24:06,091 INFO ]: trace histogram [23, 23, 23, 23, 23, 16, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:06,091 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:06,091 INFO ]: Analyzing trace with hash -1089301819, now seen corresponding path program 1 times [2018-06-24 21:24:06,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:06,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:06,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:06,092 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:06,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:06,146 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:06,454 INFO ]: Checked inductivity of 5885 backedges. 290 proven. 86 refuted. 0 times theorem prover too weak. 5509 trivial. 0 not checked. [2018-06-24 21:24:06,454 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:24:06,454 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:24:06,467 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:24:06,822 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:06,838 INFO ]: Computing forward predicates... [2018-06-24 21:24:07,093 INFO ]: Checked inductivity of 5885 backedges. 2159 proven. 15 refuted. 0 times theorem prover too weak. 3711 trivial. 0 not checked. [2018-06-24 21:24:07,128 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:24:07,128 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2018-06-24 21:24:07,128 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:24:07,128 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:24:07,128 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:24:07,129 INFO ]: Start difference. First operand 931 states and 1851 transitions. Second operand 10 states. [2018-06-24 21:24:16,983 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:16,983 INFO ]: Finished difference Result 2640 states and 10939 transitions. [2018-06-24 21:24:16,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 21:24:16,983 INFO ]: Start accepts. Automaton has 10 states. Word has length 302 [2018-06-24 21:24:16,984 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:17,261 INFO ]: With dead ends: 2640 [2018-06-24 21:24:17,261 INFO ]: Without dead ends: 2367 [2018-06-24 21:24:17,262 INFO ]: 0 DeclaredPredicates, 337 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:24:17,263 INFO ]: Start minimizeSevpa. Operand 2367 states. [2018-06-24 21:24:17,861 INFO ]: Finished minimizeSevpa. Reduced states from 2367 to 1097. [2018-06-24 21:24:17,862 INFO ]: Start removeUnreachable. Operand 1097 states. [2018-06-24 21:24:17,902 INFO ]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 2491 transitions. [2018-06-24 21:24:17,902 INFO ]: Start accepts. Automaton has 1097 states and 2491 transitions. Word has length 302 [2018-06-24 21:24:17,904 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:17,904 INFO ]: Abstraction has 1097 states and 2491 transitions. [2018-06-24 21:24:17,904 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:24:17,904 INFO ]: Start isEmpty. Operand 1097 states and 2491 transitions. [2018-06-24 21:24:17,980 INFO ]: Finished isEmpty. Found accepting run of length 366 [2018-06-24 21:24:17,980 INFO ]: Found error trace [2018-06-24 21:24:17,980 INFO ]: trace histogram [27, 27, 27, 27, 27, 20, 18, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:17,980 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:17,981 INFO ]: Analyzing trace with hash 2011970631, now seen corresponding path program 1 times [2018-06-24 21:24:17,981 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:17,981 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:17,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:17,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:17,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:18,086 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:18,618 INFO ]: Checked inductivity of 8654 backedges. 383 proven. 104 refuted. 0 times theorem prover too weak. 8167 trivial. 0 not checked. [2018-06-24 21:24:18,618 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:24:18,618 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:24:18,626 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:18,967 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:18,989 INFO ]: Computing forward predicates... [2018-06-24 21:24:19,179 INFO ]: Checked inductivity of 8654 backedges. 4548 proven. 79 refuted. 0 times theorem prover too weak. 4027 trivial. 0 not checked. [2018-06-24 21:24:19,214 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:24:19,214 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-24 21:24:19,214 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:24:19,215 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:24:19,215 INFO ]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:24:19,215 INFO ]: Start difference. First operand 1097 states and 2491 transitions. Second operand 18 states. Received shutdown request... [2018-06-24 21:24:25,465 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 21:24:25,465 WARN ]: Verification canceled [2018-06-24 21:24:25,468 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:24:25,469 WARN ]: Timeout [2018-06-24 21:24:25,469 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:24:25 BasicIcfg [2018-06-24 21:24:25,469 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:24:25,470 INFO ]: Toolchain (without parser) took 51796.34 ms. Allocated memory was 304.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 233.1 MB in the beginning and 287.2 MB in the end (delta: -54.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 3.6 GB. [2018-06-24 21:24:25,471 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 304.6 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:24:25,472 INFO ]: ChcToBoogie took 92.87 ms. Allocated memory is still 304.6 MB. Free memory was 232.1 MB in the beginning and 229.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:24:25,472 INFO ]: Boogie Preprocessor took 74.63 ms. Allocated memory is still 304.6 MB. Free memory was 229.1 MB in the beginning and 227.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:24:25,472 INFO ]: RCFGBuilder took 1177.87 ms. Allocated memory was 304.6 MB in the beginning and 321.4 MB in the end (delta: 16.8 MB). Free memory was 227.0 MB in the beginning and 291.3 MB in the end (delta: -64.3 MB). Peak memory consumption was 49.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:24:25,473 INFO ]: BlockEncodingV2 took 1196.87 ms. Allocated memory is still 321.4 MB. Free memory was 291.3 MB in the beginning and 247.5 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 3.6 GB. [2018-06-24 21:24:25,473 INFO ]: TraceAbstraction took 49241.32 ms. Allocated memory was 321.4 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 247.5 MB in the beginning and 287.2 MB in the end (delta: -39.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 3.6 GB. [2018-06-24 21:24:25,477 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 123 locations, 205 edges - StatisticsResult: Encoded RCFG 84 locations, 169 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 304.6 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 92.87 ms. Allocated memory is still 304.6 MB. Free memory was 232.1 MB in the beginning and 229.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 74.63 ms. Allocated memory is still 304.6 MB. Free memory was 229.1 MB in the beginning and 227.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1177.87 ms. Allocated memory was 304.6 MB in the beginning and 321.4 MB in the end (delta: 16.8 MB). Free memory was 227.0 MB in the beginning and 291.3 MB in the end (delta: -64.3 MB). Peak memory consumption was 49.4 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1196.87 ms. Allocated memory is still 321.4 MB. Free memory was 291.3 MB in the beginning and 247.5 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 3.6 GB. * TraceAbstraction took 49241.32 ms. Allocated memory was 321.4 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 247.5 MB in the beginning and 287.2 MB in the end (delta: -39.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (1097states) and interpolant automaton (currently 46 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1298 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. TIMEOUT Result, 49.1s OverallTime, 22 OverallIterations, 27 TraceHistogramMax, 35.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5950 SDtfs, 2011 SDslu, 19226 SDs, 0 SdLazy, 29452 SolverSat, 4470 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2786 GetRequests, 2636 SyntacticMatches, 3 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1097occurred in iteration=21, 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: 2.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 2199 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 5781 NumberOfCodeBlocks, 5781 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 5744 ConstructedInterpolants, 0 QuantifiedInterpolants, 1625389 SizeOfPredicates, 47 NumberOfNonLiveVariables, 28420 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 37 InterpolantComputations, 17 PerfectInterpolantSequences, 93852/95260 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/queen.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-24-25-486.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/queen.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-24-25-486.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/queen.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-24-25-486.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/queen.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-24-25-486.csv Completed graceful shutdown