java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:39:06,684 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:39:06,687 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:39:06,700 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:39:06,700 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:39:06,702 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:39:06,703 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:39:06,707 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:39:06,708 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:39:06,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:39:06,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:39:06,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:39:06,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:39:06,712 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:39:06,713 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:39:06,714 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:39:06,716 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:39:06,717 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:39:06,719 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:39:06,720 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:39:06,721 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:39:06,723 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:39:06,723 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:39:06,723 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:39:06,724 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:39:06,725 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:39:06,726 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:39:06,727 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:39:06,728 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:39:06,728 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:39:06,728 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:39:06,729 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:39:06,729 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:39:06,730 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:39:06,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:39:06,731 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:39:06,744 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:39:06,744 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:39:06,745 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:39:06,745 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:39:06,746 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:39:06,746 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:39:06,746 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:39:06,746 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:39:06,747 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:39:06,747 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:39:06,747 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:39:06,747 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:39:06,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:39:06,748 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:39:06,748 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:39:06,748 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:39:06,748 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:39:06,748 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:39:06,748 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:39:06,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:39:06,749 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:39:06,750 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:39:06,750 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:39:06,791 INFO ]: Repository-Root is: /tmp [2018-06-24 21:39:06,806 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:39:06,810 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:39:06,811 INFO ]: Initializing SmtParser... [2018-06-24 21:39:06,812 INFO ]: SmtParser initialized [2018-06-24 21:39:06,812 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 [2018-06-24 21:39:06,814 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:39:06,899 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@3e5a9e9d [2018-06-24 21:39:07,167 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 [2018-06-24 21:39:07,171 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:39:07,177 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:39:07,178 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:39:07,178 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:39:07,178 INFO ]: ChcToBoogie initialized [2018-06-24 21:39:07,181 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:39:07" (1/1) ... [2018-06-24 21:39:07,237 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:07 Unit [2018-06-24 21:39:07,237 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:39:07,238 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:39:07,238 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:39:07,238 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:39:07,257 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:07" (1/1) ... [2018-06-24 21:39:07,260 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:07" (1/1) ... [2018-06-24 21:39:07,267 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:07" (1/1) ... [2018-06-24 21:39:07,267 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:07" (1/1) ... [2018-06-24 21:39:07,278 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:07" (1/1) ... [2018-06-24 21:39:07,280 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:07" (1/1) ... [2018-06-24 21:39:07,281 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:07" (1/1) ... [2018-06-24 21:39:07,288 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:39:07,289 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:39:07,289 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:39:07,289 INFO ]: RCFGBuilder initialized [2018-06-24 21:39:07,290 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:07" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:39:07,304 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:39:07,304 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:39:07,304 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:39:07,304 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:39:07,304 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:39:07,304 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:39:07,625 INFO ]: Using library mode [2018-06-24 21:39:07,626 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:39:07 BoogieIcfgContainer [2018-06-24 21:39:07,626 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:39:07,627 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:39:07,627 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:39:07,627 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:39:07,628 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:39:07" (1/1) ... [2018-06-24 21:39:07,644 INFO ]: Initial Icfg 12 locations, 20 edges [2018-06-24 21:39:07,645 INFO ]: Using Remove infeasible edges [2018-06-24 21:39:07,645 INFO ]: Using Maximize final states [2018-06-24 21:39:07,646 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:39:07,646 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:39:07,649 INFO ]: Using Remove sink states [2018-06-24 21:39:07,650 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:39:07,650 INFO ]: Using Use SBE [2018-06-24 21:39:07,656 INFO ]: SBE split 0 edges [2018-06-24 21:39:07,661 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:39:07,663 INFO ]: 0 new accepting states [2018-06-24 21:39:07,685 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 21:39:07,686 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:39:07,690 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:39:07,690 INFO ]: 0 new accepting states [2018-06-24 21:39:07,690 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:39:07,690 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:39:07,690 INFO ]: Encoded RCFG 8 locations, 16 edges [2018-06-24 21:39:07,693 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:39:07 BasicIcfg [2018-06-24 21:39:07,693 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:39:07,695 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:39:07,695 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:39:07,698 INFO ]: TraceAbstraction initialized [2018-06-24 21:39:07,698 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:39:07" (1/4) ... [2018-06-24 21:39:07,699 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9fb9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:39:07, skipping insertion in model container [2018-06-24 21:39:07,699 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:39:07" (2/4) ... [2018-06-24 21:39:07,699 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9fb9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:39:07, skipping insertion in model container [2018-06-24 21:39:07,699 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:39:07" (3/4) ... [2018-06-24 21:39:07,700 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9fb9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:39:07, skipping insertion in model container [2018-06-24 21:39:07,700 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:39:07" (4/4) ... [2018-06-24 21:39:07,701 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:39:07,711 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:39:07,718 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:39:07,761 INFO ]: Using default assertion order modulation [2018-06-24 21:39:07,763 INFO ]: Interprodecural is true [2018-06-24 21:39:07,763 INFO ]: Hoare is false [2018-06-24 21:39:07,763 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:39:07,763 INFO ]: Backedges is TWOTRACK [2018-06-24 21:39:07,763 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:39:07,763 INFO ]: Difference is false [2018-06-24 21:39:07,763 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:39:07,763 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:39:07,774 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 21:39:07,786 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:39:07,786 INFO ]: Found error trace [2018-06-24 21:39:07,787 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:07,787 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:07,792 INFO ]: Analyzing trace with hash 226146214, now seen corresponding path program 1 times [2018-06-24 21:39:07,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:07,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:07,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:07,833 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:07,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:07,881 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:07,991 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:07,993 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:07,993 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:39:07,994 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:39:08,006 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:39:08,006 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:39:08,008 INFO ]: Start difference. First operand 8 states. Second operand 5 states. [2018-06-24 21:39:08,340 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:08,340 INFO ]: Finished difference Result 14 states and 36 transitions. [2018-06-24 21:39:08,341 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:39:08,342 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 21:39:08,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:08,351 INFO ]: With dead ends: 14 [2018-06-24 21:39:08,352 INFO ]: Without dead ends: 13 [2018-06-24 21:39:08,353 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:39:08,366 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:39:08,383 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-24 21:39:08,384 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:39:08,385 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2018-06-24 21:39:08,386 INFO ]: Start accepts. Automaton has 10 states and 23 transitions. Word has length 7 [2018-06-24 21:39:08,387 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:08,387 INFO ]: Abstraction has 10 states and 23 transitions. [2018-06-24 21:39:08,387 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:39:08,387 INFO ]: Start isEmpty. Operand 10 states and 23 transitions. [2018-06-24 21:39:08,387 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:39:08,387 INFO ]: Found error trace [2018-06-24 21:39:08,387 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:08,387 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:08,388 INFO ]: Analyzing trace with hash -1642556787, now seen corresponding path program 1 times [2018-06-24 21:39:08,388 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:08,388 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:08,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:08,388 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:08,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:08,407 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:08,524 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:08,524 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:08,524 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:39:08,525 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:39:08,525 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:39:08,525 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:39:08,525 INFO ]: Start difference. First operand 10 states and 23 transitions. Second operand 5 states. [2018-06-24 21:39:08,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:08,772 INFO ]: Finished difference Result 17 states and 46 transitions. [2018-06-24 21:39:08,773 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:39:08,773 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 21:39:08,773 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:08,773 INFO ]: With dead ends: 17 [2018-06-24 21:39:08,774 INFO ]: Without dead ends: 17 [2018-06-24 21:39:08,774 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:39:08,774 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:39:08,777 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-24 21:39:08,777 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:39:08,778 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 41 transitions. [2018-06-24 21:39:08,778 INFO ]: Start accepts. Automaton has 15 states and 41 transitions. Word has length 8 [2018-06-24 21:39:08,778 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:08,778 INFO ]: Abstraction has 15 states and 41 transitions. [2018-06-24 21:39:08,778 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:39:08,778 INFO ]: Start isEmpty. Operand 15 states and 41 transitions. [2018-06-24 21:39:08,779 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:39:08,779 INFO ]: Found error trace [2018-06-24 21:39:08,779 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:08,779 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:08,779 INFO ]: Analyzing trace with hash -1613927636, now seen corresponding path program 1 times [2018-06-24 21:39:08,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:08,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:08,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:08,780 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:08,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:08,795 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:08,874 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:08,874 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:08,874 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:39:08,874 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:39:08,874 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:39:08,875 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:39:08,875 INFO ]: Start difference. First operand 15 states and 41 transitions. Second operand 5 states. [2018-06-24 21:39:09,132 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:09,132 INFO ]: Finished difference Result 23 states and 64 transitions. [2018-06-24 21:39:09,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:39:09,132 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 21:39:09,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:09,133 INFO ]: With dead ends: 23 [2018-06-24 21:39:09,133 INFO ]: Without dead ends: 23 [2018-06-24 21:39:09,133 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:39:09,133 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 21:39:09,136 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-06-24 21:39:09,136 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:39:09,137 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2018-06-24 21:39:09,137 INFO ]: Start accepts. Automaton has 20 states and 56 transitions. Word has length 8 [2018-06-24 21:39:09,137 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:09,137 INFO ]: Abstraction has 20 states and 56 transitions. [2018-06-24 21:39:09,137 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:39:09,137 INFO ]: Start isEmpty. Operand 20 states and 56 transitions. [2018-06-24 21:39:09,138 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:39:09,138 INFO ]: Found error trace [2018-06-24 21:39:09,138 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:09,138 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:09,138 INFO ]: Analyzing trace with hash -1578833838, now seen corresponding path program 1 times [2018-06-24 21:39:09,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:09,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:09,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:09,140 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:09,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:09,161 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:09,261 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:09,261 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:09,261 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:09,267 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:09,307 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:09,316 INFO ]: Computing forward predicates... [2018-06-24 21:39:09,622 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:09,648 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:09,648 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-24 21:39:09,648 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:39:09,648 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:39:09,648 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:39:09,648 INFO ]: Start difference. First operand 20 states and 56 transitions. Second operand 8 states. [2018-06-24 21:39:10,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:10,053 INFO ]: Finished difference Result 32 states and 94 transitions. [2018-06-24 21:39:10,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:39:10,054 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-24 21:39:10,054 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:10,055 INFO ]: With dead ends: 32 [2018-06-24 21:39:10,055 INFO ]: Without dead ends: 28 [2018-06-24 21:39:10,055 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:39:10,055 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 21:39:10,058 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 22. [2018-06-24 21:39:10,058 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 21:39:10,059 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 62 transitions. [2018-06-24 21:39:10,059 INFO ]: Start accepts. Automaton has 22 states and 62 transitions. Word has length 8 [2018-06-24 21:39:10,059 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:10,059 INFO ]: Abstraction has 22 states and 62 transitions. [2018-06-24 21:39:10,060 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:39:10,060 INFO ]: Start isEmpty. Operand 22 states and 62 transitions. [2018-06-24 21:39:10,060 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:39:10,060 INFO ]: Found error trace [2018-06-24 21:39:10,060 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:10,060 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:10,060 INFO ]: Analyzing trace with hash -1577910317, now seen corresponding path program 1 times [2018-06-24 21:39:10,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:10,060 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:10,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:10,061 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:10,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:10,073 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:10,124 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:10,124 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:10,124 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:39:10,124 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:39:10,124 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:39:10,124 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:39:10,124 INFO ]: Start difference. First operand 22 states and 62 transitions. Second operand 4 states. [2018-06-24 21:39:10,200 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:10,200 INFO ]: Finished difference Result 33 states and 94 transitions. [2018-06-24 21:39:10,201 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:39:10,201 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-24 21:39:10,201 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:10,202 INFO ]: With dead ends: 33 [2018-06-24 21:39:10,202 INFO ]: Without dead ends: 33 [2018-06-24 21:39:10,202 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:39:10,202 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 21:39:10,206 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-06-24 21:39:10,206 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 21:39:10,207 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 68 transitions. [2018-06-24 21:39:10,207 INFO ]: Start accepts. Automaton has 24 states and 68 transitions. Word has length 8 [2018-06-24 21:39:10,207 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:10,207 INFO ]: Abstraction has 24 states and 68 transitions. [2018-06-24 21:39:10,207 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:39:10,207 INFO ]: Start isEmpty. Operand 24 states and 68 transitions. [2018-06-24 21:39:10,207 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:39:10,207 INFO ]: Found error trace [2018-06-24 21:39:10,207 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:10,208 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:10,208 INFO ]: Analyzing trace with hash 619872590, now seen corresponding path program 1 times [2018-06-24 21:39:10,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:10,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:10,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:10,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:10,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:10,223 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:10,279 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:10,279 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:10,279 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:10,287 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:10,319 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:10,320 INFO ]: Computing forward predicates... [2018-06-24 21:39:10,359 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:10,380 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:39:10,380 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-24 21:39:10,380 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:39:10,380 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:39:10,381 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:39:10,381 INFO ]: Start difference. First operand 24 states and 68 transitions. Second operand 8 states. [2018-06-24 21:39:10,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:10,716 INFO ]: Finished difference Result 44 states and 120 transitions. [2018-06-24 21:39:10,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:39:10,720 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 21:39:10,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:10,721 INFO ]: With dead ends: 44 [2018-06-24 21:39:10,721 INFO ]: Without dead ends: 35 [2018-06-24 21:39:10,721 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:39:10,721 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:39:10,725 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-24 21:39:10,725 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 21:39:10,726 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 66 transitions. [2018-06-24 21:39:10,726 INFO ]: Start accepts. Automaton has 29 states and 66 transitions. Word has length 9 [2018-06-24 21:39:10,726 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:10,726 INFO ]: Abstraction has 29 states and 66 transitions. [2018-06-24 21:39:10,726 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:39:10,726 INFO ]: Start isEmpty. Operand 29 states and 66 transitions. [2018-06-24 21:39:10,727 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:39:10,727 INFO ]: Found error trace [2018-06-24 21:39:10,727 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:10,727 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:10,727 INFO ]: Analyzing trace with hash 1507376271, now seen corresponding path program 1 times [2018-06-24 21:39:10,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:10,727 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:10,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:10,728 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:10,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:10,739 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:10,934 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:10,934 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:10,934 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:10,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:10,968 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:10,970 INFO ]: Computing forward predicates... [2018-06-24 21:39:10,999 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:11,020 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:39:11,020 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-24 21:39:11,020 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:39:11,020 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:39:11,020 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:39:11,020 INFO ]: Start difference. First operand 29 states and 66 transitions. Second operand 8 states. [2018-06-24 21:39:11,408 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:11,409 INFO ]: Finished difference Result 38 states and 83 transitions. [2018-06-24 21:39:11,409 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:39:11,409 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 21:39:11,409 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:11,410 INFO ]: With dead ends: 38 [2018-06-24 21:39:11,410 INFO ]: Without dead ends: 35 [2018-06-24 21:39:11,410 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:39:11,410 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:39:11,413 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-24 21:39:11,413 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 21:39:11,414 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 60 transitions. [2018-06-24 21:39:11,414 INFO ]: Start accepts. Automaton has 29 states and 60 transitions. Word has length 9 [2018-06-24 21:39:11,414 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:11,414 INFO ]: Abstraction has 29 states and 60 transitions. [2018-06-24 21:39:11,414 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:39:11,414 INFO ]: Start isEmpty. Operand 29 states and 60 transitions. [2018-06-24 21:39:11,415 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:39:11,415 INFO ]: Found error trace [2018-06-24 21:39:11,415 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:11,415 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:11,415 INFO ]: Analyzing trace with hash -1698640602, now seen corresponding path program 2 times [2018-06-24 21:39:11,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:11,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:11,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:11,416 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:11,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:11,435 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:11,492 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:39:11,492 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:11,492 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:39:11,492 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:39:11,492 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:39:11,492 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:39:11,492 INFO ]: Start difference. First operand 29 states and 60 transitions. Second operand 5 states. [2018-06-24 21:39:11,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:11,528 INFO ]: Finished difference Result 48 states and 94 transitions. [2018-06-24 21:39:11,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:39:11,529 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 21:39:11,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:11,529 INFO ]: With dead ends: 48 [2018-06-24 21:39:11,529 INFO ]: Without dead ends: 39 [2018-06-24 21:39:11,530 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:39:11,530 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 21:39:11,535 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-06-24 21:39:11,535 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 21:39:11,536 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 52 transitions. [2018-06-24 21:39:11,536 INFO ]: Start accepts. Automaton has 26 states and 52 transitions. Word has length 9 [2018-06-24 21:39:11,536 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:11,536 INFO ]: Abstraction has 26 states and 52 transitions. [2018-06-24 21:39:11,536 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:39:11,536 INFO ]: Start isEmpty. Operand 26 states and 52 transitions. [2018-06-24 21:39:11,537 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:39:11,537 INFO ]: Found error trace [2018-06-24 21:39:11,537 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:11,537 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:11,537 INFO ]: Analyzing trace with hash 382477743, now seen corresponding path program 1 times [2018-06-24 21:39:11,537 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:11,537 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:11,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:11,538 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:11,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:11,564 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:11,600 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:11,600 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:11,600 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 21:39:11,606 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:11,637 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:11,639 INFO ]: Computing forward predicates... [2018-06-24 21:39:11,749 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:11,781 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:11,781 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 21:39:11,781 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:39:11,782 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:39:11,782 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:39:11,782 INFO ]: Start difference. First operand 26 states and 52 transitions. Second operand 6 states. [2018-06-24 21:39:11,831 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:11,831 INFO ]: Finished difference Result 30 states and 57 transitions. [2018-06-24 21:39:11,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:39:11,831 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 21:39:11,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:11,831 INFO ]: With dead ends: 30 [2018-06-24 21:39:11,831 INFO ]: Without dead ends: 30 [2018-06-24 21:39:11,831 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:39:11,832 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 21:39:11,834 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-24 21:39:11,834 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 21:39:11,839 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2018-06-24 21:39:11,839 INFO ]: Start accepts. Automaton has 28 states and 54 transitions. Word has length 10 [2018-06-24 21:39:11,839 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:11,839 INFO ]: Abstraction has 28 states and 54 transitions. [2018-06-24 21:39:11,839 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:39:11,839 INFO ]: Start isEmpty. Operand 28 states and 54 transitions. [2018-06-24 21:39:11,839 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:39:11,839 INFO ]: Found error trace [2018-06-24 21:39:11,840 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:11,840 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:11,840 INFO ]: Analyzing trace with hash -455438452, now seen corresponding path program 1 times [2018-06-24 21:39:11,840 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:11,840 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:11,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:11,841 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:11,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:11,856 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:11,950 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:11,950 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:11,950 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 21:39:11,950 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:39:11,950 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:39:11,950 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:39:11,950 INFO ]: Start difference. First operand 28 states and 54 transitions. Second operand 6 states. [2018-06-24 21:39:12,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:12,009 INFO ]: Finished difference Result 31 states and 57 transitions. [2018-06-24 21:39:12,009 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:39:12,009 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 21:39:12,009 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:12,009 INFO ]: With dead ends: 31 [2018-06-24 21:39:12,009 INFO ]: Without dead ends: 29 [2018-06-24 21:39:12,009 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:39:12,009 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 21:39:12,012 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-24 21:39:12,012 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 21:39:12,012 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 51 transitions. [2018-06-24 21:39:12,012 INFO ]: Start accepts. Automaton has 27 states and 51 transitions. Word has length 10 [2018-06-24 21:39:12,013 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:12,013 INFO ]: Abstraction has 27 states and 51 transitions. [2018-06-24 21:39:12,013 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:39:12,013 INFO ]: Start isEmpty. Operand 27 states and 51 transitions. [2018-06-24 21:39:12,013 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:39:12,013 INFO ]: Found error trace [2018-06-24 21:39:12,013 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:12,013 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:12,013 INFO ]: Analyzing trace with hash -426809301, now seen corresponding path program 1 times [2018-06-24 21:39:12,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:12,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:12,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:12,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:12,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:12,023 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:12,056 INFO ]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:39:12,056 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:12,056 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:39:12,057 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:39:12,057 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:39:12,057 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:39:12,057 INFO ]: Start difference. First operand 27 states and 51 transitions. Second operand 5 states. [2018-06-24 21:39:12,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:12,153 INFO ]: Finished difference Result 37 states and 74 transitions. [2018-06-24 21:39:12,153 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:39:12,153 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-24 21:39:12,153 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:12,154 INFO ]: With dead ends: 37 [2018-06-24 21:39:12,154 INFO ]: Without dead ends: 22 [2018-06-24 21:39:12,154 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:39:12,154 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:39:12,156 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-24 21:39:12,156 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 21:39:12,156 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2018-06-24 21:39:12,158 INFO ]: Start accepts. Automaton has 22 states and 41 transitions. Word has length 10 [2018-06-24 21:39:12,158 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:12,158 INFO ]: Abstraction has 22 states and 41 transitions. [2018-06-24 21:39:12,158 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:39:12,158 INFO ]: Start isEmpty. Operand 22 states and 41 transitions. [2018-06-24 21:39:12,158 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:39:12,158 INFO ]: Found error trace [2018-06-24 21:39:12,159 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:12,159 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:12,159 INFO ]: Analyzing trace with hash 1580975051, now seen corresponding path program 1 times [2018-06-24 21:39:12,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:12,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:12,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:12,159 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:12,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:12,187 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:12,319 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:12,319 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:12,319 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:12,330 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:12,353 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:12,356 INFO ]: Computing forward predicates... [2018-06-24 21:39:12,522 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:12,544 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:12,544 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-24 21:39:12,545 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:39:12,545 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:39:12,545 INFO ]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:39:12,545 INFO ]: Start difference. First operand 22 states and 41 transitions. Second operand 13 states. [2018-06-24 21:39:13,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:13,150 INFO ]: Finished difference Result 63 states and 142 transitions. [2018-06-24 21:39:13,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:39:13,150 INFO ]: Start accepts. Automaton has 13 states. Word has length 11 [2018-06-24 21:39:13,150 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:13,151 INFO ]: With dead ends: 63 [2018-06-24 21:39:13,151 INFO ]: Without dead ends: 51 [2018-06-24 21:39:13,151 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:39:13,151 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 21:39:13,154 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 29. [2018-06-24 21:39:13,154 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 21:39:13,155 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 56 transitions. [2018-06-24 21:39:13,155 INFO ]: Start accepts. Automaton has 29 states and 56 transitions. Word has length 11 [2018-06-24 21:39:13,155 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:13,155 INFO ]: Abstraction has 29 states and 56 transitions. [2018-06-24 21:39:13,155 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:39:13,155 INFO ]: Start isEmpty. Operand 29 states and 56 transitions. [2018-06-24 21:39:13,155 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:39:13,155 INFO ]: Found error trace [2018-06-24 21:39:13,155 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:13,156 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:13,156 INFO ]: Analyzing trace with hash -938984883, now seen corresponding path program 2 times [2018-06-24 21:39:13,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:13,156 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:13,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:13,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:13,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:13,174 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:13,519 INFO ]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:13,519 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:13,519 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:13,527 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:39:13,547 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:39:13,547 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:13,548 INFO ]: Computing forward predicates... [2018-06-24 21:39:13,592 INFO ]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:13,612 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:13,612 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-06-24 21:39:13,613 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:39:13,613 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:39:13,613 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:39:13,613 INFO ]: Start difference. First operand 29 states and 56 transitions. Second operand 11 states. [2018-06-24 21:39:14,002 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:14,002 INFO ]: Finished difference Result 54 states and 112 transitions. [2018-06-24 21:39:14,002 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:39:14,002 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-24 21:39:14,003 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:14,003 INFO ]: With dead ends: 54 [2018-06-24 21:39:14,003 INFO ]: Without dead ends: 48 [2018-06-24 21:39:14,004 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:39:14,004 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-24 21:39:14,006 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-06-24 21:39:14,006 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:39:14,007 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 65 transitions. [2018-06-24 21:39:14,007 INFO ]: Start accepts. Automaton has 34 states and 65 transitions. Word has length 11 [2018-06-24 21:39:14,007 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:14,007 INFO ]: Abstraction has 34 states and 65 transitions. [2018-06-24 21:39:14,007 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:39:14,007 INFO ]: Start isEmpty. Operand 34 states and 65 transitions. [2018-06-24 21:39:14,008 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:39:14,008 INFO ]: Found error trace [2018-06-24 21:39:14,008 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:14,008 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:14,008 INFO ]: Analyzing trace with hash -283707923, now seen corresponding path program 1 times [2018-06-24 21:39:14,008 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:14,008 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:14,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:14,008 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:14,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:14,016 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:14,232 INFO ]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:39:14,232 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:39:14,232 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:39:14,232 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:39:14,232 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:39:14,232 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:39:14,232 INFO ]: Start difference. First operand 34 states and 65 transitions. Second operand 5 states. [2018-06-24 21:39:14,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:14,306 INFO ]: Finished difference Result 34 states and 64 transitions. [2018-06-24 21:39:14,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:39:14,306 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-24 21:39:14,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:14,307 INFO ]: With dead ends: 34 [2018-06-24 21:39:14,307 INFO ]: Without dead ends: 29 [2018-06-24 21:39:14,307 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:39:14,307 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 21:39:14,309 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 21:39:14,309 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 21:39:14,309 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 57 transitions. [2018-06-24 21:39:14,309 INFO ]: Start accepts. Automaton has 29 states and 57 transitions. Word has length 11 [2018-06-24 21:39:14,309 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:14,309 INFO ]: Abstraction has 29 states and 57 transitions. [2018-06-24 21:39:14,309 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:39:14,309 INFO ]: Start isEmpty. Operand 29 states and 57 transitions. [2018-06-24 21:39:14,310 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:39:14,310 INFO ]: Found error trace [2018-06-24 21:39:14,310 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:14,310 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:14,310 INFO ]: Analyzing trace with hash 79685935, now seen corresponding path program 2 times [2018-06-24 21:39:14,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:14,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:14,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:14,310 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:14,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:14,320 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:14,386 INFO ]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:14,386 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:14,386 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:39:14,400 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:14,440 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:39:14,440 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:14,442 INFO ]: Computing forward predicates... [2018-06-24 21:39:14,656 INFO ]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:14,677 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:14,677 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-24 21:39:14,677 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:39:14,677 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:39:14,678 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:39:14,678 INFO ]: Start difference. First operand 29 states and 57 transitions. Second operand 13 states. [2018-06-24 21:39:14,906 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:14,906 INFO ]: Finished difference Result 52 states and 107 transitions. [2018-06-24 21:39:14,906 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:39:14,906 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-24 21:39:14,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:14,906 INFO ]: With dead ends: 52 [2018-06-24 21:39:14,906 INFO ]: Without dead ends: 47 [2018-06-24 21:39:14,907 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:39:14,907 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-24 21:39:14,909 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-06-24 21:39:14,909 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 21:39:14,910 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 74 transitions. [2018-06-24 21:39:14,910 INFO ]: Start accepts. Automaton has 37 states and 74 transitions. Word has length 12 [2018-06-24 21:39:14,910 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:14,910 INFO ]: Abstraction has 37 states and 74 transitions. [2018-06-24 21:39:14,910 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:39:14,910 INFO ]: Start isEmpty. Operand 37 states and 74 transitions. [2018-06-24 21:39:14,910 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:39:14,910 INFO ]: Found error trace [2018-06-24 21:39:14,910 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:14,910 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:14,910 INFO ]: Analyzing trace with hash 1695798066, now seen corresponding path program 1 times [2018-06-24 21:39:14,911 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:14,911 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:14,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:14,911 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:14,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:14,928 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:14,986 INFO ]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:39:14,986 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:14,986 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:14,999 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:15,018 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:15,019 INFO ]: Computing forward predicates... [2018-06-24 21:39:15,060 INFO ]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:39:15,079 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:15,080 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-06-24 21:39:15,080 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:39:15,080 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:39:15,080 INFO ]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:39:15,080 INFO ]: Start difference. First operand 37 states and 74 transitions. Second operand 11 states. [2018-06-24 21:39:15,350 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:15,350 INFO ]: Finished difference Result 56 states and 116 transitions. [2018-06-24 21:39:15,350 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:39:15,350 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 21:39:15,350 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:15,351 INFO ]: With dead ends: 56 [2018-06-24 21:39:15,351 INFO ]: Without dead ends: 27 [2018-06-24 21:39:15,351 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:39:15,351 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 21:39:15,353 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-24 21:39:15,353 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 21:39:15,353 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 51 transitions. [2018-06-24 21:39:15,353 INFO ]: Start accepts. Automaton has 25 states and 51 transitions. Word has length 12 [2018-06-24 21:39:15,353 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:15,353 INFO ]: Abstraction has 25 states and 51 transitions. [2018-06-24 21:39:15,354 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:39:15,354 INFO ]: Start isEmpty. Operand 25 states and 51 transitions. [2018-06-24 21:39:15,354 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:39:15,354 INFO ]: Found error trace [2018-06-24 21:39:15,354 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:15,354 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:15,354 INFO ]: Analyzing trace with hash 1016474420, now seen corresponding path program 3 times [2018-06-24 21:39:15,354 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:15,354 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:15,355 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:15,355 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:15,355 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:15,365 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:15,481 INFO ]: Checked inductivity of 12 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:39:15,481 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:15,481 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:15,489 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:39:15,513 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:39:15,513 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:15,515 INFO ]: Computing forward predicates... [2018-06-24 21:39:15,553 INFO ]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:15,572 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:15,572 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-24 21:39:15,572 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:39:15,572 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:39:15,572 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:39:15,572 INFO ]: Start difference. First operand 25 states and 51 transitions. Second operand 12 states. [2018-06-24 21:39:15,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:15,718 INFO ]: Finished difference Result 28 states and 54 transitions. [2018-06-24 21:39:15,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:39:15,720 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-24 21:39:15,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:15,720 INFO ]: With dead ends: 28 [2018-06-24 21:39:15,720 INFO ]: Without dead ends: 28 [2018-06-24 21:39:15,721 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:39:15,721 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 21:39:15,722 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 23. [2018-06-24 21:39:15,722 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 21:39:15,723 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 47 transitions. [2018-06-24 21:39:15,723 INFO ]: Start accepts. Automaton has 23 states and 47 transitions. Word has length 14 [2018-06-24 21:39:15,723 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:15,723 INFO ]: Abstraction has 23 states and 47 transitions. [2018-06-24 21:39:15,723 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:39:15,723 INFO ]: Start isEmpty. Operand 23 states and 47 transitions. [2018-06-24 21:39:15,723 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:39:15,723 INFO ]: Found error trace [2018-06-24 21:39:15,723 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:15,723 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:15,723 INFO ]: Analyzing trace with hash 207127794, now seen corresponding path program 4 times [2018-06-24 21:39:15,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:15,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:15,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:15,724 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:15,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:15,740 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:15,936 INFO ]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:39:15,936 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:15,936 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:15,941 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:39:15,978 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:39:15,978 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:15,981 INFO ]: Computing forward predicates... [2018-06-24 21:39:16,392 INFO ]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:39:16,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:16,423 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-06-24 21:39:16,424 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:39:16,424 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:39:16,424 INFO ]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:39:16,424 INFO ]: Start difference. First operand 23 states and 47 transitions. Second operand 16 states. [2018-06-24 21:39:17,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:17,276 INFO ]: Finished difference Result 78 states and 189 transitions. [2018-06-24 21:39:17,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 21:39:17,325 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-24 21:39:17,325 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:17,326 INFO ]: With dead ends: 78 [2018-06-24 21:39:17,326 INFO ]: Without dead ends: 51 [2018-06-24 21:39:17,326 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:39:17,326 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 21:39:17,332 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 29. [2018-06-24 21:39:17,332 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 21:39:17,332 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 58 transitions. [2018-06-24 21:39:17,332 INFO ]: Start accepts. Automaton has 29 states and 58 transitions. Word has length 14 [2018-06-24 21:39:17,332 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:17,332 INFO ]: Abstraction has 29 states and 58 transitions. [2018-06-24 21:39:17,332 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:39:17,332 INFO ]: Start isEmpty. Operand 29 states and 58 transitions. [2018-06-24 21:39:17,333 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:39:17,333 INFO ]: Found error trace [2018-06-24 21:39:17,333 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:17,333 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:17,333 INFO ]: Analyzing trace with hash 887186164, now seen corresponding path program 3 times [2018-06-24 21:39:17,333 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:17,333 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:17,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:17,334 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:17,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:17,347 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:17,862 INFO ]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:39:17,863 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:17,863 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:17,870 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:39:17,896 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:39:17,896 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:17,897 INFO ]: Computing forward predicates... [2018-06-24 21:39:17,985 INFO ]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:39:18,003 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:18,003 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-24 21:39:18,003 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:39:18,004 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:39:18,004 INFO ]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:39:18,004 INFO ]: Start difference. First operand 29 states and 58 transitions. Second operand 15 states. [2018-06-24 21:39:19,309 WARN ]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-24 21:39:19,372 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:19,372 INFO ]: Finished difference Result 71 states and 152 transitions. [2018-06-24 21:39:19,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 21:39:19,372 INFO ]: Start accepts. Automaton has 15 states. Word has length 14 [2018-06-24 21:39:19,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:19,373 INFO ]: With dead ends: 71 [2018-06-24 21:39:19,373 INFO ]: Without dead ends: 60 [2018-06-24 21:39:19,373 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:39:19,373 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-24 21:39:19,375 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 35. [2018-06-24 21:39:19,375 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 21:39:19,464 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 69 transitions. [2018-06-24 21:39:19,464 INFO ]: Start accepts. Automaton has 35 states and 69 transitions. Word has length 14 [2018-06-24 21:39:19,464 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:19,464 INFO ]: Abstraction has 35 states and 69 transitions. [2018-06-24 21:39:19,464 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:39:19,464 INFO ]: Start isEmpty. Operand 35 states and 69 transitions. [2018-06-24 21:39:19,465 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:39:19,465 INFO ]: Found error trace [2018-06-24 21:39:19,465 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:19,465 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:19,465 INFO ]: Analyzing trace with hash -72478266, now seen corresponding path program 5 times [2018-06-24 21:39:19,465 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:19,465 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:19,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:19,466 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:19,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:19,482 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:20,258 INFO ]: Checked inductivity of 16 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:39:20,258 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:20,258 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:20,273 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:39:20,325 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 21:39:20,325 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:20,327 INFO ]: Computing forward predicates... [2018-06-24 21:39:20,461 INFO ]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:39:20,481 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:20,481 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-06-24 21:39:20,481 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:39:20,481 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:39:20,481 INFO ]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:39:20,481 INFO ]: Start difference. First operand 35 states and 69 transitions. Second operand 17 states. [2018-06-24 21:39:20,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:20,749 INFO ]: Finished difference Result 61 states and 132 transitions. [2018-06-24 21:39:20,749 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 21:39:20,749 INFO ]: Start accepts. Automaton has 17 states. Word has length 15 [2018-06-24 21:39:20,749 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:20,750 INFO ]: With dead ends: 61 [2018-06-24 21:39:20,750 INFO ]: Without dead ends: 53 [2018-06-24 21:39:20,750 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:39:20,750 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 21:39:20,752 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-06-24 21:39:20,752 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 21:39:20,752 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 78 transitions. [2018-06-24 21:39:20,752 INFO ]: Start accepts. Automaton has 37 states and 78 transitions. Word has length 15 [2018-06-24 21:39:20,753 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:20,753 INFO ]: Abstraction has 37 states and 78 transitions. [2018-06-24 21:39:20,753 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:39:20,753 INFO ]: Start isEmpty. Operand 37 states and 78 transitions. [2018-06-24 21:39:20,753 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:39:20,753 INFO ]: Found error trace [2018-06-24 21:39:20,753 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:20,753 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:20,753 INFO ]: Analyzing trace with hash 961148943, now seen corresponding path program 4 times [2018-06-24 21:39:20,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:20,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:20,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:20,754 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:20,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:20,765 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:20,886 INFO ]: Checked inductivity of 18 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:20,886 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:20,886 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:20,892 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:39:20,919 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:39:20,919 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:20,921 INFO ]: Computing forward predicates... [2018-06-24 21:39:20,933 INFO ]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:20,964 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:20,964 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-24 21:39:20,965 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:39:20,965 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:39:20,965 INFO ]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:39:20,965 INFO ]: Start difference. First operand 37 states and 78 transitions. Second operand 10 states. [2018-06-24 21:39:21,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:21,030 INFO ]: Finished difference Result 40 states and 82 transitions. [2018-06-24 21:39:21,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:39:21,031 INFO ]: Start accepts. Automaton has 10 states. Word has length 16 [2018-06-24 21:39:21,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:21,031 INFO ]: With dead ends: 40 [2018-06-24 21:39:21,031 INFO ]: Without dead ends: 40 [2018-06-24 21:39:21,031 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:39:21,031 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 21:39:21,033 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-06-24 21:39:21,033 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 21:39:21,033 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 75 transitions. [2018-06-24 21:39:21,033 INFO ]: Start accepts. Automaton has 35 states and 75 transitions. Word has length 16 [2018-06-24 21:39:21,033 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:21,033 INFO ]: Abstraction has 35 states and 75 transitions. [2018-06-24 21:39:21,033 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:39:21,033 INFO ]: Start isEmpty. Operand 35 states and 75 transitions. [2018-06-24 21:39:21,034 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:39:21,034 INFO ]: Found error trace [2018-06-24 21:39:21,034 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:21,034 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:21,034 INFO ]: Analyzing trace with hash -389154835, now seen corresponding path program 6 times [2018-06-24 21:39:21,034 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:21,034 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:21,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:21,035 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:21,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:21,046 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:21,644 INFO ]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:39:21,644 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:21,644 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:21,650 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:39:21,681 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 21:39:21,681 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:21,683 INFO ]: Computing forward predicates... [2018-06-24 21:39:21,745 INFO ]: Checked inductivity of 22 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:39:21,764 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:21,764 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-24 21:39:21,764 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:39:21,764 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:39:21,764 INFO ]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:39:21,764 INFO ]: Start difference. First operand 35 states and 75 transitions. Second operand 11 states. [2018-06-24 21:39:21,829 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:21,829 INFO ]: Finished difference Result 42 states and 83 transitions. [2018-06-24 21:39:21,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:39:21,830 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-24 21:39:21,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:21,830 INFO ]: With dead ends: 42 [2018-06-24 21:39:21,830 INFO ]: Without dead ends: 42 [2018-06-24 21:39:21,831 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:39:21,831 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 21:39:21,834 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-06-24 21:39:21,834 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 21:39:21,834 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 70 transitions. [2018-06-24 21:39:21,834 INFO ]: Start accepts. Automaton has 32 states and 70 transitions. Word has length 17 [2018-06-24 21:39:21,835 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:21,835 INFO ]: Abstraction has 32 states and 70 transitions. [2018-06-24 21:39:21,835 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:39:21,835 INFO ]: Start isEmpty. Operand 32 states and 70 transitions. [2018-06-24 21:39:21,835 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:39:21,835 INFO ]: Found error trace [2018-06-24 21:39:21,835 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:21,835 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:21,835 INFO ]: Analyzing trace with hash -782181845, now seen corresponding path program 7 times [2018-06-24 21:39:21,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:21,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:21,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:21,836 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:21,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:21,852 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:21,996 INFO ]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:21,996 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:21,996 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:39:22,011 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:22,053 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:22,057 INFO ]: Computing forward predicates... [2018-06-24 21:39:22,379 INFO ]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:22,410 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:22,410 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-24 21:39:22,410 INFO ]: Interpolant automaton has 22 states [2018-06-24 21:39:22,410 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 21:39:22,410 INFO ]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:39:22,410 INFO ]: Start difference. First operand 32 states and 70 transitions. Second operand 22 states. [2018-06-24 21:39:23,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:23,641 INFO ]: Finished difference Result 104 states and 251 transitions. [2018-06-24 21:39:23,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 21:39:23,642 INFO ]: Start accepts. Automaton has 22 states. Word has length 17 [2018-06-24 21:39:23,642 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:23,643 INFO ]: With dead ends: 104 [2018-06-24 21:39:23,643 INFO ]: Without dead ends: 72 [2018-06-24 21:39:23,643 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=310, Invalid=1250, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 21:39:23,643 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-24 21:39:23,644 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 33. [2018-06-24 21:39:23,644 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 21:39:23,645 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 72 transitions. [2018-06-24 21:39:23,645 INFO ]: Start accepts. Automaton has 33 states and 72 transitions. Word has length 17 [2018-06-24 21:39:23,645 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:23,645 INFO ]: Abstraction has 33 states and 72 transitions. [2018-06-24 21:39:23,645 INFO ]: Interpolant automaton has 22 states. [2018-06-24 21:39:23,645 INFO ]: Start isEmpty. Operand 33 states and 72 transitions. [2018-06-24 21:39:23,645 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:39:23,645 INFO ]: Found error trace [2018-06-24 21:39:23,646 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:23,646 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:23,646 INFO ]: Analyzing trace with hash -81117267, now seen corresponding path program 5 times [2018-06-24 21:39:23,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:23,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:23,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:23,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:23,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:23,657 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:23,757 INFO ]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:23,757 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:23,757 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:23,765 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:39:23,799 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 21:39:23,799 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:23,801 INFO ]: Computing forward predicates... [2018-06-24 21:39:23,892 INFO ]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:23,911 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:23,911 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-06-24 21:39:23,912 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:39:23,912 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:39:23,912 INFO ]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:39:23,912 INFO ]: Start difference. First operand 33 states and 72 transitions. Second operand 19 states. [2018-06-24 21:39:24,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:24,306 INFO ]: Finished difference Result 104 states and 231 transitions. [2018-06-24 21:39:24,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 21:39:24,308 INFO ]: Start accepts. Automaton has 19 states. Word has length 17 [2018-06-24 21:39:24,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:24,309 INFO ]: With dead ends: 104 [2018-06-24 21:39:24,309 INFO ]: Without dead ends: 90 [2018-06-24 21:39:24,310 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=1027, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 21:39:24,310 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-24 21:39:24,311 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 47. [2018-06-24 21:39:24,311 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-24 21:39:24,311 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 97 transitions. [2018-06-24 21:39:24,311 INFO ]: Start accepts. Automaton has 47 states and 97 transitions. Word has length 17 [2018-06-24 21:39:24,311 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:24,311 INFO ]: Abstraction has 47 states and 97 transitions. [2018-06-24 21:39:24,311 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:39:24,311 INFO ]: Start isEmpty. Operand 47 states and 97 transitions. [2018-06-24 21:39:24,312 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:39:24,312 INFO ]: Found error trace [2018-06-24 21:39:24,312 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:24,312 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:24,312 INFO ]: Analyzing trace with hash 1009138575, now seen corresponding path program 8 times [2018-06-24 21:39:24,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:24,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:24,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:24,312 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:24,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:24,323 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:24,396 INFO ]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:24,397 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:24,397 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) [2018-06-24 21:39:24,414 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:24,472 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:39:24,472 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:24,474 INFO ]: Computing forward predicates... [2018-06-24 21:39:24,627 INFO ]: Checked inductivity of 27 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:39:24,646 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:24,646 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-06-24 21:39:24,646 INFO ]: Interpolant automaton has 21 states [2018-06-24 21:39:24,647 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 21:39:24,647 INFO ]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:39:24,647 INFO ]: Start difference. First operand 47 states and 97 transitions. Second operand 21 states. [2018-06-24 21:39:25,059 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:25,059 INFO ]: Finished difference Result 89 states and 196 transitions. [2018-06-24 21:39:25,060 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 21:39:25,060 INFO ]: Start accepts. Automaton has 21 states. Word has length 18 [2018-06-24 21:39:25,060 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:25,060 INFO ]: With dead ends: 89 [2018-06-24 21:39:25,060 INFO ]: Without dead ends: 77 [2018-06-24 21:39:25,061 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=976, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:39:25,061 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-24 21:39:25,063 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 50. [2018-06-24 21:39:25,063 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-24 21:39:25,063 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 109 transitions. [2018-06-24 21:39:25,063 INFO ]: Start accepts. Automaton has 50 states and 109 transitions. Word has length 18 [2018-06-24 21:39:25,063 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:25,063 INFO ]: Abstraction has 50 states and 109 transitions. [2018-06-24 21:39:25,063 INFO ]: Interpolant automaton has 21 states. [2018-06-24 21:39:25,063 INFO ]: Start isEmpty. Operand 50 states and 109 transitions. [2018-06-24 21:39:25,064 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:39:25,064 INFO ]: Found error trace [2018-06-24 21:39:25,064 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:25,064 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:25,064 INFO ]: Analyzing trace with hash 751745254, now seen corresponding path program 6 times [2018-06-24 21:39:25,064 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:25,064 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:25,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:25,065 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:25,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:25,076 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:25,480 INFO ]: Checked inductivity of 30 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:39:25,480 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:25,480 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:25,485 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:39:25,521 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 21:39:25,521 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:25,523 INFO ]: Computing forward predicates... [2018-06-24 21:39:25,536 INFO ]: Checked inductivity of 30 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:39:25,555 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:25,555 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-24 21:39:25,555 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:39:25,556 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:39:25,556 INFO ]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:39:25,556 INFO ]: Start difference. First operand 50 states and 109 transitions. Second operand 12 states. [2018-06-24 21:39:25,622 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:25,622 INFO ]: Finished difference Result 56 states and 117 transitions. [2018-06-24 21:39:25,622 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:39:25,622 INFO ]: Start accepts. Automaton has 12 states. Word has length 19 [2018-06-24 21:39:25,623 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:25,623 INFO ]: With dead ends: 56 [2018-06-24 21:39:25,623 INFO ]: Without dead ends: 56 [2018-06-24 21:39:25,623 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:39:25,623 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-24 21:39:25,625 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 47. [2018-06-24 21:39:25,625 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-24 21:39:25,625 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 105 transitions. [2018-06-24 21:39:25,625 INFO ]: Start accepts. Automaton has 47 states and 105 transitions. Word has length 19 [2018-06-24 21:39:25,625 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:25,625 INFO ]: Abstraction has 47 states and 105 transitions. [2018-06-24 21:39:25,625 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:39:25,626 INFO ]: Start isEmpty. Operand 47 states and 105 transitions. [2018-06-24 21:39:25,626 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:39:25,626 INFO ]: Found error trace [2018-06-24 21:39:25,626 INFO ]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:25,626 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:25,626 INFO ]: Analyzing trace with hash -588656940, now seen corresponding path program 9 times [2018-06-24 21:39:25,626 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:25,626 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:25,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:25,627 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:25,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:25,638 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:25,921 INFO ]: Checked inductivity of 35 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 21:39:25,921 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:25,921 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:25,928 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:39:25,966 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 21:39:25,966 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:25,968 INFO ]: Computing forward predicates... [2018-06-24 21:39:25,990 INFO ]: Checked inductivity of 35 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:39:26,009 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:26,009 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2018-06-24 21:39:26,010 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:39:26,010 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:39:26,010 INFO ]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:39:26,010 INFO ]: Start difference. First operand 47 states and 105 transitions. Second operand 13 states. [2018-06-24 21:39:26,084 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:26,084 INFO ]: Finished difference Result 59 states and 119 transitions. [2018-06-24 21:39:26,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:39:26,085 INFO ]: Start accepts. Automaton has 13 states. Word has length 20 [2018-06-24 21:39:26,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:26,085 INFO ]: With dead ends: 59 [2018-06-24 21:39:26,086 INFO ]: Without dead ends: 59 [2018-06-24 21:39:26,086 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:39:26,086 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-24 21:39:26,087 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 43. [2018-06-24 21:39:26,087 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 21:39:26,088 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 99 transitions. [2018-06-24 21:39:26,088 INFO ]: Start accepts. Automaton has 43 states and 99 transitions. Word has length 20 [2018-06-24 21:39:26,088 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:26,088 INFO ]: Abstraction has 43 states and 99 transitions. [2018-06-24 21:39:26,088 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:39:26,088 INFO ]: Start isEmpty. Operand 43 states and 99 transitions. [2018-06-24 21:39:26,088 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:39:26,088 INFO ]: Found error trace [2018-06-24 21:39:26,088 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:26,088 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:26,088 INFO ]: Analyzing trace with hash -330491502, now seen corresponding path program 10 times [2018-06-24 21:39:26,088 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:26,088 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:26,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:26,089 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:26,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:26,113 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:26,480 INFO ]: Checked inductivity of 35 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 21:39:26,480 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:26,480 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 21:39:26,486 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:39:26,541 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:39:26,541 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:26,548 INFO ]: Computing forward predicates... [2018-06-24 21:39:27,199 INFO ]: Checked inductivity of 35 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:39:27,218 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:27,218 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 22 [2018-06-24 21:39:27,219 INFO ]: Interpolant automaton has 22 states [2018-06-24 21:39:27,219 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 21:39:27,219 INFO ]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:39:27,219 INFO ]: Start difference. First operand 43 states and 99 transitions. Second operand 22 states. [2018-06-24 21:39:28,442 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:28,442 INFO ]: Finished difference Result 170 states and 443 transitions. [2018-06-24 21:39:28,443 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 21:39:28,443 INFO ]: Start accepts. Automaton has 22 states. Word has length 20 [2018-06-24 21:39:28,443 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:28,443 INFO ]: With dead ends: 170 [2018-06-24 21:39:28,443 INFO ]: Without dead ends: 95 [2018-06-24 21:39:28,444 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=312, Invalid=1410, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 21:39:28,444 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-24 21:39:28,446 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 51. [2018-06-24 21:39:28,446 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-24 21:39:28,446 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 112 transitions. [2018-06-24 21:39:28,447 INFO ]: Start accepts. Automaton has 51 states and 112 transitions. Word has length 20 [2018-06-24 21:39:28,447 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:28,447 INFO ]: Abstraction has 51 states and 112 transitions. [2018-06-24 21:39:28,447 INFO ]: Interpolant automaton has 22 states. [2018-06-24 21:39:28,447 INFO ]: Start isEmpty. Operand 51 states and 112 transitions. [2018-06-24 21:39:28,447 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:39:28,447 INFO ]: Found error trace [2018-06-24 21:39:28,447 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:28,447 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:28,447 INFO ]: Analyzing trace with hash -917297516, now seen corresponding path program 7 times [2018-06-24 21:39:28,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:28,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:28,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:28,448 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:28,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:28,459 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:28,604 INFO ]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:39:28,605 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:28,605 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 21:39:28,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:28,651 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:28,654 INFO ]: Computing forward predicates... [2018-06-24 21:39:28,765 INFO ]: Checked inductivity of 35 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:39:28,784 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:28,784 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-06-24 21:39:28,784 INFO ]: Interpolant automaton has 23 states [2018-06-24 21:39:28,784 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 21:39:28,784 INFO ]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:39:28,784 INFO ]: Start difference. First operand 51 states and 112 transitions. Second operand 23 states. [2018-06-24 21:39:29,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:29,549 INFO ]: Finished difference Result 151 states and 336 transitions. [2018-06-24 21:39:29,551 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 21:39:29,551 INFO ]: Start accepts. Automaton has 23 states. Word has length 20 [2018-06-24 21:39:29,551 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:29,552 INFO ]: With dead ends: 151 [2018-06-24 21:39:29,552 INFO ]: Without dead ends: 127 [2018-06-24 21:39:29,553 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=450, Invalid=1530, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 21:39:29,553 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-24 21:39:29,556 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 61. [2018-06-24 21:39:29,556 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-24 21:39:29,556 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 131 transitions. [2018-06-24 21:39:29,557 INFO ]: Start accepts. Automaton has 61 states and 131 transitions. Word has length 20 [2018-06-24 21:39:29,557 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:29,557 INFO ]: Abstraction has 61 states and 131 transitions. [2018-06-24 21:39:29,557 INFO ]: Interpolant automaton has 23 states. [2018-06-24 21:39:29,557 INFO ]: Start isEmpty. Operand 61 states and 131 transitions. [2018-06-24 21:39:29,557 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 21:39:29,557 INFO ]: Found error trace [2018-06-24 21:39:29,557 INFO ]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:29,557 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:29,557 INFO ]: Analyzing trace with hash 479907430, now seen corresponding path program 11 times [2018-06-24 21:39:29,557 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:29,557 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:29,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:29,558 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:29,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:29,570 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:29,786 INFO ]: Checked inductivity of 41 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:39:29,786 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:29,786 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 21:39:29,792 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:39:29,845 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:39:29,845 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:29,847 INFO ]: Computing forward predicates... [2018-06-24 21:39:29,958 INFO ]: Checked inductivity of 41 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:39:29,977 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:29,977 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-06-24 21:39:29,977 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:39:29,977 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:39:29,977 INFO ]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:39:29,977 INFO ]: Start difference. First operand 61 states and 131 transitions. Second operand 25 states. [2018-06-24 21:39:30,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:30,440 INFO ]: Finished difference Result 123 states and 274 transitions. [2018-06-24 21:39:30,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 21:39:30,442 INFO ]: Start accepts. Automaton has 25 states. Word has length 21 [2018-06-24 21:39:30,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:30,442 INFO ]: With dead ends: 123 [2018-06-24 21:39:30,442 INFO ]: Without dead ends: 106 [2018-06-24 21:39:30,443 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=399, Invalid=1407, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 21:39:30,443 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-24 21:39:30,445 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 65. [2018-06-24 21:39:30,445 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-24 21:39:30,446 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 146 transitions. [2018-06-24 21:39:30,446 INFO ]: Start accepts. Automaton has 65 states and 146 transitions. Word has length 21 [2018-06-24 21:39:30,446 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:30,446 INFO ]: Abstraction has 65 states and 146 transitions. [2018-06-24 21:39:30,446 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:39:30,446 INFO ]: Start isEmpty. Operand 65 states and 146 transitions. [2018-06-24 21:39:30,446 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 21:39:30,446 INFO ]: Found error trace [2018-06-24 21:39:30,446 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:30,446 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:30,447 INFO ]: Analyzing trace with hash 549311087, now seen corresponding path program 8 times [2018-06-24 21:39:30,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:30,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:30,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:30,447 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:30,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:30,462 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:30,906 INFO ]: Checked inductivity of 45 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:39:30,906 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:30,906 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 21:39:30,911 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:39:30,950 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:39:30,950 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:30,952 INFO ]: Computing forward predicates... [2018-06-24 21:39:30,975 INFO ]: Checked inductivity of 45 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:39:30,994 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:30,994 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-24 21:39:30,994 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:39:30,994 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:39:30,994 INFO ]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:39:30,994 INFO ]: Start difference. First operand 65 states and 146 transitions. Second operand 14 states. [2018-06-24 21:39:31,074 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:31,074 INFO ]: Finished difference Result 75 states and 159 transitions. [2018-06-24 21:39:31,074 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:39:31,074 INFO ]: Start accepts. Automaton has 14 states. Word has length 22 [2018-06-24 21:39:31,075 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:31,075 INFO ]: With dead ends: 75 [2018-06-24 21:39:31,075 INFO ]: Without dead ends: 75 [2018-06-24 21:39:31,075 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:39:31,075 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-24 21:39:31,077 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 61. [2018-06-24 21:39:31,077 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-24 21:39:31,077 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 141 transitions. [2018-06-24 21:39:31,077 INFO ]: Start accepts. Automaton has 61 states and 141 transitions. Word has length 22 [2018-06-24 21:39:31,077 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:31,077 INFO ]: Abstraction has 61 states and 141 transitions. [2018-06-24 21:39:31,077 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:39:31,077 INFO ]: Start isEmpty. Operand 61 states and 141 transitions. [2018-06-24 21:39:31,077 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 21:39:31,077 INFO ]: Found error trace [2018-06-24 21:39:31,077 INFO ]: trace histogram [5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:31,078 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:31,078 INFO ]: Analyzing trace with hash -1385110195, now seen corresponding path program 12 times [2018-06-24 21:39:31,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:31,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:31,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:31,078 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:31,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:31,093 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:31,332 INFO ]: Checked inductivity of 51 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 21:39:31,333 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:31,333 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 21:39:31,338 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:39:31,445 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 21:39:31,445 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:31,448 INFO ]: Computing forward predicates... [2018-06-24 21:39:31,594 INFO ]: Checked inductivity of 51 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 21:39:31,614 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:31,614 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-06-24 21:39:31,614 INFO ]: Interpolant automaton has 24 states [2018-06-24 21:39:31,614 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 21:39:31,614 INFO ]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:39:31,614 INFO ]: Start difference. First operand 61 states and 141 transitions. Second operand 24 states. [2018-06-24 21:39:31,889 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:31,889 INFO ]: Finished difference Result 79 states and 162 transitions. [2018-06-24 21:39:31,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:39:31,891 INFO ]: Start accepts. Automaton has 24 states. Word has length 23 [2018-06-24 21:39:31,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:31,891 INFO ]: With dead ends: 79 [2018-06-24 21:39:31,891 INFO ]: Without dead ends: 79 [2018-06-24 21:39:31,892 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 21:39:31,892 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-24 21:39:31,894 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 56. [2018-06-24 21:39:31,894 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-24 21:39:31,895 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 134 transitions. [2018-06-24 21:39:31,895 INFO ]: Start accepts. Automaton has 56 states and 134 transitions. Word has length 23 [2018-06-24 21:39:31,896 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:31,896 INFO ]: Abstraction has 56 states and 134 transitions. [2018-06-24 21:39:31,896 INFO ]: Interpolant automaton has 24 states. [2018-06-24 21:39:31,896 INFO ]: Start isEmpty. Operand 56 states and 134 transitions. [2018-06-24 21:39:31,896 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 21:39:31,896 INFO ]: Found error trace [2018-06-24 21:39:31,896 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:31,896 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:31,896 INFO ]: Analyzing trace with hash 1898739851, now seen corresponding path program 13 times [2018-06-24 21:39:31,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:31,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:31,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:31,897 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:31,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:31,919 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:32,171 INFO ]: Checked inductivity of 51 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-24 21:39:32,171 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:32,171 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 21:39:32,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:32,223 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:32,229 INFO ]: Computing forward predicates... [2018-06-24 21:39:32,680 INFO ]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:39:32,699 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:32,699 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 24 [2018-06-24 21:39:32,700 INFO ]: Interpolant automaton has 24 states [2018-06-24 21:39:32,700 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 21:39:32,700 INFO ]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:39:32,700 INFO ]: Start difference. First operand 56 states and 134 transitions. Second operand 24 states. [2018-06-24 21:39:33,687 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:33,687 INFO ]: Finished difference Result 195 states and 507 transitions. [2018-06-24 21:39:33,687 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 21:39:33,687 INFO ]: Start accepts. Automaton has 24 states. Word has length 23 [2018-06-24 21:39:33,687 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:33,688 INFO ]: With dead ends: 195 [2018-06-24 21:39:33,688 INFO ]: Without dead ends: 123 [2018-06-24 21:39:33,688 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=383, Invalid=1687, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 21:39:33,689 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-24 21:39:33,691 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 65. [2018-06-24 21:39:33,691 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-24 21:39:33,692 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 148 transitions. [2018-06-24 21:39:33,692 INFO ]: Start accepts. Automaton has 65 states and 148 transitions. Word has length 23 [2018-06-24 21:39:33,692 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:33,692 INFO ]: Abstraction has 65 states and 148 transitions. [2018-06-24 21:39:33,692 INFO ]: Interpolant automaton has 24 states. [2018-06-24 21:39:33,692 INFO ]: Start isEmpty. Operand 65 states and 148 transitions. [2018-06-24 21:39:33,692 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 21:39:33,692 INFO ]: Found error trace [2018-06-24 21:39:33,692 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:33,692 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:33,692 INFO ]: Analyzing trace with hash 618876173, now seen corresponding path program 9 times [2018-06-24 21:39:33,692 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:33,692 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:33,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:33,693 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:33,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:33,705 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:33,860 INFO ]: Checked inductivity of 51 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:39:33,860 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:33,860 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 21:39:33,866 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:39:33,910 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 21:39:33,910 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:33,912 INFO ]: Computing forward predicates... [2018-06-24 21:39:34,422 INFO ]: Checked inductivity of 51 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:39:34,441 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:34,441 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-06-24 21:39:34,441 INFO ]: Interpolant automaton has 27 states [2018-06-24 21:39:34,442 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 21:39:34,442 INFO ]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:39:34,442 INFO ]: Start difference. First operand 65 states and 148 transitions. Second operand 27 states. [2018-06-24 21:39:35,451 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:35,451 INFO ]: Finished difference Result 203 states and 458 transitions. [2018-06-24 21:39:35,451 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 21:39:35,452 INFO ]: Start accepts. Automaton has 27 states. Word has length 23 [2018-06-24 21:39:35,452 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:35,453 INFO ]: With dead ends: 203 [2018-06-24 21:39:35,453 INFO ]: Without dead ends: 171 [2018-06-24 21:39:35,453 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=624, Invalid=2132, Unknown=0, NotChecked=0, Total=2756 [2018-06-24 21:39:35,454 INFO ]: Start minimizeSevpa. Operand 171 states. [2018-06-24 21:39:35,458 INFO ]: Finished minimizeSevpa. Reduced states from 171 to 77. [2018-06-24 21:39:35,458 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-24 21:39:35,459 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 171 transitions. [2018-06-24 21:39:35,459 INFO ]: Start accepts. Automaton has 77 states and 171 transitions. Word has length 23 [2018-06-24 21:39:35,459 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:35,459 INFO ]: Abstraction has 77 states and 171 transitions. [2018-06-24 21:39:35,459 INFO ]: Interpolant automaton has 27 states. [2018-06-24 21:39:35,459 INFO ]: Start isEmpty. Operand 77 states and 171 transitions. [2018-06-24 21:39:35,459 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 21:39:35,459 INFO ]: Found error trace [2018-06-24 21:39:35,459 INFO ]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:35,459 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:35,460 INFO ]: Analyzing trace with hash 781358575, now seen corresponding path program 14 times [2018-06-24 21:39:35,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:35,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:35,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:35,460 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:35,460 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:35,472 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:36,127 INFO ]: Checked inductivity of 58 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:39:36,127 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:36,127 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 21:39:36,133 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:39:36,175 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:39:36,175 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:36,177 INFO ]: Computing forward predicates... [2018-06-24 21:39:37,104 INFO ]: Checked inductivity of 58 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:39:37,123 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:37,123 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-06-24 21:39:37,123 INFO ]: Interpolant automaton has 29 states [2018-06-24 21:39:37,123 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 21:39:37,123 INFO ]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:39:37,123 INFO ]: Start difference. First operand 77 states and 171 transitions. Second operand 29 states. [2018-06-24 21:39:37,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:37,662 INFO ]: Finished difference Result 163 states and 366 transitions. [2018-06-24 21:39:37,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 21:39:37,662 INFO ]: Start accepts. Automaton has 29 states. Word has length 24 [2018-06-24 21:39:37,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:37,663 INFO ]: With dead ends: 163 [2018-06-24 21:39:37,663 INFO ]: Without dead ends: 140 [2018-06-24 21:39:37,664 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=534, Invalid=1916, Unknown=0, NotChecked=0, Total=2450 [2018-06-24 21:39:37,664 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-24 21:39:37,667 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 82. [2018-06-24 21:39:37,667 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-24 21:39:37,668 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 189 transitions. [2018-06-24 21:39:37,668 INFO ]: Start accepts. Automaton has 82 states and 189 transitions. Word has length 24 [2018-06-24 21:39:37,668 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:37,668 INFO ]: Abstraction has 82 states and 189 transitions. [2018-06-24 21:39:37,668 INFO ]: Interpolant automaton has 29 states. [2018-06-24 21:39:37,668 INFO ]: Start isEmpty. Operand 82 states and 189 transitions. [2018-06-24 21:39:37,668 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 21:39:37,668 INFO ]: Found error trace [2018-06-24 21:39:37,668 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:37,668 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:37,669 INFO ]: Analyzing trace with hash -461247098, now seen corresponding path program 10 times [2018-06-24 21:39:37,669 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:37,669 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:37,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:37,669 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:37,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:37,690 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:37,978 INFO ]: Checked inductivity of 63 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 21:39:37,984 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:37,984 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 21:39:37,991 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:39:38,035 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:39:38,035 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:38,037 INFO ]: Computing forward predicates... [2018-06-24 21:39:38,052 INFO ]: Checked inductivity of 63 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 21:39:38,071 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:38,071 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-24 21:39:38,071 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:39:38,071 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:39:38,071 INFO ]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:39:38,071 INFO ]: Start difference. First operand 82 states and 189 transitions. Second operand 16 states. [2018-06-24 21:39:38,192 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:38,192 INFO ]: Finished difference Result 97 states and 208 transitions. [2018-06-24 21:39:38,193 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:39:38,193 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-24 21:39:38,193 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:38,193 INFO ]: With dead ends: 97 [2018-06-24 21:39:38,193 INFO ]: Without dead ends: 97 [2018-06-24 21:39:38,194 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:39:38,194 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-24 21:39:38,196 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 77. [2018-06-24 21:39:38,196 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-24 21:39:38,197 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 183 transitions. [2018-06-24 21:39:38,197 INFO ]: Start accepts. Automaton has 77 states and 183 transitions. Word has length 25 [2018-06-24 21:39:38,197 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:38,197 INFO ]: Abstraction has 77 states and 183 transitions. [2018-06-24 21:39:38,197 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:39:38,197 INFO ]: Start isEmpty. Operand 77 states and 183 transitions. [2018-06-24 21:39:38,197 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:39:38,197 INFO ]: Found error trace [2018-06-24 21:39:38,197 INFO ]: trace histogram [6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:38,197 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:38,197 INFO ]: Analyzing trace with hash -686757260, now seen corresponding path program 15 times [2018-06-24 21:39:38,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:38,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:38,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:38,198 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:38,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:38,210 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:38,756 INFO ]: Checked inductivity of 70 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-24 21:39:38,756 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:38,756 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 21:39:38,762 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:39:38,820 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 21:39:38,820 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:38,823 INFO ]: Computing forward predicates... [2018-06-24 21:39:38,956 INFO ]: Checked inductivity of 70 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 21:39:38,976 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:38,976 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-06-24 21:39:38,976 INFO ]: Interpolant automaton has 28 states [2018-06-24 21:39:38,976 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 21:39:38,976 INFO ]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:39:38,976 INFO ]: Start difference. First operand 77 states and 183 transitions. Second operand 28 states. [2018-06-24 21:39:39,370 WARN ]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-24 21:39:39,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:39,619 INFO ]: Finished difference Result 102 states and 212 transitions. [2018-06-24 21:39:39,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:39:39,619 INFO ]: Start accepts. Automaton has 28 states. Word has length 26 [2018-06-24 21:39:39,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:39,620 INFO ]: With dead ends: 102 [2018-06-24 21:39:39,620 INFO ]: Without dead ends: 102 [2018-06-24 21:39:39,620 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=413, Invalid=1227, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:39:39,620 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-24 21:39:39,622 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 71. [2018-06-24 21:39:39,622 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-24 21:39:39,623 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 175 transitions. [2018-06-24 21:39:39,623 INFO ]: Start accepts. Automaton has 71 states and 175 transitions. Word has length 26 [2018-06-24 21:39:39,623 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:39,623 INFO ]: Abstraction has 71 states and 175 transitions. [2018-06-24 21:39:39,623 INFO ]: Interpolant automaton has 28 states. [2018-06-24 21:39:39,623 INFO ]: Start isEmpty. Operand 71 states and 175 transitions. [2018-06-24 21:39:39,624 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:39:39,624 INFO ]: Found error trace [2018-06-24 21:39:39,624 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:39,624 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:39,624 INFO ]: Analyzing trace with hash -1707825614, now seen corresponding path program 16 times [2018-06-24 21:39:39,624 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:39,624 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:39,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:39,624 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:39,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:39,645 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:39,823 INFO ]: Checked inductivity of 70 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 21:39:39,823 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:39,823 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 21:39:39,828 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:39:39,879 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:39:39,879 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:39,885 INFO ]: Computing forward predicates... [2018-06-24 21:39:40,334 INFO ]: Checked inductivity of 70 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 21:39:40,356 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:40,356 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 27 [2018-06-24 21:39:40,356 INFO ]: Interpolant automaton has 27 states [2018-06-24 21:39:40,356 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 21:39:40,356 INFO ]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:39:40,356 INFO ]: Start difference. First operand 71 states and 175 transitions. Second operand 27 states. [2018-06-24 21:39:41,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:41,463 INFO ]: Finished difference Result 253 states and 670 transitions. [2018-06-24 21:39:41,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 21:39:41,463 INFO ]: Start accepts. Automaton has 27 states. Word has length 26 [2018-06-24 21:39:41,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:41,464 INFO ]: With dead ends: 253 [2018-06-24 21:39:41,464 INFO ]: Without dead ends: 155 [2018-06-24 21:39:41,465 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=475, Invalid=2177, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 21:39:41,465 INFO ]: Start minimizeSevpa. Operand 155 states. [2018-06-24 21:39:41,468 INFO ]: Finished minimizeSevpa. Reduced states from 155 to 81. [2018-06-24 21:39:41,468 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-24 21:39:41,469 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 190 transitions. [2018-06-24 21:39:41,469 INFO ]: Start accepts. Automaton has 81 states and 190 transitions. Word has length 26 [2018-06-24 21:39:41,469 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:41,469 INFO ]: Abstraction has 81 states and 190 transitions. [2018-06-24 21:39:41,469 INFO ]: Interpolant automaton has 27 states. [2018-06-24 21:39:41,469 INFO ]: Start isEmpty. Operand 81 states and 190 transitions. [2018-06-24 21:39:41,469 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:39:41,469 INFO ]: Found error trace [2018-06-24 21:39:41,469 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:41,469 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:41,469 INFO ]: Analyzing trace with hash 998793780, now seen corresponding path program 11 times [2018-06-24 21:39:41,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:41,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:41,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:41,470 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:41,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:41,484 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:42,838 INFO ]: Checked inductivity of 70 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 21:39:42,838 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:42,838 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 21:39:42,844 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:39:42,895 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 21:39:42,895 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:42,898 INFO ]: Computing forward predicates... [2018-06-24 21:39:42,934 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 21:39:42,953 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:42,953 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 21:39:42,953 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:39:42,953 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:39:42,953 INFO ]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:39:42,953 INFO ]: Start difference. First operand 81 states and 190 transitions. Second operand 17 states. [2018-06-24 21:39:43,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:43,667 INFO ]: Finished difference Result 171 states and 400 transitions. [2018-06-24 21:39:43,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 21:39:43,667 INFO ]: Start accepts. Automaton has 17 states. Word has length 26 [2018-06-24 21:39:43,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:43,668 INFO ]: With dead ends: 171 [2018-06-24 21:39:43,668 INFO ]: Without dead ends: 171 [2018-06-24 21:39:43,669 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:39:43,669 INFO ]: Start minimizeSevpa. Operand 171 states. [2018-06-24 21:39:43,672 INFO ]: Finished minimizeSevpa. Reduced states from 171 to 94. [2018-06-24 21:39:43,672 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-24 21:39:43,673 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 218 transitions. [2018-06-24 21:39:43,673 INFO ]: Start accepts. Automaton has 94 states and 218 transitions. Word has length 26 [2018-06-24 21:39:43,673 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:43,673 INFO ]: Abstraction has 94 states and 218 transitions. [2018-06-24 21:39:43,673 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:39:43,673 INFO ]: Start isEmpty. Operand 94 states and 218 transitions. [2018-06-24 21:39:43,674 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 21:39:43,674 INFO ]: Found error trace [2018-06-24 21:39:43,674 INFO ]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:43,674 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:43,674 INFO ]: Analyzing trace with hash -1697053946, now seen corresponding path program 17 times [2018-06-24 21:39:43,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:43,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:43,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:43,674 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:43,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:43,687 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:44,003 INFO ]: Checked inductivity of 78 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 21:39:44,003 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:44,003 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 21:39:44,009 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:39:44,063 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 21:39:44,063 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:44,067 INFO ]: Computing forward predicates... [2018-06-24 21:39:44,153 INFO ]: Checked inductivity of 78 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 21:39:44,173 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:44,173 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-06-24 21:39:44,173 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:39:44,173 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:39:44,174 INFO ]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:39:44,174 INFO ]: Start difference. First operand 94 states and 218 transitions. Second operand 18 states. [2018-06-24 21:39:44,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:44,480 INFO ]: Finished difference Result 193 states and 453 transitions. [2018-06-24 21:39:44,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 21:39:44,480 INFO ]: Start accepts. Automaton has 18 states. Word has length 27 [2018-06-24 21:39:44,480 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:44,481 INFO ]: With dead ends: 193 [2018-06-24 21:39:44,481 INFO ]: Without dead ends: 193 [2018-06-24 21:39:44,481 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=338, Invalid=592, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:39:44,481 INFO ]: Start minimizeSevpa. Operand 193 states. [2018-06-24 21:39:44,485 INFO ]: Finished minimizeSevpa. Reduced states from 193 to 109. [2018-06-24 21:39:44,485 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-24 21:39:44,486 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 250 transitions. [2018-06-24 21:39:44,486 INFO ]: Start accepts. Automaton has 109 states and 250 transitions. Word has length 27 [2018-06-24 21:39:44,486 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:44,486 INFO ]: Abstraction has 109 states and 250 transitions. [2018-06-24 21:39:44,486 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:39:44,486 INFO ]: Start isEmpty. Operand 109 states and 250 transitions. [2018-06-24 21:39:44,487 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 21:39:44,487 INFO ]: Found error trace [2018-06-24 21:39:44,487 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:44,487 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:44,487 INFO ]: Analyzing trace with hash 897361543, now seen corresponding path program 12 times [2018-06-24 21:39:44,487 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:44,487 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:44,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:44,488 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:44,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:44,500 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:44,706 INFO ]: Checked inductivity of 77 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 21:39:44,706 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:44,706 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 21:39:44,711 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:39:44,764 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 21:39:44,764 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:44,767 INFO ]: Computing forward predicates... [2018-06-24 21:39:45,004 INFO ]: Checked inductivity of 77 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 21:39:45,023 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:45,023 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-06-24 21:39:45,023 INFO ]: Interpolant automaton has 34 states [2018-06-24 21:39:45,024 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 21:39:45,024 INFO ]: CoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 21:39:45,024 INFO ]: Start difference. First operand 109 states and 250 transitions. Second operand 34 states. [2018-06-24 21:39:46,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:46,052 INFO ]: Finished difference Result 367 states and 799 transitions. [2018-06-24 21:39:46,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-24 21:39:46,053 INFO ]: Start accepts. Automaton has 34 states. Word has length 27 [2018-06-24 21:39:46,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:46,054 INFO ]: With dead ends: 367 [2018-06-24 21:39:46,054 INFO ]: Without dead ends: 218 [2018-06-24 21:39:46,055 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=705, Invalid=3851, Unknown=0, NotChecked=0, Total=4556 [2018-06-24 21:39:46,055 INFO ]: Start minimizeSevpa. Operand 218 states. [2018-06-24 21:39:46,061 INFO ]: Finished minimizeSevpa. Reduced states from 218 to 194. [2018-06-24 21:39:46,061 INFO ]: Start removeUnreachable. Operand 194 states. [2018-06-24 21:39:46,062 INFO ]: Finished removeUnreachable. Reduced from 194 states to 194 states and 458 transitions. [2018-06-24 21:39:46,062 INFO ]: Start accepts. Automaton has 194 states and 458 transitions. Word has length 27 [2018-06-24 21:39:46,063 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:46,063 INFO ]: Abstraction has 194 states and 458 transitions. [2018-06-24 21:39:46,063 INFO ]: Interpolant automaton has 34 states. [2018-06-24 21:39:46,063 INFO ]: Start isEmpty. Operand 194 states and 458 transitions. [2018-06-24 21:39:46,063 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 21:39:46,063 INFO ]: Found error trace [2018-06-24 21:39:46,063 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:46,063 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:46,063 INFO ]: Analyzing trace with hash 504334533, now seen corresponding path program 1 times [2018-06-24 21:39:46,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:46,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:46,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:46,064 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:46,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:46,076 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:46,488 INFO ]: Checked inductivity of 77 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 21:39:46,488 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:46,488 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 21:39:46,493 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:46,539 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:46,542 INFO ]: Computing forward predicates... [2018-06-24 21:39:46,800 INFO ]: Checked inductivity of 77 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 21:39:46,818 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:46,818 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-06-24 21:39:46,818 INFO ]: Interpolant automaton has 32 states [2018-06-24 21:39:46,819 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 21:39:46,819 INFO ]: CoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:39:46,819 INFO ]: Start difference. First operand 194 states and 458 transitions. Second operand 32 states. [2018-06-24 21:39:47,623 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:47,623 INFO ]: Finished difference Result 620 states and 1582 transitions. [2018-06-24 21:39:47,623 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 21:39:47,623 INFO ]: Start accepts. Automaton has 32 states. Word has length 27 [2018-06-24 21:39:47,623 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:47,625 INFO ]: With dead ends: 620 [2018-06-24 21:39:47,625 INFO ]: Without dead ends: 381 [2018-06-24 21:39:47,626 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=635, Invalid=2445, Unknown=0, NotChecked=0, Total=3080 [2018-06-24 21:39:47,626 INFO ]: Start minimizeSevpa. Operand 381 states. [2018-06-24 21:39:47,631 INFO ]: Finished minimizeSevpa. Reduced states from 381 to 123. [2018-06-24 21:39:47,631 INFO ]: Start removeUnreachable. Operand 123 states. [2018-06-24 21:39:47,632 INFO ]: Finished removeUnreachable. Reduced from 123 states to 123 states and 316 transitions. [2018-06-24 21:39:47,632 INFO ]: Start accepts. Automaton has 123 states and 316 transitions. Word has length 27 [2018-06-24 21:39:47,632 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:47,632 INFO ]: Abstraction has 123 states and 316 transitions. [2018-06-24 21:39:47,632 INFO ]: Interpolant automaton has 32 states. [2018-06-24 21:39:47,632 INFO ]: Start isEmpty. Operand 123 states and 316 transitions. [2018-06-24 21:39:47,632 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 21:39:47,632 INFO ]: Found error trace [2018-06-24 21:39:47,632 INFO ]: trace histogram [7, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:47,632 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:47,633 INFO ]: Analyzing trace with hash -1375151443, now seen corresponding path program 18 times [2018-06-24 21:39:47,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:47,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:47,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:47,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:47,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:47,645 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:47,794 INFO ]: Checked inductivity of 92 backedges. 22 proven. 41 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-24 21:39:47,794 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:47,794 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:47,800 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:39:47,856 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 21:39:47,856 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:47,859 INFO ]: Computing forward predicates... [2018-06-24 21:39:47,891 INFO ]: Checked inductivity of 92 backedges. 28 proven. 33 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-24 21:39:47,909 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:47,909 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 19 [2018-06-24 21:39:47,910 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:39:47,910 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:39:47,910 INFO ]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:39:47,910 INFO ]: Start difference. First operand 123 states and 316 transitions. Second operand 19 states. [2018-06-24 21:39:48,025 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:48,025 INFO ]: Finished difference Result 100 states and 185 transitions. [2018-06-24 21:39:48,025 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:39:48,025 INFO ]: Start accepts. Automaton has 19 states. Word has length 29 [2018-06-24 21:39:48,025 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:48,025 INFO ]: With dead ends: 100 [2018-06-24 21:39:48,025 INFO ]: Without dead ends: 100 [2018-06-24 21:39:48,026 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=236, Invalid=466, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:39:48,026 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-24 21:39:48,028 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 60. [2018-06-24 21:39:48,028 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-24 21:39:48,028 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 138 transitions. [2018-06-24 21:39:48,028 INFO ]: Start accepts. Automaton has 60 states and 138 transitions. Word has length 29 [2018-06-24 21:39:48,028 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:48,028 INFO ]: Abstraction has 60 states and 138 transitions. [2018-06-24 21:39:48,028 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:39:48,028 INFO ]: Start isEmpty. Operand 60 states and 138 transitions. [2018-06-24 21:39:48,028 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 21:39:48,029 INFO ]: Found error trace [2018-06-24 21:39:48,029 INFO ]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:48,029 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:48,030 INFO ]: Analyzing trace with hash 925671147, now seen corresponding path program 19 times [2018-06-24 21:39:48,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:48,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:48,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:48,030 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:48,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:48,053 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:48,686 INFO ]: Checked inductivity of 92 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-24 21:39:48,686 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:48,686 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:48,692 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:48,769 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:48,775 INFO ]: Computing forward predicates... [2018-06-24 21:39:49,220 INFO ]: Checked inductivity of 92 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 21:39:49,240 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:49,240 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 30 [2018-06-24 21:39:49,240 INFO ]: Interpolant automaton has 30 states [2018-06-24 21:39:49,241 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 21:39:49,241 INFO ]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:39:49,241 INFO ]: Start difference. First operand 60 states and 138 transitions. Second operand 30 states. [2018-06-24 21:39:50,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:50,603 INFO ]: Finished difference Result 207 states and 521 transitions. [2018-06-24 21:39:50,603 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 21:39:50,603 INFO ]: Start accepts. Automaton has 30 states. Word has length 29 [2018-06-24 21:39:50,603 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:50,604 INFO ]: With dead ends: 207 [2018-06-24 21:39:50,604 INFO ]: Without dead ends: 135 [2018-06-24 21:39:50,605 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=578, Invalid=2728, Unknown=0, NotChecked=0, Total=3306 [2018-06-24 21:39:50,605 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-24 21:39:50,607 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 71. [2018-06-24 21:39:50,607 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-24 21:39:50,607 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 154 transitions. [2018-06-24 21:39:50,607 INFO ]: Start accepts. Automaton has 71 states and 154 transitions. Word has length 29 [2018-06-24 21:39:50,607 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:50,607 INFO ]: Abstraction has 71 states and 154 transitions. [2018-06-24 21:39:50,607 INFO ]: Interpolant automaton has 30 states. [2018-06-24 21:39:50,607 INFO ]: Start isEmpty. Operand 71 states and 154 transitions. [2018-06-24 21:39:50,608 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 21:39:50,608 INFO ]: Found error trace [2018-06-24 21:39:50,608 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:50,608 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:50,608 INFO ]: Analyzing trace with hash -763272595, now seen corresponding path program 13 times [2018-06-24 21:39:50,608 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:50,608 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:50,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:50,608 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:50,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:50,622 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:50,839 INFO ]: Checked inductivity of 92 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 21:39:50,839 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:50,839 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:50,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:50,900 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:50,902 INFO ]: Computing forward predicates... [2018-06-24 21:39:51,112 INFO ]: Checked inductivity of 92 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 21:39:51,131 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:51,131 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2018-06-24 21:39:51,131 INFO ]: Interpolant automaton has 35 states [2018-06-24 21:39:51,131 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 21:39:51,131 INFO ]: CoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 21:39:51,131 INFO ]: Start difference. First operand 71 states and 154 transitions. Second operand 35 states. [2018-06-24 21:39:52,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:52,089 INFO ]: Finished difference Result 247 states and 510 transitions. [2018-06-24 21:39:52,089 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-24 21:39:52,089 INFO ]: Start accepts. Automaton has 35 states. Word has length 29 [2018-06-24 21:39:52,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:52,089 INFO ]: With dead ends: 247 [2018-06-24 21:39:52,089 INFO ]: Without dead ends: 196 [2018-06-24 21:39:52,091 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1059, Invalid=3633, Unknown=0, NotChecked=0, Total=4692 [2018-06-24 21:39:52,091 INFO ]: Start minimizeSevpa. Operand 196 states. [2018-06-24 21:39:52,093 INFO ]: Finished minimizeSevpa. Reduced states from 196 to 80. [2018-06-24 21:39:52,093 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-24 21:39:52,094 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 164 transitions. [2018-06-24 21:39:52,094 INFO ]: Start accepts. Automaton has 80 states and 164 transitions. Word has length 29 [2018-06-24 21:39:52,094 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:52,094 INFO ]: Abstraction has 80 states and 164 transitions. [2018-06-24 21:39:52,094 INFO ]: Interpolant automaton has 35 states. [2018-06-24 21:39:52,094 INFO ]: Start isEmpty. Operand 80 states and 164 transitions. [2018-06-24 21:39:52,094 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 21:39:52,094 INFO ]: Found error trace [2018-06-24 21:39:52,094 INFO ]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:52,095 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:52,095 INFO ]: Analyzing trace with hash 2108880975, now seen corresponding path program 20 times [2018-06-24 21:39:52,095 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:52,095 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:52,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:52,095 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:52,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:52,111 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:52,250 INFO ]: Checked inductivity of 101 backedges. 45 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 21:39:52,250 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:52,251 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:52,256 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:39:52,311 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:39:52,311 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:52,313 INFO ]: Computing forward predicates... [2018-06-24 21:39:52,535 INFO ]: Checked inductivity of 101 backedges. 36 proven. 37 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 21:39:52,554 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:52,554 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-06-24 21:39:52,554 INFO ]: Interpolant automaton has 37 states [2018-06-24 21:39:52,554 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 21:39:52,555 INFO ]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 21:39:52,555 INFO ]: Start difference. First operand 80 states and 164 transitions. Second operand 37 states. [2018-06-24 21:39:53,368 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:53,368 INFO ]: Finished difference Result 569 states and 1516 transitions. [2018-06-24 21:39:53,368 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 21:39:53,368 INFO ]: Start accepts. Automaton has 37 states. Word has length 30 [2018-06-24 21:39:53,368 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:53,370 INFO ]: With dead ends: 569 [2018-06-24 21:39:53,370 INFO ]: Without dead ends: 531 [2018-06-24 21:39:53,371 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=864, Invalid=3168, Unknown=0, NotChecked=0, Total=4032 [2018-06-24 21:39:53,371 INFO ]: Start minimizeSevpa. Operand 531 states. [2018-06-24 21:39:53,376 INFO ]: Finished minimizeSevpa. Reduced states from 531 to 87. [2018-06-24 21:39:53,376 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-24 21:39:53,377 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 188 transitions. [2018-06-24 21:39:53,377 INFO ]: Start accepts. Automaton has 87 states and 188 transitions. Word has length 30 [2018-06-24 21:39:53,377 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:53,377 INFO ]: Abstraction has 87 states and 188 transitions. [2018-06-24 21:39:53,377 INFO ]: Interpolant automaton has 37 states. [2018-06-24 21:39:53,377 INFO ]: Start isEmpty. Operand 87 states and 188 transitions. [2018-06-24 21:39:53,377 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 21:39:53,377 INFO ]: Found error trace [2018-06-24 21:39:53,377 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:53,377 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:53,377 INFO ]: Analyzing trace with hash 472422950, now seen corresponding path program 14 times [2018-06-24 21:39:53,377 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:53,377 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:53,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:53,378 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:53,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:53,391 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:53,600 INFO ]: Checked inductivity of 108 backedges. 29 proven. 43 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 21:39:53,600 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:53,600 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:53,605 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:39:53,662 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:39:53,662 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:53,664 INFO ]: Computing forward predicates... [2018-06-24 21:39:53,683 INFO ]: Checked inductivity of 108 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 21:39:53,702 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:53,702 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-06-24 21:39:53,702 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:39:53,702 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:39:53,702 INFO ]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:39:53,702 INFO ]: Start difference. First operand 87 states and 188 transitions. Second operand 20 states. [2018-06-24 21:39:53,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:53,818 INFO ]: Finished difference Result 115 states and 222 transitions. [2018-06-24 21:39:53,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 21:39:53,818 INFO ]: Start accepts. Automaton has 20 states. Word has length 31 [2018-06-24 21:39:53,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:53,818 INFO ]: With dead ends: 115 [2018-06-24 21:39:53,818 INFO ]: Without dead ends: 115 [2018-06-24 21:39:53,818 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=282, Invalid=530, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:39:53,818 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-24 21:39:53,820 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 80. [2018-06-24 21:39:53,820 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-24 21:39:53,821 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 180 transitions. [2018-06-24 21:39:53,821 INFO ]: Start accepts. Automaton has 80 states and 180 transitions. Word has length 31 [2018-06-24 21:39:53,821 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:53,821 INFO ]: Abstraction has 80 states and 180 transitions. [2018-06-24 21:39:53,821 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:39:53,821 INFO ]: Start isEmpty. Operand 80 states and 180 transitions. [2018-06-24 21:39:53,821 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:39:53,821 INFO ]: Found error trace [2018-06-24 21:39:53,821 INFO ]: trace histogram [8, 8, 7, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:53,821 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:53,821 INFO ]: Analyzing trace with hash 1790803476, now seen corresponding path program 21 times [2018-06-24 21:39:53,821 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:53,821 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:53,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:53,822 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:53,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:53,837 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:54,376 INFO ]: Checked inductivity of 117 backedges. 29 proven. 51 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-24 21:39:54,376 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:54,376 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:54,382 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:39:54,447 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:39:54,447 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:54,450 INFO ]: Computing forward predicates... [2018-06-24 21:39:54,478 INFO ]: Checked inductivity of 117 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-24 21:39:54,497 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:54,497 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 21 [2018-06-24 21:39:54,497 INFO ]: Interpolant automaton has 21 states [2018-06-24 21:39:54,497 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 21:39:54,497 INFO ]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:39:54,497 INFO ]: Start difference. First operand 80 states and 180 transitions. Second operand 21 states. [2018-06-24 21:39:54,634 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:54,634 INFO ]: Finished difference Result 122 states and 228 transitions. [2018-06-24 21:39:54,634 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 21:39:54,634 INFO ]: Start accepts. Automaton has 21 states. Word has length 32 [2018-06-24 21:39:54,634 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:54,634 INFO ]: With dead ends: 122 [2018-06-24 21:39:54,634 INFO ]: Without dead ends: 122 [2018-06-24 21:39:54,634 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=578, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:39:54,634 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-24 21:39:54,636 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 72. [2018-06-24 21:39:54,636 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-24 21:39:54,637 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 170 transitions. [2018-06-24 21:39:54,637 INFO ]: Start accepts. Automaton has 72 states and 170 transitions. Word has length 32 [2018-06-24 21:39:54,637 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:54,637 INFO ]: Abstraction has 72 states and 170 transitions. [2018-06-24 21:39:54,637 INFO ]: Interpolant automaton has 21 states. [2018-06-24 21:39:54,637 INFO ]: Start isEmpty. Operand 72 states and 170 transitions. [2018-06-24 21:39:54,637 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:39:54,637 INFO ]: Found error trace [2018-06-24 21:39:54,637 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:54,637 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:54,638 INFO ]: Analyzing trace with hash 973155026, now seen corresponding path program 22 times [2018-06-24 21:39:54,638 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:54,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:54,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:54,638 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:54,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:54,664 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:54,834 INFO ]: Checked inductivity of 117 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-24 21:39:54,834 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:54,834 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:54,839 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:39:54,907 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:39:54,907 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:54,914 INFO ]: Computing forward predicates... [2018-06-24 21:39:55,466 INFO ]: Checked inductivity of 117 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 21:39:55,485 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:55,485 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 33 [2018-06-24 21:39:55,485 INFO ]: Interpolant automaton has 33 states [2018-06-24 21:39:55,485 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 21:39:55,485 INFO ]: CoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 21:39:55,486 INFO ]: Start difference. First operand 72 states and 170 transitions. Second operand 33 states. [2018-06-24 21:39:57,086 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:57,086 INFO ]: Finished difference Result 253 states and 648 transitions. [2018-06-24 21:39:57,086 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-24 21:39:57,086 INFO ]: Start accepts. Automaton has 33 states. Word has length 32 [2018-06-24 21:39:57,086 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:57,087 INFO ]: With dead ends: 253 [2018-06-24 21:39:57,087 INFO ]: Without dead ends: 161 [2018-06-24 21:39:57,087 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=692, Invalid=3340, Unknown=0, NotChecked=0, Total=4032 [2018-06-24 21:39:57,087 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-24 21:39:57,088 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 84. [2018-06-24 21:39:57,088 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-24 21:39:57,089 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 187 transitions. [2018-06-24 21:39:57,089 INFO ]: Start accepts. Automaton has 84 states and 187 transitions. Word has length 32 [2018-06-24 21:39:57,089 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:57,089 INFO ]: Abstraction has 84 states and 187 transitions. [2018-06-24 21:39:57,089 INFO ]: Interpolant automaton has 33 states. [2018-06-24 21:39:57,089 INFO ]: Start isEmpty. Operand 84 states and 187 transitions. [2018-06-24 21:39:57,089 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:39:57,089 INFO ]: Found error trace [2018-06-24 21:39:57,089 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:57,089 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:57,089 INFO ]: Analyzing trace with hash 1395856852, now seen corresponding path program 15 times [2018-06-24 21:39:57,089 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:57,089 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:57,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:57,090 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:57,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:57,105 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:57,288 INFO ]: Checked inductivity of 117 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 21:39:57,288 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:57,288 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:57,294 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:39:57,361 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:39:57,361 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:57,365 INFO ]: Computing forward predicates... [2018-06-24 21:39:57,826 INFO ]: Checked inductivity of 117 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 21:39:57,845 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:57,845 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2018-06-24 21:39:57,845 INFO ]: Interpolant automaton has 39 states [2018-06-24 21:39:57,845 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 21:39:57,845 INFO ]: CoverageRelationStatistics Valid=212, Invalid=1270, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 21:39:57,846 INFO ]: Start difference. First operand 84 states and 187 transitions. Second operand 39 states. [2018-06-24 21:39:59,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:59,164 INFO ]: Finished difference Result 302 states and 629 transitions. [2018-06-24 21:39:59,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-06-24 21:39:59,164 INFO ]: Start accepts. Automaton has 39 states. Word has length 32 [2018-06-24 21:39:59,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:59,165 INFO ]: With dead ends: 302 [2018-06-24 21:39:59,165 INFO ]: Without dead ends: 240 [2018-06-24 21:39:59,165 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1320, Invalid=4532, Unknown=0, NotChecked=0, Total=5852 [2018-06-24 21:39:59,165 INFO ]: Start minimizeSevpa. Operand 240 states. [2018-06-24 21:39:59,168 INFO ]: Finished minimizeSevpa. Reduced states from 240 to 95. [2018-06-24 21:39:59,168 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-24 21:39:59,169 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 201 transitions. [2018-06-24 21:39:59,169 INFO ]: Start accepts. Automaton has 95 states and 201 transitions. Word has length 32 [2018-06-24 21:39:59,169 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:59,169 INFO ]: Abstraction has 95 states and 201 transitions. [2018-06-24 21:39:59,169 INFO ]: Interpolant automaton has 39 states. [2018-06-24 21:39:59,169 INFO ]: Start isEmpty. Operand 95 states and 201 transitions. [2018-06-24 21:39:59,169 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 21:39:59,169 INFO ]: Found error trace [2018-06-24 21:39:59,169 INFO ]: trace histogram [8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:59,169 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:59,169 INFO ]: Analyzing trace with hash -684019802, now seen corresponding path program 23 times [2018-06-24 21:39:59,169 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:59,169 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:59,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:59,170 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:59,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:59,192 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:59,372 INFO ]: Checked inductivity of 127 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 21:39:59,372 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:59,372 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:59,377 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:39:59,441 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 21:39:59,441 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:59,444 INFO ]: Computing forward predicates... [2018-06-24 21:39:59,462 INFO ]: Checked inductivity of 127 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 21:39:59,481 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:59,481 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-24 21:39:59,481 INFO ]: Interpolant automaton has 22 states [2018-06-24 21:39:59,481 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 21:39:59,481 INFO ]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:39:59,481 INFO ]: Start difference. First operand 95 states and 201 transitions. Second operand 22 states. [2018-06-24 21:39:59,812 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:59,812 INFO ]: Finished difference Result 627 states and 1651 transitions. [2018-06-24 21:39:59,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 21:39:59,814 INFO ]: Start accepts. Automaton has 22 states. Word has length 33 [2018-06-24 21:39:59,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:59,816 INFO ]: With dead ends: 627 [2018-06-24 21:39:59,816 INFO ]: Without dead ends: 627 [2018-06-24 21:39:59,816 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=533, Invalid=949, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 21:39:59,816 INFO ]: Start minimizeSevpa. Operand 627 states. [2018-06-24 21:39:59,822 INFO ]: Finished minimizeSevpa. Reduced states from 627 to 114. [2018-06-24 21:39:59,822 INFO ]: Start removeUnreachable. Operand 114 states. [2018-06-24 21:39:59,822 INFO ]: Finished removeUnreachable. Reduced from 114 states to 114 states and 241 transitions. [2018-06-24 21:39:59,822 INFO ]: Start accepts. Automaton has 114 states and 241 transitions. Word has length 33 [2018-06-24 21:39:59,822 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:59,822 INFO ]: Abstraction has 114 states and 241 transitions. [2018-06-24 21:39:59,822 INFO ]: Interpolant automaton has 22 states. [2018-06-24 21:39:59,822 INFO ]: Start isEmpty. Operand 114 states and 241 transitions. [2018-06-24 21:39:59,823 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 21:39:59,823 INFO ]: Found error trace [2018-06-24 21:39:59,823 INFO ]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:59,823 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:59,823 INFO ]: Analyzing trace with hash 566206255, now seen corresponding path program 16 times [2018-06-24 21:39:59,823 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:59,823 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:59,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:59,823 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:59,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:59,841 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:00,012 INFO ]: Checked inductivity of 135 backedges. 37 proven. 53 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 21:40:00,012 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:00,012 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:00,018 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:40:00,081 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:40:00,081 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:00,084 INFO ]: Computing forward predicates... [2018-06-24 21:40:00,462 INFO ]: Checked inductivity of 135 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 21:40:00,491 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:00,491 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-24 21:40:00,491 INFO ]: Interpolant automaton has 22 states [2018-06-24 21:40:00,491 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 21:40:00,491 INFO ]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:40:00,491 INFO ]: Start difference. First operand 114 states and 241 transitions. Second operand 22 states. [2018-06-24 21:40:01,446 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:01,446 INFO ]: Finished difference Result 234 states and 486 transitions. [2018-06-24 21:40:01,446 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 21:40:01,446 INFO ]: Start accepts. Automaton has 22 states. Word has length 34 [2018-06-24 21:40:01,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:01,447 INFO ]: With dead ends: 234 [2018-06-24 21:40:01,447 INFO ]: Without dead ends: 234 [2018-06-24 21:40:01,447 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=568, Invalid=1072, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:40:01,447 INFO ]: Start minimizeSevpa. Operand 234 states. [2018-06-24 21:40:01,450 INFO ]: Finished minimizeSevpa. Reduced states from 234 to 106. [2018-06-24 21:40:01,450 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-24 21:40:01,450 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 232 transitions. [2018-06-24 21:40:01,450 INFO ]: Start accepts. Automaton has 106 states and 232 transitions. Word has length 34 [2018-06-24 21:40:01,450 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:01,450 INFO ]: Abstraction has 106 states and 232 transitions. [2018-06-24 21:40:01,450 INFO ]: Interpolant automaton has 22 states. [2018-06-24 21:40:01,450 INFO ]: Start isEmpty. Operand 106 states and 232 transitions. [2018-06-24 21:40:01,451 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 21:40:01,451 INFO ]: Found error trace [2018-06-24 21:40:01,451 INFO ]: trace histogram [9, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:01,451 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:01,451 INFO ]: Analyzing trace with hash 269748053, now seen corresponding path program 24 times [2018-06-24 21:40:01,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:01,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:01,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:01,451 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:01,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:01,472 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:02,221 INFO ]: Checked inductivity of 136 backedges. 46 proven. 53 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-24 21:40:02,221 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:02,221 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:02,227 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:40:02,298 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 21:40:02,298 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:02,302 INFO ]: Computing forward predicates... [2018-06-24 21:40:02,815 INFO ]: Checked inductivity of 136 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 21:40:02,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:02,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 41 [2018-06-24 21:40:02,834 INFO ]: Interpolant automaton has 41 states [2018-06-24 21:40:02,834 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-24 21:40:02,834 INFO ]: CoverageRelationStatistics Valid=280, Invalid=1360, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:40:02,834 INFO ]: Start difference. First operand 106 states and 232 transitions. Second operand 41 states. Received shutdown request... [2018-06-24 21:40:03,028 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 21:40:03,029 WARN ]: Verification canceled [2018-06-24 21:40:03,030 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:40:03,031 WARN ]: Timeout [2018-06-24 21:40:03,031 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:40:03 BasicIcfg [2018-06-24 21:40:03,031 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:40:03,032 INFO ]: Toolchain (without parser) took 55860.05 ms. Allocated memory was 309.3 MB in the beginning and 783.8 MB in the end (delta: 474.5 MB). Free memory was 263.7 MB in the beginning and 387.4 MB in the end (delta: -123.7 MB). Peak memory consumption was 350.8 MB. Max. memory is 3.6 GB. [2018-06-24 21:40:03,033 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:40:03,033 INFO ]: ChcToBoogie took 59.66 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:40:03,033 INFO ]: Boogie Preprocessor took 50.51 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:40:03,034 INFO ]: RCFGBuilder took 337.46 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 247.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:40:03,034 INFO ]: BlockEncodingV2 took 66.93 ms. Allocated memory is still 309.3 MB. Free memory was 247.7 MB in the beginning and 245.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:40:03,035 INFO ]: TraceAbstraction took 55336.66 ms. Allocated memory was 309.3 MB in the beginning and 783.8 MB in the end (delta: 474.5 MB). Free memory was 244.7 MB in the beginning and 387.4 MB in the end (delta: -142.7 MB). Peak memory consumption was 331.8 MB. Max. memory is 3.6 GB. [2018-06-24 21:40:03,037 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 20 edges - StatisticsResult: Encoded RCFG 8 locations, 16 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.66 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 50.51 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 337.46 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 247.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 66.93 ms. Allocated memory is still 309.3 MB. Free memory was 247.7 MB in the beginning and 245.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55336.66 ms. Allocated memory was 309.3 MB in the beginning and 783.8 MB in the end (delta: 474.5 MB). Free memory was 244.7 MB in the beginning and 387.4 MB in the end (delta: -142.7 MB). Peak memory consumption was 331.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (106states) and interpolant automaton (currently 21 states, 41 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 45 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. TIMEOUT Result, 55.2s OverallTime, 53 OverallIterations, 9 TraceHistogramMax, 26.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 499 SDtfs, 1954 SDslu, 3708 SDs, 0 SdLazy, 11118 SolverSat, 6371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2458 GetRequests, 823 SyntacticMatches, 83 SemanticMatches, 1551 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12381 ImplicationChecksByTransitivity, 35.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=41, 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, 52 MinimizatonAttempts, 2895 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 23.6s InterpolantComputationTime, 2007 NumberOfCodeBlocks, 2007 NumberOfCodeBlocksAsserted, 169 NumberOfCheckSat, 1909 ConstructedInterpolants, 5 QuantifiedInterpolants, 212109 SizeOfPredicates, 201 NumberOfNonLiveVariables, 17917 ConjunctsInSsa, 3058 ConjunctsInUnsatCore, 98 InterpolantComputations, 10 PerfectInterpolantSequences, 2845/4751 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-40-03-047.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-40-03-047.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-40-03-047.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-40-03-047.csv Completed graceful shutdown