java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:45:23,243 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:45:23,245 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:45:23,258 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:45:23,258 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:45:23,259 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:45:23,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:45:23,264 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:45:23,266 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:45:23,267 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:45:23,269 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:45:23,269 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:45:23,270 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:45:23,271 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:45:23,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:45:23,276 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:45:23,278 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:45:23,291 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:45:23,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:45:23,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:45:23,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:45:23,297 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:45:23,297 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:45:23,297 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:45:23,298 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:45:23,299 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:45:23,299 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:45:23,304 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:45:23,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:45:23,305 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:45:23,306 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:45:23,312 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:45:23,312 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:45:23,313 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:45:23,313 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:45:23,313 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:45:23,327 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:45:23,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:45:23,327 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:45:23,327 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:45:23,328 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:45:23,328 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:45:23,329 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:45:23,329 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:45:23,329 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:45:23,329 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:45:23,329 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:45:23,330 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:45:23,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:45:23,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:45:23,330 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:45:23,330 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:45:23,330 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:45:23,334 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:45:23,334 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:45:23,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:45:23,334 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:45:23,336 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:45:23,336 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:45:23,390 INFO ]: Repository-Root is: /tmp [2018-06-24 20:45:23,409 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:45:23,412 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:45:23,418 INFO ]: Initializing SmtParser... [2018-06-24 20:45:23,418 INFO ]: SmtParser initialized [2018-06-24 20:45:23,419 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2_merged_safe.c-1.smt2 [2018-06-24 20:45:23,420 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:45:23,512 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2_merged_safe.c-1.smt2 unknown [2018-06-24 20:45:23,702 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2_merged_safe.c-1.smt2 [2018-06-24 20:45:23,707 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:45:23,713 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:45:23,714 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:45:23,714 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:45:23,714 INFO ]: ChcToBoogie initialized [2018-06-24 20:45:23,718 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:45:23" (1/1) ... [2018-06-24 20:45:23,767 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:23 Unit [2018-06-24 20:45:23,767 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:45:23,768 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:45:23,768 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:45:23,768 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:45:23,787 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:23" (1/1) ... [2018-06-24 20:45:23,787 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:23" (1/1) ... [2018-06-24 20:45:23,795 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:23" (1/1) ... [2018-06-24 20:45:23,795 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:23" (1/1) ... [2018-06-24 20:45:23,797 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:23" (1/1) ... [2018-06-24 20:45:23,800 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:23" (1/1) ... [2018-06-24 20:45:23,801 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:23" (1/1) ... [2018-06-24 20:45:23,802 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:45:23,803 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:45:23,803 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:45:23,803 INFO ]: RCFGBuilder initialized [2018-06-24 20:45:23,804 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:23" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:45:23,817 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:45:23,818 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:45:23,818 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:45:23,818 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:45:23,818 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:45:23,818 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:45:24,025 INFO ]: Using library mode [2018-06-24 20:45:24,026 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:45:24 BoogieIcfgContainer [2018-06-24 20:45:24,026 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:45:24,026 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:45:24,026 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:45:24,036 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:45:24,036 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:45:24" (1/1) ... [2018-06-24 20:45:24,063 INFO ]: Initial Icfg 11 locations, 14 edges [2018-06-24 20:45:24,064 INFO ]: Using Remove infeasible edges [2018-06-24 20:45:24,064 INFO ]: Using Maximize final states [2018-06-24 20:45:24,065 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:45:24,065 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:45:24,066 INFO ]: Using Remove sink states [2018-06-24 20:45:24,067 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:45:24,067 INFO ]: Using Use SBE [2018-06-24 20:45:24,091 INFO ]: SBE split 3 edges [2018-06-24 20:45:24,096 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:45:24,097 INFO ]: 0 new accepting states [2018-06-24 20:45:24,122 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 20:45:24,124 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:45:24,127 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:45:24,127 INFO ]: 0 new accepting states [2018-06-24 20:45:24,127 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:45:24,128 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:45:24,128 INFO ]: Encoded RCFG 7 locations, 12 edges [2018-06-24 20:45:24,128 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:45:24 BasicIcfg [2018-06-24 20:45:24,128 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:45:24,130 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:45:24,130 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:45:24,133 INFO ]: TraceAbstraction initialized [2018-06-24 20:45:24,134 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:45:23" (1/4) ... [2018-06-24 20:45:24,147 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2473c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:45:24, skipping insertion in model container [2018-06-24 20:45:24,147 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:45:23" (2/4) ... [2018-06-24 20:45:24,147 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2473c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:45:24, skipping insertion in model container [2018-06-24 20:45:24,147 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:45:24" (3/4) ... [2018-06-24 20:45:24,147 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2473c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:45:24, skipping insertion in model container [2018-06-24 20:45:24,147 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:45:24" (4/4) ... [2018-06-24 20:45:24,149 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:45:24,162 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:45:24,171 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:45:24,227 INFO ]: Using default assertion order modulation [2018-06-24 20:45:24,228 INFO ]: Interprodecural is true [2018-06-24 20:45:24,228 INFO ]: Hoare is false [2018-06-24 20:45:24,228 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:45:24,228 INFO ]: Backedges is TWOTRACK [2018-06-24 20:45:24,228 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:45:24,228 INFO ]: Difference is false [2018-06-24 20:45:24,228 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:45:24,228 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:45:24,243 INFO ]: Start isEmpty. Operand 7 states. [2018-06-24 20:45:24,252 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:45:24,252 INFO ]: Found error trace [2018-06-24 20:45:24,254 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:45:24,254 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:24,260 INFO ]: Analyzing trace with hash 1221392010, now seen corresponding path program 1 times [2018-06-24 20:45:24,262 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:24,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:24,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:24,309 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:24,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:24,356 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:24,511 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:24,513 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:45:24,513 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:45:24,514 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:45:24,526 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:45:24,526 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:45:24,528 INFO ]: Start difference. First operand 7 states. Second operand 4 states. [2018-06-24 20:45:24,775 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:24,775 INFO ]: Finished difference Result 11 states and 20 transitions. [2018-06-24 20:45:24,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:45:24,778 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:45:24,778 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:24,789 INFO ]: With dead ends: 11 [2018-06-24 20:45:24,790 INFO ]: Without dead ends: 11 [2018-06-24 20:45:24,803 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:45:24,826 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:45:24,846 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 20:45:24,848 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:45:24,849 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-06-24 20:45:24,850 INFO ]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 6 [2018-06-24 20:45:24,851 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:24,851 INFO ]: Abstraction has 9 states and 15 transitions. [2018-06-24 20:45:24,851 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:45:24,851 INFO ]: Start isEmpty. Operand 9 states and 15 transitions. [2018-06-24 20:45:24,851 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:45:24,851 INFO ]: Found error trace [2018-06-24 20:45:24,851 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:24,851 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:24,852 INFO ]: Analyzing trace with hash 1213281659, now seen corresponding path program 1 times [2018-06-24 20:45:24,852 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:24,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:24,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:24,853 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:24,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:24,882 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:25,149 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:25,149 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:25,149 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:25,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:25,186 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:25,192 INFO ]: Computing forward predicates... [2018-06-24 20:45:25,280 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:25,313 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:25,313 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 20:45:25,313 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:45:25,314 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:45:25,314 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:45:25,314 INFO ]: Start difference. First operand 9 states and 15 transitions. Second operand 7 states. [2018-06-24 20:45:25,966 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:25,966 INFO ]: Finished difference Result 16 states and 31 transitions. [2018-06-24 20:45:25,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:45:25,967 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 20:45:25,967 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:25,967 INFO ]: With dead ends: 16 [2018-06-24 20:45:25,967 INFO ]: Without dead ends: 16 [2018-06-24 20:45:25,968 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:45:25,968 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:45:25,970 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-06-24 20:45:25,970 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:45:25,971 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2018-06-24 20:45:25,971 INFO ]: Start accepts. Automaton has 11 states and 20 transitions. Word has length 8 [2018-06-24 20:45:25,971 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:25,971 INFO ]: Abstraction has 11 states and 20 transitions. [2018-06-24 20:45:25,971 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:45:25,971 INFO ]: Start isEmpty. Operand 11 states and 20 transitions. [2018-06-24 20:45:25,971 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:45:25,971 INFO ]: Found error trace [2018-06-24 20:45:25,971 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:25,972 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:25,972 INFO ]: Analyzing trace with hash 1299169112, now seen corresponding path program 1 times [2018-06-24 20:45:25,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:25,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:25,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:25,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:25,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:25,985 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:26,140 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:26,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:26,141 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:45:26,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:26,187 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:26,189 INFO ]: Computing forward predicates... [2018-06-24 20:45:26,473 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:45:26,501 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:45:26,501 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-24 20:45:26,502 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:45:26,502 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:45:26,502 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:45:26,502 INFO ]: Start difference. First operand 11 states and 20 transitions. Second operand 7 states. [2018-06-24 20:45:26,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:26,831 INFO ]: Finished difference Result 16 states and 28 transitions. [2018-06-24 20:45:26,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:45:26,831 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 20:45:26,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:26,831 INFO ]: With dead ends: 16 [2018-06-24 20:45:26,831 INFO ]: Without dead ends: 11 [2018-06-24 20:45:26,832 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:45:26,832 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:45:26,833 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:45:26,833 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:45:26,834 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-24 20:45:26,834 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-24 20:45:26,834 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:26,834 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-24 20:45:26,834 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:45:26,834 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-24 20:45:26,834 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:45:26,834 INFO ]: Found error trace [2018-06-24 20:45:26,834 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:45:26,834 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:26,834 INFO ]: Analyzing trace with hash 1156023357, now seen corresponding path program 1 times [2018-06-24 20:45:26,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:26,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:26,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:26,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:26,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:26,851 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:26,897 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:26,897 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:26,897 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:26,908 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:26,924 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:26,926 INFO ]: Computing forward predicates... [2018-06-24 20:45:26,947 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:26,968 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:45:26,968 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-24 20:45:26,968 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:45:26,969 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:45:26,969 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:45:26,969 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 7 states. [2018-06-24 20:45:27,160 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-24 20:45:27,320 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:27,320 INFO ]: Finished difference Result 17 states and 26 transitions. [2018-06-24 20:45:27,320 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:45:27,320 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 20:45:27,320 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:27,320 INFO ]: With dead ends: 17 [2018-06-24 20:45:27,320 INFO ]: Without dead ends: 11 [2018-06-24 20:45:27,321 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:45:27,321 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:45:27,322 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:45:27,322 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:45:27,322 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-06-24 20:45:27,322 INFO ]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2018-06-24 20:45:27,322 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:27,322 INFO ]: Abstraction has 11 states and 14 transitions. [2018-06-24 20:45:27,322 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:45:27,323 INFO ]: Start isEmpty. Operand 11 states and 14 transitions. [2018-06-24 20:45:27,323 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:45:27,323 INFO ]: Found error trace [2018-06-24 20:45:27,323 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-24 20:45:27,323 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:27,323 INFO ]: Analyzing trace with hash 2009168940, now seen corresponding path program 2 times [2018-06-24 20:45:27,323 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:27,323 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:27,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:27,324 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:27,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:27,339 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:27,553 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:27,553 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:27,553 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:27,559 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:45:27,598 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:45:27,598 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:27,603 INFO ]: Computing forward predicates... [2018-06-24 20:45:27,672 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:27,691 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:27,691 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 20:45:27,691 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:45:27,691 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:45:27,691 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:45:27,691 INFO ]: Start difference. First operand 11 states and 14 transitions. Second operand 9 states. [2018-06-24 20:45:28,051 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:28,052 INFO ]: Finished difference Result 14 states and 19 transitions. [2018-06-24 20:45:28,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:45:28,052 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 20:45:28,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:28,052 INFO ]: With dead ends: 14 [2018-06-24 20:45:28,052 INFO ]: Without dead ends: 14 [2018-06-24 20:45:28,053 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:45:28,053 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:45:28,054 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-24 20:45:28,054 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:45:28,054 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-24 20:45:28,054 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2018-06-24 20:45:28,054 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:28,054 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-24 20:45:28,054 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:45:28,054 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-24 20:45:28,055 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:45:28,055 INFO ]: Found error trace [2018-06-24 20:45:28,055 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-06-24 20:45:28,055 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:28,055 INFO ]: Analyzing trace with hash -1942300003, now seen corresponding path program 3 times [2018-06-24 20:45:28,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:28,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:28,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:28,056 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:28,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:28,073 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:28,232 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:28,232 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:28,232 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:28,239 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:45:28,291 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:45:28,291 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:28,294 INFO ]: Computing forward predicates... [2018-06-24 20:45:28,340 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:28,367 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:28,367 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 20:45:28,367 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:45:28,367 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:45:28,367 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:45:28,367 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 11 states. [2018-06-24 20:45:28,656 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:28,656 INFO ]: Finished difference Result 16 states and 22 transitions. [2018-06-24 20:45:28,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:45:28,658 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 20:45:28,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:28,658 INFO ]: With dead ends: 16 [2018-06-24 20:45:28,658 INFO ]: Without dead ends: 16 [2018-06-24 20:45:28,659 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:45:28,659 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:45:28,660 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-06-24 20:45:28,660 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:45:28,660 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-06-24 20:45:28,661 INFO ]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 12 [2018-06-24 20:45:28,661 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:28,661 INFO ]: Abstraction has 15 states and 20 transitions. [2018-06-24 20:45:28,661 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:45:28,661 INFO ]: Start isEmpty. Operand 15 states and 20 transitions. [2018-06-24 20:45:28,661 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:45:28,661 INFO ]: Found error trace [2018-06-24 20:45:28,661 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-06-24 20:45:28,661 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:28,661 INFO ]: Analyzing trace with hash 1742102734, now seen corresponding path program 4 times [2018-06-24 20:45:28,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:28,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:28,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:28,664 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:28,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:28,682 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:28,961 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:28,961 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:28,961 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:28,974 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:45:29,009 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:45:29,009 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:29,014 INFO ]: Computing forward predicates... [2018-06-24 20:45:29,080 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:29,099 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:29,099 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 20:45:29,100 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:45:29,100 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:45:29,100 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:45:29,100 INFO ]: Start difference. First operand 15 states and 20 transitions. Second operand 13 states. [2018-06-24 20:45:29,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:29,503 INFO ]: Finished difference Result 18 states and 25 transitions. [2018-06-24 20:45:29,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:45:29,503 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-24 20:45:29,503 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:29,504 INFO ]: With dead ends: 18 [2018-06-24 20:45:29,504 INFO ]: Without dead ends: 18 [2018-06-24 20:45:29,504 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:45:29,504 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:45:29,506 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-06-24 20:45:29,506 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:45:29,506 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-06-24 20:45:29,507 INFO ]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 14 [2018-06-24 20:45:29,507 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:29,507 INFO ]: Abstraction has 17 states and 23 transitions. [2018-06-24 20:45:29,507 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:45:29,507 INFO ]: Start isEmpty. Operand 17 states and 23 transitions. [2018-06-24 20:45:29,507 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:45:29,507 INFO ]: Found error trace [2018-06-24 20:45:29,507 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-06-24 20:45:29,507 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:29,507 INFO ]: Analyzing trace with hash -894886209, now seen corresponding path program 5 times [2018-06-24 20:45:29,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:29,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:29,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:29,508 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:29,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:29,531 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:30,068 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:30,068 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:30,068 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:30,081 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:45:30,122 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:45:30,122 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:30,127 INFO ]: Computing forward predicates... [2018-06-24 20:45:30,553 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:30,583 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:30,583 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-24 20:45:30,584 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:45:30,584 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:45:30,584 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:45:30,584 INFO ]: Start difference. First operand 17 states and 23 transitions. Second operand 15 states. [2018-06-24 20:45:31,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:31,149 INFO ]: Finished difference Result 20 states and 28 transitions. [2018-06-24 20:45:31,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:45:31,149 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-24 20:45:31,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:31,150 INFO ]: With dead ends: 20 [2018-06-24 20:45:31,150 INFO ]: Without dead ends: 20 [2018-06-24 20:45:31,150 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:45:31,150 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:45:31,152 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-06-24 20:45:31,152 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:45:31,153 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-06-24 20:45:31,153 INFO ]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 16 [2018-06-24 20:45:31,153 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:31,153 INFO ]: Abstraction has 19 states and 26 transitions. [2018-06-24 20:45:31,153 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:45:31,153 INFO ]: Start isEmpty. Operand 19 states and 26 transitions. [2018-06-24 20:45:31,153 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:45:31,153 INFO ]: Found error trace [2018-06-24 20:45:31,153 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2018-06-24 20:45:31,153 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:31,153 INFO ]: Analyzing trace with hash -1010555792, now seen corresponding path program 6 times [2018-06-24 20:45:31,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:31,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:31,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:31,154 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:31,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:31,185 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:31,650 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:31,650 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:31,650 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:31,656 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:45:31,689 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:45:31,690 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:31,695 INFO ]: Computing forward predicates... [2018-06-24 20:45:31,783 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:31,802 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:31,802 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 20:45:31,803 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:45:31,803 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:45:31,803 INFO ]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:45:31,803 INFO ]: Start difference. First operand 19 states and 26 transitions. Second operand 17 states. [2018-06-24 20:45:32,359 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:32,360 INFO ]: Finished difference Result 22 states and 31 transitions. [2018-06-24 20:45:32,507 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:45:32,507 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 20:45:32,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:32,508 INFO ]: With dead ends: 22 [2018-06-24 20:45:32,508 INFO ]: Without dead ends: 22 [2018-06-24 20:45:32,508 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:45:32,508 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:45:32,510 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-24 20:45:32,510 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:45:32,511 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2018-06-24 20:45:32,511 INFO ]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 18 [2018-06-24 20:45:32,511 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:32,511 INFO ]: Abstraction has 21 states and 29 transitions. [2018-06-24 20:45:32,511 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:45:32,511 INFO ]: Start isEmpty. Operand 21 states and 29 transitions. [2018-06-24 20:45:32,512 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:45:32,512 INFO ]: Found error trace [2018-06-24 20:45:32,512 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2018-06-24 20:45:32,512 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:32,512 INFO ]: Analyzing trace with hash -499875359, now seen corresponding path program 7 times [2018-06-24 20:45:32,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:32,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:32,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:32,513 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:32,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:32,534 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:32,882 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:32,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:32,882 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:32,888 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:32,921 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:32,926 INFO ]: Computing forward predicates... [2018-06-24 20:45:32,997 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:33,025 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:33,025 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 20:45:33,025 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:45:33,025 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:45:33,026 INFO ]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:45:33,026 INFO ]: Start difference. First operand 21 states and 29 transitions. Second operand 19 states. [2018-06-24 20:45:33,507 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-24 20:45:33,670 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:33,670 INFO ]: Finished difference Result 24 states and 34 transitions. [2018-06-24 20:45:33,670 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:45:33,670 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-24 20:45:33,670 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:33,671 INFO ]: With dead ends: 24 [2018-06-24 20:45:33,671 INFO ]: Without dead ends: 24 [2018-06-24 20:45:33,671 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:45:33,671 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:45:33,673 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-06-24 20:45:33,673 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:45:33,674 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2018-06-24 20:45:33,674 INFO ]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 20 [2018-06-24 20:45:33,674 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:33,674 INFO ]: Abstraction has 23 states and 32 transitions. [2018-06-24 20:45:33,674 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:45:33,674 INFO ]: Start isEmpty. Operand 23 states and 32 transitions. [2018-06-24 20:45:33,675 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:45:33,675 INFO ]: Found error trace [2018-06-24 20:45:33,675 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2018-06-24 20:45:33,675 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:33,675 INFO ]: Analyzing trace with hash 637749010, now seen corresponding path program 8 times [2018-06-24 20:45:33,675 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:33,675 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:33,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:33,676 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:33,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:33,692 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:34,077 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:34,077 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:34,077 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:34,083 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:45:34,115 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:45:34,115 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:34,121 INFO ]: Computing forward predicates... [2018-06-24 20:45:34,250 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:34,270 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:34,271 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-24 20:45:34,271 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:45:34,271 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:45:34,271 INFO ]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:45:34,271 INFO ]: Start difference. First operand 23 states and 32 transitions. Second operand 21 states. [2018-06-24 20:45:35,014 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:35,014 INFO ]: Finished difference Result 26 states and 37 transitions. [2018-06-24 20:45:35,014 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:45:35,014 INFO ]: Start accepts. Automaton has 21 states. Word has length 22 [2018-06-24 20:45:35,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:35,015 INFO ]: With dead ends: 26 [2018-06-24 20:45:35,015 INFO ]: Without dead ends: 26 [2018-06-24 20:45:35,015 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=1273, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:45:35,016 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:45:35,018 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-06-24 20:45:35,018 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:45:35,018 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-06-24 20:45:35,018 INFO ]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 22 [2018-06-24 20:45:35,018 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:35,018 INFO ]: Abstraction has 25 states and 35 transitions. [2018-06-24 20:45:35,018 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:45:35,018 INFO ]: Start isEmpty. Operand 25 states and 35 transitions. [2018-06-24 20:45:35,019 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:45:35,019 INFO ]: Found error trace [2018-06-24 20:45:35,019 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2018-06-24 20:45:35,019 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:35,019 INFO ]: Analyzing trace with hash -1321892861, now seen corresponding path program 9 times [2018-06-24 20:45:35,019 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:35,019 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:35,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:35,020 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:35,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:35,036 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:35,453 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:35,453 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:35,453 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:35,459 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:45:35,501 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-24 20:45:35,501 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:35,507 INFO ]: Computing forward predicates... [2018-06-24 20:45:35,914 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:35,934 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:35,934 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-24 20:45:35,935 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:45:35,935 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:45:35,935 INFO ]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:45:35,935 INFO ]: Start difference. First operand 25 states and 35 transitions. Second operand 23 states. [2018-06-24 20:45:36,800 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:36,801 INFO ]: Finished difference Result 28 states and 40 transitions. [2018-06-24 20:45:36,801 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:45:36,801 INFO ]: Start accepts. Automaton has 23 states. Word has length 24 [2018-06-24 20:45:36,801 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:36,801 INFO ]: With dead ends: 28 [2018-06-24 20:45:36,801 INFO ]: Without dead ends: 28 [2018-06-24 20:45:36,802 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=1574, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 20:45:36,802 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:45:36,803 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-06-24 20:45:36,803 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:45:36,804 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2018-06-24 20:45:36,804 INFO ]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 24 [2018-06-24 20:45:36,804 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:36,804 INFO ]: Abstraction has 27 states and 38 transitions. [2018-06-24 20:45:36,804 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:45:36,804 INFO ]: Start isEmpty. Operand 27 states and 38 transitions. [2018-06-24 20:45:36,805 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:45:36,805 INFO ]: Found error trace [2018-06-24 20:45:36,805 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-06-24 20:45:36,805 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:36,805 INFO ]: Analyzing trace with hash 952912052, now seen corresponding path program 10 times [2018-06-24 20:45:36,805 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:36,805 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:36,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:36,806 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:36,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:36,823 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:37,291 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:37,291 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:37,291 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:37,298 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:45:37,348 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:45:37,348 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:37,354 INFO ]: Computing forward predicates... [2018-06-24 20:45:37,531 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:37,561 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:37,741 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-24 20:45:37,741 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:45:37,741 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:45:37,741 INFO ]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:45:37,741 INFO ]: Start difference. First operand 27 states and 38 transitions. Second operand 25 states. [2018-06-24 20:45:38,691 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:38,691 INFO ]: Finished difference Result 30 states and 43 transitions. [2018-06-24 20:45:38,692 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:45:38,692 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-24 20:45:38,692 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:38,693 INFO ]: With dead ends: 30 [2018-06-24 20:45:38,693 INFO ]: Without dead ends: 30 [2018-06-24 20:45:38,693 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=163, Invalid=1907, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:45:38,693 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:45:38,695 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-06-24 20:45:38,695 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:45:38,695 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-06-24 20:45:38,696 INFO ]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 26 [2018-06-24 20:45:38,696 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:38,696 INFO ]: Abstraction has 29 states and 41 transitions. [2018-06-24 20:45:38,696 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:45:38,696 INFO ]: Start isEmpty. Operand 29 states and 41 transitions. [2018-06-24 20:45:38,696 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:45:38,696 INFO ]: Found error trace [2018-06-24 20:45:38,696 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2018-06-24 20:45:38,696 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:38,697 INFO ]: Analyzing trace with hash 902079781, now seen corresponding path program 11 times [2018-06-24 20:45:38,697 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:38,697 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:38,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:38,697 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:38,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:38,715 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:39,231 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:39,231 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:39,231 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:39,238 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:45:39,290 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-24 20:45:39,290 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:39,299 INFO ]: Computing forward predicates... [2018-06-24 20:45:39,774 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:39,793 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:39,793 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-06-24 20:45:39,793 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:45:39,793 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:45:39,793 INFO ]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:45:39,794 INFO ]: Start difference. First operand 29 states and 41 transitions. Second operand 27 states. [2018-06-24 20:45:41,329 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:41,329 INFO ]: Finished difference Result 32 states and 46 transitions. [2018-06-24 20:45:41,329 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:45:41,329 INFO ]: Start accepts. Automaton has 27 states. Word has length 28 [2018-06-24 20:45:41,329 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:41,329 INFO ]: With dead ends: 32 [2018-06-24 20:45:41,329 INFO ]: Without dead ends: 32 [2018-06-24 20:45:41,330 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=178, Invalid=2272, Unknown=0, NotChecked=0, Total=2450 [2018-06-24 20:45:41,330 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:45:41,332 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-06-24 20:45:41,332 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:45:41,333 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2018-06-24 20:45:41,333 INFO ]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 28 [2018-06-24 20:45:41,334 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:41,334 INFO ]: Abstraction has 31 states and 44 transitions. [2018-06-24 20:45:41,334 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:45:41,334 INFO ]: Start isEmpty. Operand 31 states and 44 transitions. [2018-06-24 20:45:41,334 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:45:41,334 INFO ]: Found error trace [2018-06-24 20:45:41,334 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2018-06-24 20:45:41,334 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:41,335 INFO ]: Analyzing trace with hash -703092394, now seen corresponding path program 12 times [2018-06-24 20:45:41,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:41,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:41,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:41,335 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:41,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:41,360 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:42,036 INFO ]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:42,037 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:42,037 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:42,042 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:45:42,098 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-24 20:45:42,098 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:42,104 INFO ]: Computing forward predicates... [2018-06-24 20:45:42,157 INFO ]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:42,177 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:42,177 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-24 20:45:42,177 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:45:42,177 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:45:42,177 INFO ]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:45:42,177 INFO ]: Start difference. First operand 31 states and 44 transitions. Second operand 29 states. [2018-06-24 20:45:43,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:43,528 INFO ]: Finished difference Result 34 states and 49 transitions. [2018-06-24 20:45:43,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:45:43,540 INFO ]: Start accepts. Automaton has 29 states. Word has length 30 [2018-06-24 20:45:43,540 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:43,540 INFO ]: With dead ends: 34 [2018-06-24 20:45:43,540 INFO ]: Without dead ends: 34 [2018-06-24 20:45:43,541 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=2669, Unknown=0, NotChecked=0, Total=2862 [2018-06-24 20:45:43,541 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:45:43,543 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-06-24 20:45:43,543 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:45:43,544 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-06-24 20:45:43,544 INFO ]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 30 [2018-06-24 20:45:43,544 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:43,544 INFO ]: Abstraction has 33 states and 47 transitions. [2018-06-24 20:45:43,544 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:45:43,544 INFO ]: Start isEmpty. Operand 33 states and 47 transitions. [2018-06-24 20:45:43,545 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:45:43,545 INFO ]: Found error trace [2018-06-24 20:45:43,545 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2018-06-24 20:45:43,545 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:43,545 INFO ]: Analyzing trace with hash -1380293305, now seen corresponding path program 13 times [2018-06-24 20:45:43,545 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:43,545 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:43,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:43,546 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:43,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:43,566 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:44,963 INFO ]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:44,963 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:44,963 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:44,969 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:45,020 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:45,027 INFO ]: Computing forward predicates... [2018-06-24 20:45:45,080 INFO ]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:45,100 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:45,100 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-24 20:45:45,101 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:45:45,101 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:45:45,101 INFO ]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:45:45,101 INFO ]: Start difference. First operand 33 states and 47 transitions. Second operand 31 states. [2018-06-24 20:45:46,457 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:46,457 INFO ]: Finished difference Result 36 states and 52 transitions. [2018-06-24 20:45:46,457 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:45:46,457 INFO ]: Start accepts. Automaton has 31 states. Word has length 32 [2018-06-24 20:45:46,458 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:46,458 INFO ]: With dead ends: 36 [2018-06-24 20:45:46,458 INFO ]: Without dead ends: 36 [2018-06-24 20:45:46,459 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=208, Invalid=3098, Unknown=0, NotChecked=0, Total=3306 [2018-06-24 20:45:46,459 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:45:46,465 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-06-24 20:45:46,465 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:45:46,465 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2018-06-24 20:45:46,465 INFO ]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 32 [2018-06-24 20:45:46,465 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:46,465 INFO ]: Abstraction has 35 states and 50 transitions. [2018-06-24 20:45:46,465 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:45:46,465 INFO ]: Start isEmpty. Operand 35 states and 50 transitions. [2018-06-24 20:45:46,466 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:45:46,466 INFO ]: Found error trace [2018-06-24 20:45:46,466 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2018-06-24 20:45:46,466 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:46,466 INFO ]: Analyzing trace with hash 664660216, now seen corresponding path program 14 times [2018-06-24 20:45:46,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:46,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:46,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:46,467 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:45:46,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:46,492 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:47,268 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:47,268 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:47,268 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:47,274 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:45:47,324 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:45:47,324 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:47,335 INFO ]: Computing forward predicates... [2018-06-24 20:45:47,414 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:47,433 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:47,433 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-24 20:45:47,433 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:45:47,433 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:45:47,433 INFO ]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:45:47,433 INFO ]: Start difference. First operand 35 states and 50 transitions. Second operand 33 states. [2018-06-24 20:45:49,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:49,089 INFO ]: Finished difference Result 38 states and 55 transitions. [2018-06-24 20:45:49,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:45:49,131 INFO ]: Start accepts. Automaton has 33 states. Word has length 34 [2018-06-24 20:45:49,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:49,132 INFO ]: With dead ends: 38 [2018-06-24 20:45:49,132 INFO ]: Without dead ends: 38 [2018-06-24 20:45:49,133 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=223, Invalid=3559, Unknown=0, NotChecked=0, Total=3782 [2018-06-24 20:45:49,133 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:45:49,135 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-06-24 20:45:49,135 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:45:49,136 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2018-06-24 20:45:49,136 INFO ]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 34 [2018-06-24 20:45:49,136 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:49,136 INFO ]: Abstraction has 37 states and 53 transitions. [2018-06-24 20:45:49,136 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:45:49,136 INFO ]: Start isEmpty. Operand 37 states and 53 transitions. [2018-06-24 20:45:49,140 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:45:49,140 INFO ]: Found error trace [2018-06-24 20:45:49,140 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2018-06-24 20:45:49,140 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:49,140 INFO ]: Analyzing trace with hash -1230027671, now seen corresponding path program 15 times [2018-06-24 20:45:49,140 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:49,140 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:49,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:49,141 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:49,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:49,159 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:50,525 INFO ]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:50,525 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:50,525 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:50,530 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:45:50,676 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-06-24 20:45:50,676 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:50,683 INFO ]: Computing forward predicates... [2018-06-24 20:45:50,740 INFO ]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:50,760 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:50,760 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-24 20:45:50,761 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:45:50,761 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:45:50,761 INFO ]: CoverageRelationStatistics Valid=83, Invalid=1107, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:45:50,761 INFO ]: Start difference. First operand 37 states and 53 transitions. Second operand 35 states. [2018-06-24 20:45:52,570 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:52,570 INFO ]: Finished difference Result 40 states and 58 transitions. [2018-06-24 20:45:52,571 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:45:52,571 INFO ]: Start accepts. Automaton has 35 states. Word has length 36 [2018-06-24 20:45:52,572 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:52,572 INFO ]: With dead ends: 40 [2018-06-24 20:45:52,572 INFO ]: Without dead ends: 40 [2018-06-24 20:45:52,573 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=238, Invalid=4052, Unknown=0, NotChecked=0, Total=4290 [2018-06-24 20:45:52,573 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:45:52,575 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-06-24 20:45:52,575 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:45:52,576 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2018-06-24 20:45:52,576 INFO ]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 36 [2018-06-24 20:45:52,576 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:52,576 INFO ]: Abstraction has 39 states and 56 transitions. [2018-06-24 20:45:52,576 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:45:52,576 INFO ]: Start isEmpty. Operand 39 states and 56 transitions. [2018-06-24 20:45:52,577 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:45:52,577 INFO ]: Found error trace [2018-06-24 20:45:52,577 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2018-06-24 20:45:52,577 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:52,577 INFO ]: Analyzing trace with hash -958953574, now seen corresponding path program 16 times [2018-06-24 20:45:52,577 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:52,577 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:52,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:52,577 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:52,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:52,599 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:53,726 INFO ]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:53,726 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:53,726 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:53,732 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:45:53,791 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:45:53,791 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:53,799 INFO ]: Computing forward predicates... [2018-06-24 20:45:53,940 INFO ]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:53,960 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:53,960 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-24 20:45:53,960 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:45:53,960 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:45:53,960 INFO ]: CoverageRelationStatistics Valid=88, Invalid=1244, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:45:53,961 INFO ]: Start difference. First operand 39 states and 56 transitions. Second operand 37 states. [2018-06-24 20:45:55,642 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-24 20:45:56,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:45:56,208 INFO ]: Finished difference Result 42 states and 61 transitions. [2018-06-24 20:45:56,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:45:56,209 INFO ]: Start accepts. Automaton has 37 states. Word has length 38 [2018-06-24 20:45:56,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:45:56,210 INFO ]: With dead ends: 42 [2018-06-24 20:45:56,210 INFO ]: Without dead ends: 42 [2018-06-24 20:45:56,211 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=253, Invalid=4577, Unknown=0, NotChecked=0, Total=4830 [2018-06-24 20:45:56,211 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 20:45:56,214 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-06-24 20:45:56,214 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:45:56,214 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2018-06-24 20:45:56,214 INFO ]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 38 [2018-06-24 20:45:56,215 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:45:56,215 INFO ]: Abstraction has 41 states and 59 transitions. [2018-06-24 20:45:56,215 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:45:56,215 INFO ]: Start isEmpty. Operand 41 states and 59 transitions. [2018-06-24 20:45:56,215 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:45:56,215 INFO ]: Found error trace [2018-06-24 20:45:56,215 INFO ]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2018-06-24 20:45:56,215 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:45:56,215 INFO ]: Analyzing trace with hash 1845215883, now seen corresponding path program 17 times [2018-06-24 20:45:56,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:45:56,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:45:56,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:56,216 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:45:56,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:45:56,240 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:58,193 INFO ]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:58,193 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:45:58,193 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:45:58,200 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:45:58,472 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-06-24 20:45:58,472 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:45:58,488 INFO ]: Computing forward predicates... [2018-06-24 20:45:58,664 INFO ]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:45:58,683 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:45:58,683 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-06-24 20:45:58,684 INFO ]: Interpolant automaton has 39 states [2018-06-24 20:45:58,684 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 20:45:58,684 INFO ]: CoverageRelationStatistics Valid=93, Invalid=1389, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:45:58,684 INFO ]: Start difference. First operand 41 states and 59 transitions. Second operand 39 states. [2018-06-24 20:45:59,450 WARN ]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-24 20:46:01,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:01,425 INFO ]: Finished difference Result 44 states and 64 transitions. [2018-06-24 20:46:01,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 20:46:01,425 INFO ]: Start accepts. Automaton has 39 states. Word has length 40 [2018-06-24 20:46:01,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:01,425 INFO ]: With dead ends: 44 [2018-06-24 20:46:01,425 INFO ]: Without dead ends: 44 [2018-06-24 20:46:01,426 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=268, Invalid=5134, Unknown=0, NotChecked=0, Total=5402 [2018-06-24 20:46:01,426 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-24 20:46:01,430 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-06-24 20:46:01,430 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 20:46:01,430 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2018-06-24 20:46:01,430 INFO ]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 40 [2018-06-24 20:46:01,430 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:01,430 INFO ]: Abstraction has 43 states and 62 transitions. [2018-06-24 20:46:01,430 INFO ]: Interpolant automaton has 39 states. [2018-06-24 20:46:01,430 INFO ]: Start isEmpty. Operand 43 states and 62 transitions. [2018-06-24 20:46:01,431 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-24 20:46:01,431 INFO ]: Found error trace [2018-06-24 20:46:01,431 INFO ]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2018-06-24 20:46:01,431 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:01,431 INFO ]: Analyzing trace with hash -587397828, now seen corresponding path program 18 times [2018-06-24 20:46:01,431 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:01,431 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:01,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:01,432 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:01,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:01,461 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:02,968 INFO ]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:02,968 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:02,968 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:02,974 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:46:03,086 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-06-24 20:46:03,086 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:03,100 INFO ]: Computing forward predicates... [2018-06-24 20:46:03,196 INFO ]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:03,215 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:03,215 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-06-24 20:46:03,215 INFO ]: Interpolant automaton has 41 states [2018-06-24 20:46:03,216 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-24 20:46:03,216 INFO ]: CoverageRelationStatistics Valid=98, Invalid=1542, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:46:03,216 INFO ]: Start difference. First operand 43 states and 62 transitions. Second operand 41 states. [2018-06-24 20:46:05,735 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:05,735 INFO ]: Finished difference Result 46 states and 67 transitions. [2018-06-24 20:46:05,735 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-24 20:46:05,735 INFO ]: Start accepts. Automaton has 41 states. Word has length 42 [2018-06-24 20:46:05,736 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:05,736 INFO ]: With dead ends: 46 [2018-06-24 20:46:05,736 INFO ]: Without dead ends: 46 [2018-06-24 20:46:05,737 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=283, Invalid=5723, Unknown=0, NotChecked=0, Total=6006 [2018-06-24 20:46:05,737 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 20:46:05,740 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-06-24 20:46:05,740 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 20:46:05,742 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2018-06-24 20:46:05,742 INFO ]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 42 [2018-06-24 20:46:05,742 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:05,743 INFO ]: Abstraction has 45 states and 65 transitions. [2018-06-24 20:46:05,743 INFO ]: Interpolant automaton has 41 states. [2018-06-24 20:46:05,743 INFO ]: Start isEmpty. Operand 45 states and 65 transitions. [2018-06-24 20:46:05,743 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-24 20:46:05,743 INFO ]: Found error trace [2018-06-24 20:46:05,743 INFO ]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2018-06-24 20:46:05,743 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:05,743 INFO ]: Analyzing trace with hash -1866965075, now seen corresponding path program 19 times [2018-06-24 20:46:05,744 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:05,744 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:05,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:05,744 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:05,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:05,768 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:07,598 INFO ]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:07,598 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:07,598 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:07,608 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:07,674 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:07,683 INFO ]: Computing forward predicates... [2018-06-24 20:46:07,828 INFO ]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:07,848 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:07,848 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-06-24 20:46:07,848 INFO ]: Interpolant automaton has 43 states [2018-06-24 20:46:07,848 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-24 20:46:07,848 INFO ]: CoverageRelationStatistics Valid=103, Invalid=1703, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:46:07,849 INFO ]: Start difference. First operand 45 states and 65 transitions. Second operand 43 states. [2018-06-24 20:46:10,539 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:10,539 INFO ]: Finished difference Result 48 states and 70 transitions. [2018-06-24 20:46:10,539 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-24 20:46:10,539 INFO ]: Start accepts. Automaton has 43 states. Word has length 44 [2018-06-24 20:46:10,539 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:10,540 INFO ]: With dead ends: 48 [2018-06-24 20:46:10,540 INFO ]: Without dead ends: 48 [2018-06-24 20:46:10,541 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=298, Invalid=6344, Unknown=0, NotChecked=0, Total=6642 [2018-06-24 20:46:10,542 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-24 20:46:10,543 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-06-24 20:46:10,543 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-24 20:46:10,544 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2018-06-24 20:46:10,544 INFO ]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 44 [2018-06-24 20:46:10,544 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:10,544 INFO ]: Abstraction has 47 states and 68 transitions. [2018-06-24 20:46:10,544 INFO ]: Interpolant automaton has 43 states. [2018-06-24 20:46:10,544 INFO ]: Start isEmpty. Operand 47 states and 68 transitions. [2018-06-24 20:46:10,545 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-24 20:46:10,545 INFO ]: Found error trace [2018-06-24 20:46:10,545 INFO ]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2018-06-24 20:46:10,545 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:10,545 INFO ]: Analyzing trace with hash 1124524510, now seen corresponding path program 20 times [2018-06-24 20:46:10,545 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:10,545 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:10,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:10,545 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:10,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:10,577 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:11,925 INFO ]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:11,925 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:11,925 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:11,931 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:46:12,001 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:46:12,001 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:12,017 INFO ]: Computing forward predicates... [2018-06-24 20:46:12,584 INFO ]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:12,604 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:12,604 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-06-24 20:46:12,604 INFO ]: Interpolant automaton has 45 states [2018-06-24 20:46:12,604 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-24 20:46:12,604 INFO ]: CoverageRelationStatistics Valid=108, Invalid=1872, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:46:12,605 INFO ]: Start difference. First operand 47 states and 68 transitions. Second operand 45 states. [2018-06-24 20:46:13,774 WARN ]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-24 20:46:15,673 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:15,673 INFO ]: Finished difference Result 50 states and 73 transitions. [2018-06-24 20:46:15,674 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-24 20:46:15,674 INFO ]: Start accepts. Automaton has 45 states. Word has length 46 [2018-06-24 20:46:15,674 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:15,674 INFO ]: With dead ends: 50 [2018-06-24 20:46:15,674 INFO ]: Without dead ends: 50 [2018-06-24 20:46:15,675 INFO ]: 0 DeclaredPredicates, 130 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=313, Invalid=6997, Unknown=0, NotChecked=0, Total=7310 [2018-06-24 20:46:15,675 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-24 20:46:15,677 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-06-24 20:46:15,677 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 20:46:15,678 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-06-24 20:46:15,678 INFO ]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 46 [2018-06-24 20:46:15,678 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:15,678 INFO ]: Abstraction has 49 states and 71 transitions. [2018-06-24 20:46:15,678 INFO ]: Interpolant automaton has 45 states. [2018-06-24 20:46:15,678 INFO ]: Start isEmpty. Operand 49 states and 71 transitions. [2018-06-24 20:46:15,679 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-24 20:46:15,679 INFO ]: Found error trace [2018-06-24 20:46:15,679 INFO ]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2018-06-24 20:46:15,679 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:15,679 INFO ]: Analyzing trace with hash -1682072625, now seen corresponding path program 21 times [2018-06-24 20:46:15,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:15,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:15,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:15,679 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:15,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:15,705 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:17,040 INFO ]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:17,040 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:17,040 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:17,046 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:46:17,155 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-06-24 20:46:17,155 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:17,166 INFO ]: Computing forward predicates... [2018-06-24 20:46:17,252 INFO ]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:17,271 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:17,271 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2018-06-24 20:46:17,271 INFO ]: Interpolant automaton has 47 states [2018-06-24 20:46:17,271 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-24 20:46:17,272 INFO ]: CoverageRelationStatistics Valid=113, Invalid=2049, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 20:46:17,272 INFO ]: Start difference. First operand 49 states and 71 transitions. Second operand 47 states. [2018-06-24 20:46:20,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:20,437 INFO ]: Finished difference Result 52 states and 76 transitions. [2018-06-24 20:46:20,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-24 20:46:20,437 INFO ]: Start accepts. Automaton has 47 states. Word has length 48 [2018-06-24 20:46:20,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:20,438 INFO ]: With dead ends: 52 [2018-06-24 20:46:20,438 INFO ]: Without dead ends: 52 [2018-06-24 20:46:20,438 INFO ]: 0 DeclaredPredicates, 136 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=328, Invalid=7682, Unknown=0, NotChecked=0, Total=8010 [2018-06-24 20:46:20,438 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-24 20:46:20,440 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-06-24 20:46:20,440 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-24 20:46:20,441 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2018-06-24 20:46:20,441 INFO ]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 48 [2018-06-24 20:46:20,441 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:20,441 INFO ]: Abstraction has 51 states and 74 transitions. [2018-06-24 20:46:20,441 INFO ]: Interpolant automaton has 47 states. [2018-06-24 20:46:20,441 INFO ]: Start isEmpty. Operand 51 states and 74 transitions. [2018-06-24 20:46:20,442 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-24 20:46:20,442 INFO ]: Found error trace [2018-06-24 20:46:20,442 INFO ]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2018-06-24 20:46:20,442 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:20,442 INFO ]: Analyzing trace with hash -1582457472, now seen corresponding path program 22 times [2018-06-24 20:46:20,442 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:20,442 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:20,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:20,442 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:20,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:20,472 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:23,381 INFO ]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:23,382 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:23,382 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:23,387 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:46:23,467 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:46:23,467 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:23,478 INFO ]: Computing forward predicates... [2018-06-24 20:46:23,643 INFO ]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:23,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:23,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-06-24 20:46:23,664 INFO ]: Interpolant automaton has 49 states [2018-06-24 20:46:23,664 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-24 20:46:23,664 INFO ]: CoverageRelationStatistics Valid=118, Invalid=2234, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:46:23,664 INFO ]: Start difference. First operand 51 states and 74 transitions. Second operand 49 states. Received shutdown request... [2018-06-24 20:46:25,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:46:25,763 WARN ]: Verification canceled [2018-06-24 20:46:25,764 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:46:25,765 WARN ]: Timeout [2018-06-24 20:46:25,766 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:46:25 BasicIcfg [2018-06-24 20:46:25,766 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:46:25,766 INFO ]: Toolchain (without parser) took 62058.72 ms. Allocated memory was 305.1 MB in the beginning and 857.7 MB in the end (delta: 552.6 MB). Free memory was 261.5 MB in the beginning and 601.8 MB in the end (delta: -340.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:46:25,767 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:46:25,767 INFO ]: ChcToBoogie took 53.64 ms. Allocated memory is still 305.1 MB. Free memory was 261.5 MB in the beginning and 258.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:46:25,768 INFO ]: Boogie Preprocessor took 34.51 ms. Allocated memory is still 305.1 MB. Free memory was 258.5 MB in the beginning and 257.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 20:46:25,768 INFO ]: RCFGBuilder took 223.34 ms. Allocated memory is still 305.1 MB. Free memory was 257.5 MB in the beginning and 248.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:46:25,769 INFO ]: BlockEncodingV2 took 102.14 ms. Allocated memory is still 305.1 MB. Free memory was 248.5 MB in the beginning and 246.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:46:25,769 INFO ]: TraceAbstraction took 61635.28 ms. Allocated memory was 305.1 MB in the beginning and 857.7 MB in the end (delta: 552.6 MB). Free memory was 245.5 MB in the beginning and 601.8 MB in the end (delta: -356.2 MB). Peak memory consumption was 196.4 MB. Max. memory is 3.6 GB. [2018-06-24 20:46:25,772 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 11 locations, 14 edges - StatisticsResult: Encoded RCFG 7 locations, 12 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 53.64 ms. Allocated memory is still 305.1 MB. Free memory was 261.5 MB in the beginning and 258.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.51 ms. Allocated memory is still 305.1 MB. Free memory was 258.5 MB in the beginning and 257.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 223.34 ms. Allocated memory is still 305.1 MB. Free memory was 257.5 MB in the beginning and 248.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 102.14 ms. Allocated memory is still 305.1 MB. Free memory was 248.5 MB in the beginning and 246.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 61635.28 ms. Allocated memory was 305.1 MB in the beginning and 857.7 MB in the end (delta: 552.6 MB). Free memory was 245.5 MB in the beginning and 601.8 MB in the end (delta: -356.2 MB). Peak memory consumption was 196.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (51states) and interpolant automaton (currently 31 states, 49 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. TIMEOUT Result, 61.5s OverallTime, 25 OverallIterations, 23 TraceHistogramMax, 33.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 124 SDtfs, 52 SDslu, 1953 SDs, 0 SdLazy, 25539 SolverSat, 1460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1760 GetRequests, 632 SyntacticMatches, 22 SemanticMatches, 1105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7271 ImplicationChecksByTransitivity, 39.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 27 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 24.7s InterpolantComputationTime, 1314 NumberOfCodeBlocks, 1314 NumberOfCodeBlocksAsserted, 170 NumberOfCheckSat, 1265 ConstructedInterpolants, 0 QuantifiedInterpolants, 920726 SizeOfPredicates, 2192 NumberOfNonLiveVariables, 9337 ConjunctsInSsa, 6729 ConjunctsInUnsatCore, 49 InterpolantComputations, 3 PerfectInterpolantSequences, 6/8104 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/barthe2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-46-25-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-46-25-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-46-25-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-46-25-782.csv Completed graceful shutdown