java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:52:52,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:52:52,662 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:52:52,675 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:52:52,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:52:52,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:52:52,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:52:52,681 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:52:52,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:52:52,684 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:52:52,685 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:52:52,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:52:52,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:52:52,689 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:52:52,690 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:52:52,691 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:52:52,692 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:52:52,702 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:52:52,703 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:52:52,704 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:52:52,705 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:52:52,710 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:52:52,710 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:52:52,710 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:52:52,711 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:52:52,712 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:52:52,712 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:52:52,713 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:52:52,717 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:52:52,717 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:52:52,718 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:52:52,718 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:52:52,718 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:52:52,719 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:52:52,720 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:52:52,721 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:52:52,737 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:52:52,737 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:52:52,737 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:52:52,738 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:52:52,738 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:52:52,739 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:52:52,739 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:52:52,739 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:52:52,739 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:52:52,740 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:52:52,741 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:52:52,741 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:52:52,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:52:52,741 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:52:52,741 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:52:52,742 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:52:52,742 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:52:52,742 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:52:52,742 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:52:52,742 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:52:52,742 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:52:52,745 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:52:52,746 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:52:52,792 INFO ]: Repository-Root is: /tmp [2018-06-24 20:52:52,808 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:52:52,813 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:52:52,815 INFO ]: Initializing SmtParser... [2018-06-24 20:52:52,815 INFO ]: SmtParser initialized [2018-06-24 20:52:52,816 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 [2018-06-24 20:52:52,817 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:52:52,903 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 unknown [2018-06-24 20:52:53,066 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 [2018-06-24 20:52:53,071 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:52:53,078 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:52:53,079 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:52:53,079 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:52:53,079 INFO ]: ChcToBoogie initialized [2018-06-24 20:52:53,082 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:52:53" (1/1) ... [2018-06-24 20:52:53,137 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:53 Unit [2018-06-24 20:52:53,137 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:52:53,138 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:52:53,138 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:52:53,138 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:52:53,157 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:53" (1/1) ... [2018-06-24 20:52:53,157 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:53" (1/1) ... [2018-06-24 20:52:53,165 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:53" (1/1) ... [2018-06-24 20:52:53,165 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:53" (1/1) ... [2018-06-24 20:52:53,167 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:53" (1/1) ... [2018-06-24 20:52:53,170 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:53" (1/1) ... [2018-06-24 20:52:53,170 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:53" (1/1) ... [2018-06-24 20:52:53,173 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:52:53,173 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:52:53,173 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:52:53,173 INFO ]: RCFGBuilder initialized [2018-06-24 20:52:53,174 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:53" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:52:53,188 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:52:53,188 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:52:53,188 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:52:53,188 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:52:53,188 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:52:53,188 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:52:53,434 INFO ]: Using library mode [2018-06-24 20:52:53,434 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:52:53 BoogieIcfgContainer [2018-06-24 20:52:53,434 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:52:53,435 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:52:53,435 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:52:53,436 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:52:53,436 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:52:53" (1/1) ... [2018-06-24 20:52:53,451 INFO ]: Initial Icfg 14 locations, 16 edges [2018-06-24 20:52:53,452 INFO ]: Using Remove infeasible edges [2018-06-24 20:52:53,452 INFO ]: Using Maximize final states [2018-06-24 20:52:53,453 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:52:53,453 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:52:53,455 INFO ]: Using Remove sink states [2018-06-24 20:52:53,455 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:52:53,455 INFO ]: Using Use SBE [2018-06-24 20:52:53,461 INFO ]: SBE split 0 edges [2018-06-24 20:52:53,466 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:52:53,467 INFO ]: 0 new accepting states [2018-06-24 20:52:53,534 INFO ]: Removed 8 edges and 4 locations by large block encoding [2018-06-24 20:52:53,536 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:52:53,541 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:52:53,541 INFO ]: 0 new accepting states [2018-06-24 20:52:53,541 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:52:53,541 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:52:53,542 INFO ]: Encoded RCFG 8 locations, 10 edges [2018-06-24 20:52:53,542 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:52:53 BasicIcfg [2018-06-24 20:52:53,542 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:52:53,555 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:52:53,555 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:52:53,558 INFO ]: TraceAbstraction initialized [2018-06-24 20:52:53,558 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:52:53" (1/4) ... [2018-06-24 20:52:53,559 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c28aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:52:53, skipping insertion in model container [2018-06-24 20:52:53,559 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:53" (2/4) ... [2018-06-24 20:52:53,560 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c28aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:52:53, skipping insertion in model container [2018-06-24 20:52:53,560 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:52:53" (3/4) ... [2018-06-24 20:52:53,560 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c28aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:52:53, skipping insertion in model container [2018-06-24 20:52:53,560 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:52:53" (4/4) ... [2018-06-24 20:52:53,561 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:52:53,571 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:52:53,578 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:52:53,618 INFO ]: Using default assertion order modulation [2018-06-24 20:52:53,619 INFO ]: Interprodecural is true [2018-06-24 20:52:53,619 INFO ]: Hoare is false [2018-06-24 20:52:53,619 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:52:53,619 INFO ]: Backedges is TWOTRACK [2018-06-24 20:52:53,619 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:52:53,619 INFO ]: Difference is false [2018-06-24 20:52:53,619 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:52:53,619 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:52:53,628 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 20:52:53,637 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:52:53,637 INFO ]: Found error trace [2018-06-24 20:52:53,638 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:53,638 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:53,643 INFO ]: Analyzing trace with hash -1173083044, now seen corresponding path program 1 times [2018-06-24 20:52:53,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:53,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:53,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:53,679 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:53,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:53,718 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:53,796 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:53,798 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:52:53,798 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:52:53,800 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:52:53,810 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:52:53,810 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:52:53,813 INFO ]: Start difference. First operand 8 states. Second operand 4 states. [2018-06-24 20:52:53,912 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:53,912 INFO ]: Finished difference Result 13 states and 18 transitions. [2018-06-24 20:52:53,912 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:52:53,913 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:52:53,913 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:53,921 INFO ]: With dead ends: 13 [2018-06-24 20:52:53,921 INFO ]: Without dead ends: 13 [2018-06-24 20:52:53,923 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:52:53,935 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:52:53,948 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-24 20:52:53,949 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:52:53,950 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-24 20:52:53,951 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-06-24 20:52:53,951 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:53,951 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-24 20:52:53,951 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:52:53,951 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-24 20:52:53,952 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:52:53,952 INFO ]: Found error trace [2018-06-24 20:52:53,952 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:53,952 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:53,952 INFO ]: Analyzing trace with hash -2007083269, now seen corresponding path program 1 times [2018-06-24 20:52:53,952 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:53,952 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:53,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:53,953 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:53,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:53,968 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:54,088 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:54,088 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:54,088 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) [2018-06-24 20:52:54,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:54,144 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:54,151 INFO ]: Computing forward predicates... [2018-06-24 20:52:54,495 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:54,529 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:52:54,529 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-06-24 20:52:54,530 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:52:54,530 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:52:54,530 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:52:54,530 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 9 states. [2018-06-24 20:52:54,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:54,762 INFO ]: Finished difference Result 12 states and 16 transitions. [2018-06-24 20:52:54,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:52:54,763 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-24 20:52:54,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:54,763 INFO ]: With dead ends: 12 [2018-06-24 20:52:54,763 INFO ]: Without dead ends: 9 [2018-06-24 20:52:54,764 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:52:54,764 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:52:54,765 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:52:54,765 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:52:54,766 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-24 20:52:54,766 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 8 [2018-06-24 20:52:54,766 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:54,766 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-24 20:52:54,766 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:52:54,766 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-24 20:52:54,766 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:52:54,766 INFO ]: Found error trace [2018-06-24 20:52:54,766 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:54,766 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:54,767 INFO ]: Analyzing trace with hash -1980301160, now seen corresponding path program 1 times [2018-06-24 20:52:54,767 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:54,767 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:54,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:54,768 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:54,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:54,779 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:54,843 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:54,843 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:52:54,843 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:52:54,843 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:52:54,843 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:52:54,843 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:52:54,843 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-06-24 20:52:54,905 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:54,905 INFO ]: Finished difference Result 11 states and 14 transitions. [2018-06-24 20:52:54,905 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:52:54,905 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 20:52:54,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:54,906 INFO ]: With dead ends: 11 [2018-06-24 20:52:54,906 INFO ]: Without dead ends: 10 [2018-06-24 20:52:54,906 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:52:54,906 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:52:54,908 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:52:54,908 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:52:54,908 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-24 20:52:54,908 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-06-24 20:52:54,908 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:54,908 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-24 20:52:54,908 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:52:54,908 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-24 20:52:54,908 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:52:54,908 INFO ]: Found error trace [2018-06-24 20:52:54,909 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:54,909 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:54,909 INFO ]: Analyzing trace with hash -1261041089, now seen corresponding path program 1 times [2018-06-24 20:52:54,909 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:54,909 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:54,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:54,910 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:54,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:54,924 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:55,119 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:52:55,119 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:52:55,119 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:52:55,120 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:52:55,120 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:52:55,120 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:52:55,120 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-06-24 20:52:55,234 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:55,235 INFO ]: Finished difference Result 11 states and 13 transitions. [2018-06-24 20:52:55,237 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:52:55,237 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:52:55,237 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:55,237 INFO ]: With dead ends: 11 [2018-06-24 20:52:55,237 INFO ]: Without dead ends: 11 [2018-06-24 20:52:55,237 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:52:55,237 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:52:55,238 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:52:55,238 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:52:55,239 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-24 20:52:55,239 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-06-24 20:52:55,239 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:55,239 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-24 20:52:55,239 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:52:55,239 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-24 20:52:55,239 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:52:55,239 INFO ]: Found error trace [2018-06-24 20:52:55,239 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:55,240 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:55,240 INFO ]: Analyzing trace with hash -437802474, now seen corresponding path program 1 times [2018-06-24 20:52:55,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:55,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:55,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:55,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:55,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:55,259 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:55,473 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:52:55,473 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:55,473 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 20:52:55,496 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 20:52:55,534 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:55,537 INFO ]: Computing forward predicates... [2018-06-24 20:52:55,905 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:52:55,925 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:55,925 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-24 20:52:55,925 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:52:55,925 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:52:55,925 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:52:55,925 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 11 states. [2018-06-24 20:52:56,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:56,036 INFO ]: Finished difference Result 18 states and 23 transitions. [2018-06-24 20:52:56,036 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:52:56,036 INFO ]: Start accepts. Automaton has 11 states. Word has length 10 [2018-06-24 20:52:56,037 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:56,037 INFO ]: With dead ends: 18 [2018-06-24 20:52:56,037 INFO ]: Without dead ends: 18 [2018-06-24 20:52:56,037 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:52:56,037 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:52:56,039 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-24 20:52:56,039 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:52:56,039 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-06-24 20:52:56,039 INFO ]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2018-06-24 20:52:56,039 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:56,040 INFO ]: Abstraction has 13 states and 16 transitions. [2018-06-24 20:52:56,040 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:52:56,040 INFO ]: Start isEmpty. Operand 13 states and 16 transitions. [2018-06-24 20:52:56,040 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:52:56,040 INFO ]: Found error trace [2018-06-24 20:52:56,040 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:56,040 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:56,040 INFO ]: Analyzing trace with hash -718608899, now seen corresponding path program 2 times [2018-06-24 20:52:56,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:56,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:56,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:56,041 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:56,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:56,053 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:56,217 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:52:56,217 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:56,217 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:56,223 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:56,242 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:56,242 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:56,244 INFO ]: Computing forward predicates... [2018-06-24 20:52:56,323 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:52:56,342 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:56,342 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-24 20:52:56,342 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:52:56,343 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:52:56,343 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:52:56,343 INFO ]: Start difference. First operand 13 states and 16 transitions. Second operand 12 states. [2018-06-24 20:52:56,830 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2018-06-24 20:52:57,076 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:57,076 INFO ]: Finished difference Result 23 states and 29 transitions. [2018-06-24 20:52:57,077 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:52:57,077 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-24 20:52:57,077 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:57,077 INFO ]: With dead ends: 23 [2018-06-24 20:52:57,077 INFO ]: Without dead ends: 17 [2018-06-24 20:52:57,078 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:52:57,078 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:52:57,079 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-24 20:52:57,079 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:52:57,080 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-24 20:52:57,080 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 11 [2018-06-24 20:52:57,080 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:57,080 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-24 20:52:57,080 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:52:57,080 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-24 20:52:57,080 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:52:57,080 INFO ]: Found error trace [2018-06-24 20:52:57,080 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:57,081 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:57,081 INFO ]: Analyzing trace with hash -750805926, now seen corresponding path program 3 times [2018-06-24 20:52:57,081 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:57,081 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:57,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:57,081 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:57,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:57,093 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:57,183 INFO ]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:52:57,183 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:57,183 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:57,190 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:57,214 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:52:57,214 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:57,216 INFO ]: Computing forward predicates... [2018-06-24 20:52:57,251 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:52:57,273 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:57,273 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-24 20:52:57,273 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:52:57,273 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:52:57,273 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:52:57,274 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 10 states. [2018-06-24 20:52:57,327 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:57,327 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-24 20:52:57,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:52:57,328 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 20:52:57,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:57,328 INFO ]: With dead ends: 16 [2018-06-24 20:52:57,328 INFO ]: Without dead ends: 16 [2018-06-24 20:52:57,329 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:52:57,329 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:52:57,330 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-24 20:52:57,330 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:52:57,330 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-24 20:52:57,330 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2018-06-24 20:52:57,330 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:57,330 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-24 20:52:57,330 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:52:57,331 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-24 20:52:57,331 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:52:57,331 INFO ]: Found error trace [2018-06-24 20:52:57,331 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:57,331 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:57,331 INFO ]: Analyzing trace with hash -1800381605, now seen corresponding path program 4 times [2018-06-24 20:52:57,331 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:57,331 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:57,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:57,332 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:57,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:57,343 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:57,424 INFO ]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:52:57,424 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:57,424 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:57,430 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:57,451 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:57,451 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:57,453 INFO ]: Computing forward predicates... [2018-06-24 20:52:57,499 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:52:57,518 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:57,518 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-24 20:52:57,518 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:52:57,518 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:52:57,519 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:52:57,519 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 11 states. [2018-06-24 20:52:57,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:57,569 INFO ]: Finished difference Result 17 states and 20 transitions. [2018-06-24 20:52:57,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:52:57,569 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 20:52:57,570 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:57,570 INFO ]: With dead ends: 17 [2018-06-24 20:52:57,570 INFO ]: Without dead ends: 14 [2018-06-24 20:52:57,570 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:52:57,570 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:52:57,571 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:52:57,571 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:52:57,572 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-24 20:52:57,572 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2018-06-24 20:52:57,572 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:57,572 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-24 20:52:57,572 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:52:57,572 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-24 20:52:57,572 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:52:57,572 INFO ]: Found error trace [2018-06-24 20:52:57,572 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:57,573 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:57,573 INFO ]: Analyzing trace with hash -950880420, now seen corresponding path program 5 times [2018-06-24 20:52:57,573 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:57,573 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:57,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:57,573 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:57,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:57,596 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:57,693 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:52:57,693 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:57,693 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:57,700 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:52:57,744 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:57,744 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:57,747 INFO ]: Computing forward predicates... [2018-06-24 20:52:58,237 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:52:58,269 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:58,269 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-24 20:52:58,269 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:52:58,269 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:52:58,269 INFO ]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:52:58,269 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 15 states. [2018-06-24 20:52:58,555 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:58,555 INFO ]: Finished difference Result 23 states and 28 transitions. [2018-06-24 20:52:58,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:52:58,558 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-24 20:52:58,558 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:58,558 INFO ]: With dead ends: 23 [2018-06-24 20:52:58,558 INFO ]: Without dead ends: 23 [2018-06-24 20:52:58,559 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:52:58,559 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:52:58,560 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-06-24 20:52:58,560 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:52:58,561 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-06-24 20:52:58,561 INFO ]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 13 [2018-06-24 20:52:58,561 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:58,561 INFO ]: Abstraction has 16 states and 19 transitions. [2018-06-24 20:52:58,561 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:52:58,561 INFO ]: Start isEmpty. Operand 16 states and 19 transitions. [2018-06-24 20:52:58,561 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:52:58,561 INFO ]: Found error trace [2018-06-24 20:52:58,561 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:58,562 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:58,562 INFO ]: Analyzing trace with hash -386147461, now seen corresponding path program 6 times [2018-06-24 20:52:58,562 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:58,562 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:58,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:58,562 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:58,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:58,579 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:58,674 INFO ]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:52:58,674 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:58,674 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:58,686 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:52:58,718 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:52:58,718 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:58,720 INFO ]: Computing forward predicates... [2018-06-24 20:52:58,972 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:52:58,991 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:58,991 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-24 20:52:58,991 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:52:58,991 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:52:58,991 INFO ]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:52:58,991 INFO ]: Start difference. First operand 16 states and 19 transitions. Second operand 16 states. [2018-06-24 20:52:59,585 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:59,586 INFO ]: Finished difference Result 29 states and 35 transitions. [2018-06-24 20:52:59,586 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:52:59,586 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-24 20:52:59,586 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:59,586 INFO ]: With dead ends: 29 [2018-06-24 20:52:59,586 INFO ]: Without dead ends: 21 [2018-06-24 20:52:59,587 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:52:59,587 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:52:59,589 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-24 20:52:59,589 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:52:59,589 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-06-24 20:52:59,589 INFO ]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2018-06-24 20:52:59,589 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:59,589 INFO ]: Abstraction has 17 states and 20 transitions. [2018-06-24 20:52:59,589 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:52:59,589 INFO ]: Start isEmpty. Operand 17 states and 20 transitions. [2018-06-24 20:52:59,590 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:52:59,590 INFO ]: Found error trace [2018-06-24 20:52:59,590 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:59,590 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:59,590 INFO ]: Analyzing trace with hash -1262719336, now seen corresponding path program 7 times [2018-06-24 20:52:59,590 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:59,590 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:59,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:59,591 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:59,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:59,601 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:59,676 INFO ]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:52:59,676 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:59,676 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:59,682 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:59,716 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:59,718 INFO ]: Computing forward predicates... [2018-06-24 20:52:59,806 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:52:59,825 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:59,825 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-24 20:52:59,825 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:52:59,825 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:52:59,825 INFO ]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:52:59,826 INFO ]: Start difference. First operand 17 states and 20 transitions. Second operand 13 states. [2018-06-24 20:52:59,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:59,881 INFO ]: Finished difference Result 20 states and 23 transitions. [2018-06-24 20:52:59,882 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:52:59,882 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-24 20:52:59,882 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:59,882 INFO ]: With dead ends: 20 [2018-06-24 20:52:59,882 INFO ]: Without dead ends: 20 [2018-06-24 20:52:59,882 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:52:59,882 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:52:59,883 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-06-24 20:52:59,883 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:52:59,884 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-24 20:52:59,884 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2018-06-24 20:52:59,884 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:59,884 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-24 20:52:59,884 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:52:59,884 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-24 20:52:59,884 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:52:59,884 INFO ]: Found error trace [2018-06-24 20:52:59,884 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:59,885 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:59,885 INFO ]: Analyzing trace with hash -489828131, now seen corresponding path program 8 times [2018-06-24 20:52:59,885 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:59,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:59,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:59,885 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:59,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:59,895 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:59,980 INFO ]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:52:59,980 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:00,013 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:00,019 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:53:00,039 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:00,039 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:00,041 INFO ]: Computing forward predicates... [2018-06-24 20:53:00,147 INFO ]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:00,167 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:00,167 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-24 20:53:00,167 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:53:00,167 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:53:00,167 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:53:00,167 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 16 states. [2018-06-24 20:53:00,446 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:00,446 INFO ]: Finished difference Result 21 states and 24 transitions. [2018-06-24 20:53:00,446 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:53:00,446 INFO ]: Start accepts. Automaton has 16 states. Word has length 15 [2018-06-24 20:53:00,446 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:00,446 INFO ]: With dead ends: 21 [2018-06-24 20:53:00,446 INFO ]: Without dead ends: 17 [2018-06-24 20:53:00,447 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:53:00,447 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:53:00,448 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:53:00,448 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:53:00,449 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-06-24 20:53:00,449 INFO ]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2018-06-24 20:53:00,449 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:00,449 INFO ]: Abstraction has 17 states and 19 transitions. [2018-06-24 20:53:00,449 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:53:00,449 INFO ]: Start isEmpty. Operand 17 states and 19 transitions. [2018-06-24 20:53:00,449 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:53:00,449 INFO ]: Found error trace [2018-06-24 20:53:00,449 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:00,449 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:00,449 INFO ]: Analyzing trace with hash 1884608662, now seen corresponding path program 9 times [2018-06-24 20:53:00,450 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:00,450 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:00,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:00,450 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:00,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:00,468 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:00,582 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:00,582 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:00,582 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:00,589 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:53:00,632 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:53:00,632 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:00,634 INFO ]: Computing forward predicates... [2018-06-24 20:53:01,153 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:01,171 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:01,171 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-24 20:53:01,171 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:53:01,171 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:53:01,171 INFO ]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:53:01,171 INFO ]: Start difference. First operand 17 states and 19 transitions. Second operand 19 states. [2018-06-24 20:53:01,387 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:01,387 INFO ]: Finished difference Result 28 states and 33 transitions. [2018-06-24 20:53:01,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:53:01,388 INFO ]: Start accepts. Automaton has 19 states. Word has length 16 [2018-06-24 20:53:01,388 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:01,389 INFO ]: With dead ends: 28 [2018-06-24 20:53:01,389 INFO ]: Without dead ends: 28 [2018-06-24 20:53:01,389 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:53:01,389 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:53:01,391 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-06-24 20:53:01,391 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:53:01,391 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-06-24 20:53:01,391 INFO ]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 16 [2018-06-24 20:53:01,392 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:01,392 INFO ]: Abstraction has 19 states and 22 transitions. [2018-06-24 20:53:01,392 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:53:01,392 INFO ]: Start isEmpty. Operand 19 states and 22 transitions. [2018-06-24 20:53:01,392 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:53:01,392 INFO ]: Found error trace [2018-06-24 20:53:01,392 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:01,392 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:01,392 INFO ]: Analyzing trace with hash -1817262083, now seen corresponding path program 10 times [2018-06-24 20:53:01,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:01,392 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:01,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:01,394 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:01,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:01,404 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:01,507 INFO ]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:01,507 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:01,507 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:01,514 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:53:01,554 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:53:01,554 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:01,557 INFO ]: Computing forward predicates... [2018-06-24 20:53:01,665 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:01,698 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:01,698 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-24 20:53:01,698 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:53:01,698 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:53:01,698 INFO ]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:53:01,699 INFO ]: Start difference. First operand 19 states and 22 transitions. Second operand 19 states. [2018-06-24 20:53:02,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:02,128 INFO ]: Finished difference Result 27 states and 31 transitions. [2018-06-24 20:53:02,128 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:53:02,128 INFO ]: Start accepts. Automaton has 19 states. Word has length 17 [2018-06-24 20:53:02,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:02,128 INFO ]: With dead ends: 27 [2018-06-24 20:53:02,128 INFO ]: Without dead ends: 18 [2018-06-24 20:53:02,129 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:53:02,129 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:53:02,130 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 20:53:02,130 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:53:02,130 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-24 20:53:02,131 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 17 [2018-06-24 20:53:02,131 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:02,131 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-24 20:53:02,131 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:53:02,131 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-24 20:53:02,131 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:53:02,131 INFO ]: Found error trace [2018-06-24 20:53:02,131 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:02,131 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:02,131 INFO ]: Analyzing trace with hash 1905723354, now seen corresponding path program 11 times [2018-06-24 20:53:02,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:02,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:02,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:02,132 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:02,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:02,141 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:02,599 INFO ]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:02,599 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:02,599 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:02,604 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:53:02,628 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:53:02,628 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:02,630 INFO ]: Computing forward predicates... [2018-06-24 20:53:02,679 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:02,699 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:02,699 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-24 20:53:02,699 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:53:02,699 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:53:02,699 INFO ]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:53:02,699 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2018-06-24 20:53:02,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:02,767 INFO ]: Finished difference Result 19 states and 21 transitions. [2018-06-24 20:53:02,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:53:02,768 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-24 20:53:02,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:02,769 INFO ]: With dead ends: 19 [2018-06-24 20:53:02,769 INFO ]: Without dead ends: 19 [2018-06-24 20:53:02,769 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:53:02,769 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:53:02,770 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 20:53:02,770 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:53:02,771 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-06-24 20:53:02,771 INFO ]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 17 [2018-06-24 20:53:02,771 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:02,771 INFO ]: Abstraction has 19 states and 21 transitions. [2018-06-24 20:53:02,771 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:53:02,771 INFO ]: Start isEmpty. Operand 19 states and 21 transitions. [2018-06-24 20:53:02,771 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:53:02,771 INFO ]: Found error trace [2018-06-24 20:53:02,771 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:02,771 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:02,772 INFO ]: Analyzing trace with hash -1052352549, now seen corresponding path program 12 times [2018-06-24 20:53:02,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:02,772 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:02,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:02,772 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:02,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:02,783 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:03,654 INFO ]: Checked inductivity of 26 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:03,654 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:03,654 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:03,660 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:53:03,683 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:53:03,683 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:03,685 INFO ]: Computing forward predicates... [2018-06-24 20:53:03,845 INFO ]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:03,868 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:03,868 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-24 20:53:03,869 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:53:03,869 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:53:03,869 INFO ]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:53:03,869 INFO ]: Start difference. First operand 19 states and 21 transitions. Second operand 20 states. [2018-06-24 20:53:04,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:04,072 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-24 20:53:04,073 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:53:04,073 INFO ]: Start accepts. Automaton has 20 states. Word has length 18 [2018-06-24 20:53:04,073 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:04,073 INFO ]: With dead ends: 25 [2018-06-24 20:53:04,073 INFO ]: Without dead ends: 20 [2018-06-24 20:53:04,074 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=217, Invalid=653, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:53:04,074 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:53:04,075 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 20:53:04,075 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:53:04,076 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-06-24 20:53:04,076 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2018-06-24 20:53:04,076 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:04,076 INFO ]: Abstraction has 20 states and 22 transitions. [2018-06-24 20:53:04,076 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:53:04,076 INFO ]: Start isEmpty. Operand 20 states and 22 transitions. [2018-06-24 20:53:04,076 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:53:04,076 INFO ]: Found error trace [2018-06-24 20:53:04,076 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:04,076 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:04,076 INFO ]: Analyzing trace with hash -1684401572, now seen corresponding path program 13 times [2018-06-24 20:53:04,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:04,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:04,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:04,077 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:04,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:04,092 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:04,588 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:04,588 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:04,588 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:04,596 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:04,623 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:04,627 INFO ]: Computing forward predicates... [2018-06-24 20:53:04,885 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:04,904 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:04,904 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-06-24 20:53:04,905 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:53:04,905 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:53:04,905 INFO ]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:53:04,905 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 23 states. [2018-06-24 20:53:05,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:05,137 INFO ]: Finished difference Result 33 states and 38 transitions. [2018-06-24 20:53:05,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:53:05,137 INFO ]: Start accepts. Automaton has 23 states. Word has length 19 [2018-06-24 20:53:05,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:05,137 INFO ]: With dead ends: 33 [2018-06-24 20:53:05,138 INFO ]: Without dead ends: 33 [2018-06-24 20:53:05,138 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:53:05,138 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:53:05,139 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-06-24 20:53:05,140 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:53:05,140 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-06-24 20:53:05,140 INFO ]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2018-06-24 20:53:05,140 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:05,140 INFO ]: Abstraction has 22 states and 25 transitions. [2018-06-24 20:53:05,140 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:53:05,140 INFO ]: Start isEmpty. Operand 22 states and 25 transitions. [2018-06-24 20:53:05,140 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:53:05,140 INFO ]: Found error trace [2018-06-24 20:53:05,140 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:05,141 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:05,141 INFO ]: Analyzing trace with hash 196915195, now seen corresponding path program 14 times [2018-06-24 20:53:05,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:05,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:05,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:05,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:05,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:05,154 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:05,302 INFO ]: Checked inductivity of 35 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:05,302 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:05,302 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) [2018-06-24 20:53:05,315 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:05,346 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:05,346 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:05,348 INFO ]: Computing forward predicates... [2018-06-24 20:53:05,493 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:05,513 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:05,513 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-06-24 20:53:05,513 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:53:05,514 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:53:05,514 INFO ]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:53:05,514 INFO ]: Start difference. First operand 22 states and 25 transitions. Second operand 24 states. [2018-06-24 20:53:06,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:06,123 INFO ]: Finished difference Result 41 states and 47 transitions. [2018-06-24 20:53:06,124 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:53:06,124 INFO ]: Start accepts. Automaton has 24 states. Word has length 20 [2018-06-24 20:53:06,124 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:06,124 INFO ]: With dead ends: 41 [2018-06-24 20:53:06,124 INFO ]: Without dead ends: 29 [2018-06-24 20:53:06,125 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:53:06,125 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:53:06,126 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-06-24 20:53:06,126 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:53:06,127 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-06-24 20:53:06,127 INFO ]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2018-06-24 20:53:06,127 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:06,127 INFO ]: Abstraction has 23 states and 26 transitions. [2018-06-24 20:53:06,127 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:53:06,127 INFO ]: Start isEmpty. Operand 23 states and 26 transitions. [2018-06-24 20:53:06,127 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:53:06,127 INFO ]: Found error trace [2018-06-24 20:53:06,127 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:06,127 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:06,127 INFO ]: Analyzing trace with hash 278162584, now seen corresponding path program 15 times [2018-06-24 20:53:06,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:06,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:06,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:06,128 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:06,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:06,137 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:06,542 INFO ]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:06,542 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:06,542 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:06,548 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:53:06,576 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:53:06,576 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:06,579 INFO ]: Computing forward predicates... [2018-06-24 20:53:06,660 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:06,692 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:06,692 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-06-24 20:53:06,692 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:53:06,692 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:53:06,692 INFO ]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:53:06,692 INFO ]: Start difference. First operand 23 states and 26 transitions. Second operand 20 states. [2018-06-24 20:53:07,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:07,072 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-24 20:53:07,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:53:07,072 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-24 20:53:07,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:07,072 INFO ]: With dead ends: 29 [2018-06-24 20:53:07,072 INFO ]: Without dead ends: 23 [2018-06-24 20:53:07,072 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=355, Invalid=977, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:53:07,072 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:53:07,073 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 20:53:07,074 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:53:07,074 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-24 20:53:07,074 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-06-24 20:53:07,074 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:07,074 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-24 20:53:07,074 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:53:07,074 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-24 20:53:07,074 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:53:07,074 INFO ]: Found error trace [2018-06-24 20:53:07,074 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:07,075 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:07,075 INFO ]: Analyzing trace with hash -1952286954, now seen corresponding path program 16 times [2018-06-24 20:53:07,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:07,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:07,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:07,075 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:07,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:07,090 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:07,395 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:53:07,395 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:07,395 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:07,401 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:53:07,442 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:53:07,442 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:07,446 INFO ]: Computing forward predicates... [2018-06-24 20:53:07,901 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:53:07,920 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:07,920 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-06-24 20:53:07,921 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:53:07,921 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:53:07,921 INFO ]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:53:07,921 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 27 states. [2018-06-24 20:53:08,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:08,641 INFO ]: Finished difference Result 38 states and 43 transitions. [2018-06-24 20:53:08,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:53:08,642 INFO ]: Start accepts. Automaton has 27 states. Word has length 22 [2018-06-24 20:53:08,642 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:08,642 INFO ]: With dead ends: 38 [2018-06-24 20:53:08,642 INFO ]: Without dead ends: 38 [2018-06-24 20:53:08,643 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:53:08,643 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:53:08,644 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 25. [2018-06-24 20:53:08,644 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:53:08,645 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-06-24 20:53:08,645 INFO ]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2018-06-24 20:53:08,645 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:08,645 INFO ]: Abstraction has 25 states and 28 transitions. [2018-06-24 20:53:08,645 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:53:08,645 INFO ]: Start isEmpty. Operand 25 states and 28 transitions. [2018-06-24 20:53:08,645 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:53:08,645 INFO ]: Found error trace [2018-06-24 20:53:08,645 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:08,645 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:08,645 INFO ]: Analyzing trace with hash 932321789, now seen corresponding path program 17 times [2018-06-24 20:53:08,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:08,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:08,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:08,648 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:08,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:08,659 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:08,951 INFO ]: Checked inductivity of 51 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:53:08,951 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:08,951 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:08,957 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:53:08,991 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:53:08,991 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:08,993 INFO ]: Computing forward predicates... [2018-06-24 20:53:09,143 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:53:09,163 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:09,163 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-06-24 20:53:09,163 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:53:09,163 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:53:09,163 INFO ]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:53:09,164 INFO ]: Start difference. First operand 25 states and 28 transitions. Second operand 25 states. [2018-06-24 20:53:09,304 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:09,304 INFO ]: Finished difference Result 37 states and 41 transitions. [2018-06-24 20:53:09,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:53:09,306 INFO ]: Start accepts. Automaton has 25 states. Word has length 23 [2018-06-24 20:53:09,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:09,306 INFO ]: With dead ends: 37 [2018-06-24 20:53:09,306 INFO ]: Without dead ends: 24 [2018-06-24 20:53:09,307 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:53:09,307 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:53:09,308 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 20:53:09,308 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:53:09,309 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-24 20:53:09,309 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 23 [2018-06-24 20:53:09,309 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:09,309 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-24 20:53:09,309 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:53:09,309 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-24 20:53:09,309 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:53:09,309 INFO ]: Found error trace [2018-06-24 20:53:09,309 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:09,309 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:09,310 INFO ]: Analyzing trace with hash 1701651290, now seen corresponding path program 18 times [2018-06-24 20:53:09,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:09,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:09,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:09,310 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:09,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:09,321 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:09,705 INFO ]: Checked inductivity of 51 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:53:09,705 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:09,705 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:09,710 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:53:09,742 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:53:09,742 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:09,745 INFO ]: Computing forward predicates... [2018-06-24 20:53:09,843 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:53:09,862 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:09,862 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-06-24 20:53:09,862 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:53:09,863 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:53:09,863 INFO ]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:53:09,863 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 23 states. [2018-06-24 20:53:10,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:10,214 INFO ]: Finished difference Result 33 states and 36 transitions. [2018-06-24 20:53:10,268 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:53:10,268 INFO ]: Start accepts. Automaton has 23 states. Word has length 23 [2018-06-24 20:53:10,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:10,269 INFO ]: With dead ends: 33 [2018-06-24 20:53:10,269 INFO ]: Without dead ends: 26 [2018-06-24 20:53:10,269 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=534, Invalid=1272, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:53:10,269 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:53:10,271 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:53:10,271 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:53:10,271 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-24 20:53:10,271 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-06-24 20:53:10,272 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:10,272 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-24 20:53:10,272 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:53:10,272 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-24 20:53:10,272 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:53:10,272 INFO ]: Found error trace [2018-06-24 20:53:10,272 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:10,272 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:10,272 INFO ]: Analyzing trace with hash 1283341660, now seen corresponding path program 19 times [2018-06-24 20:53:10,272 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:10,272 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:10,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:10,273 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:10,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:10,291 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:10,657 INFO ]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:53:10,657 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:10,657 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:10,662 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:10,693 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:10,698 INFO ]: Computing forward predicates... [2018-06-24 20:53:11,178 INFO ]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:53:11,197 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:11,197 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2018-06-24 20:53:11,197 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:53:11,197 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:53:11,197 INFO ]: CoverageRelationStatistics Valid=66, Invalid=864, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:53:11,197 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 31 states. [2018-06-24 20:53:11,633 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:11,633 INFO ]: Finished difference Result 43 states and 48 transitions. [2018-06-24 20:53:11,634 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:53:11,634 INFO ]: Start accepts. Automaton has 31 states. Word has length 25 [2018-06-24 20:53:11,634 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:11,634 INFO ]: With dead ends: 43 [2018-06-24 20:53:11,634 INFO ]: Without dead ends: 43 [2018-06-24 20:53:11,634 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:53:11,634 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 20:53:11,636 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-06-24 20:53:11,636 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:53:11,637 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-06-24 20:53:11,637 INFO ]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2018-06-24 20:53:11,637 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:11,637 INFO ]: Abstraction has 28 states and 31 transitions. [2018-06-24 20:53:11,637 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:53:11,637 INFO ]: Start isEmpty. Operand 28 states and 31 transitions. [2018-06-24 20:53:11,637 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:53:11,637 INFO ]: Found error trace [2018-06-24 20:53:11,637 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:11,637 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:11,637 INFO ]: Analyzing trace with hash -779824005, now seen corresponding path program 20 times [2018-06-24 20:53:11,637 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:11,637 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:11,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:11,638 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:11,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:11,654 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:12,121 INFO ]: Checked inductivity of 70 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:53:12,121 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:12,121 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:12,127 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:53:12,161 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:12,161 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:12,164 INFO ]: Computing forward predicates... [2018-06-24 20:53:12,360 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:53:12,379 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:12,379 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-06-24 20:53:12,379 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:53:12,380 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:53:12,380 INFO ]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:53:12,380 INFO ]: Start difference. First operand 28 states and 31 transitions. Second operand 32 states. [2018-06-24 20:53:13,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:13,089 INFO ]: Finished difference Result 53 states and 59 transitions. [2018-06-24 20:53:13,089 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-24 20:53:13,089 INFO ]: Start accepts. Automaton has 32 states. Word has length 26 [2018-06-24 20:53:13,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:13,089 INFO ]: With dead ends: 53 [2018-06-24 20:53:13,089 INFO ]: Without dead ends: 37 [2018-06-24 20:53:13,090 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=772, Invalid=2420, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 20:53:13,090 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:53:13,092 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-06-24 20:53:13,092 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:53:13,092 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-06-24 20:53:13,092 INFO ]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2018-06-24 20:53:13,092 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:13,092 INFO ]: Abstraction has 29 states and 32 transitions. [2018-06-24 20:53:13,092 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:53:13,092 INFO ]: Start isEmpty. Operand 29 states and 32 transitions. [2018-06-24 20:53:13,093 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:53:13,093 INFO ]: Found error trace [2018-06-24 20:53:13,093 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:13,093 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:13,093 INFO ]: Analyzing trace with hash -188548456, now seen corresponding path program 21 times [2018-06-24 20:53:13,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:13,093 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:13,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:13,093 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:13,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:13,104 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:13,994 INFO ]: Checked inductivity of 70 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:53:13,994 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:13,994 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:14,001 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:53:14,037 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:53:14,037 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:14,040 INFO ]: Computing forward predicates... [2018-06-24 20:53:14,644 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:53:14,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:14,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-24 20:53:14,663 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:53:14,663 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:53:14,663 INFO ]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:53:14,663 INFO ]: Start difference. First operand 29 states and 32 transitions. Second operand 25 states. [2018-06-24 20:53:14,862 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:14,862 INFO ]: Finished difference Result 36 states and 39 transitions. [2018-06-24 20:53:14,862 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:53:14,862 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-24 20:53:14,862 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:14,863 INFO ]: With dead ends: 36 [2018-06-24 20:53:14,863 INFO ]: Without dead ends: 36 [2018-06-24 20:53:14,863 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=311, Invalid=745, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:53:14,863 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:53:14,864 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-06-24 20:53:14,864 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:53:14,865 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-24 20:53:14,865 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 26 [2018-06-24 20:53:14,865 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:14,865 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-24 20:53:14,865 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:53:14,865 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-24 20:53:14,865 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:53:14,865 INFO ]: Found error trace [2018-06-24 20:53:14,865 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:14,866 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:14,866 INFO ]: Analyzing trace with hash -1550269219, now seen corresponding path program 22 times [2018-06-24 20:53:14,866 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:14,866 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:14,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:14,866 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:14,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:14,879 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:15,395 INFO ]: Checked inductivity of 77 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:15,395 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:15,440 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:15,446 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:53:15,480 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:53:15,480 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:15,483 INFO ]: Computing forward predicates... [2018-06-24 20:53:15,585 INFO ]: Checked inductivity of 77 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:15,605 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:15,605 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-06-24 20:53:15,605 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:53:15,605 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:53:15,605 INFO ]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:53:15,605 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 26 states. [2018-06-24 20:53:15,723 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:15,723 INFO ]: Finished difference Result 37 states and 40 transitions. [2018-06-24 20:53:15,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:53:15,723 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-24 20:53:15,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:15,723 INFO ]: With dead ends: 37 [2018-06-24 20:53:15,723 INFO ]: Without dead ends: 29 [2018-06-24 20:53:15,724 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=310, Invalid=812, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:53:15,724 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:53:15,725 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:53:15,725 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:53:15,726 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-24 20:53:15,726 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2018-06-24 20:53:15,726 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:15,726 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-24 20:53:15,726 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:53:15,726 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-24 20:53:15,727 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:53:15,727 INFO ]: Found error trace [2018-06-24 20:53:15,727 INFO ]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:15,727 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:15,727 INFO ]: Analyzing trace with hash 152864150, now seen corresponding path program 23 times [2018-06-24 20:53:15,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:15,727 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:15,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:15,727 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:15,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:15,745 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:16,130 INFO ]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:16,130 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:16,130 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:16,144 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:53:16,190 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 20:53:16,190 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:16,195 INFO ]: Computing forward predicates... [2018-06-24 20:53:17,140 INFO ]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:17,158 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:17,158 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2018-06-24 20:53:17,159 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:53:17,159 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:53:17,159 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1115, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:53:17,159 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 35 states. [2018-06-24 20:53:17,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:17,641 INFO ]: Finished difference Result 48 states and 53 transitions. [2018-06-24 20:53:17,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:53:17,642 INFO ]: Start accepts. Automaton has 35 states. Word has length 28 [2018-06-24 20:53:17,642 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:17,642 INFO ]: With dead ends: 48 [2018-06-24 20:53:17,642 INFO ]: Without dead ends: 48 [2018-06-24 20:53:17,643 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:53:17,643 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-24 20:53:17,645 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 31. [2018-06-24 20:53:17,645 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:53:17,645 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-06-24 20:53:17,645 INFO ]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 28 [2018-06-24 20:53:17,645 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:17,645 INFO ]: Abstraction has 31 states and 34 transitions. [2018-06-24 20:53:17,645 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:53:17,645 INFO ]: Start isEmpty. Operand 31 states and 34 transitions. [2018-06-24 20:53:17,646 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:53:17,646 INFO ]: Found error trace [2018-06-24 20:53:17,646 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:17,646 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:17,646 INFO ]: Analyzing trace with hash 1410391037, now seen corresponding path program 24 times [2018-06-24 20:53:17,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:17,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:17,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:17,647 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:17,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:17,659 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:18,247 INFO ]: Checked inductivity of 92 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:18,247 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:18,247 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:18,254 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:53:18,292 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:53:18,292 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:18,294 INFO ]: Computing forward predicates... [2018-06-24 20:53:18,578 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:18,598 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:18,598 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-06-24 20:53:18,598 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:53:18,598 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:53:18,598 INFO ]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:53:18,598 INFO ]: Start difference. First operand 31 states and 34 transitions. Second operand 36 states. [2018-06-24 20:53:19,312 WARN ]: Spent 405.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-06-24 20:53:19,897 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:19,897 INFO ]: Finished difference Result 59 states and 65 transitions. [2018-06-24 20:53:19,897 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 20:53:19,897 INFO ]: Start accepts. Automaton has 36 states. Word has length 29 [2018-06-24 20:53:19,898 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:19,898 INFO ]: With dead ends: 59 [2018-06-24 20:53:19,898 INFO ]: Without dead ends: 41 [2018-06-24 20:53:19,899 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2018-06-24 20:53:19,899 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:53:19,900 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-06-24 20:53:19,900 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:53:19,900 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-24 20:53:19,900 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2018-06-24 20:53:19,900 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:19,900 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-24 20:53:19,900 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:53:19,900 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-24 20:53:19,901 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:53:19,901 INFO ]: Found error trace [2018-06-24 20:53:19,901 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:19,901 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:19,901 INFO ]: Analyzing trace with hash -1604456742, now seen corresponding path program 25 times [2018-06-24 20:53:19,901 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:19,901 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:19,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:19,902 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:19,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:19,914 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:20,100 INFO ]: Checked inductivity of 92 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:20,100 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:20,100 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:20,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:20,148 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:20,150 INFO ]: Computing forward predicates... [2018-06-24 20:53:20,607 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:20,626 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:20,626 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-24 20:53:20,626 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:53:20,627 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:53:20,627 INFO ]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:53:20,627 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 28 states. [2018-06-24 20:53:20,777 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:20,777 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-24 20:53:20,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:53:20,779 INFO ]: Start accepts. Automaton has 28 states. Word has length 29 [2018-06-24 20:53:20,780 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:20,780 INFO ]: With dead ends: 40 [2018-06-24 20:53:20,780 INFO ]: Without dead ends: 40 [2018-06-24 20:53:20,780 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=390, Invalid=942, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:53:20,780 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:53:20,782 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-06-24 20:53:20,782 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:53:20,782 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-24 20:53:20,782 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 29 [2018-06-24 20:53:20,782 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:20,782 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-24 20:53:20,782 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:53:20,782 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-24 20:53:20,782 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:53:20,782 INFO ]: Found error trace [2018-06-24 20:53:20,782 INFO ]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:20,783 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:20,783 INFO ]: Analyzing trace with hash 1801214171, now seen corresponding path program 26 times [2018-06-24 20:53:20,783 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:20,783 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:20,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:20,783 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:20,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:20,801 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:21,092 INFO ]: Checked inductivity of 100 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:53:21,092 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:21,092 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:21,098 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:53:21,136 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:21,136 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:21,139 INFO ]: Computing forward predicates... [2018-06-24 20:53:21,492 INFO ]: Checked inductivity of 100 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:53:21,511 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:21,511 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-06-24 20:53:21,511 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:53:21,511 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:53:21,512 INFO ]: CoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:53:21,512 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 36 states. [2018-06-24 20:53:22,143 WARN ]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-06-24 20:53:22,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:22,333 INFO ]: Finished difference Result 41 states and 44 transitions. [2018-06-24 20:53:22,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:53:22,333 INFO ]: Start accepts. Automaton has 36 states. Word has length 30 [2018-06-24 20:53:22,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:22,333 INFO ]: With dead ends: 41 [2018-06-24 20:53:22,333 INFO ]: Without dead ends: 32 [2018-06-24 20:53:22,334 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=659, Invalid=2203, Unknown=0, NotChecked=0, Total=2862 [2018-06-24 20:53:22,334 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:53:22,335 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 20:53:22,335 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:53:22,335 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-24 20:53:22,335 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2018-06-24 20:53:22,336 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:22,336 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-24 20:53:22,336 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:53:22,336 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-24 20:53:22,336 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:53:22,336 INFO ]: Found error trace [2018-06-24 20:53:22,336 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:22,336 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:22,336 INFO ]: Analyzing trace with hash -91015076, now seen corresponding path program 27 times [2018-06-24 20:53:22,336 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:22,336 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:22,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:22,337 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:22,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:22,358 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:22,886 INFO ]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:53:22,886 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:22,886 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:22,894 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:53:22,941 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:53:22,941 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:22,947 INFO ]: Computing forward predicates... [2018-06-24 20:53:24,083 INFO ]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:53:24,104 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:24,104 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29] total 48 [2018-06-24 20:53:24,104 INFO ]: Interpolant automaton has 48 states [2018-06-24 20:53:24,104 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-24 20:53:24,105 INFO ]: CoverageRelationStatistics Valid=102, Invalid=2154, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:53:24,105 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 48 states. [2018-06-24 20:53:25,390 WARN ]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-06-24 20:53:26,363 WARN ]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-06-24 20:53:27,124 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:27,124 INFO ]: Finished difference Result 63 states and 69 transitions. [2018-06-24 20:53:27,124 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:53:27,124 INFO ]: Start accepts. Automaton has 48 states. Word has length 31 [2018-06-24 20:53:27,124 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:27,125 INFO ]: With dead ends: 63 [2018-06-24 20:53:27,125 INFO ]: Without dead ends: 53 [2018-06-24 20:53:27,126 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=471, Invalid=4221, Unknown=0, NotChecked=0, Total=4692 [2018-06-24 20:53:27,126 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 20:53:27,127 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-06-24 20:53:27,127 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:53:27,127 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-06-24 20:53:27,127 INFO ]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 31 [2018-06-24 20:53:27,127 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:27,128 INFO ]: Abstraction has 34 states and 37 transitions. [2018-06-24 20:53:27,128 INFO ]: Interpolant automaton has 48 states. [2018-06-24 20:53:27,128 INFO ]: Start isEmpty. Operand 34 states and 37 transitions. [2018-06-24 20:53:27,128 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:53:27,128 INFO ]: Found error trace [2018-06-24 20:53:27,128 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:27,128 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:27,128 INFO ]: Analyzing trace with hash 1379420411, now seen corresponding path program 28 times [2018-06-24 20:53:27,128 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:27,128 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:27,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:27,129 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:27,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:27,141 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:27,446 INFO ]: Checked inductivity of 117 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:53:27,446 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:27,446 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:27,451 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:53:27,491 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:53:27,491 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:27,495 INFO ]: Computing forward predicates... [2018-06-24 20:53:27,758 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:53:27,778 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:27,778 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2018-06-24 20:53:27,778 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:53:27,778 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:53:27,778 INFO ]: CoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:53:27,778 INFO ]: Start difference. First operand 34 states and 37 transitions. Second operand 34 states. [2018-06-24 20:53:27,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:27,957 INFO ]: Finished difference Result 52 states and 56 transitions. [2018-06-24 20:53:27,957 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:53:27,957 INFO ]: Start accepts. Automaton has 34 states. Word has length 32 [2018-06-24 20:53:27,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:27,958 INFO ]: With dead ends: 52 [2018-06-24 20:53:27,958 INFO ]: Without dead ends: 33 [2018-06-24 20:53:27,958 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=470, Invalid=1510, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:53:27,958 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:53:27,960 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 20:53:27,960 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:53:27,960 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-24 20:53:27,960 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 32 [2018-06-24 20:53:27,960 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:27,960 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-24 20:53:27,960 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:53:27,960 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-24 20:53:27,961 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:53:27,961 INFO ]: Found error trace [2018-06-24 20:53:27,961 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:27,961 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:27,961 INFO ]: Analyzing trace with hash -1081337704, now seen corresponding path program 29 times [2018-06-24 20:53:27,961 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:27,961 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:27,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:27,961 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:27,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:27,972 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:28,341 INFO ]: Checked inductivity of 117 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:53:28,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:28,342 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:28,347 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:53:28,392 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:53:28,392 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:28,395 INFO ]: Computing forward predicates... [2018-06-24 20:53:28,538 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:53:28,557 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:28,557 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-24 20:53:28,557 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:53:28,558 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:53:28,558 INFO ]: CoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:53:28,558 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 31 states. [2018-06-24 20:53:28,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:28,740 INFO ]: Finished difference Result 34 states and 36 transitions. [2018-06-24 20:53:28,741 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:53:28,741 INFO ]: Start accepts. Automaton has 31 states. Word has length 32 [2018-06-24 20:53:28,741 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:28,741 INFO ]: With dead ends: 34 [2018-06-24 20:53:28,741 INFO ]: Without dead ends: 34 [2018-06-24 20:53:28,742 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:53:28,742 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:53:28,743 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:53:28,743 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:53:28,743 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-06-24 20:53:28,743 INFO ]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 32 [2018-06-24 20:53:28,743 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:28,743 INFO ]: Abstraction has 34 states and 36 transitions. [2018-06-24 20:53:28,743 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:53:28,743 INFO ]: Start isEmpty. Operand 34 states and 36 transitions. [2018-06-24 20:53:28,743 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:53:28,743 INFO ]: Found error trace [2018-06-24 20:53:28,743 INFO ]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:28,743 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:28,743 INFO ]: Analyzing trace with hash 838035165, now seen corresponding path program 30 times [2018-06-24 20:53:28,743 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:28,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:28,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:28,744 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:28,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:28,753 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:29,364 INFO ]: Checked inductivity of 126 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:29,364 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:29,364 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:29,369 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:53:29,413 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:53:29,413 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:29,415 INFO ]: Computing forward predicates... [2018-06-24 20:53:29,711 INFO ]: Checked inductivity of 126 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:29,730 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:29,730 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-06-24 20:53:29,730 INFO ]: Interpolant automaton has 40 states [2018-06-24 20:53:29,730 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 20:53:29,730 INFO ]: CoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:53:29,731 INFO ]: Start difference. First operand 34 states and 36 transitions. Second operand 40 states. [2018-06-24 20:53:30,320 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:30,320 INFO ]: Finished difference Result 45 states and 48 transitions. [2018-06-24 20:53:30,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:53:30,321 INFO ]: Start accepts. Automaton has 40 states. Word has length 33 [2018-06-24 20:53:30,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:30,321 INFO ]: With dead ends: 45 [2018-06-24 20:53:30,321 INFO ]: Without dead ends: 35 [2018-06-24 20:53:30,322 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=807, Invalid=2733, Unknown=0, NotChecked=0, Total=3540 [2018-06-24 20:53:30,322 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:53:30,323 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 20:53:30,323 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:53:30,323 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-24 20:53:30,323 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2018-06-24 20:53:30,323 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:30,323 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-24 20:53:30,323 INFO ]: Interpolant automaton has 40 states. [2018-06-24 20:53:30,323 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-24 20:53:30,323 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:53:30,323 INFO ]: Found error trace [2018-06-24 20:53:30,323 INFO ]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:30,323 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:30,323 INFO ]: Analyzing trace with hash 1594819606, now seen corresponding path program 31 times [2018-06-24 20:53:30,323 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:30,323 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:30,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:30,324 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:30,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:30,341 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:30,910 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:30,926 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:30,926 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:30,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:30,974 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:30,979 INFO ]: Computing forward predicates... [2018-06-24 20:53:31,683 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:31,703 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:31,703 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2018-06-24 20:53:31,703 INFO ]: Interpolant automaton has 43 states [2018-06-24 20:53:31,703 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-24 20:53:31,705 INFO ]: CoverageRelationStatistics Valid=93, Invalid=1713, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:53:31,705 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 43 states. [2018-06-24 20:53:32,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:32,503 INFO ]: Finished difference Result 58 states and 63 transitions. [2018-06-24 20:53:32,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:53:32,504 INFO ]: Start accepts. Automaton has 43 states. Word has length 34 [2018-06-24 20:53:32,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:32,504 INFO ]: With dead ends: 58 [2018-06-24 20:53:32,504 INFO ]: Without dead ends: 58 [2018-06-24 20:53:32,504 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-06-24 20:53:32,505 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 20:53:32,506 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 37. [2018-06-24 20:53:32,506 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:53:32,506 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-06-24 20:53:32,506 INFO ]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2018-06-24 20:53:32,506 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:32,506 INFO ]: Abstraction has 37 states and 40 transitions. [2018-06-24 20:53:32,506 INFO ]: Interpolant automaton has 43 states. [2018-06-24 20:53:32,507 INFO ]: Start isEmpty. Operand 37 states and 40 transitions. [2018-06-24 20:53:32,507 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:53:32,507 INFO ]: Found error trace [2018-06-24 20:53:32,507 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:32,507 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:32,507 INFO ]: Analyzing trace with hash -714666499, now seen corresponding path program 32 times [2018-06-24 20:53:32,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:32,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:32,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:32,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:32,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:32,520 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:32,892 INFO ]: Checked inductivity of 145 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:32,892 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:32,892 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:32,897 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:53:32,940 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:32,940 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:32,943 INFO ]: Computing forward predicates... [2018-06-24 20:53:33,369 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:33,387 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:33,387 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2018-06-24 20:53:33,388 INFO ]: Interpolant automaton has 44 states [2018-06-24 20:53:33,388 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-24 20:53:33,388 INFO ]: CoverageRelationStatistics Valid=256, Invalid=1636, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:53:33,388 INFO ]: Start difference. First operand 37 states and 40 transitions. Second operand 44 states. [2018-06-24 20:53:34,779 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:34,779 INFO ]: Finished difference Result 71 states and 77 transitions. [2018-06-24 20:53:34,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-24 20:53:34,779 INFO ]: Start accepts. Automaton has 44 states. Word has length 35 [2018-06-24 20:53:34,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:34,779 INFO ]: With dead ends: 71 [2018-06-24 20:53:34,779 INFO ]: Without dead ends: 49 [2018-06-24 20:53:34,780 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1423, Invalid=4583, Unknown=0, NotChecked=0, Total=6006 [2018-06-24 20:53:34,780 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 20:53:34,781 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 38. [2018-06-24 20:53:34,781 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:53:34,781 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-24 20:53:34,781 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2018-06-24 20:53:34,781 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:34,781 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-24 20:53:34,781 INFO ]: Interpolant automaton has 44 states. [2018-06-24 20:53:34,781 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-24 20:53:34,781 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:53:34,781 INFO ]: Found error trace [2018-06-24 20:53:34,781 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:34,781 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:34,781 INFO ]: Analyzing trace with hash 1023765082, now seen corresponding path program 33 times [2018-06-24 20:53:34,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:34,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:34,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:34,782 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:34,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:34,792 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:35,753 INFO ]: Checked inductivity of 145 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:35,753 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:35,753 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:35,758 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:53:35,805 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:53:35,805 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:35,808 INFO ]: Computing forward predicates... [2018-06-24 20:53:35,997 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:36,016 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:36,016 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 35 [2018-06-24 20:53:36,016 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:53:36,016 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:53:36,017 INFO ]: CoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:53:36,017 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 35 states. [2018-06-24 20:53:36,709 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:36,709 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-24 20:53:36,709 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-24 20:53:36,709 INFO ]: Start accepts. Automaton has 35 states. Word has length 35 [2018-06-24 20:53:36,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:36,710 INFO ]: With dead ends: 49 [2018-06-24 20:53:36,710 INFO ]: Without dead ends: 38 [2018-06-24 20:53:36,710 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1278, Invalid=3144, Unknown=0, NotChecked=0, Total=4422 [2018-06-24 20:53:36,710 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:53:36,711 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 20:53:36,711 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:53:36,711 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-24 20:53:36,711 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-06-24 20:53:36,711 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:36,711 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-24 20:53:36,711 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:53:36,711 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-24 20:53:36,712 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:53:36,712 INFO ]: Found error trace [2018-06-24 20:53:36,712 INFO ]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:36,712 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:36,712 INFO ]: Analyzing trace with hash 292356956, now seen corresponding path program 34 times [2018-06-24 20:53:36,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:36,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:36,712 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:36,712 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:36,712 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:36,730 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:37,333 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:53:37,333 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:37,333 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:37,339 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:53:37,386 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:53:37,386 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:37,394 INFO ]: Computing forward predicates... [2018-06-24 20:53:38,336 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:53:38,356 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:38,356 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2018-06-24 20:53:38,356 INFO ]: Interpolant automaton has 47 states [2018-06-24 20:53:38,356 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-24 20:53:38,357 INFO ]: CoverageRelationStatistics Valid=102, Invalid=2060, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 20:53:38,357 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 47 states. [2018-06-24 20:53:39,267 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:39,267 INFO ]: Finished difference Result 63 states and 68 transitions. [2018-06-24 20:53:39,267 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:53:39,267 INFO ]: Start accepts. Automaton has 47 states. Word has length 37 [2018-06-24 20:53:39,267 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:39,268 INFO ]: With dead ends: 63 [2018-06-24 20:53:39,268 INFO ]: Without dead ends: 63 [2018-06-24 20:53:39,268 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2018-06-24 20:53:39,268 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-24 20:53:39,269 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 40. [2018-06-24 20:53:39,269 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:53:39,269 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-06-24 20:53:39,269 INFO ]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 37 [2018-06-24 20:53:39,269 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:39,269 INFO ]: Abstraction has 40 states and 43 transitions. [2018-06-24 20:53:39,269 INFO ]: Interpolant automaton has 47 states. [2018-06-24 20:53:39,269 INFO ]: Start isEmpty. Operand 40 states and 43 transitions. [2018-06-24 20:53:39,270 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:53:39,270 INFO ]: Found error trace [2018-06-24 20:53:39,270 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:39,270 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:39,270 INFO ]: Analyzing trace with hash 482020731, now seen corresponding path program 35 times [2018-06-24 20:53:39,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:39,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:39,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:39,270 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:39,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:39,283 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:39,601 INFO ]: Checked inductivity of 176 backedges. 45 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:53:39,601 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:39,601 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:39,606 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:53:39,663 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:53:39,663 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:39,668 INFO ]: Computing forward predicates... [2018-06-24 20:53:40,063 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:53:40,081 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:40,081 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2018-06-24 20:53:40,082 INFO ]: Interpolant automaton has 48 states [2018-06-24 20:53:40,082 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-24 20:53:40,082 INFO ]: CoverageRelationStatistics Valid=303, Invalid=1953, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:53:40,082 INFO ]: Start difference. First operand 40 states and 43 transitions. Second operand 48 states. [2018-06-24 20:53:41,332 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:41,332 INFO ]: Finished difference Result 77 states and 83 transitions. [2018-06-24 20:53:41,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-06-24 20:53:41,333 INFO ]: Start accepts. Automaton has 48 states. Word has length 38 [2018-06-24 20:53:41,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:41,333 INFO ]: With dead ends: 77 [2018-06-24 20:53:41,333 INFO ]: Without dead ends: 53 [2018-06-24 20:53:41,334 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1684, Invalid=5456, Unknown=0, NotChecked=0, Total=7140 [2018-06-24 20:53:41,334 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 20:53:41,334 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 41. [2018-06-24 20:53:41,334 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:53:41,335 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-06-24 20:53:41,335 INFO ]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2018-06-24 20:53:41,335 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:41,335 INFO ]: Abstraction has 41 states and 44 transitions. [2018-06-24 20:53:41,335 INFO ]: Interpolant automaton has 48 states. [2018-06-24 20:53:41,335 INFO ]: Start isEmpty. Operand 41 states and 44 transitions. [2018-06-24 20:53:41,335 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:53:41,335 INFO ]: Found error trace [2018-06-24 20:53:41,335 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:41,335 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:41,335 INFO ]: Analyzing trace with hash 372491928, now seen corresponding path program 36 times [2018-06-24 20:53:41,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:41,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:41,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:41,336 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:41,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:41,346 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:42,052 INFO ]: Checked inductivity of 176 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:53:42,052 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:42,052 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:42,057 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:53:42,109 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:53:42,109 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:42,113 INFO ]: Computing forward predicates... [2018-06-24 20:53:42,337 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:53:42,355 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:42,355 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 38 [2018-06-24 20:53:42,356 INFO ]: Interpolant automaton has 38 states [2018-06-24 20:53:42,356 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 20:53:42,356 INFO ]: CoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:53:42,356 INFO ]: Start difference. First operand 41 states and 44 transitions. Second operand 38 states. [2018-06-24 20:53:43,048 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:43,048 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-24 20:53:43,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-24 20:53:43,048 INFO ]: Start accepts. Automaton has 38 states. Word has length 38 [2018-06-24 20:53:43,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:43,048 INFO ]: With dead ends: 53 [2018-06-24 20:53:43,048 INFO ]: Without dead ends: 41 [2018-06-24 20:53:43,049 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1514, Invalid=3742, Unknown=0, NotChecked=0, Total=5256 [2018-06-24 20:53:43,049 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:53:43,050 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-24 20:53:43,050 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:53:43,050 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-06-24 20:53:43,050 INFO ]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 38 [2018-06-24 20:53:43,050 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:43,050 INFO ]: Abstraction has 41 states and 43 transitions. [2018-06-24 20:53:43,050 INFO ]: Interpolant automaton has 38 states. [2018-06-24 20:53:43,050 INFO ]: Start isEmpty. Operand 41 states and 43 transitions. [2018-06-24 20:53:43,051 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:53:43,051 INFO ]: Found error trace [2018-06-24 20:53:43,051 INFO ]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:43,051 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:43,051 INFO ]: Analyzing trace with hash 1757803158, now seen corresponding path program 37 times [2018-06-24 20:53:43,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:43,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:43,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:43,054 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:43,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:43,073 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:44,144 INFO ]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:53:44,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:44,144 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:44,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:44,204 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:44,212 INFO ]: Computing forward predicates... [2018-06-24 20:53:45,162 INFO ]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:53:45,181 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:45,181 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 51 [2018-06-24 20:53:45,181 INFO ]: Interpolant automaton has 51 states [2018-06-24 20:53:45,181 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-24 20:53:45,182 INFO ]: CoverageRelationStatistics Valid=111, Invalid=2439, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:53:45,182 INFO ]: Start difference. First operand 41 states and 43 transitions. Second operand 51 states. [2018-06-24 20:53:46,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:46,128 INFO ]: Finished difference Result 68 states and 73 transitions. [2018-06-24 20:53:46,128 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:53:46,128 INFO ]: Start accepts. Automaton has 51 states. Word has length 40 [2018-06-24 20:53:46,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:46,128 INFO ]: With dead ends: 68 [2018-06-24 20:53:46,128 INFO ]: Without dead ends: 68 [2018-06-24 20:53:46,129 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-06-24 20:53:46,129 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-24 20:53:46,130 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 43. [2018-06-24 20:53:46,130 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 20:53:46,130 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-06-24 20:53:46,130 INFO ]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 40 [2018-06-24 20:53:46,130 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:46,130 INFO ]: Abstraction has 43 states and 46 transitions. [2018-06-24 20:53:46,130 INFO ]: Interpolant automaton has 51 states. [2018-06-24 20:53:46,130 INFO ]: Start isEmpty. Operand 43 states and 46 transitions. [2018-06-24 20:53:46,131 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 20:53:46,131 INFO ]: Found error trace [2018-06-24 20:53:46,131 INFO ]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:46,131 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:46,131 INFO ]: Analyzing trace with hash -1060065283, now seen corresponding path program 38 times [2018-06-24 20:53:46,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:46,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:46,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:46,131 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:46,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:46,147 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:46,444 INFO ]: Checked inductivity of 210 backedges. 55 proven. 89 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:53:46,444 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:46,444 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:46,449 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:53:46,514 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:46,514 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:46,518 INFO ]: Computing forward predicates... [2018-06-24 20:53:47,001 INFO ]: Checked inductivity of 210 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:53:47,020 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:47,020 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2018-06-24 20:53:47,020 INFO ]: Interpolant automaton has 52 states [2018-06-24 20:53:47,020 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-24 20:53:47,020 INFO ]: CoverageRelationStatistics Valid=354, Invalid=2298, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:53:47,020 INFO ]: Start difference. First operand 43 states and 46 transitions. Second operand 52 states. [2018-06-24 20:53:48,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:48,508 INFO ]: Finished difference Result 83 states and 89 transitions. [2018-06-24 20:53:48,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-24 20:53:48,508 INFO ]: Start accepts. Automaton has 52 states. Word has length 41 [2018-06-24 20:53:48,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:48,508 INFO ]: With dead ends: 83 [2018-06-24 20:53:48,508 INFO ]: Without dead ends: 57 [2018-06-24 20:53:48,508 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1967, Invalid=6405, Unknown=0, NotChecked=0, Total=8372 [2018-06-24 20:53:48,509 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 20:53:48,510 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-06-24 20:53:48,510 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 20:53:48,510 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-06-24 20:53:48,510 INFO ]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2018-06-24 20:53:48,510 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:48,510 INFO ]: Abstraction has 44 states and 47 transitions. [2018-06-24 20:53:48,510 INFO ]: Interpolant automaton has 52 states. [2018-06-24 20:53:48,510 INFO ]: Start isEmpty. Operand 44 states and 47 transitions. [2018-06-24 20:53:48,510 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 20:53:48,510 INFO ]: Found error trace [2018-06-24 20:53:48,510 INFO ]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:48,511 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:48,511 INFO ]: Analyzing trace with hash 1056937434, now seen corresponding path program 39 times [2018-06-24 20:53:48,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:48,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:48,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:48,511 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:48,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:48,526 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:48,791 INFO ]: Checked inductivity of 210 backedges. 67 proven. 77 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:53:48,791 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:48,791 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:48,796 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:53:48,854 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:53:48,854 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:48,859 INFO ]: Computing forward predicates... [2018-06-24 20:53:49,109 INFO ]: Checked inductivity of 210 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:53:49,128 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:49,128 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 41 [2018-06-24 20:53:49,128 INFO ]: Interpolant automaton has 41 states [2018-06-24 20:53:49,128 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-24 20:53:49,128 INFO ]: CoverageRelationStatistics Valid=278, Invalid=1362, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:53:49,128 INFO ]: Start difference. First operand 44 states and 47 transitions. Second operand 41 states. [2018-06-24 20:53:49,943 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:49,943 INFO ]: Finished difference Result 57 states and 60 transitions. [2018-06-24 20:53:49,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-24 20:53:49,943 INFO ]: Start accepts. Automaton has 41 states. Word has length 41 [2018-06-24 20:53:49,944 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:49,944 INFO ]: With dead ends: 57 [2018-06-24 20:53:49,944 INFO ]: Without dead ends: 44 [2018-06-24 20:53:49,944 INFO ]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1770, Invalid=4392, Unknown=0, NotChecked=0, Total=6162 [2018-06-24 20:53:49,944 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-24 20:53:49,945 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-24 20:53:49,945 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 20:53:49,946 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-06-24 20:53:49,946 INFO ]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2018-06-24 20:53:49,946 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:49,946 INFO ]: Abstraction has 44 states and 46 transitions. [2018-06-24 20:53:49,946 INFO ]: Interpolant automaton has 41 states. [2018-06-24 20:53:49,946 INFO ]: Start isEmpty. Operand 44 states and 46 transitions. [2018-06-24 20:53:49,946 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-24 20:53:49,946 INFO ]: Found error trace [2018-06-24 20:53:49,946 INFO ]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:49,946 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:49,946 INFO ]: Analyzing trace with hash -2019582372, now seen corresponding path program 40 times [2018-06-24 20:53:49,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:49,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:49,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:49,947 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:49,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:49,965 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:50,627 INFO ]: Checked inductivity of 234 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-24 20:53:50,627 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:50,627 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:50,633 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:53:50,689 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:53:50,689 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:50,695 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-24 20:53:51,553 INFO ]: Timeout while computing interpolants [2018-06-24 20:53:51,794 WARN ]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:51,794 WARN ]: Verification canceled [2018-06-24 20:53:51,796 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:53:51,797 WARN ]: Timeout [2018-06-24 20:53:51,798 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:53:51 BasicIcfg [2018-06-24 20:53:51,798 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:53:51,798 INFO ]: Toolchain (without parser) took 58726.79 ms. Allocated memory was 305.1 MB in the beginning and 831.5 MB in the end (delta: 526.4 MB). Free memory was 261.5 MB in the beginning and 508.6 MB in the end (delta: -247.1 MB). Peak memory consumption was 279.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:53:51,799 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:53:51,799 INFO ]: ChcToBoogie took 58.76 ms. Allocated memory is still 305.1 MB. Free memory was 259.5 MB in the beginning and 257.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:53:51,800 INFO ]: Boogie Preprocessor took 35.01 ms. Allocated memory is still 305.1 MB. Free memory is still 257.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:53:51,800 INFO ]: RCFGBuilder took 261.27 ms. Allocated memory is still 305.1 MB. Free memory was 257.5 MB in the beginning and 247.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:53:51,800 INFO ]: BlockEncodingV2 took 107.26 ms. Allocated memory is still 305.1 MB. Free memory was 247.5 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:53:51,801 INFO ]: TraceAbstraction took 58242.45 ms. Allocated memory was 305.1 MB in the beginning and 831.5 MB in the end (delta: 526.4 MB). Free memory was 245.5 MB in the beginning and 508.6 MB in the end (delta: -263.1 MB). Peak memory consumption was 263.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:53:51,805 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 14 locations, 16 edges - StatisticsResult: Encoded RCFG 8 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.76 ms. Allocated memory is still 305.1 MB. Free memory was 259.5 MB in the beginning and 257.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.01 ms. Allocated memory is still 305.1 MB. Free memory is still 257.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 261.27 ms. Allocated memory is still 305.1 MB. Free memory was 257.5 MB in the beginning and 247.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 107.26 ms. Allocated memory is still 305.1 MB. Free memory was 247.5 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58242.45 ms. Allocated memory was 305.1 MB in the beginning and 831.5 MB in the end (delta: 526.4 MB). Free memory was 245.5 MB in the beginning and 508.6 MB in the end (delta: -263.1 MB). Peak memory consumption was 263.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 50 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. TIMEOUT Result, 58.1s OverallTime, 44 OverallIterations, 12 TraceHistogramMax, 23.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 272 SDtfs, 917 SDslu, 3828 SDs, 0 SdLazy, 10687 SolverSat, 1871 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2438 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 1634 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14046 ImplicationChecksByTransitivity, 42.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 43 MinimizatonAttempts, 258 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 29.3s InterpolantComputationTime, 2004 NumberOfCodeBlocks, 2004 NumberOfCodeBlocksAsserted, 158 NumberOfCheckSat, 1921 ConstructedInterpolants, 75 QuantifiedInterpolants, 312519 SizeOfPredicates, 271 NumberOfNonLiveVariables, 12674 ConjunctsInSsa, 2916 ConjunctsInUnsatCore, 83 InterpolantComputations, 4 PerfectInterpolantSequences, 3412/6163 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/square_twice_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-53-51-815.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-53-51-815.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-53-51-815.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-53-51-815.csv Completed graceful shutdown