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/barthe_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:46:00,473 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:46:00,475 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:46:00,490 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:46:00,490 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:46:00,493 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:46:00,494 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:46:00,497 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:46:00,499 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:46:00,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:46:00,501 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:46:00,502 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:46:00,502 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:46:00,503 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:46:00,504 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:46:00,507 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:46:00,509 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:46:00,517 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:46:00,518 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:46:00,519 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:46:00,524 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:46:00,526 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:46:00,526 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:46:00,526 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:46:00,527 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:46:00,528 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:46:00,529 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:46:00,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:46:00,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:46:00,531 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:46:00,532 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:46:00,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:46:00,533 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:46:00,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:46:00,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:46:00,534 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:46:00,556 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:46:00,556 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:46:00,556 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:46:00,556 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:46:00,557 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:46:00,557 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:46:00,558 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:46:00,559 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:46:00,559 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:46:00,559 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:46:00,559 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:46:00,559 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:46:00,560 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:46:00,560 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:46:00,560 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:46:00,560 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:46:00,560 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:46:00,560 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:46:00,561 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:46:00,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:46:00,561 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:46:00,563 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:46:00,563 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:46:00,610 INFO ]: Repository-Root is: /tmp [2018-06-24 20:46:00,621 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:46:00,624 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:46:00,626 INFO ]: Initializing SmtParser... [2018-06-24 20:46:00,626 INFO ]: SmtParser initialized [2018-06-24 20:46:00,627 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/barthe_merged_safe.c-1.smt2 [2018-06-24 20:46:00,631 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:46:00,722 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe_merged_safe.c-1.smt2 unknown [2018-06-24 20:46:00,895 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe_merged_safe.c-1.smt2 [2018-06-24 20:46:00,900 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:46:00,906 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:46:00,906 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:46:00,906 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:46:00,906 INFO ]: ChcToBoogie initialized [2018-06-24 20:46:00,910 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:46:00" (1/1) ... [2018-06-24 20:46:00,962 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:00 Unit [2018-06-24 20:46:00,962 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:46:00,963 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:46:00,963 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:46:00,963 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:46:00,984 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:00" (1/1) ... [2018-06-24 20:46:00,985 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:00" (1/1) ... [2018-06-24 20:46:00,991 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:00" (1/1) ... [2018-06-24 20:46:00,991 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:00" (1/1) ... [2018-06-24 20:46:00,994 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:00" (1/1) ... [2018-06-24 20:46:00,996 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:00" (1/1) ... [2018-06-24 20:46:00,997 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:00" (1/1) ... [2018-06-24 20:46:00,998 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:46:01,000 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:46:01,000 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:46:01,000 INFO ]: RCFGBuilder initialized [2018-06-24 20:46:01,001 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:00" (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:46:01,017 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:46:01,017 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:46:01,017 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:46:01,017 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:46:01,017 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:46:01,017 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:46:01,322 INFO ]: Using library mode [2018-06-24 20:46:01,323 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:46:01 BoogieIcfgContainer [2018-06-24 20:46:01,323 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:46:01,323 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:46:01,323 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:46:01,327 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:46:01,327 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:46:01" (1/1) ... [2018-06-24 20:46:01,352 INFO ]: Initial Icfg 12 locations, 13 edges [2018-06-24 20:46:01,354 INFO ]: Using Remove infeasible edges [2018-06-24 20:46:01,354 INFO ]: Using Maximize final states [2018-06-24 20:46:01,354 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:46:01,355 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:46:01,359 INFO ]: Using Remove sink states [2018-06-24 20:46:01,360 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:46:01,360 INFO ]: Using Use SBE [2018-06-24 20:46:01,370 INFO ]: SBE split 0 edges [2018-06-24 20:46:01,376 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:46:01,378 INFO ]: 0 new accepting states [2018-06-24 20:46:01,520 INFO ]: Removed 13 edges and 4 locations by large block encoding [2018-06-24 20:46:01,522 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:46:01,523 INFO ]: Removed 1 edges and 0 locations because of local infeasibility [2018-06-24 20:46:01,523 INFO ]: 0 new accepting states [2018-06-24 20:46:01,523 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:46:01,523 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:46:01,523 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:46:01,523 INFO ]: 0 new accepting states [2018-06-24 20:46:01,523 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:46:01,524 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:46:01,524 INFO ]: Encoded RCFG 6 locations, 7 edges [2018-06-24 20:46:01,524 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:46:01 BasicIcfg [2018-06-24 20:46:01,524 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:46:01,526 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:46:01,526 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:46:01,529 INFO ]: TraceAbstraction initialized [2018-06-24 20:46:01,529 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:46:00" (1/4) ... [2018-06-24 20:46:01,530 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4732b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:46:01, skipping insertion in model container [2018-06-24 20:46:01,530 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:00" (2/4) ... [2018-06-24 20:46:01,530 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4732b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:46:01, skipping insertion in model container [2018-06-24 20:46:01,530 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:46:01" (3/4) ... [2018-06-24 20:46:01,530 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4732b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:46:01, skipping insertion in model container [2018-06-24 20:46:01,530 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:46:01" (4/4) ... [2018-06-24 20:46:01,532 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:46:01,540 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:46:01,547 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:46:01,593 INFO ]: Using default assertion order modulation [2018-06-24 20:46:01,593 INFO ]: Interprodecural is true [2018-06-24 20:46:01,593 INFO ]: Hoare is false [2018-06-24 20:46:01,593 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:46:01,593 INFO ]: Backedges is TWOTRACK [2018-06-24 20:46:01,593 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:46:01,593 INFO ]: Difference is false [2018-06-24 20:46:01,593 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:46:01,593 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:46:01,605 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 20:46:01,613 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:46:01,613 INFO ]: Found error trace [2018-06-24 20:46:01,614 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:46:01,614 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:01,619 INFO ]: Analyzing trace with hash 37439016, now seen corresponding path program 1 times [2018-06-24 20:46:01,621 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:01,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:01,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:01,653 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:01,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:01,710 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:01,818 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:46:01,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:46:01,820 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:46:01,821 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:46:01,831 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:46:01,832 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:46:01,833 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 20:46:01,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:01,938 INFO ]: Finished difference Result 7 states and 8 transitions. [2018-06-24 20:46:01,940 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:46:01,942 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:46:01,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:01,951 INFO ]: With dead ends: 7 [2018-06-24 20:46:01,951 INFO ]: Without dead ends: 6 [2018-06-24 20:46:01,956 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:46:01,974 INFO ]: Start minimizeSevpa. Operand 6 states. [2018-06-24 20:46:01,990 INFO ]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-06-24 20:46:01,991 INFO ]: Start removeUnreachable. Operand 6 states. [2018-06-24 20:46:01,991 INFO ]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-06-24 20:46:01,992 INFO ]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 5 [2018-06-24 20:46:01,992 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:01,992 INFO ]: Abstraction has 6 states and 6 transitions. [2018-06-24 20:46:01,992 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:46:01,992 INFO ]: Start isEmpty. Operand 6 states and 6 transitions. [2018-06-24 20:46:01,993 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:46:01,993 INFO ]: Found error trace [2018-06-24 20:46:01,993 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:46:01,993 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:01,993 INFO ]: Analyzing trace with hash 37379434, now seen corresponding path program 1 times [2018-06-24 20:46:01,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:01,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:01,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:01,994 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:01,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:02,021 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:02,081 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:46:02,081 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:46:02,081 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:46:02,082 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:46:02,082 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:46:02,082 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:46:02,083 INFO ]: Start difference. First operand 6 states and 6 transitions. Second operand 3 states. [2018-06-24 20:46:02,112 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:02,112 INFO ]: Finished difference Result 7 states and 7 transitions. [2018-06-24 20:46:02,112 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:46:02,113 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:46:02,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:02,113 INFO ]: With dead ends: 7 [2018-06-24 20:46:02,113 INFO ]: Without dead ends: 7 [2018-06-24 20:46:02,114 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:46:02,114 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 20:46:02,115 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 20:46:02,115 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 20:46:02,115 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-06-24 20:46:02,115 INFO ]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-06-24 20:46:02,116 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:02,116 INFO ]: Abstraction has 7 states and 7 transitions. [2018-06-24 20:46:02,116 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:46:02,116 INFO ]: Start isEmpty. Operand 7 states and 7 transitions. [2018-06-24 20:46:02,116 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:46:02,116 INFO ]: Found error trace [2018-06-24 20:46:02,116 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:46:02,116 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:02,116 INFO ]: Analyzing trace with hash 1158563719, now seen corresponding path program 1 times [2018-06-24 20:46:02,116 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:02,116 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:02,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:02,119 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:02,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:02,154 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:02,296 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:46:02,296 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:02,296 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:02,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:02,351 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:02,361 INFO ]: Computing forward predicates... [2018-06-24 20:46:02,485 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:46:02,504 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:02,505 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 20:46:02,505 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:46:02,505 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:46:02,505 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:46:02,505 INFO ]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-06-24 20:46:02,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:02,528 INFO ]: Finished difference Result 8 states and 8 transitions. [2018-06-24 20:46:02,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:46:02,529 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 20:46:02,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:02,529 INFO ]: With dead ends: 8 [2018-06-24 20:46:02,529 INFO ]: Without dead ends: 8 [2018-06-24 20:46:02,530 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:46:02,530 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:46:02,531 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:46:02,531 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:46:02,531 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-06-24 20:46:02,531 INFO ]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-06-24 20:46:02,531 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:02,531 INFO ]: Abstraction has 8 states and 8 transitions. [2018-06-24 20:46:02,531 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:46:02,531 INFO ]: Start isEmpty. Operand 8 states and 8 transitions. [2018-06-24 20:46:02,531 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:46:02,531 INFO ]: Found error trace [2018-06-24 20:46:02,532 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 20:46:02,532 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:02,532 INFO ]: Analyzing trace with hash 1555538186, now seen corresponding path program 2 times [2018-06-24 20:46:02,532 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:02,532 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:02,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:02,533 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:02,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:02,579 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:02,789 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:02,789 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:02,789 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:02,797 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:46:02,883 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:46:02,884 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:02,889 INFO ]: Computing forward predicates... [2018-06-24 20:46:02,990 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:03,022 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:03,022 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:46:03,023 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:46:03,023 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:46:03,023 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:46:03,023 INFO ]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2018-06-24 20:46:03,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:03,072 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-24 20:46:03,073 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:46:03,073 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:46:03,073 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:03,073 INFO ]: With dead ends: 9 [2018-06-24 20:46:03,073 INFO ]: Without dead ends: 9 [2018-06-24 20:46:03,073 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:46:03,074 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:46:03,075 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:46:03,075 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:46:03,075 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-24 20:46:03,075 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-24 20:46:03,075 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:03,075 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-24 20:46:03,075 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:46:03,075 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-24 20:46:03,075 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:46:03,075 INFO ]: Found error trace [2018-06-24 20:46:03,075 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-24 20:46:03,076 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:03,076 INFO ]: Analyzing trace with hash 976844775, now seen corresponding path program 3 times [2018-06-24 20:46:03,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:03,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:03,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:03,076 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:03,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:03,110 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:03,663 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:03,663 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:03,663 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:46:03,678 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:46:03,756 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:46:03,756 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:03,760 INFO ]: Computing forward predicates... [2018-06-24 20:46:03,996 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:04,020 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:04,020 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 20:46:04,021 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:46:04,021 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:46:04,021 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:46:04,021 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-06-24 20:46:04,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:04,154 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-24 20:46:04,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:46:04,155 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 20:46:04,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:04,155 INFO ]: With dead ends: 10 [2018-06-24 20:46:04,155 INFO ]: Without dead ends: 10 [2018-06-24 20:46:04,155 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:46:04,156 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:46:04,158 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:46:04,158 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:46:04,158 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-24 20:46:04,158 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-24 20:46:04,158 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:04,158 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-24 20:46:04,158 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:46:04,158 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-24 20:46:04,158 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:46:04,158 INFO ]: Found error trace [2018-06-24 20:46:04,158 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-24 20:46:04,159 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:04,159 INFO ]: Analyzing trace with hash 217218218, now seen corresponding path program 4 times [2018-06-24 20:46:04,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:04,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:04,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:04,159 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:04,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:04,187 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:04,695 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:04,695 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:04,695 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:46:04,710 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:46:04,756 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:46:04,756 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:04,762 INFO ]: Computing forward predicates... [2018-06-24 20:46:04,897 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:04,931 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:04,931 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-24 20:46:04,931 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:46:04,931 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:46:04,931 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:46:04,931 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2018-06-24 20:46:05,000 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:05,000 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-24 20:46:05,000 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:46:05,000 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 20:46:05,000 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:05,001 INFO ]: With dead ends: 11 [2018-06-24 20:46:05,001 INFO ]: Without dead ends: 11 [2018-06-24 20:46:05,001 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:46:05,001 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:46:05,002 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:46:05,002 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:46:05,002 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-24 20:46:05,002 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-24 20:46:05,003 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:05,003 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-24 20:46:05,003 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:46:05,003 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-24 20:46:05,003 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:46:05,003 INFO ]: Found error trace [2018-06-24 20:46:05,003 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-24 20:46:05,003 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:05,003 INFO ]: Analyzing trace with hash -1856368569, now seen corresponding path program 5 times [2018-06-24 20:46:05,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:05,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:05,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:05,004 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:05,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:05,042 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:05,402 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:05,402 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:05,402 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:46:05,416 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:46:05,461 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:46:05,461 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:05,466 INFO ]: Computing forward predicates... [2018-06-24 20:46:05,513 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:05,547 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:05,547 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 20:46:05,548 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:46:05,548 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:46:05,548 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:46:05,548 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-06-24 20:46:05,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:05,674 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-24 20:46:05,674 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:46:05,674 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 20:46:05,674 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:05,674 INFO ]: With dead ends: 12 [2018-06-24 20:46:05,674 INFO ]: Without dead ends: 12 [2018-06-24 20:46:05,675 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:46:05,675 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:46:05,676 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 20:46:05,676 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:46:05,676 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-24 20:46:05,676 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-24 20:46:05,676 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:05,676 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-24 20:46:05,676 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:46:05,676 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-24 20:46:05,676 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:46:05,676 INFO ]: Found error trace [2018-06-24 20:46:05,676 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-24 20:46:05,677 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:05,677 INFO ]: Analyzing trace with hash -1713049526, now seen corresponding path program 6 times [2018-06-24 20:46:05,677 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:05,677 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:05,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:05,677 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:05,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:05,729 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:05,996 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:05,996 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:05,996 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:46:06,010 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:06,060 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:46:06,060 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:06,067 INFO ]: Computing forward predicates... [2018-06-24 20:46:06,109 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:06,139 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:06,140 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:46:06,140 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:46:06,140 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:46:06,140 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:46:06,140 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-06-24 20:46:06,283 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:06,283 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-24 20:46:06,283 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:46:06,283 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 20:46:06,284 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:06,284 INFO ]: With dead ends: 13 [2018-06-24 20:46:06,284 INFO ]: Without dead ends: 13 [2018-06-24 20:46:06,284 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:46:06,284 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:46:06,286 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:46:06,286 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:46:06,286 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-24 20:46:06,286 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-24 20:46:06,287 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:06,287 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-24 20:46:06,287 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:46:06,287 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-24 20:46:06,287 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:46:06,287 INFO ]: Found error trace [2018-06-24 20:46:06,287 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-24 20:46:06,287 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:06,287 INFO ]: Analyzing trace with hash -1565126489, now seen corresponding path program 7 times [2018-06-24 20:46:06,287 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:06,287 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:06,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:06,288 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:06,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:06,329 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:06,541 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:06,541 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:06,541 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:46:06,554 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:06,608 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:06,616 INFO ]: Computing forward predicates... [2018-06-24 20:46:06,707 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:06,728 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:06,728 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 20:46:06,728 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:46:06,728 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:46:06,728 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:46:06,728 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-06-24 20:46:06,795 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:06,795 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-24 20:46:06,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:46:06,795 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 20:46:06,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:06,796 INFO ]: With dead ends: 14 [2018-06-24 20:46:06,796 INFO ]: Without dead ends: 14 [2018-06-24 20:46:06,796 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:46:06,796 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:46:06,797 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:46:06,797 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:46:06,798 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-24 20:46:06,798 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-24 20:46:06,798 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:06,798 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-24 20:46:06,798 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:46:06,798 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-24 20:46:06,798 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:46:06,798 INFO ]: Found error trace [2018-06-24 20:46:06,798 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-24 20:46:06,798 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:06,798 INFO ]: Analyzing trace with hash -1274479638, now seen corresponding path program 8 times [2018-06-24 20:46:06,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:06,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:06,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:06,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:06,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:06,852 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:07,232 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:07,232 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:07,232 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:46:07,241 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:46:07,311 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:46:07,311 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:07,319 INFO ]: Computing forward predicates... [2018-06-24 20:46:07,427 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:07,446 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:07,446 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-24 20:46:07,446 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:46:07,447 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:46:07,447 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:46:07,447 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2018-06-24 20:46:07,544 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:07,544 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-24 20:46:07,544 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:46:07,544 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-24 20:46:07,544 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:07,544 INFO ]: With dead ends: 15 [2018-06-24 20:46:07,544 INFO ]: Without dead ends: 15 [2018-06-24 20:46:07,545 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:46:07,545 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:46:07,546 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 20:46:07,546 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:46:07,547 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-24 20:46:07,547 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-24 20:46:07,547 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:07,547 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-24 20:46:07,547 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:46:07,547 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-24 20:46:07,547 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:46:07,547 INFO ]: Found error trace [2018-06-24 20:46:07,547 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-24 20:46:07,547 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:07,547 INFO ]: Analyzing trace with hash -854361849, now seen corresponding path program 9 times [2018-06-24 20:46:07,547 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:07,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:07,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:07,548 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:07,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:07,582 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:07,873 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:07,873 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:07,873 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:46:07,879 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:46:08,002 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:46:08,002 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:08,011 INFO ]: Computing forward predicates... [2018-06-24 20:46:08,097 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:08,117 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:08,117 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 20:46:08,117 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:46:08,117 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:46:08,117 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:46:08,117 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-06-24 20:46:08,213 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:08,213 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-24 20:46:08,213 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:46:08,213 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-24 20:46:08,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:08,213 INFO ]: With dead ends: 16 [2018-06-24 20:46:08,213 INFO ]: Without dead ends: 16 [2018-06-24 20:46:08,214 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:46:08,214 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:46:08,215 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:46:08,215 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:46:08,215 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-24 20:46:08,215 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-24 20:46:08,215 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:08,215 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-24 20:46:08,215 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:46:08,215 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-24 20:46:08,216 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:46:08,216 INFO ]: Found error trace [2018-06-24 20:46:08,216 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-24 20:46:08,216 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:08,216 INFO ]: Analyzing trace with hash -715612278, now seen corresponding path program 10 times [2018-06-24 20:46:08,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:08,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:08,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:08,217 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:08,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:08,273 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:09,145 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:09,145 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:09,145 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:46:09,150 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:46:09,208 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:46:09,208 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:09,217 INFO ]: Computing forward predicates... [2018-06-24 20:46:09,569 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:09,588 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:09,588 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-24 20:46:09,588 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:46:09,588 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:46:09,588 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:46:09,588 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2018-06-24 20:46:09,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:09,697 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-24 20:46:09,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:46:09,719 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-24 20:46:09,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:09,719 INFO ]: With dead ends: 17 [2018-06-24 20:46:09,719 INFO ]: Without dead ends: 17 [2018-06-24 20:46:09,719 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:46:09,720 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:46:09,722 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:46:09,722 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:46:09,723 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-24 20:46:09,723 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-24 20:46:09,723 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:09,723 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-24 20:46:09,723 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:46:09,723 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-24 20:46:09,723 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:46:09,723 INFO ]: Found error trace [2018-06-24 20:46:09,723 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-24 20:46:09,723 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:09,723 INFO ]: Analyzing trace with hash -709342873, now seen corresponding path program 11 times [2018-06-24 20:46:09,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:09,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:09,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:09,724 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:09,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:09,769 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:10,625 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:10,625 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:10,625 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:46:10,633 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:46:10,728 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:46:10,728 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:10,743 INFO ]: Computing forward predicates... [2018-06-24 20:46:11,145 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:11,169 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:11,169 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-24 20:46:11,170 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:46:11,170 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:46:11,170 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:46:11,170 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2018-06-24 20:46:11,304 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:11,304 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-24 20:46:11,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:46:11,305 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-24 20:46:11,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:11,305 INFO ]: With dead ends: 18 [2018-06-24 20:46:11,305 INFO ]: Without dead ends: 18 [2018-06-24 20:46:11,306 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:46:11,306 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:46:11,307 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 20:46:11,307 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:46:11,308 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-24 20:46:11,308 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-24 20:46:11,308 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:11,308 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-24 20:46:11,308 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:46:11,308 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-24 20:46:11,308 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:46:11,308 INFO ]: Found error trace [2018-06-24 20:46:11,308 INFO ]: trace histogram [12, 1, 1, 1, 1, 1] [2018-06-24 20:46:11,308 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:11,308 INFO ]: Analyzing trace with hash -514991318, now seen corresponding path program 12 times [2018-06-24 20:46:11,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:11,308 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:11,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:11,309 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:11,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:11,389 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:12,203 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:12,203 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:12,203 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:46:12,209 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:46:12,300 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:46:12,300 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:12,309 INFO ]: Computing forward predicates... [2018-06-24 20:46:12,397 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:12,417 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:12,417 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-24 20:46:12,417 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:46:12,417 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:46:12,417 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:46:12,418 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2018-06-24 20:46:12,664 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:12,664 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-24 20:46:12,664 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:46:12,665 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-24 20:46:12,665 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:12,665 INFO ]: With dead ends: 19 [2018-06-24 20:46:12,665 INFO ]: Without dead ends: 19 [2018-06-24 20:46:12,665 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:46:12,665 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:46:12,667 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 20:46:12,667 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:46:12,667 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-24 20:46:12,667 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-24 20:46:12,667 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:12,667 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-24 20:46:12,667 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:46:12,667 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-24 20:46:12,667 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:46:12,667 INFO ]: Found error trace [2018-06-24 20:46:12,668 INFO ]: trace histogram [13, 1, 1, 1, 1, 1] [2018-06-24 20:46:12,668 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:12,668 INFO ]: Analyzing trace with hash 1214939591, now seen corresponding path program 13 times [2018-06-24 20:46:12,668 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:12,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:12,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:12,668 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:12,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:12,732 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:13,333 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:13,334 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:13,334 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) [2018-06-24 20:46:13,348 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:13,413 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:13,422 INFO ]: Computing forward predicates... [2018-06-24 20:46:13,527 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:13,547 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:13,547 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 20:46:13,548 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:46:13,548 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:46:13,548 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:46:13,548 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2018-06-24 20:46:13,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:13,700 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-24 20:46:13,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:46:13,700 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 20:46:13,701 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:13,701 INFO ]: With dead ends: 20 [2018-06-24 20:46:13,701 INFO ]: Without dead ends: 20 [2018-06-24 20:46:13,701 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:46:13,701 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:46:13,703 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 20:46:13,703 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:46:13,703 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-24 20:46:13,703 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-24 20:46:13,703 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:13,703 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-24 20:46:13,703 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:46:13,703 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-24 20:46:13,704 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:46:13,704 INFO ]: Found error trace [2018-06-24 20:46:13,704 INFO ]: trace histogram [14, 1, 1, 1, 1, 1] [2018-06-24 20:46:13,704 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:13,704 INFO ]: Analyzing trace with hash -991777078, now seen corresponding path program 14 times [2018-06-24 20:46:13,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:13,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:13,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:13,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:13,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:13,773 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:14,177 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:14,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:14,177 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:46:14,184 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:46:14,281 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:46:14,281 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:14,303 INFO ]: Computing forward predicates... [2018-06-24 20:46:14,622 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:14,641 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:14,641 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-06-24 20:46:14,642 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:46:14,642 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:46:14,642 INFO ]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:46:14,642 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2018-06-24 20:46:14,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:14,797 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-24 20:46:14,819 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:46:14,819 INFO ]: Start accepts. Automaton has 18 states. Word has length 19 [2018-06-24 20:46:14,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:14,819 INFO ]: With dead ends: 21 [2018-06-24 20:46:14,819 INFO ]: Without dead ends: 21 [2018-06-24 20:46:14,820 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:46:14,820 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:46:14,821 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 20:46:14,821 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:46:14,822 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-24 20:46:14,822 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-24 20:46:14,822 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:14,822 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-24 20:46:14,822 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:46:14,822 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-24 20:46:14,822 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:46:14,822 INFO ]: Found error trace [2018-06-24 20:46:14,822 INFO ]: trace histogram [15, 1, 1, 1, 1, 1] [2018-06-24 20:46:14,822 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:14,822 INFO ]: Analyzing trace with hash -680517081, now seen corresponding path program 15 times [2018-06-24 20:46:14,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:14,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:14,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:14,823 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:14,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:14,937 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:15,484 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:15,484 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:15,484 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:15,490 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:46:15,593 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 20:46:15,593 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:15,602 INFO ]: Computing forward predicates... [2018-06-24 20:46:15,725 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:15,745 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:15,745 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 20:46:15,745 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:46:15,745 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:46:15,745 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:46:15,745 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2018-06-24 20:46:16,004 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:16,005 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-24 20:46:16,005 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:46:16,006 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-24 20:46:16,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:16,006 INFO ]: With dead ends: 22 [2018-06-24 20:46:16,006 INFO ]: Without dead ends: 22 [2018-06-24 20:46:16,006 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:46:16,006 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:46:16,008 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-24 20:46:16,008 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:46:16,008 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-24 20:46:16,009 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-24 20:46:16,009 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:16,009 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-24 20:46:16,009 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:46:16,009 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-24 20:46:16,010 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:46:16,010 INFO ]: Found error trace [2018-06-24 20:46:16,010 INFO ]: trace histogram [16, 1, 1, 1, 1, 1] [2018-06-24 20:46:16,010 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:16,010 INFO ]: Analyzing trace with hash 378608234, now seen corresponding path program 16 times [2018-06-24 20:46:16,010 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:16,010 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:16,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:16,011 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:16,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:16,070 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:16,464 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:16,464 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:16,464 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:46:16,470 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:46:16,566 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:46:16,566 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:16,578 INFO ]: Computing forward predicates... [2018-06-24 20:46:16,725 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:16,756 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:16,756 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-06-24 20:46:16,756 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:46:16,756 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:46:16,756 INFO ]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:46:16,756 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 20 states. [2018-06-24 20:46:16,995 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:16,995 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-24 20:46:16,995 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:46:16,995 INFO ]: Start accepts. Automaton has 20 states. Word has length 21 [2018-06-24 20:46:16,996 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:16,996 INFO ]: With dead ends: 23 [2018-06-24 20:46:16,996 INFO ]: Without dead ends: 23 [2018-06-24 20:46:16,996 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:46:16,996 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:46:17,002 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 20:46:17,002 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:46:17,003 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-24 20:46:17,003 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-24 20:46:17,003 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:17,003 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-24 20:46:17,003 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:46:17,003 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-24 20:46:17,004 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:46:17,004 INFO ]: Found error trace [2018-06-24 20:46:17,004 INFO ]: trace histogram [17, 1, 1, 1, 1, 1] [2018-06-24 20:46:17,004 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:17,004 INFO ]: Analyzing trace with hash -1148245369, now seen corresponding path program 17 times [2018-06-24 20:46:17,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:17,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:17,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:17,004 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:17,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:17,131 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:17,613 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:17,613 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:17,613 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:46:17,621 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:46:17,764 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 20:46:17,764 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:17,777 INFO ]: Computing forward predicates... [2018-06-24 20:46:18,331 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:18,362 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:18,362 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-24 20:46:18,362 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:46:18,362 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:46:18,363 INFO ]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:46:18,363 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 21 states. [2018-06-24 20:46:19,379 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:19,379 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-24 20:46:19,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:46:19,380 INFO ]: Start accepts. Automaton has 21 states. Word has length 22 [2018-06-24 20:46:19,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:19,380 INFO ]: With dead ends: 24 [2018-06-24 20:46:19,380 INFO ]: Without dead ends: 24 [2018-06-24 20:46:19,380 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:46:19,380 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:46:19,382 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 20:46:19,382 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:46:19,382 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-24 20:46:19,382 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-24 20:46:19,382 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:19,382 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-24 20:46:19,382 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:46:19,382 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-24 20:46:19,383 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:46:19,383 INFO ]: Found error trace [2018-06-24 20:46:19,383 INFO ]: trace histogram [18, 1, 1, 1, 1, 1] [2018-06-24 20:46:19,383 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:19,383 INFO ]: Analyzing trace with hash -1236066806, now seen corresponding path program 18 times [2018-06-24 20:46:19,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:19,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:19,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:19,386 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:19,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:19,466 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:19,977 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:19,977 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:20,031 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:46:20,040 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:46:20,212 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-24 20:46:20,212 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:20,223 INFO ]: Computing forward predicates... [2018-06-24 20:46:20,323 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:20,343 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:20,343 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-24 20:46:20,343 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:46:20,343 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:46:20,343 INFO ]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:46:20,343 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 22 states. [2018-06-24 20:46:20,607 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:20,607 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-24 20:46:20,607 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:46:20,607 INFO ]: Start accepts. Automaton has 22 states. Word has length 23 [2018-06-24 20:46:20,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:20,608 INFO ]: With dead ends: 25 [2018-06-24 20:46:20,608 INFO ]: Without dead ends: 25 [2018-06-24 20:46:20,608 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:46:20,608 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:46:20,610 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 20:46:20,610 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:46:20,610 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-24 20:46:20,610 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-24 20:46:20,610 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:20,610 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-24 20:46:20,610 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:46:20,610 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-24 20:46:20,611 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:46:20,611 INFO ]: Found error trace [2018-06-24 20:46:20,611 INFO ]: trace histogram [19, 1, 1, 1, 1, 1] [2018-06-24 20:46:20,611 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:20,611 INFO ]: Analyzing trace with hash 336435943, now seen corresponding path program 19 times [2018-06-24 20:46:20,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:20,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:20,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:20,611 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:20,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:20,789 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:22,938 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:22,938 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:22,938 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:46:22,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:23,038 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:23,051 INFO ]: Computing forward predicates... [2018-06-24 20:46:23,244 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:23,265 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:23,265 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-24 20:46:23,265 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:46:23,265 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:46:23,265 INFO ]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:46:23,265 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 23 states. [2018-06-24 20:46:23,612 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:23,612 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-24 20:46:23,612 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:46:23,612 INFO ]: Start accepts. Automaton has 23 states. Word has length 24 [2018-06-24 20:46:23,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:23,613 INFO ]: With dead ends: 26 [2018-06-24 20:46:23,613 INFO ]: Without dead ends: 26 [2018-06-24 20:46:23,613 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:46:23,613 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:46:23,615 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:46:23,615 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:46:23,615 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-24 20:46:23,615 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-24 20:46:23,616 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:23,616 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-24 20:46:23,616 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:46:23,616 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-24 20:46:23,616 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:46:23,616 INFO ]: Found error trace [2018-06-24 20:46:23,616 INFO ]: trace histogram [20, 1, 1, 1, 1, 1] [2018-06-24 20:46:23,616 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:23,616 INFO ]: Analyzing trace with hash 1839380906, now seen corresponding path program 20 times [2018-06-24 20:46:23,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:23,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:23,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:23,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:23,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:23,697 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:24,723 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:24,723 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:24,723 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:46:24,729 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:46:24,815 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:46:24,815 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:24,830 INFO ]: Computing forward predicates... [2018-06-24 20:46:24,895 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:24,914 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:24,914 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-06-24 20:46:24,915 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:46:24,915 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:46:24,915 INFO ]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:46:24,915 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 24 states. [2018-06-24 20:46:25,201 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:25,202 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-24 20:46:25,253 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:46:25,253 INFO ]: Start accepts. Automaton has 24 states. Word has length 25 [2018-06-24 20:46:25,253 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:25,253 INFO ]: With dead ends: 27 [2018-06-24 20:46:25,253 INFO ]: Without dead ends: 27 [2018-06-24 20:46:25,254 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:46:25,254 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:46:25,255 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 20:46:25,255 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:46:25,255 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-24 20:46:25,255 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-24 20:46:25,256 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:25,256 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-24 20:46:25,256 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:46:25,256 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-24 20:46:25,256 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:46:25,256 INFO ]: Found error trace [2018-06-24 20:46:25,256 INFO ]: trace histogram [21, 1, 1, 1, 1, 1] [2018-06-24 20:46:25,256 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:25,256 INFO ]: Analyzing trace with hash 1186034503, now seen corresponding path program 21 times [2018-06-24 20:46:25,256 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:25,256 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:25,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:25,257 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:25,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:25,390 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:26,096 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:26,096 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:26,096 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:46:26,103 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:46:26,226 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-24 20:46:26,226 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:26,237 INFO ]: Computing forward predicates... [2018-06-24 20:46:26,408 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:26,427 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:26,427 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-24 20:46:26,428 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:46:26,428 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:46:26,428 INFO ]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:46:26,428 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 25 states. [2018-06-24 20:46:26,794 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:26,794 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-24 20:46:26,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:46:26,795 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-24 20:46:26,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:26,795 INFO ]: With dead ends: 28 [2018-06-24 20:46:26,795 INFO ]: Without dead ends: 28 [2018-06-24 20:46:26,796 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:46:26,796 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:46:26,797 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-24 20:46:26,797 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:46:26,798 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-24 20:46:26,798 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-24 20:46:26,798 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:26,798 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-24 20:46:26,798 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:46:26,798 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-24 20:46:26,798 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:46:26,798 INFO ]: Found error trace [2018-06-24 20:46:26,798 INFO ]: trace histogram [22, 1, 1, 1, 1, 1] [2018-06-24 20:46:26,798 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:26,799 INFO ]: Analyzing trace with hash -1887834806, now seen corresponding path program 22 times [2018-06-24 20:46:26,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:26,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:26,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:26,800 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:26,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:26,910 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:27,555 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:27,556 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:27,556 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:46:27,564 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:46:27,687 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:46:27,687 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:27,701 INFO ]: Computing forward predicates... [2018-06-24 20:46:27,794 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:27,815 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:27,815 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-06-24 20:46:27,815 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:46:27,815 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:46:27,816 INFO ]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:46:27,816 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 26 states. [2018-06-24 20:46:28,427 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:28,427 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-24 20:46:28,428 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:46:28,428 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-24 20:46:28,428 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:28,428 INFO ]: With dead ends: 29 [2018-06-24 20:46:28,428 INFO ]: Without dead ends: 29 [2018-06-24 20:46:28,429 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:46:28,429 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:46:28,430 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:46:28,430 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:46:28,431 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-24 20:46:28,431 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-24 20:46:28,431 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:28,431 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-24 20:46:28,431 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:46:28,431 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-24 20:46:28,431 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:46:28,431 INFO ]: Found error trace [2018-06-24 20:46:28,431 INFO ]: trace histogram [23, 1, 1, 1, 1, 1] [2018-06-24 20:46:28,431 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:28,432 INFO ]: Analyzing trace with hash 1606464423, now seen corresponding path program 23 times [2018-06-24 20:46:28,432 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:28,432 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:28,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:28,432 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:28,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:28,608 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:29,202 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:29,202 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:29,202 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:46:29,208 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:46:29,422 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-24 20:46:29,422 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:29,451 INFO ]: Computing forward predicates... [2018-06-24 20:46:29,559 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:29,581 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:29,581 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-06-24 20:46:29,581 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:46:29,581 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:46:29,581 INFO ]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:46:29,581 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 27 states. [2018-06-24 20:46:29,941 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:29,941 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-24 20:46:29,941 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:46:29,941 INFO ]: Start accepts. Automaton has 27 states. Word has length 28 [2018-06-24 20:46:29,941 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:29,941 INFO ]: With dead ends: 30 [2018-06-24 20:46:29,941 INFO ]: Without dead ends: 30 [2018-06-24 20:46:29,941 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:46:29,942 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:46:29,943 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-24 20:46:29,943 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:46:29,944 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-24 20:46:29,944 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-24 20:46:29,944 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:29,944 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-24 20:46:29,944 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:46:29,944 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-24 20:46:29,944 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:46:29,944 INFO ]: Found error trace [2018-06-24 20:46:29,944 INFO ]: trace histogram [24, 1, 1, 1, 1, 1] [2018-06-24 20:46:29,944 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:29,945 INFO ]: Analyzing trace with hash -1739409174, now seen corresponding path program 24 times [2018-06-24 20:46:29,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:29,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:29,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:29,945 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:29,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:30,034 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:31,239 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:31,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:31,239 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:46:31,246 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:46:31,402 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-24 20:46:31,402 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:31,419 INFO ]: Computing forward predicates... [2018-06-24 20:46:31,510 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:31,530 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:31,530 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-06-24 20:46:31,531 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:46:31,531 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:46:31,531 INFO ]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:46:31,531 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 28 states. [2018-06-24 20:46:31,996 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:31,996 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-24 20:46:31,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:46:31,997 INFO ]: Start accepts. Automaton has 28 states. Word has length 29 [2018-06-24 20:46:31,997 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:31,997 INFO ]: With dead ends: 31 [2018-06-24 20:46:31,997 INFO ]: Without dead ends: 31 [2018-06-24 20:46:31,997 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:46:31,997 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:46:31,999 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 20:46:31,999 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:46:31,999 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-24 20:46:31,999 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-24 20:46:32,000 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:32,000 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-24 20:46:32,000 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:46:32,000 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-24 20:46:32,000 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:46:32,000 INFO ]: Found error trace [2018-06-24 20:46:32,000 INFO ]: trace histogram [25, 1, 1, 1, 1, 1] [2018-06-24 20:46:32,000 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:32,000 INFO ]: Analyzing trace with hash 1912691719, now seen corresponding path program 25 times [2018-06-24 20:46:32,000 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:32,000 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:32,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:32,001 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:32,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:32,257 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:32,958 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:32,958 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:32,958 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:46:32,965 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:33,090 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:33,105 INFO ]: Computing forward predicates... [2018-06-24 20:46:33,169 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:33,189 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:33,189 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-24 20:46:33,189 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:46:33,189 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:46:33,189 INFO ]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:46:33,189 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 29 states. [2018-06-24 20:46:33,585 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:33,585 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-24 20:46:33,587 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:46:33,588 INFO ]: Start accepts. Automaton has 29 states. Word has length 30 [2018-06-24 20:46:33,588 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:33,588 INFO ]: With dead ends: 32 [2018-06-24 20:46:33,588 INFO ]: Without dead ends: 32 [2018-06-24 20:46:33,588 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:46:33,588 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:46:33,702 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 20:46:33,702 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:46:33,703 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-24 20:46:33,703 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-24 20:46:33,703 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:33,703 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-24 20:46:33,703 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:46:33,703 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-24 20:46:33,703 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:46:33,703 INFO ]: Found error trace [2018-06-24 20:46:33,704 INFO ]: trace histogram [26, 1, 1, 1, 1, 1] [2018-06-24 20:46:33,704 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:33,704 INFO ]: Analyzing trace with hash -836297590, now seen corresponding path program 26 times [2018-06-24 20:46:33,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:33,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:33,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:33,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:33,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:33,978 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:34,660 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:34,660 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:34,660 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:46:34,672 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:46:34,787 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:46:34,787 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:34,809 INFO ]: Computing forward predicates... [2018-06-24 20:46:34,842 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:34,861 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:34,861 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-24 20:46:34,862 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:46:34,862 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:46:34,862 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:46:34,862 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-06-24 20:46:35,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:35,317 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-24 20:46:35,318 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:46:35,318 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-24 20:46:35,318 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:35,318 INFO ]: With dead ends: 33 [2018-06-24 20:46:35,318 INFO ]: Without dead ends: 33 [2018-06-24 20:46:35,318 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:46:35,318 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:46:35,320 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 20:46:35,320 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:46:35,320 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-24 20:46:35,320 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-24 20:46:35,320 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:35,320 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-24 20:46:35,320 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:46:35,321 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-24 20:46:35,321 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:46:35,321 INFO ]: Found error trace [2018-06-24 20:46:35,321 INFO ]: trace histogram [27, 1, 1, 1, 1, 1] [2018-06-24 20:46:35,321 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:35,321 INFO ]: Analyzing trace with hash -155620249, now seen corresponding path program 27 times [2018-06-24 20:46:35,321 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:35,321 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:35,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:35,322 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:35,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:35,645 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:36,431 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:36,431 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:36,431 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:46:36,437 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:46:36,608 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-24 20:46:36,608 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:36,623 INFO ]: Computing forward predicates... [2018-06-24 20:46:36,741 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:36,761 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:36,761 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-24 20:46:36,761 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:46:36,761 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:46:36,761 INFO ]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:46:36,761 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 31 states. [2018-06-24 20:46:37,219 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:37,219 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-24 20:46:37,219 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:46:37,219 INFO ]: Start accepts. Automaton has 31 states. Word has length 32 [2018-06-24 20:46:37,219 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:37,220 INFO ]: With dead ends: 34 [2018-06-24 20:46:37,220 INFO ]: Without dead ends: 34 [2018-06-24 20:46:37,220 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:46:37,220 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:46:37,221 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:46:37,221 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:46:37,221 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-24 20:46:37,221 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-24 20:46:37,221 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:37,221 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-24 20:46:37,221 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:46:37,221 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-24 20:46:37,222 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:46:37,222 INFO ]: Found error trace [2018-06-24 20:46:37,222 INFO ]: trace histogram [28, 1, 1, 1, 1, 1] [2018-06-24 20:46:37,222 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:37,222 INFO ]: Analyzing trace with hash -529459158, now seen corresponding path program 28 times [2018-06-24 20:46:37,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:37,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:37,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:37,222 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:37,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:37,364 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:38,440 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:38,440 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:38,440 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:46:38,447 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:46:38,610 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:46:38,610 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:38,628 INFO ]: Computing forward predicates... [2018-06-24 20:46:38,805 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:38,825 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:38,825 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-24 20:46:38,825 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:46:38,826 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:46:38,826 INFO ]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:46:38,826 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 32 states. [2018-06-24 20:46:39,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:39,403 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-24 20:46:39,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:46:39,403 INFO ]: Start accepts. Automaton has 32 states. Word has length 33 [2018-06-24 20:46:39,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:39,403 INFO ]: With dead ends: 35 [2018-06-24 20:46:39,403 INFO ]: Without dead ends: 35 [2018-06-24 20:46:39,403 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:46:39,404 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:46:39,405 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 20:46:39,405 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:46:39,406 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-24 20:46:39,406 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-24 20:46:39,406 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:39,406 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-24 20:46:39,406 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:46:39,406 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-24 20:46:39,406 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:46:39,406 INFO ]: Found error trace [2018-06-24 20:46:39,406 INFO ]: trace histogram [29, 1, 1, 1, 1, 1] [2018-06-24 20:46:39,406 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:39,406 INFO ]: Analyzing trace with hash 766436551, now seen corresponding path program 29 times [2018-06-24 20:46:39,406 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:39,406 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:39,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:39,407 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:39,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:39,736 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:40,554 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:40,554 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:40,554 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:46:40,559 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:46:40,833 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-24 20:46:40,833 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:40,861 INFO ]: Computing forward predicates... [2018-06-24 20:46:40,940 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:40,960 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:40,960 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-24 20:46:40,961 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:46:40,961 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:46:40,961 INFO ]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:46:40,961 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 33 states. [2018-06-24 20:46:41,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:41,497 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-24 20:46:41,498 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:46:41,498 INFO ]: Start accepts. Automaton has 33 states. Word has length 34 [2018-06-24 20:46:41,498 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:41,498 INFO ]: With dead ends: 36 [2018-06-24 20:46:41,498 INFO ]: Without dead ends: 36 [2018-06-24 20:46:41,498 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:46:41,498 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:46:41,500 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 20:46:41,500 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:46:41,500 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-24 20:46:41,500 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-24 20:46:41,500 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:41,500 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-24 20:46:41,500 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:46:41,500 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-24 20:46:41,500 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:46:41,500 INFO ]: Found error trace [2018-06-24 20:46:41,501 INFO ]: trace histogram [30, 1, 1, 1, 1, 1] [2018-06-24 20:46:41,501 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:41,501 INFO ]: Analyzing trace with hash -2010469430, now seen corresponding path program 30 times [2018-06-24 20:46:41,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:41,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:41,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:41,501 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:41,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:41,633 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:42,583 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:42,583 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:42,583 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:46:42,588 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:46:42,813 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-24 20:46:42,813 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:42,839 INFO ]: Computing forward predicates... [2018-06-24 20:46:42,913 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:42,934 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:42,934 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-24 20:46:42,934 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:46:42,935 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:46:42,935 INFO ]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:46:42,935 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 34 states. [2018-06-24 20:46:43,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:43,492 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-24 20:46:43,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:46:43,492 INFO ]: Start accepts. Automaton has 34 states. Word has length 35 [2018-06-24 20:46:43,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:43,492 INFO ]: With dead ends: 37 [2018-06-24 20:46:43,492 INFO ]: Without dead ends: 37 [2018-06-24 20:46:43,493 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:46:43,493 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:46:43,495 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-24 20:46:43,495 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:46:43,495 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-24 20:46:43,495 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-24 20:46:43,495 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:43,495 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-24 20:46:43,495 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:46:43,495 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-24 20:46:43,495 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:46:43,495 INFO ]: Found error trace [2018-06-24 20:46:43,495 INFO ]: trace histogram [31, 1, 1, 1, 1, 1] [2018-06-24 20:46:43,496 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:43,496 INFO ]: Analyzing trace with hash 2099758375, now seen corresponding path program 31 times [2018-06-24 20:46:43,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:43,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:43,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:43,496 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:43,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:43,818 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:45,871 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:45,871 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:45,871 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:46:45,877 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:46,036 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:46,060 INFO ]: Computing forward predicates... [2018-06-24 20:46:46,243 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:46,263 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:46,263 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-24 20:46:46,263 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:46:46,263 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:46:46,263 INFO ]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:46:46,263 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 35 states. [2018-06-24 20:46:46,872 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:46,872 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-24 20:46:46,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 20:46:46,873 INFO ]: Start accepts. Automaton has 35 states. Word has length 36 [2018-06-24 20:46:46,873 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:46,873 INFO ]: With dead ends: 38 [2018-06-24 20:46:46,873 INFO ]: Without dead ends: 38 [2018-06-24 20:46:46,874 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:46:46,874 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:46:46,875 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 20:46:46,875 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:46:46,875 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-24 20:46:46,875 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-24 20:46:46,875 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:46,875 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-24 20:46:46,875 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:46:46,875 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-24 20:46:46,876 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:46:46,876 INFO ]: Found error trace [2018-06-24 20:46:46,876 INFO ]: trace histogram [32, 1, 1, 1, 1, 1] [2018-06-24 20:46:46,876 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:46,876 INFO ]: Analyzing trace with hash 667801450, now seen corresponding path program 32 times [2018-06-24 20:46:46,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:46,876 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:46,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:46,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:46,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:47,091 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:48,481 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:48,481 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:48,481 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:46:48,486 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:46:48,635 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:46:48,635 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:48,667 INFO ]: Computing forward predicates... [2018-06-24 20:46:48,794 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:48,816 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:48,816 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-06-24 20:46:48,816 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:46:48,817 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:46:48,817 INFO ]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:46:48,817 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 36 states. [2018-06-24 20:46:49,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:49,454 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-24 20:46:49,454 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:46:49,454 INFO ]: Start accepts. Automaton has 36 states. Word has length 37 [2018-06-24 20:46:49,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:49,454 INFO ]: With dead ends: 39 [2018-06-24 20:46:49,454 INFO ]: Without dead ends: 39 [2018-06-24 20:46:49,455 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:46:49,455 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:46:49,455 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-24 20:46:49,455 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:46:49,456 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-24 20:46:49,456 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-24 20:46:49,456 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:49,456 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-24 20:46:49,456 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:46:49,456 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-24 20:46:49,456 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:46:49,456 INFO ]: Found error trace [2018-06-24 20:46:49,456 INFO ]: trace histogram [33, 1, 1, 1, 1, 1] [2018-06-24 20:46:49,456 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:49,457 INFO ]: Analyzing trace with hash -773190265, now seen corresponding path program 33 times [2018-06-24 20:46:49,457 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:49,457 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:49,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:49,457 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:49,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:49,797 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:51,266 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:51,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:51,267 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:46:51,278 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:46:51,514 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-24 20:46:51,514 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:51,535 INFO ]: Computing forward predicates... [2018-06-24 20:46:51,739 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:51,760 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:51,760 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-24 20:46:51,760 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:46:51,760 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:46:51,760 INFO ]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:46:51,760 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 37 states. [2018-06-24 20:46:52,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:52,521 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-24 20:46:52,521 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 20:46:52,521 INFO ]: Start accepts. Automaton has 37 states. Word has length 38 [2018-06-24 20:46:52,521 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:52,521 INFO ]: With dead ends: 40 [2018-06-24 20:46:52,521 INFO ]: Without dead ends: 40 [2018-06-24 20:46:52,522 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:46:52,522 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:46:52,523 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-24 20:46:52,523 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:46:52,523 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-24 20:46:52,523 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-24 20:46:52,523 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:52,523 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-24 20:46:52,523 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:46:52,523 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-24 20:46:52,523 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:46:52,523 INFO ]: Found error trace [2018-06-24 20:46:52,523 INFO ]: trace histogram [34, 1, 1, 1, 1, 1] [2018-06-24 20:46:52,524 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:52,524 INFO ]: Analyzing trace with hash 1800706826, now seen corresponding path program 34 times [2018-06-24 20:46:52,524 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:52,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:52,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:52,524 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:52,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:52,775 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:54,829 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:54,829 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:54,829 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:46:54,835 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:46:55,016 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:46:55,016 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:55,040 INFO ]: Computing forward predicates... [2018-06-24 20:46:55,252 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:55,272 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:55,272 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-06-24 20:46:55,272 INFO ]: Interpolant automaton has 38 states [2018-06-24 20:46:55,273 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 20:46:55,273 INFO ]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:46:55,273 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 38 states. Received shutdown request... [2018-06-24 20:46:55,957 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:46:55,958 WARN ]: Verification canceled [2018-06-24 20:46:55,960 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:46:55,961 WARN ]: Timeout [2018-06-24 20:46:55,961 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:46:55 BasicIcfg [2018-06-24 20:46:55,961 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:46:55,962 INFO ]: Toolchain (without parser) took 55061.22 ms. Allocated memory was 308.8 MB in the beginning and 1.0 GB in the end (delta: 740.8 MB). Free memory was 265.2 MB in the beginning and 585.5 MB in the end (delta: -320.3 MB). Peak memory consumption was 420.5 MB. Max. memory is 3.6 GB. [2018-06-24 20:46:55,963 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:46:55,964 INFO ]: ChcToBoogie took 56.18 ms. Allocated memory is still 308.8 MB. Free memory was 264.2 MB in the beginning and 262.2 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:46:55,964 INFO ]: Boogie Preprocessor took 35.74 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 261.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 20:46:55,964 INFO ]: RCFGBuilder took 323.08 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 252.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:46:55,965 INFO ]: BlockEncodingV2 took 201.33 ms. Allocated memory is still 308.8 MB. Free memory was 252.2 MB in the beginning and 245.2 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:46:55,965 INFO ]: TraceAbstraction took 54435.48 ms. Allocated memory was 308.8 MB in the beginning and 1.0 GB in the end (delta: 740.8 MB). Free memory was 245.2 MB in the beginning and 585.5 MB in the end (delta: -340.3 MB). Peak memory consumption was 400.5 MB. Max. memory is 3.6 GB. [2018-06-24 20:46:55,971 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 13 edges - StatisticsResult: Encoded RCFG 6 locations, 7 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.18 ms. Allocated memory is still 308.8 MB. Free memory was 264.2 MB in the beginning and 262.2 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.74 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 261.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 323.08 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 252.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 201.33 ms. Allocated memory is still 308.8 MB. Free memory was 252.2 MB in the beginning and 245.2 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54435.48 ms. Allocated memory was 308.8 MB in the beginning and 1.0 GB in the end (delta: 740.8 MB). Free memory was 245.2 MB in the beginning and 585.5 MB in the end (delta: -340.3 MB). Peak memory consumption was 400.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (40states) and interpolant automaton (currently 37 states, 38 states before enhancement), while ReachableStatesComputation was computing reachable states (37 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 54.3s OverallTime, 36 OverallIterations, 34 TraceHistogramMax, 11.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 178 SDtfs, 0 SDslu, 1862 SDs, 0 SdLazy, 16367 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1434 GetRequests, 740 SyntacticMatches, 33 SemanticMatches, 661 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 7.8s SatisfiabilityAnalysisTime, 32.4s InterpolantComputationTime, 1540 NumberOfCodeBlocks, 1540 NumberOfCodeBlocksAsserted, 223 NumberOfCheckSat, 1470 ConstructedInterpolants, 0 QuantifiedInterpolants, 996222 SizeOfPredicates, 4012 NumberOfNonLiveVariables, 25925 ConjunctsInSsa, 20026 ConjunctsInUnsatCore, 70 InterpolantComputations, 2 PerfectInterpolantSequences, 0/14280 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/barthe_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-46-55-985.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-46-55-985.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-46-55-985.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-46-55-985.csv Completed graceful shutdown