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__barthe.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:41:05,833 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:41:05,835 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:41:05,846 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:41:05,847 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:41:05,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:41:05,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:41:05,852 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:41:05,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:41:05,854 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:41:05,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:41:05,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:41:05,857 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:41:05,858 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:41:05,859 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:41:05,860 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:41:05,863 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:41:05,876 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:41:05,878 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:41:05,879 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:41:05,880 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:41:05,882 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:41:05,882 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:41:05,882 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:41:05,883 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:41:05,884 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:41:05,884 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:41:05,885 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:41:05,886 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:41:05,886 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:41:05,887 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:41:05,888 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:41:05,888 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:41:05,889 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:41:05,889 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:41:05,890 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:41:05,909 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:41:05,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:41:05,910 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:41:05,910 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:41:05,911 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:41:05,911 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:41:05,911 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:41:05,912 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:41:05,912 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:41:05,912 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:41:05,912 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:41:05,912 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:41:05,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:41:05,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:41:05,914 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:41:05,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:41:05,915 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:41:05,915 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:41:05,915 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:41:05,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:41:05,915 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:41:05,917 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:41:05,917 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:41:05,961 INFO ]: Repository-Root is: /tmp [2018-06-24 21:41:05,980 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:41:05,988 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:41:05,990 INFO ]: Initializing SmtParser... [2018-06-24 21:41:05,990 INFO ]: SmtParser initialized [2018-06-24 21:41:05,990 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe.smt2 [2018-06-24 21:41:05,992 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:41:06,081 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@33b07166 [2018-06-24 21:41:06,227 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe.smt2 [2018-06-24 21:41:06,232 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:41:06,238 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:41:06,239 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:41:06,239 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:41:06,240 INFO ]: ChcToBoogie initialized [2018-06-24 21:41:06,243 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:41:06" (1/1) ... [2018-06-24 21:41:06,303 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:41:06 Unit [2018-06-24 21:41:06,303 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:41:06,307 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:41:06,307 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:41:06,307 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:41:06,328 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:41:06" (1/1) ... [2018-06-24 21:41:06,328 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:41:06" (1/1) ... [2018-06-24 21:41:06,333 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:41:06" (1/1) ... [2018-06-24 21:41:06,333 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:41:06" (1/1) ... [2018-06-24 21:41:06,335 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:41:06" (1/1) ... [2018-06-24 21:41:06,338 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:41:06" (1/1) ... [2018-06-24 21:41:06,339 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:41:06" (1/1) ... [2018-06-24 21:41:06,340 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:41:06,341 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:41:06,341 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:41:06,341 INFO ]: RCFGBuilder initialized [2018-06-24 21:41:06,342 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:41:06" (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:41:06,356 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:41:06,356 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:41:06,356 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:41:06,356 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:41:06,356 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:41:06,356 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:41:06,644 INFO ]: Using library mode [2018-06-24 21:41:06,645 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:41:06 BoogieIcfgContainer [2018-06-24 21:41:06,645 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:41:06,645 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:41:06,645 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:41:06,646 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:41:06,647 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:41:06" (1/1) ... [2018-06-24 21:41:06,660 INFO ]: Initial Icfg 10 locations, 12 edges [2018-06-24 21:41:06,662 INFO ]: Using Remove infeasible edges [2018-06-24 21:41:06,662 INFO ]: Using Maximize final states [2018-06-24 21:41:06,663 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:41:06,663 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:41:06,664 INFO ]: Using Remove sink states [2018-06-24 21:41:06,665 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:41:06,665 INFO ]: Using Use SBE [2018-06-24 21:41:06,671 INFO ]: SBE split 0 edges [2018-06-24 21:41:06,675 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:41:06,677 INFO ]: 0 new accepting states [2018-06-24 21:41:06,732 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 21:41:06,734 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:41:06,737 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:41:06,737 INFO ]: 0 new accepting states [2018-06-24 21:41:06,737 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:41:06,737 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:41:06,738 INFO ]: Encoded RCFG 6 locations, 8 edges [2018-06-24 21:41:06,738 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:41:06 BasicIcfg [2018-06-24 21:41:06,738 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:41:06,739 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:41:06,739 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:41:06,743 INFO ]: TraceAbstraction initialized [2018-06-24 21:41:06,743 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:41:06" (1/4) ... [2018-06-24 21:41:06,744 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b160929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:41:06, skipping insertion in model container [2018-06-24 21:41:06,744 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:41:06" (2/4) ... [2018-06-24 21:41:06,744 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b160929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:41:06, skipping insertion in model container [2018-06-24 21:41:06,744 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:41:06" (3/4) ... [2018-06-24 21:41:06,744 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b160929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:41:06, skipping insertion in model container [2018-06-24 21:41:06,744 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:41:06" (4/4) ... [2018-06-24 21:41:06,746 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:41:06,754 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:41:06,760 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:41:06,800 INFO ]: Using default assertion order modulation [2018-06-24 21:41:06,800 INFO ]: Interprodecural is true [2018-06-24 21:41:06,800 INFO ]: Hoare is false [2018-06-24 21:41:06,801 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:41:06,801 INFO ]: Backedges is TWOTRACK [2018-06-24 21:41:06,801 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:41:06,801 INFO ]: Difference is false [2018-06-24 21:41:06,801 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:41:06,801 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:41:06,810 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 21:41:06,819 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:41:06,819 INFO ]: Found error trace [2018-06-24 21:41:06,820 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:41:06,820 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:06,825 INFO ]: Analyzing trace with hash 37311172, now seen corresponding path program 1 times [2018-06-24 21:41:06,827 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:06,827 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:06,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:06,858 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:06,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:06,905 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:06,955 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:41:06,957 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:41:06,957 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:41:06,958 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:41:06,969 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:41:06,970 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:41:06,971 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 21:41:07,071 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:07,071 INFO ]: Finished difference Result 7 states and 11 transitions. [2018-06-24 21:41:07,071 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:41:07,072 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:41:07,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:07,079 INFO ]: With dead ends: 7 [2018-06-24 21:41:07,080 INFO ]: Without dead ends: 7 [2018-06-24 21:41:07,081 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:41:07,095 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:41:07,126 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:41:07,127 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:41:07,128 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-24 21:41:07,129 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-06-24 21:41:07,129 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:07,129 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-24 21:41:07,129 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:41:07,129 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-24 21:41:07,129 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:41:07,129 INFO ]: Found error trace [2018-06-24 21:41:07,129 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:41:07,129 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:07,129 INFO ]: Analyzing trace with hash 1156261132, now seen corresponding path program 1 times [2018-06-24 21:41:07,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:07,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:07,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:07,130 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:07,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:07,158 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:07,374 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:41:07,374 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:07,374 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:41:07,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:07,429 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:07,435 INFO ]: Computing forward predicates... [2018-06-24 21:41:07,476 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:41:07,508 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:41:07,508 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-06-24 21:41:07,508 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:41:07,508 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:41:07,508 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:41:07,509 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 5 states. [2018-06-24 21:41:07,761 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:07,761 INFO ]: Finished difference Result 9 states and 16 transitions. [2018-06-24 21:41:07,762 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:41:07,762 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 21:41:07,762 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:07,763 INFO ]: With dead ends: 9 [2018-06-24 21:41:07,763 INFO ]: Without dead ends: 7 [2018-06-24 21:41:07,763 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:41:07,764 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:41:07,764 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:41:07,765 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:41:07,765 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-06-24 21:41:07,765 INFO ]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 6 [2018-06-24 21:41:07,765 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:07,765 INFO ]: Abstraction has 7 states and 9 transitions. [2018-06-24 21:41:07,765 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:41:07,765 INFO ]: Start isEmpty. Operand 7 states and 9 transitions. [2018-06-24 21:41:07,765 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:41:07,765 INFO ]: Found error trace [2018-06-24 21:41:07,765 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:41:07,765 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:07,765 INFO ]: Analyzing trace with hash 1156290923, now seen corresponding path program 1 times [2018-06-24 21:41:07,765 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:07,765 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:07,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:07,769 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:07,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:07,781 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:07,825 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:41:07,825 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:41:07,825 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:41:07,825 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:41:07,826 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:41:07,826 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:41:07,826 INFO ]: Start difference. First operand 7 states and 9 transitions. Second operand 3 states. [2018-06-24 21:41:07,849 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:07,849 INFO ]: Finished difference Result 8 states and 11 transitions. [2018-06-24 21:41:07,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:41:07,849 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:41:07,850 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:07,851 INFO ]: With dead ends: 8 [2018-06-24 21:41:07,851 INFO ]: Without dead ends: 7 [2018-06-24 21:41:07,851 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:41:07,851 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:41:07,852 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:41:07,852 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:41:07,852 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-06-24 21:41:07,852 INFO ]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 6 [2018-06-24 21:41:07,852 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:07,852 INFO ]: Abstraction has 7 states and 7 transitions. [2018-06-24 21:41:07,852 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:41:07,852 INFO ]: Start isEmpty. Operand 7 states and 7 transitions. [2018-06-24 21:41:07,853 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:41:07,853 INFO ]: Found error trace [2018-06-24 21:41:07,853 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:41:07,853 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:07,853 INFO ]: Analyzing trace with hash 1156350505, now seen corresponding path program 1 times [2018-06-24 21:41:07,853 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:07,853 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:07,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:07,854 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:07,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:07,902 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:08,099 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:41:08,099 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:08,099 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:41:08,107 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:08,142 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:08,143 INFO ]: Computing forward predicates... [2018-06-24 21:41:08,171 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:41:08,202 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:08,202 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 21:41:08,203 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:41:08,203 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:41:08,203 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:41:08,203 INFO ]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-06-24 21:41:08,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:08,215 INFO ]: Finished difference Result 8 states and 8 transitions. [2018-06-24 21:41:08,218 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:41:08,218 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 21:41:08,219 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:08,219 INFO ]: With dead ends: 8 [2018-06-24 21:41:08,219 INFO ]: Without dead ends: 8 [2018-06-24 21:41:08,219 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:41:08,219 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 21:41:08,220 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 21:41:08,220 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:41:08,221 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-06-24 21:41:08,221 INFO ]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-06-24 21:41:08,221 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:08,221 INFO ]: Abstraction has 8 states and 8 transitions. [2018-06-24 21:41:08,221 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:41:08,221 INFO ]: Start isEmpty. Operand 8 states and 8 transitions. [2018-06-24 21:41:08,221 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:41:08,221 INFO ]: Found error trace [2018-06-24 21:41:08,221 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 21:41:08,221 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:08,221 INFO ]: Analyzing trace with hash 1486831460, now seen corresponding path program 2 times [2018-06-24 21:41:08,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:08,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:08,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:08,222 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:08,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:08,260 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:08,460 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:08,460 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:08,460 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:41:08,478 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:41:08,528 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:41:08,528 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:08,530 INFO ]: Computing forward predicates... [2018-06-24 21:41:08,582 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:08,605 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:08,605 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 21:41:08,605 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:41:08,605 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:41:08,605 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:41:08,606 INFO ]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-06-24 21:41:08,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:08,639 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-24 21:41:08,640 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:41:08,640 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 21:41:08,640 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:08,640 INFO ]: With dead ends: 9 [2018-06-24 21:41:08,640 INFO ]: Without dead ends: 9 [2018-06-24 21:41:08,640 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:41:08,640 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:41:08,642 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 21:41:08,642 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:41:08,642 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-24 21:41:08,642 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-24 21:41:08,642 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:08,642 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-24 21:41:08,642 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:41:08,642 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-24 21:41:08,642 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:41:08,642 INFO ]: Found error trace [2018-06-24 21:41:08,642 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-24 21:41:08,643 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:08,643 INFO ]: Analyzing trace with hash -1153160823, now seen corresponding path program 3 times [2018-06-24 21:41:08,643 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:08,643 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:08,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:08,643 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:08,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:08,673 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:08,836 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:08,836 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:08,836 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:41:08,843 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:41:08,908 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:41:08,908 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:08,911 INFO ]: Computing forward predicates... [2018-06-24 21:41:09,103 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:09,125 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:09,125 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 21:41:09,125 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:41:09,125 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:41:09,125 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:41:09,126 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-06-24 21:41:09,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:09,338 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-24 21:41:09,338 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:41:09,338 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 21:41:09,338 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:09,339 INFO ]: With dead ends: 10 [2018-06-24 21:41:09,339 INFO ]: Without dead ends: 10 [2018-06-24 21:41:09,339 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:41:09,339 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:41:09,340 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:41:09,340 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:41:09,340 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-24 21:41:09,340 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-24 21:41:09,340 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:09,340 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-24 21:41:09,340 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:41:09,340 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-24 21:41:09,341 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:41:09,341 INFO ]: Found error trace [2018-06-24 21:41:09,341 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-24 21:41:09,341 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:09,341 INFO ]: Analyzing trace with hash -1388542972, now seen corresponding path program 4 times [2018-06-24 21:41:09,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:09,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:09,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:09,342 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:09,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:09,382 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:09,653 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:09,653 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:09,653 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:41:09,664 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:41:09,701 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:41:09,701 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:09,705 INFO ]: Computing forward predicates... [2018-06-24 21:41:09,756 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:09,777 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:09,777 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-24 21:41:09,777 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:41:09,777 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:41:09,777 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:41:09,778 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2018-06-24 21:41:09,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:09,822 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-24 21:41:09,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:41:09,823 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 21:41:09,823 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:09,824 INFO ]: With dead ends: 11 [2018-06-24 21:41:09,824 INFO ]: Without dead ends: 11 [2018-06-24 21:41:09,824 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:41:09,824 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:41:09,825 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 21:41:09,825 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:41:09,826 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-24 21:41:09,826 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-24 21:41:09,826 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:09,826 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-24 21:41:09,826 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:41:09,826 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-24 21:41:09,826 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:41:09,826 INFO ]: Found error trace [2018-06-24 21:41:09,826 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-24 21:41:09,826 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:09,826 INFO ]: Analyzing trace with hash -95454999, now seen corresponding path program 5 times [2018-06-24 21:41:09,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:09,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:09,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:09,827 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:09,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:09,846 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:10,282 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:10,282 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:10,282 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:41:10,292 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:41:10,371 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:41:10,371 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:10,375 INFO ]: Computing forward predicates... [2018-06-24 21:41:10,626 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:10,657 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:10,657 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 21:41:10,657 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:41:10,657 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:41:10,657 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:41:10,658 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2018-06-24 21:41:10,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:10,747 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-24 21:41:10,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:41:10,748 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 21:41:10,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:10,748 INFO ]: With dead ends: 12 [2018-06-24 21:41:10,748 INFO ]: Without dead ends: 12 [2018-06-24 21:41:10,748 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:41:10,749 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:41:10,749 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 21:41:10,749 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:41:10,750 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-24 21:41:10,750 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-24 21:41:10,750 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:10,750 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-24 21:41:10,750 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:41:10,750 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-24 21:41:10,750 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:41:10,750 INFO ]: Found error trace [2018-06-24 21:41:10,750 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-24 21:41:10,750 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:10,750 INFO ]: Analyzing trace with hash 1335566500, now seen corresponding path program 6 times [2018-06-24 21:41:10,750 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:10,750 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:10,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:10,751 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:10,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:10,771 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:11,049 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:11,049 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:11,049 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:41:11,063 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:41:11,141 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 21:41:11,141 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:11,145 INFO ]: Computing forward predicates... [2018-06-24 21:41:11,230 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:11,250 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:11,258 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-24 21:41:11,258 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:41:11,258 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:41:11,258 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:41:11,258 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2018-06-24 21:41:11,308 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:11,308 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-24 21:41:11,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:41:11,308 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 21:41:11,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:11,309 INFO ]: With dead ends: 13 [2018-06-24 21:41:11,309 INFO ]: Without dead ends: 13 [2018-06-24 21:41:11,309 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:41:11,309 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:41:11,310 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 21:41:11,310 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:41:11,310 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-24 21:41:11,311 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-24 21:41:11,311 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:11,311 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-24 21:41:11,311 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:41:11,311 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-24 21:41:11,311 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:41:11,311 INFO ]: Found error trace [2018-06-24 21:41:11,311 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-24 21:41:11,311 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:11,311 INFO ]: Analyzing trace with hash -1547407287, now seen corresponding path program 7 times [2018-06-24 21:41:11,311 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:11,311 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:11,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:11,312 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:11,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:11,350 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:11,489 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:11,490 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:11,490 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:41:11,500 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:11,533 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:11,537 INFO ]: Computing forward predicates... [2018-06-24 21:41:11,660 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:11,679 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:11,679 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 21:41:11,679 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:41:11,679 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:41:11,680 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:41:11,680 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-06-24 21:41:11,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:11,749 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-24 21:41:11,749 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:41:11,749 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 21:41:11,749 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:11,749 INFO ]: With dead ends: 14 [2018-06-24 21:41:11,749 INFO ]: Without dead ends: 14 [2018-06-24 21:41:11,750 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:41:11,750 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:41:11,751 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 21:41:11,751 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:41:11,751 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-24 21:41:11,752 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-24 21:41:11,752 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:11,752 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-24 21:41:11,752 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:41:11,752 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-24 21:41:11,752 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:41:11,752 INFO ]: Found error trace [2018-06-24 21:41:11,752 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-24 21:41:11,752 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:11,752 INFO ]: Analyzing trace with hash -725281468, now seen corresponding path program 8 times [2018-06-24 21:41:11,752 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:11,752 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:11,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:11,753 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:11,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:11,776 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:12,077 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:12,077 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:12,077 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:41:12,083 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:41:12,126 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:41:12,126 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:12,132 INFO ]: Computing forward predicates... [2018-06-24 21:41:12,285 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:12,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:12,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-24 21:41:12,304 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:41:12,304 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:41:12,304 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:41:12,304 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-06-24 21:41:12,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:12,402 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-24 21:41:12,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:41:12,403 INFO ]: Start accepts. Automaton has 13 states. Word has length 13 [2018-06-24 21:41:12,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:12,403 INFO ]: With dead ends: 15 [2018-06-24 21:41:12,403 INFO ]: Without dead ends: 15 [2018-06-24 21:41:12,404 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:41:12,404 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:41:12,405 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 21:41:12,405 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:41:12,405 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-24 21:41:12,405 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-24 21:41:12,405 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:12,405 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-24 21:41:12,405 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:41:12,405 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-24 21:41:12,405 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:41:12,406 INFO ]: Found error trace [2018-06-24 21:41:12,406 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-24 21:41:12,406 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:12,406 INFO ]: Analyzing trace with hash -1009184855, now seen corresponding path program 9 times [2018-06-24 21:41:12,406 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:12,406 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:12,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:12,406 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:12,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:12,430 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:12,704 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:12,704 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:12,704 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:41:12,710 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:41:12,772 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:41:12,772 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:12,777 INFO ]: Computing forward predicates... [2018-06-24 21:41:12,850 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:12,868 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:12,868 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 21:41:12,868 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:41:12,868 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:41:12,868 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:41:12,869 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-06-24 21:41:12,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:12,989 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-24 21:41:12,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:41:12,990 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-24 21:41:12,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:12,990 INFO ]: With dead ends: 16 [2018-06-24 21:41:12,990 INFO ]: Without dead ends: 16 [2018-06-24 21:41:12,990 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:41:12,990 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:41:12,992 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 21:41:12,992 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:41:12,992 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-24 21:41:12,992 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-24 21:41:12,992 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:12,992 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-24 21:41:12,992 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:41:12,992 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-24 21:41:12,993 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:41:12,993 INFO ]: Found error trace [2018-06-24 21:41:12,993 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-24 21:41:12,993 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:12,993 INFO ]: Analyzing trace with hash -1220255260, now seen corresponding path program 10 times [2018-06-24 21:41:12,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:12,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:12,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:12,994 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:12,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:13,020 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:13,248 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:13,248 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:13,248 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:41:13,254 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:41:13,310 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:41:13,310 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:13,316 INFO ]: Computing forward predicates... [2018-06-24 21:41:13,412 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:13,432 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:13,432 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-24 21:41:13,432 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:41:13,432 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:41:13,432 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:41:13,432 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2018-06-24 21:41:13,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:13,576 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-24 21:41:13,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:41:13,576 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-24 21:41:13,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:13,576 INFO ]: With dead ends: 17 [2018-06-24 21:41:13,576 INFO ]: Without dead ends: 17 [2018-06-24 21:41:13,576 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:41:13,577 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:41:13,578 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 21:41:13,578 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:41:13,578 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-24 21:41:13,578 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-24 21:41:13,578 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:13,578 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-24 21:41:13,578 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:41:13,578 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-24 21:41:13,579 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:41:13,579 INFO ]: Found error trace [2018-06-24 21:41:13,579 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-24 21:41:13,579 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:13,579 INFO ]: Analyzing trace with hash 826496777, now seen corresponding path program 11 times [2018-06-24 21:41:13,579 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:13,579 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:13,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:13,579 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:13,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:13,647 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:14,021 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:14,022 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:14,022 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:41:14,028 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:41:14,123 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 21:41:14,123 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:14,131 INFO ]: Computing forward predicates... [2018-06-24 21:41:14,196 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:14,221 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:14,221 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-24 21:41:14,221 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:41:14,221 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:41:14,221 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:41:14,221 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2018-06-24 21:41:14,320 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:14,320 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-24 21:41:14,320 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:41:14,320 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-24 21:41:14,320 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:14,320 INFO ]: With dead ends: 18 [2018-06-24 21:41:14,320 INFO ]: Without dead ends: 18 [2018-06-24 21:41:14,321 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:41:14,321 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 21:41:14,322 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 21:41:14,322 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 21:41:14,322 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-24 21:41:14,323 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-24 21:41:14,323 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:14,323 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-24 21:41:14,323 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:41:14,323 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-24 21:41:14,323 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:41:14,323 INFO ]: Found error trace [2018-06-24 21:41:14,323 INFO ]: trace histogram [12, 1, 1, 1, 1, 1] [2018-06-24 21:41:14,323 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:14,323 INFO ]: Analyzing trace with hash -148699516, now seen corresponding path program 12 times [2018-06-24 21:41:14,323 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:14,323 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:14,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:14,324 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:14,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:14,356 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:14,839 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:14,839 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:14,839 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:41:14,844 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:41:14,898 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 21:41:14,898 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:14,903 INFO ]: Computing forward predicates... [2018-06-24 21:41:15,369 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:15,399 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:15,400 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-24 21:41:15,400 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:41:15,400 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:41:15,400 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:41:15,400 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2018-06-24 21:41:15,552 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:15,552 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-24 21:41:15,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:41:15,553 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-24 21:41:15,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:15,553 INFO ]: With dead ends: 19 [2018-06-24 21:41:15,553 INFO ]: Without dead ends: 19 [2018-06-24 21:41:15,554 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:41:15,554 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 21:41:15,555 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 21:41:15,555 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:41:15,556 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-24 21:41:15,556 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-24 21:41:15,556 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:15,556 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-24 21:41:15,556 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:41:15,556 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-24 21:41:15,556 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:41:15,556 INFO ]: Found error trace [2018-06-24 21:41:15,556 INFO ]: trace histogram [13, 1, 1, 1, 1, 1] [2018-06-24 21:41:15,556 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:15,556 INFO ]: Analyzing trace with hash -315013527, now seen corresponding path program 13 times [2018-06-24 21:41:15,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:15,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:15,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:15,557 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:15,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:15,592 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:16,737 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:16,737 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:16,814 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:41:16,819 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:16,880 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:16,886 INFO ]: Computing forward predicates... [2018-06-24 21:41:16,958 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:16,976 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:16,976 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 21:41:16,977 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:41:16,977 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:41:16,977 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:41:16,977 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2018-06-24 21:41:17,293 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:17,293 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-24 21:41:17,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:41:17,296 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 21:41:17,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:17,296 INFO ]: With dead ends: 20 [2018-06-24 21:41:17,296 INFO ]: Without dead ends: 20 [2018-06-24 21:41:17,297 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:41:17,297 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 21:41:17,298 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 21:41:17,298 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:41:17,298 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-24 21:41:17,298 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-24 21:41:17,298 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:17,298 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-24 21:41:17,298 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:41:17,298 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-24 21:41:17,299 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:41:17,299 INFO ]: Found error trace [2018-06-24 21:41:17,299 INFO ]: trace histogram [14, 1, 1, 1, 1, 1] [2018-06-24 21:41:17,299 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:17,299 INFO ]: Analyzing trace with hash -1175780572, now seen corresponding path program 14 times [2018-06-24 21:41:17,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:17,299 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:17,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:17,299 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:17,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:17,334 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:17,891 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:17,891 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:17,891 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:41:17,896 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:41:17,978 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:41:17,978 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:17,986 INFO ]: Computing forward predicates... [2018-06-24 21:41:18,257 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:18,276 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:18,276 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-06-24 21:41:18,276 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:41:18,276 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:41:18,277 INFO ]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:41:18,277 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2018-06-24 21:41:18,445 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:18,445 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-24 21:41:18,446 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:41:18,446 INFO ]: Start accepts. Automaton has 18 states. Word has length 19 [2018-06-24 21:41:18,446 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:18,446 INFO ]: With dead ends: 21 [2018-06-24 21:41:18,446 INFO ]: Without dead ends: 21 [2018-06-24 21:41:18,447 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:41:18,447 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 21:41:18,449 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 21:41:18,449 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 21:41:18,449 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-24 21:41:18,449 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-24 21:41:18,449 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:18,449 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-24 21:41:18,449 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:41:18,449 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-24 21:41:18,450 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:41:18,450 INFO ]: Found error trace [2018-06-24 21:41:18,450 INFO ]: trace histogram [15, 1, 1, 1, 1, 1] [2018-06-24 21:41:18,450 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:18,450 INFO ]: Analyzing trace with hash -2089755191, now seen corresponding path program 15 times [2018-06-24 21:41:18,450 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:18,450 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:18,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:18,450 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:18,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:18,513 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:18,964 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:18,964 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:18,964 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:41:18,970 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:41:19,027 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 21:41:19,027 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:19,033 INFO ]: Computing forward predicates... [2018-06-24 21:41:19,088 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:19,108 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:19,108 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 21:41:19,108 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:41:19,108 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:41:19,108 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:41:19,108 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2018-06-24 21:41:19,315 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:19,315 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-24 21:41:19,315 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 21:41:19,315 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-24 21:41:19,315 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:19,316 INFO ]: With dead ends: 22 [2018-06-24 21:41:19,316 INFO ]: Without dead ends: 22 [2018-06-24 21:41:19,316 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:41:19,316 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:41:19,318 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-24 21:41:19,318 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 21:41:19,318 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-24 21:41:19,318 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-24 21:41:19,318 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:19,318 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-24 21:41:19,318 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:41:19,319 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-24 21:41:19,319 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 21:41:19,319 INFO ]: Found error trace [2018-06-24 21:41:19,319 INFO ]: trace histogram [16, 1, 1, 1, 1, 1] [2018-06-24 21:41:19,319 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:19,319 INFO ]: Analyzing trace with hash -358197308, now seen corresponding path program 16 times [2018-06-24 21:41:19,319 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:19,319 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:19,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:19,320 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:19,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:19,362 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:20,067 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:20,068 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:20,068 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:41:20,073 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:41:20,155 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:41:20,155 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:20,162 INFO ]: Computing forward predicates... [2018-06-24 21:41:20,233 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:20,263 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:20,263 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-06-24 21:41:20,263 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:41:20,263 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:41:20,263 INFO ]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:41:20,264 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 20 states. [2018-06-24 21:41:20,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:20,470 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-24 21:41:20,471 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 21:41:20,471 INFO ]: Start accepts. Automaton has 20 states. Word has length 21 [2018-06-24 21:41:20,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:20,472 INFO ]: With dead ends: 23 [2018-06-24 21:41:20,472 INFO ]: Without dead ends: 23 [2018-06-24 21:41:20,472 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:41:20,472 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 21:41:20,474 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 21:41:20,474 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 21:41:20,474 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-24 21:41:20,474 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-24 21:41:20,474 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:20,474 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-24 21:41:20,474 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:41:20,474 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-24 21:41:20,475 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 21:41:20,475 INFO ]: Found error trace [2018-06-24 21:41:20,475 INFO ]: trace histogram [17, 1, 1, 1, 1, 1] [2018-06-24 21:41:20,475 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:20,475 INFO ]: Analyzing trace with hash 1780489513, now seen corresponding path program 17 times [2018-06-24 21:41:20,475 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:20,475 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:20,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:20,475 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:20,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:20,533 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:21,132 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:21,132 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:21,132 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:41:21,138 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:41:21,312 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 21:41:21,312 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:21,325 INFO ]: Computing forward predicates... [2018-06-24 21:41:21,454 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:21,475 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:21,475 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-24 21:41:21,475 INFO ]: Interpolant automaton has 21 states [2018-06-24 21:41:21,475 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 21:41:21,475 INFO ]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:41:21,475 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 21 states. [2018-06-24 21:41:21,710 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:21,710 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-24 21:41:21,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 21:41:21,710 INFO ]: Start accepts. Automaton has 21 states. Word has length 22 [2018-06-24 21:41:21,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:21,711 INFO ]: With dead ends: 24 [2018-06-24 21:41:21,711 INFO ]: Without dead ends: 24 [2018-06-24 21:41:21,711 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:41:21,711 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 21:41:21,712 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 21:41:21,713 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 21:41:21,713 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-24 21:41:21,713 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-24 21:41:21,713 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:21,713 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-24 21:41:21,713 INFO ]: Interpolant automaton has 21 states. [2018-06-24 21:41:21,713 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-24 21:41:21,713 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 21:41:21,713 INFO ]: Found error trace [2018-06-24 21:41:21,713 INFO ]: trace histogram [18, 1, 1, 1, 1, 1] [2018-06-24 21:41:21,713 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:21,713 INFO ]: Analyzing trace with hash -639695772, now seen corresponding path program 18 times [2018-06-24 21:41:21,713 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:21,713 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:21,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:21,714 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:21,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:21,772 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:22,285 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:22,285 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:22,285 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:41:22,293 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:41:22,379 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-24 21:41:22,379 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:22,387 INFO ]: Computing forward predicates... [2018-06-24 21:41:22,435 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:22,454 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:22,454 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-24 21:41:22,454 INFO ]: Interpolant automaton has 22 states [2018-06-24 21:41:22,454 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 21:41:22,454 INFO ]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:41:22,455 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 22 states. [2018-06-24 21:41:22,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:22,674 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-24 21:41:22,674 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 21:41:22,674 INFO ]: Start accepts. Automaton has 22 states. Word has length 23 [2018-06-24 21:41:22,674 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:22,674 INFO ]: With dead ends: 25 [2018-06-24 21:41:22,674 INFO ]: Without dead ends: 25 [2018-06-24 21:41:22,675 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:41:22,675 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 21:41:22,677 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 21:41:22,677 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 21:41:22,677 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-24 21:41:22,677 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-24 21:41:22,677 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:22,677 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-24 21:41:22,677 INFO ]: Interpolant automaton has 22 states. [2018-06-24 21:41:22,678 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-24 21:41:22,678 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 21:41:22,678 INFO ]: Found error trace [2018-06-24 21:41:22,678 INFO ]: trace histogram [19, 1, 1, 1, 1, 1] [2018-06-24 21:41:22,678 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:22,678 INFO ]: Analyzing trace with hash 1643971721, now seen corresponding path program 19 times [2018-06-24 21:41:22,678 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:22,678 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:22,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:22,679 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:22,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:22,725 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:23,371 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:23,372 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:23,372 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:41:23,377 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:23,493 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:23,501 INFO ]: Computing forward predicates... [2018-06-24 21:41:23,579 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:23,598 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:23,598 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-24 21:41:23,598 INFO ]: Interpolant automaton has 23 states [2018-06-24 21:41:23,598 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 21:41:23,598 INFO ]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:41:23,598 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 23 states. [2018-06-24 21:41:23,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:23,933 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-24 21:41:23,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 21:41:23,935 INFO ]: Start accepts. Automaton has 23 states. Word has length 24 [2018-06-24 21:41:23,935 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:23,936 INFO ]: With dead ends: 26 [2018-06-24 21:41:23,936 INFO ]: Without dead ends: 26 [2018-06-24 21:41:23,936 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:41:23,936 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 21:41:23,938 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 21:41:23,938 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 21:41:23,938 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-24 21:41:23,938 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-24 21:41:23,938 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:23,938 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-24 21:41:23,938 INFO ]: Interpolant automaton has 23 states. [2018-06-24 21:41:23,938 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-24 21:41:23,939 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 21:41:23,939 INFO ]: Found error trace [2018-06-24 21:41:23,939 INFO ]: trace histogram [20, 1, 1, 1, 1, 1] [2018-06-24 21:41:23,939 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:23,939 INFO ]: Analyzing trace with hash -576780028, now seen corresponding path program 20 times [2018-06-24 21:41:23,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:23,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:23,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:23,939 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:23,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:23,999 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:24,447 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:24,448 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:24,448 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:41:24,453 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:41:24,531 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:41:24,531 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:24,538 INFO ]: Computing forward predicates... [2018-06-24 21:41:24,597 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:24,616 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:24,616 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-06-24 21:41:24,616 INFO ]: Interpolant automaton has 24 states [2018-06-24 21:41:24,616 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 21:41:24,616 INFO ]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:41:24,617 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 24 states. [2018-06-24 21:41:24,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:24,886 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-24 21:41:24,887 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 21:41:24,887 INFO ]: Start accepts. Automaton has 24 states. Word has length 25 [2018-06-24 21:41:24,887 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:24,888 INFO ]: With dead ends: 27 [2018-06-24 21:41:24,888 INFO ]: Without dead ends: 27 [2018-06-24 21:41:24,888 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:41:24,888 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 21:41:24,889 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 21:41:24,889 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 21:41:24,890 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-24 21:41:24,890 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-24 21:41:24,890 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:24,890 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-24 21:41:24,890 INFO ]: Interpolant automaton has 24 states. [2018-06-24 21:41:24,890 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-24 21:41:24,890 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:41:24,890 INFO ]: Found error trace [2018-06-24 21:41:24,890 INFO ]: trace histogram [21, 1, 1, 1, 1, 1] [2018-06-24 21:41:24,890 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:24,891 INFO ]: Analyzing trace with hash -700607511, now seen corresponding path program 21 times [2018-06-24 21:41:24,891 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:24,891 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:24,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:24,891 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:24,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:24,945 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:26,191 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:26,191 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:26,191 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:41:26,200 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:41:26,349 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-24 21:41:26,349 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:26,356 INFO ]: Computing forward predicates... [2018-06-24 21:41:26,430 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:26,449 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:26,449 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-24 21:41:26,449 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:41:26,450 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:41:26,450 INFO ]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:41:26,450 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 25 states. [2018-06-24 21:41:26,810 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:26,810 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-24 21:41:26,923 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 21:41:26,923 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-24 21:41:26,923 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:26,923 INFO ]: With dead ends: 28 [2018-06-24 21:41:26,923 INFO ]: Without dead ends: 28 [2018-06-24 21:41:26,924 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:41:26,924 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 21:41:26,925 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-24 21:41:26,925 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 21:41:26,926 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-24 21:41:26,926 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-24 21:41:26,926 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:26,926 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-24 21:41:26,926 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:41:26,926 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-24 21:41:26,926 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 21:41:26,926 INFO ]: Found error trace [2018-06-24 21:41:26,926 INFO ]: trace histogram [22, 1, 1, 1, 1, 1] [2018-06-24 21:41:26,927 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:26,927 INFO ]: Analyzing trace with hash -244292188, now seen corresponding path program 22 times [2018-06-24 21:41:26,927 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:26,927 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:26,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:26,927 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:26,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:26,985 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:27,555 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:27,555 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:27,555 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:41:27,561 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:41:27,714 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:41:27,714 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:27,724 INFO ]: Computing forward predicates... [2018-06-24 21:41:27,787 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:27,807 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:27,807 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-06-24 21:41:27,807 INFO ]: Interpolant automaton has 26 states [2018-06-24 21:41:27,807 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 21:41:27,807 INFO ]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:41:27,807 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 26 states. [2018-06-24 21:41:28,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:28,353 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-24 21:41:28,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 21:41:28,354 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-24 21:41:28,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:28,354 INFO ]: With dead ends: 29 [2018-06-24 21:41:28,354 INFO ]: Without dead ends: 29 [2018-06-24 21:41:28,355 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:41:28,355 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 21:41:28,359 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 21:41:28,359 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 21:41:28,360 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-24 21:41:28,360 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-24 21:41:28,360 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:28,360 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-24 21:41:28,360 INFO ]: Interpolant automaton has 26 states. [2018-06-24 21:41:28,360 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-24 21:41:28,360 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 21:41:28,360 INFO ]: Found error trace [2018-06-24 21:41:28,360 INFO ]: trace histogram [23, 1, 1, 1, 1, 1] [2018-06-24 21:41:28,360 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:28,361 INFO ]: Analyzing trace with hash 1016580937, now seen corresponding path program 23 times [2018-06-24 21:41:28,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:28,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:28,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:28,361 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:28,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:28,419 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:29,051 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:29,051 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:29,051 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:41:29,058 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:41:29,155 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-24 21:41:29,155 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:29,166 INFO ]: Computing forward predicates... [2018-06-24 21:41:29,299 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:29,318 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:29,318 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-06-24 21:41:29,318 INFO ]: Interpolant automaton has 27 states [2018-06-24 21:41:29,318 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 21:41:29,319 INFO ]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:41:29,319 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 27 states. [2018-06-24 21:41:29,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:29,645 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-24 21:41:29,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 21:41:29,645 INFO ]: Start accepts. Automaton has 27 states. Word has length 28 [2018-06-24 21:41:29,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:29,646 INFO ]: With dead ends: 30 [2018-06-24 21:41:29,646 INFO ]: Without dead ends: 30 [2018-06-24 21:41:29,646 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:41:29,646 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 21:41:29,647 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-24 21:41:29,647 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 21:41:29,647 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-24 21:41:29,647 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-24 21:41:29,647 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:29,647 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-24 21:41:29,648 INFO ]: Interpolant automaton has 27 states. [2018-06-24 21:41:29,648 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-24 21:41:29,648 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 21:41:29,648 INFO ]: Found error trace [2018-06-24 21:41:29,648 INFO ]: trace histogram [24, 1, 1, 1, 1, 1] [2018-06-24 21:41:29,648 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:29,648 INFO ]: Analyzing trace with hash 1448942148, now seen corresponding path program 24 times [2018-06-24 21:41:29,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:29,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:29,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:29,648 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:29,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:29,708 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:30,552 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:30,552 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:30,552 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:41:30,558 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:41:30,653 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-24 21:41:30,654 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:30,662 INFO ]: Computing forward predicates... [2018-06-24 21:41:30,744 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:30,763 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:30,763 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-06-24 21:41:30,763 INFO ]: Interpolant automaton has 28 states [2018-06-24 21:41:30,764 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 21:41:30,764 INFO ]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:41:30,764 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 28 states. [2018-06-24 21:41:31,210 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:31,210 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-24 21:41:31,210 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 21:41:31,210 INFO ]: Start accepts. Automaton has 28 states. Word has length 29 [2018-06-24 21:41:31,210 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:31,211 INFO ]: With dead ends: 31 [2018-06-24 21:41:31,211 INFO ]: Without dead ends: 31 [2018-06-24 21:41:31,211 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:41:31,211 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 21:41:31,213 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 21:41:31,213 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 21:41:31,213 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-24 21:41:31,213 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-24 21:41:31,213 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:31,213 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-24 21:41:31,213 INFO ]: Interpolant automaton has 28 states. [2018-06-24 21:41:31,213 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-24 21:41:31,214 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 21:41:31,214 INFO ]: Found error trace [2018-06-24 21:41:31,214 INFO ]: trace histogram [25, 1, 1, 1, 1, 1] [2018-06-24 21:41:31,214 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:31,214 INFO ]: Analyzing trace with hash 1967237801, now seen corresponding path program 25 times [2018-06-24 21:41:31,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:31,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:31,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:31,214 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:31,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:31,279 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:32,958 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:32,959 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:32,980 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:41:32,987 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:33,191 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:33,201 INFO ]: Computing forward predicates... [2018-06-24 21:41:33,278 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:33,297 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:33,298 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-24 21:41:33,298 INFO ]: Interpolant automaton has 29 states [2018-06-24 21:41:33,298 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 21:41:33,298 INFO ]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:41:33,298 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 29 states. [2018-06-24 21:41:33,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:33,720 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-24 21:41:33,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 21:41:33,723 INFO ]: Start accepts. Automaton has 29 states. Word has length 30 [2018-06-24 21:41:33,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:33,723 INFO ]: With dead ends: 32 [2018-06-24 21:41:33,723 INFO ]: Without dead ends: 32 [2018-06-24 21:41:33,723 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:41:33,724 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 21:41:33,726 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 21:41:33,726 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 21:41:33,726 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-24 21:41:33,726 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-24 21:41:33,726 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:33,726 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-24 21:41:33,726 INFO ]: Interpolant automaton has 29 states. [2018-06-24 21:41:33,726 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-24 21:41:33,727 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 21:41:33,727 INFO ]: Found error trace [2018-06-24 21:41:33,727 INFO ]: trace histogram [26, 1, 1, 1, 1, 1] [2018-06-24 21:41:33,727 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:33,727 INFO ]: Analyzing trace with hash 854533860, now seen corresponding path program 26 times [2018-06-24 21:41:33,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:33,727 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:33,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:33,728 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:33,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:33,827 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:34,551 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:34,551 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:34,551 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:41:34,562 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:41:34,697 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:41:34,697 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:34,706 INFO ]: Computing forward predicates... [2018-06-24 21:41:34,784 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:34,803 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:34,803 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-06-24 21:41:34,803 INFO ]: Interpolant automaton has 30 states [2018-06-24 21:41:34,803 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 21:41:34,803 INFO ]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:41:34,803 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 30 states. [2018-06-24 21:41:35,230 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:35,230 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-24 21:41:35,231 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 21:41:35,231 INFO ]: Start accepts. Automaton has 30 states. Word has length 31 [2018-06-24 21:41:35,231 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:35,231 INFO ]: With dead ends: 33 [2018-06-24 21:41:35,231 INFO ]: Without dead ends: 33 [2018-06-24 21:41:35,232 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:41:35,232 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 21:41:35,233 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 21:41:35,233 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 21:41:35,234 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-24 21:41:35,234 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-24 21:41:35,234 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:35,234 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-24 21:41:35,234 INFO ]: Interpolant automaton has 30 states. [2018-06-24 21:41:35,234 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-24 21:41:35,234 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:41:35,234 INFO ]: Found error trace [2018-06-24 21:41:35,234 INFO ]: trace histogram [27, 1, 1, 1, 1, 1] [2018-06-24 21:41:35,234 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:35,235 INFO ]: Analyzing trace with hash 720450057, now seen corresponding path program 27 times [2018-06-24 21:41:35,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:35,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:35,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:35,235 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:35,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:35,384 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:36,051 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:36,051 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:36,051 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:41:36,057 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:41:36,180 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-24 21:41:36,180 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:36,188 INFO ]: Computing forward predicates... [2018-06-24 21:41:36,312 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:36,332 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:36,332 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-24 21:41:36,332 INFO ]: Interpolant automaton has 31 states [2018-06-24 21:41:36,332 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 21:41:36,332 INFO ]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:41:36,332 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 31 states. [2018-06-24 21:41:36,795 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:36,795 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-24 21:41:36,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 21:41:36,797 INFO ]: Start accepts. Automaton has 31 states. Word has length 32 [2018-06-24 21:41:36,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:36,797 INFO ]: With dead ends: 34 [2018-06-24 21:41:36,797 INFO ]: Without dead ends: 34 [2018-06-24 21:41:36,798 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:41:36,798 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 21:41:36,799 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 21:41:36,799 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:41:36,799 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-24 21:41:36,800 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-24 21:41:36,800 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:36,800 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-24 21:41:36,800 INFO ]: Interpolant automaton has 31 states. [2018-06-24 21:41:36,800 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-24 21:41:36,800 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 21:41:36,800 INFO ]: Found error trace [2018-06-24 21:41:36,800 INFO ]: trace histogram [28, 1, 1, 1, 1, 1] [2018-06-24 21:41:36,800 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:36,800 INFO ]: Analyzing trace with hash 858819460, now seen corresponding path program 28 times [2018-06-24 21:41:36,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:36,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:36,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:36,801 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:36,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:36,900 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:37,747 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:37,747 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:37,747 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:41:37,752 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:41:38,029 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:41:38,029 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:38,041 INFO ]: Computing forward predicates... [2018-06-24 21:41:38,140 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:38,159 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:38,159 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-24 21:41:38,159 INFO ]: Interpolant automaton has 32 states [2018-06-24 21:41:38,159 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 21:41:38,160 INFO ]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:41:38,160 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 32 states. [2018-06-24 21:41:38,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:38,636 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-24 21:41:38,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 21:41:38,636 INFO ]: Start accepts. Automaton has 32 states. Word has length 33 [2018-06-24 21:41:38,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:38,636 INFO ]: With dead ends: 35 [2018-06-24 21:41:38,636 INFO ]: Without dead ends: 35 [2018-06-24 21:41:38,636 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:41:38,636 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:41:38,638 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 21:41:38,638 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 21:41:38,638 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-24 21:41:38,638 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-24 21:41:38,639 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:38,639 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-24 21:41:38,639 INFO ]: Interpolant automaton has 32 states. [2018-06-24 21:41:38,639 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-24 21:41:38,639 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 21:41:38,639 INFO ]: Found error trace [2018-06-24 21:41:38,639 INFO ]: trace histogram [29, 1, 1, 1, 1, 1] [2018-06-24 21:41:38,639 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:38,639 INFO ]: Analyzing trace with hash 853303657, now seen corresponding path program 29 times [2018-06-24 21:41:38,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:38,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:38,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:38,643 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:38,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:38,790 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:39,824 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:39,824 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:39,824 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:41:39,830 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:41:39,984 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-24 21:41:39,984 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:39,999 INFO ]: Computing forward predicates... [2018-06-24 21:41:40,094 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:40,113 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:40,113 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-24 21:41:40,114 INFO ]: Interpolant automaton has 33 states [2018-06-24 21:41:40,114 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 21:41:40,114 INFO ]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 21:41:40,114 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 33 states. [2018-06-24 21:41:40,648 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:40,648 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-24 21:41:40,648 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 21:41:40,648 INFO ]: Start accepts. Automaton has 33 states. Word has length 34 [2018-06-24 21:41:40,648 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:40,648 INFO ]: With dead ends: 36 [2018-06-24 21:41:40,648 INFO ]: Without dead ends: 36 [2018-06-24 21:41:40,649 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 21:41:40,649 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 21:41:40,650 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 21:41:40,650 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 21:41:40,651 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-24 21:41:40,651 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-24 21:41:40,651 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:40,651 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-24 21:41:40,651 INFO ]: Interpolant automaton has 33 states. [2018-06-24 21:41:40,651 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-24 21:41:40,651 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 21:41:40,651 INFO ]: Found error trace [2018-06-24 21:41:40,651 INFO ]: trace histogram [30, 1, 1, 1, 1, 1] [2018-06-24 21:41:40,651 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:40,652 INFO ]: Analyzing trace with hash 682313764, now seen corresponding path program 30 times [2018-06-24 21:41:40,652 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:40,652 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:40,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:40,652 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:40,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:40,739 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:42,164 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:42,164 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:42,164 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:41:42,170 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:41:42,295 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-24 21:41:42,295 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:42,305 INFO ]: Computing forward predicates... [2018-06-24 21:41:42,419 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:42,438 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:42,438 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-24 21:41:42,438 INFO ]: Interpolant automaton has 34 states [2018-06-24 21:41:42,439 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 21:41:42,439 INFO ]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 21:41:42,439 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 34 states. [2018-06-24 21:41:42,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:42,990 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-24 21:41:42,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 21:41:42,990 INFO ]: Start accepts. Automaton has 34 states. Word has length 35 [2018-06-24 21:41:42,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:42,990 INFO ]: With dead ends: 37 [2018-06-24 21:41:42,990 INFO ]: Without dead ends: 37 [2018-06-24 21:41:42,991 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 21:41:42,991 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 21:41:42,993 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-24 21:41:42,993 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 21:41:42,993 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-24 21:41:42,993 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-24 21:41:42,993 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:42,993 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-24 21:41:42,993 INFO ]: Interpolant automaton has 34 states. [2018-06-24 21:41:42,993 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-24 21:41:42,993 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 21:41:42,993 INFO ]: Found error trace [2018-06-24 21:41:42,993 INFO ]: trace histogram [31, 1, 1, 1, 1, 1] [2018-06-24 21:41:42,993 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:42,993 INFO ]: Analyzing trace with hash -323405623, now seen corresponding path program 31 times [2018-06-24 21:41:42,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:42,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:42,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:42,994 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:42,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:43,133 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:44,239 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:44,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:44,239 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:41:44,248 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:44,588 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:44,601 INFO ]: Computing forward predicates... [2018-06-24 21:41:44,689 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:44,708 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:44,708 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-24 21:41:44,709 INFO ]: Interpolant automaton has 35 states [2018-06-24 21:41:44,709 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 21:41:44,709 INFO ]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 21:41:44,709 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 35 states. [2018-06-24 21:41:45,300 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:45,300 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-24 21:41:45,301 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 21:41:45,301 INFO ]: Start accepts. Automaton has 35 states. Word has length 36 [2018-06-24 21:41:45,301 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:45,301 INFO ]: With dead ends: 38 [2018-06-24 21:41:45,301 INFO ]: Without dead ends: 38 [2018-06-24 21:41:45,301 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 21:41:45,301 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 21:41:45,302 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 21:41:45,302 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 21:41:45,303 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-24 21:41:45,303 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-24 21:41:45,303 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:45,303 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-24 21:41:45,303 INFO ]: Interpolant automaton has 35 states. [2018-06-24 21:41:45,303 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-24 21:41:45,303 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 21:41:45,303 INFO ]: Found error trace [2018-06-24 21:41:45,303 INFO ]: trace histogram [32, 1, 1, 1, 1, 1] [2018-06-24 21:41:45,303 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:45,303 INFO ]: Analyzing trace with hash -1435935548, now seen corresponding path program 32 times [2018-06-24 21:41:45,303 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:45,303 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:45,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:45,303 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:41:45,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:45,381 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:46,348 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:46,348 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:46,348 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:41:46,354 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:41:46,528 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:41:46,528 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:46,539 INFO ]: Computing forward predicates... [2018-06-24 21:41:46,624 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:46,645 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:46,645 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-06-24 21:41:46,645 INFO ]: Interpolant automaton has 36 states [2018-06-24 21:41:46,645 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 21:41:46,645 INFO ]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:41:46,645 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 36 states. [2018-06-24 21:41:47,285 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:47,285 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-24 21:41:47,286 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 21:41:47,286 INFO ]: Start accepts. Automaton has 36 states. Word has length 37 [2018-06-24 21:41:47,286 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:47,286 INFO ]: With dead ends: 39 [2018-06-24 21:41:47,286 INFO ]: Without dead ends: 39 [2018-06-24 21:41:47,286 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:41:47,286 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 21:41:47,287 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-24 21:41:47,287 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 21:41:47,288 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-24 21:41:47,288 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-24 21:41:47,288 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:47,288 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-24 21:41:47,288 INFO ]: Interpolant automaton has 36 states. [2018-06-24 21:41:47,288 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-24 21:41:47,288 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 21:41:47,288 INFO ]: Found error trace [2018-06-24 21:41:47,288 INFO ]: trace histogram [33, 1, 1, 1, 1, 1] [2018-06-24 21:41:47,288 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:47,288 INFO ]: Analyzing trace with hash -1564624855, now seen corresponding path program 33 times [2018-06-24 21:41:47,288 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:47,288 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:47,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:47,289 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:47,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:47,419 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:48,706 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:48,706 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:48,706 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:41:48,711 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:41:48,859 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-24 21:41:48,859 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:48,872 INFO ]: Computing forward predicates... [2018-06-24 21:41:49,037 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:49,057 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:49,057 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-24 21:41:49,057 INFO ]: Interpolant automaton has 37 states [2018-06-24 21:41:49,057 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 21:41:49,058 INFO ]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 21:41:49,058 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 37 states. [2018-06-24 21:41:49,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:49,697 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-24 21:41:49,714 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 21:41:49,715 INFO ]: Start accepts. Automaton has 37 states. Word has length 38 [2018-06-24 21:41:49,715 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:49,715 INFO ]: With dead ends: 40 [2018-06-24 21:41:49,715 INFO ]: Without dead ends: 40 [2018-06-24 21:41:49,715 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 21:41:49,715 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 21:41:49,716 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-24 21:41:49,716 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 21:41:49,717 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-24 21:41:49,717 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-24 21:41:49,717 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:49,717 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-24 21:41:49,717 INFO ]: Interpolant automaton has 37 states. [2018-06-24 21:41:49,717 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-24 21:41:49,717 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 21:41:49,717 INFO ]: Found error trace [2018-06-24 21:41:49,717 INFO ]: trace histogram [34, 1, 1, 1, 1, 1] [2018-06-24 21:41:49,717 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:49,718 INFO ]: Analyzing trace with hash -1259026076, now seen corresponding path program 34 times [2018-06-24 21:41:49,718 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:49,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:49,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:49,718 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:49,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:49,852 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:51,029 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:51,029 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:51,029 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:41:51,035 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:41:51,488 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:41:51,489 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:51,505 INFO ]: Computing forward predicates... [2018-06-24 21:41:52,355 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:52,375 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:52,375 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-06-24 21:41:52,375 INFO ]: Interpolant automaton has 38 states [2018-06-24 21:41:52,375 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 21:41:52,376 INFO ]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 21:41:52,376 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 38 states. [2018-06-24 21:41:53,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:53,093 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-24 21:41:53,093 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 21:41:53,094 INFO ]: Start accepts. Automaton has 38 states. Word has length 39 [2018-06-24 21:41:53,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:53,094 INFO ]: With dead ends: 41 [2018-06-24 21:41:53,094 INFO ]: Without dead ends: 41 [2018-06-24 21:41:53,094 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 21:41:53,094 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 21:41:53,095 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-24 21:41:53,095 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 21:41:53,095 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-24 21:41:53,095 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-24 21:41:53,096 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:53,096 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-24 21:41:53,096 INFO ]: Interpolant automaton has 38 states. [2018-06-24 21:41:53,096 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-24 21:41:53,096 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 21:41:53,096 INFO ]: Found error trace [2018-06-24 21:41:53,096 INFO ]: trace histogram [35, 1, 1, 1, 1, 1] [2018-06-24 21:41:53,096 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:53,096 INFO ]: Analyzing trace with hash -375398519, now seen corresponding path program 35 times [2018-06-24 21:41:53,096 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:53,096 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:53,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:53,097 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:53,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:53,234 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:54,252 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:54,252 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:54,252 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:41:54,258 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:41:54,450 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-06-24 21:41:54,450 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:54,469 INFO ]: Computing forward predicates... [2018-06-24 21:41:54,570 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:54,590 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:54,590 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-06-24 21:41:54,590 INFO ]: Interpolant automaton has 39 states [2018-06-24 21:41:54,590 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 21:41:54,590 INFO ]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 21:41:54,591 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 39 states. [2018-06-24 21:41:55,330 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:55,331 INFO ]: Finished difference Result 42 states and 42 transitions. [2018-06-24 21:41:55,382 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 21:41:55,382 INFO ]: Start accepts. Automaton has 39 states. Word has length 40 [2018-06-24 21:41:55,382 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:55,382 INFO ]: With dead ends: 42 [2018-06-24 21:41:55,382 INFO ]: Without dead ends: 42 [2018-06-24 21:41:55,383 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 21:41:55,383 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 21:41:55,383 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-24 21:41:55,383 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 21:41:55,384 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-06-24 21:41:55,384 INFO ]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-06-24 21:41:55,384 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:55,384 INFO ]: Abstraction has 42 states and 42 transitions. [2018-06-24 21:41:55,384 INFO ]: Interpolant automaton has 39 states. [2018-06-24 21:41:55,384 INFO ]: Start isEmpty. Operand 42 states and 42 transitions. [2018-06-24 21:41:55,384 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 21:41:55,384 INFO ]: Found error trace [2018-06-24 21:41:55,384 INFO ]: trace histogram [36, 1, 1, 1, 1, 1] [2018-06-24 21:41:55,384 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:55,385 INFO ]: Analyzing trace with hash 1247251972, now seen corresponding path program 36 times [2018-06-24 21:41:55,385 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:55,385 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:55,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:55,385 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:55,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:55,526 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:56,841 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:56,841 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:56,841 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:41:56,846 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:41:57,000 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-06-24 21:41:57,000 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:57,018 INFO ]: Computing forward predicates... [2018-06-24 21:41:57,436 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:57,455 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:57,455 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-06-24 21:41:57,455 INFO ]: Interpolant automaton has 40 states [2018-06-24 21:41:57,455 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 21:41:57,456 INFO ]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 21:41:57,456 INFO ]: Start difference. First operand 42 states and 42 transitions. Second operand 40 states. [2018-06-24 21:41:58,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:58,247 INFO ]: Finished difference Result 43 states and 43 transitions. [2018-06-24 21:41:58,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 21:41:58,247 INFO ]: Start accepts. Automaton has 40 states. Word has length 41 [2018-06-24 21:41:58,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:58,248 INFO ]: With dead ends: 43 [2018-06-24 21:41:58,248 INFO ]: Without dead ends: 43 [2018-06-24 21:41:58,248 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 21:41:58,248 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 21:41:58,249 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-24 21:41:58,249 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 21:41:58,249 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-06-24 21:41:58,249 INFO ]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-06-24 21:41:58,249 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:58,249 INFO ]: Abstraction has 43 states and 43 transitions. [2018-06-24 21:41:58,249 INFO ]: Interpolant automaton has 40 states. [2018-06-24 21:41:58,249 INFO ]: Start isEmpty. Operand 43 states and 43 transitions. [2018-06-24 21:41:58,249 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-24 21:41:58,249 INFO ]: Found error trace [2018-06-24 21:41:58,249 INFO ]: trace histogram [37, 1, 1, 1, 1, 1] [2018-06-24 21:41:58,249 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:58,249 INFO ]: Analyzing trace with hash 9809641, now seen corresponding path program 37 times [2018-06-24 21:41:58,250 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:58,250 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:58,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:58,250 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:58,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:58,377 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:00,024 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:00,024 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:00,024 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:42:00,029 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:00,546 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:00,563 INFO ]: Computing forward predicates... [2018-06-24 21:42:00,720 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:00,739 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:00,739 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-06-24 21:42:00,739 INFO ]: Interpolant automaton has 41 states [2018-06-24 21:42:00,739 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-24 21:42:00,739 INFO ]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:42:00,739 INFO ]: Start difference. First operand 43 states and 43 transitions. Second operand 41 states. [2018-06-24 21:42:01,565 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:01,565 INFO ]: Finished difference Result 44 states and 44 transitions. [2018-06-24 21:42:01,565 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-24 21:42:01,565 INFO ]: Start accepts. Automaton has 41 states. Word has length 42 [2018-06-24 21:42:01,565 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:01,565 INFO ]: With dead ends: 44 [2018-06-24 21:42:01,565 INFO ]: Without dead ends: 44 [2018-06-24 21:42:01,566 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:42:01,566 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-24 21:42:01,567 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-24 21:42:01,567 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 21:42:01,567 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-06-24 21:42:01,567 INFO ]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-06-24 21:42:01,567 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:01,567 INFO ]: Abstraction has 44 states and 44 transitions. [2018-06-24 21:42:01,567 INFO ]: Interpolant automaton has 41 states. [2018-06-24 21:42:01,567 INFO ]: Start isEmpty. Operand 44 states and 44 transitions. [2018-06-24 21:42:01,568 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-24 21:42:01,568 INFO ]: Found error trace [2018-06-24 21:42:01,568 INFO ]: trace histogram [38, 1, 1, 1, 1, 1] [2018-06-24 21:42:01,568 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:01,568 INFO ]: Analyzing trace with hash 303803044, now seen corresponding path program 38 times [2018-06-24 21:42:01,568 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:01,568 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:01,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:01,568 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:01,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:01,705 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:03,146 INFO ]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:03,146 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:03,146 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:42:03,152 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:42:03,414 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:42:03,414 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:03,429 INFO ]: Computing forward predicates... [2018-06-24 21:42:03,552 INFO ]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:03,577 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:03,577 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-06-24 21:42:03,577 INFO ]: Interpolant automaton has 42 states [2018-06-24 21:42:03,577 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-24 21:42:03,578 INFO ]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 21:42:03,578 INFO ]: Start difference. First operand 44 states and 44 transitions. Second operand 42 states. [2018-06-24 21:42:04,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:04,448 INFO ]: Finished difference Result 45 states and 45 transitions. [2018-06-24 21:42:04,449 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-24 21:42:04,449 INFO ]: Start accepts. Automaton has 42 states. Word has length 43 [2018-06-24 21:42:04,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:04,449 INFO ]: With dead ends: 45 [2018-06-24 21:42:04,449 INFO ]: Without dead ends: 45 [2018-06-24 21:42:04,449 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 21:42:04,450 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 21:42:04,450 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-24 21:42:04,450 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 21:42:04,450 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-06-24 21:42:04,451 INFO ]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-06-24 21:42:04,451 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:04,451 INFO ]: Abstraction has 45 states and 45 transitions. [2018-06-24 21:42:04,451 INFO ]: Interpolant automaton has 42 states. [2018-06-24 21:42:04,451 INFO ]: Start isEmpty. Operand 45 states and 45 transitions. [2018-06-24 21:42:04,451 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-24 21:42:04,451 INFO ]: Found error trace [2018-06-24 21:42:04,451 INFO ]: trace histogram [39, 1, 1, 1, 1, 1] [2018-06-24 21:42:04,451 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:04,451 INFO ]: Analyzing trace with hash 827663945, now seen corresponding path program 39 times [2018-06-24 21:42:04,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:04,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:04,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:04,451 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:42:04,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:04,641 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-24 21:42:04,918 WARN ]: Removed 3 from assertion stack [2018-06-24 21:42:04,919 WARN ]: Verification canceled [2018-06-24 21:42:04,920 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:42:04,921 WARN ]: Timeout [2018-06-24 21:42:04,922 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:42:04 BasicIcfg [2018-06-24 21:42:04,922 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:42:04,923 INFO ]: Toolchain (without parser) took 58690.29 ms. Allocated memory was 309.3 MB in the beginning and 1.0 GB in the end (delta: 703.6 MB). Free memory was 265.7 MB in the beginning and 472.5 MB in the end (delta: -206.9 MB). Peak memory consumption was 496.7 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:04,924 INFO ]: SmtParser took 0.08 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:42:04,924 INFO ]: ChcToBoogie took 65.01 ms. Allocated memory is still 309.3 MB. Free memory was 265.7 MB in the beginning and 262.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:04,925 INFO ]: Boogie Preprocessor took 32.97 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 261.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 21:42:04,925 INFO ]: RCFGBuilder took 304.38 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 253.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:04,925 INFO ]: BlockEncodingV2 took 92.50 ms. Allocated memory is still 309.3 MB. Free memory was 253.6 MB in the beginning and 250.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:04,926 INFO ]: TraceAbstraction took 58182.96 ms. Allocated memory was 309.3 MB in the beginning and 1.0 GB in the end (delta: 703.6 MB). Free memory was 250.6 MB in the beginning and 472.5 MB in the end (delta: -222.0 MB). Peak memory consumption was 481.6 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:04,928 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 12 edges - StatisticsResult: Encoded RCFG 6 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 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 65.01 ms. Allocated memory is still 309.3 MB. Free memory was 265.7 MB in the beginning and 262.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 32.97 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 261.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 304.38 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 253.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 92.50 ms. Allocated memory is still 309.3 MB. Free memory was 253.6 MB in the beginning and 250.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58182.96 ms. Allocated memory was 309.3 MB in the beginning and 1.0 GB in the end (delta: 703.6 MB). Free memory was 250.6 MB in the beginning and 472.5 MB in the end (delta: -222.0 MB). Peak memory consumption was 481.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 39, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 58.1s OverallTime, 42 OverallIterations, 39 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 207 SDtfs, 0 SDslu, 2421 SDs, 0 SdLazy, 22650 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1764 GetRequests, 904 SyntacticMatches, 36 SemanticMatches, 824 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 28.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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.1s AutomataMinimizationTime, 41 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 7.3s SatisfiabilityAnalysisTime, 33.9s InterpolantComputationTime, 1885 NumberOfCodeBlocks, 1885 NumberOfCodeBlocksAsserted, 270 NumberOfCheckSat, 1805 ConstructedInterpolants, 0 QuantifiedInterpolants, 1354980 SizeOfPredicates, 194 NumberOfNonLiveVariables, 22993 ConjunctsInSsa, 13691 ConjunctsInUnsatCore, 80 InterpolantComputations, 3 PerfectInterpolantSequences, 2/19763 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__barthe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-42-04-939.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-42-04-939.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-42-04-939.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-42-04-939.csv Completed graceful shutdown