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/hopv/lia/mochi/enc-zip_unzip.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:20:52,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:20:52,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:20:52,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:20:52,375 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:20:52,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:20:52,378 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:20:52,384 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:20:52,386 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:20:52,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:20:52,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:20:52,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:20:52,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:20:52,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:20:52,392 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:20:52,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:20:52,395 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:20:52,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:20:52,405 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:20:52,407 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:20:52,408 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:20:52,408 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:20:52,413 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:20:52,413 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:20:52,413 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:20:52,414 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:20:52,415 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:20:52,415 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:20:52,418 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:20:52,419 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:20:52,419 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:20:52,420 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:20:52,420 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:20:52,420 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:20:52,421 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:20:52,423 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:20:52,423 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:20:52,445 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:20:52,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:20:52,445 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:20:52,445 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:20:52,446 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:20:52,447 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:20:52,448 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:20:52,448 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:20:52,448 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:20:52,448 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:20:52,449 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:20:52,449 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:20:52,449 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:20:52,449 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:20:52,449 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:20:52,449 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:20:52,450 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:20:52,450 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:20:52,450 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:20:52,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:20:52,450 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:20:52,455 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:20:52,455 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:20:52,509 INFO ]: Repository-Root is: /tmp [2018-06-26 18:20:52,526 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:20:52,531 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:20:52,533 INFO ]: Initializing SmtParser... [2018-06-26 18:20:52,533 INFO ]: SmtParser initialized [2018-06-26 18:20:52,533 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 [2018-06-26 18:20:52,535 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-26 18:20:52,620 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 unknown [2018-06-26 18:20:52,913 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 [2018-06-26 18:20:52,918 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:20:52,924 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:20:52,925 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:20:52,925 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:20:52,925 INFO ]: ChcToBoogie initialized [2018-06-26 18:20:52,928 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:20:52" (1/1) ... [2018-06-26 18:20:52,988 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:20:52 Unit [2018-06-26 18:20:52,988 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:20:52,989 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:20:52,989 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:20:52,989 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:20:53,013 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:20:52" (1/1) ... [2018-06-26 18:20:53,013 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:20:52" (1/1) ... [2018-06-26 18:20:53,023 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:20:52" (1/1) ... [2018-06-26 18:20:53,024 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:20:52" (1/1) ... [2018-06-26 18:20:53,028 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:20:52" (1/1) ... [2018-06-26 18:20:53,031 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:20:52" (1/1) ... [2018-06-26 18:20:53,032 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:20:52" (1/1) ... [2018-06-26 18:20:53,033 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:20:53,034 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:20:53,034 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:20:53,034 INFO ]: RCFGBuilder initialized [2018-06-26 18:20:53,035 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:20:52" (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-26 18:20:53,047 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:20:53,047 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:20:53,047 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:20:53,047 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:20:53,047 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:20:53,047 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-26 18:20:53,424 INFO ]: Using library mode [2018-06-26 18:20:53,424 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:20:53 BoogieIcfgContainer [2018-06-26 18:20:53,424 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:20:53,425 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:20:53,425 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:20:53,425 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:20:53,428 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:20:53" (1/1) ... [2018-06-26 18:20:53,441 INFO ]: Initial Icfg 20 locations, 28 edges [2018-06-26 18:20:53,442 INFO ]: Using Remove infeasible edges [2018-06-26 18:20:53,443 INFO ]: Using Maximize final states [2018-06-26 18:20:53,443 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:20:53,443 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:20:53,445 INFO ]: Using Remove sink states [2018-06-26 18:20:53,446 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:20:53,446 INFO ]: Using Use SBE [2018-06-26 18:20:53,454 INFO ]: SBE split 0 edges [2018-06-26 18:20:53,459 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 18:20:53,461 INFO ]: 0 new accepting states [2018-06-26 18:20:53,553 INFO ]: Removed 19 edges and 7 locations by large block encoding [2018-06-26 18:20:53,555 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:20:53,557 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:20:53,557 INFO ]: 0 new accepting states [2018-06-26 18:20:53,557 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:20:53,558 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:20:53,558 INFO ]: Encoded RCFG 11 locations, 19 edges [2018-06-26 18:20:53,558 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:20:53 BasicIcfg [2018-06-26 18:20:53,558 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:20:53,559 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:20:53,559 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:20:53,562 INFO ]: TraceAbstraction initialized [2018-06-26 18:20:53,562 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:20:52" (1/4) ... [2018-06-26 18:20:53,563 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3cbd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:20:53, skipping insertion in model container [2018-06-26 18:20:53,563 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:20:52" (2/4) ... [2018-06-26 18:20:53,564 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3cbd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:20:53, skipping insertion in model container [2018-06-26 18:20:53,564 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:20:53" (3/4) ... [2018-06-26 18:20:53,564 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3cbd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:20:53, skipping insertion in model container [2018-06-26 18:20:53,564 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:20:53" (4/4) ... [2018-06-26 18:20:53,566 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:20:53,576 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:20:53,594 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:20:53,634 INFO ]: Using default assertion order modulation [2018-06-26 18:20:53,635 INFO ]: Interprodecural is true [2018-06-26 18:20:53,635 INFO ]: Hoare is false [2018-06-26 18:20:53,635 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:20:53,635 INFO ]: Backedges is TWOTRACK [2018-06-26 18:20:53,635 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:20:53,635 INFO ]: Difference is false [2018-06-26 18:20:53,635 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:20:53,635 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:20:53,643 INFO ]: Start isEmpty. Operand 11 states. [2018-06-26 18:20:53,652 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:20:53,652 INFO ]: Found error trace [2018-06-26 18:20:53,653 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:20:53,653 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:53,658 INFO ]: Analyzing trace with hash 36145960, now seen corresponding path program 1 times [2018-06-26 18:20:53,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:53,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:53,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:53,693 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:53,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:53,730 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:53,791 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:20:53,792 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:20:53,792 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:20:53,793 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:20:53,803 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:20:53,804 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:20:53,805 INFO ]: Start difference. First operand 11 states. Second operand 3 states. [2018-06-26 18:20:53,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:53,938 INFO ]: Finished difference Result 17 states and 32 transitions. [2018-06-26 18:20:53,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:20:53,939 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:20:53,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:53,947 INFO ]: With dead ends: 17 [2018-06-26 18:20:53,947 INFO ]: Without dead ends: 17 [2018-06-26 18:20:53,949 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:20:53,961 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 18:20:53,984 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 18:20:53,987 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 18:20:53,988 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 32 transitions. [2018-06-26 18:20:53,989 INFO ]: Start accepts. Automaton has 17 states and 32 transitions. Word has length 5 [2018-06-26 18:20:53,990 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:53,990 INFO ]: Abstraction has 17 states and 32 transitions. [2018-06-26 18:20:53,990 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:20:53,991 INFO ]: Start isEmpty. Operand 17 states and 32 transitions. [2018-06-26 18:20:53,992 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:20:53,992 INFO ]: Found error trace [2018-06-26 18:20:53,992 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:20:53,992 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:53,992 INFO ]: Analyzing trace with hash 1124113280, now seen corresponding path program 1 times [2018-06-26 18:20:53,992 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:53,992 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:53,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:53,993 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:53,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:54,009 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:54,087 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:20:54,087 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:20:54,087 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:20:54,088 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:20:54,088 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:20:54,088 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:20:54,089 INFO ]: Start difference. First operand 17 states and 32 transitions. Second operand 3 states. [2018-06-26 18:20:54,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:54,188 INFO ]: Finished difference Result 27 states and 52 transitions. [2018-06-26 18:20:54,190 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:20:54,190 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:20:54,190 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:54,193 INFO ]: With dead ends: 27 [2018-06-26 18:20:54,193 INFO ]: Without dead ends: 27 [2018-06-26 18:20:54,194 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:20:54,196 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 18:20:54,202 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-06-26 18:20:54,202 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 18:20:54,203 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2018-06-26 18:20:54,203 INFO ]: Start accepts. Automaton has 19 states and 36 transitions. Word has length 6 [2018-06-26 18:20:54,203 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:54,203 INFO ]: Abstraction has 19 states and 36 transitions. [2018-06-26 18:20:54,203 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:20:54,203 INFO ]: Start isEmpty. Operand 19 states and 36 transitions. [2018-06-26 18:20:54,205 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:20:54,206 INFO ]: Found error trace [2018-06-26 18:20:54,206 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:20:54,206 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:54,206 INFO ]: Analyzing trace with hash 1125036801, now seen corresponding path program 1 times [2018-06-26 18:20:54,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:54,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:54,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:54,207 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:54,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:54,221 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:54,345 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:20:54,345 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:20:54,345 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:20:54,345 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:20:54,345 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:20:54,345 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:20:54,346 INFO ]: Start difference. First operand 19 states and 36 transitions. Second operand 3 states. [2018-06-26 18:20:54,392 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:54,392 INFO ]: Finished difference Result 29 states and 54 transitions. [2018-06-26 18:20:54,392 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:20:54,392 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:20:54,392 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:54,393 INFO ]: With dead ends: 29 [2018-06-26 18:20:54,393 INFO ]: Without dead ends: 29 [2018-06-26 18:20:54,394 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:20:54,394 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 18:20:54,401 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 17. [2018-06-26 18:20:54,401 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 18:20:54,401 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2018-06-26 18:20:54,401 INFO ]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 6 [2018-06-26 18:20:54,402 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:54,402 INFO ]: Abstraction has 17 states and 30 transitions. [2018-06-26 18:20:54,402 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:20:54,402 INFO ]: Start isEmpty. Operand 17 states and 30 transitions. [2018-06-26 18:20:54,403 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:20:54,403 INFO ]: Found error trace [2018-06-26 18:20:54,403 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:54,403 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:54,403 INFO ]: Analyzing trace with hash -423722168, now seen corresponding path program 1 times [2018-06-26 18:20:54,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:54,403 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:54,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:54,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:54,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:54,413 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:54,457 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:20:54,457 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:20:54,457 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:20:54,457 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:20:54,458 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:20:54,458 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:20:54,458 INFO ]: Start difference. First operand 17 states and 30 transitions. Second operand 3 states. [2018-06-26 18:20:54,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:54,667 INFO ]: Finished difference Result 23 states and 40 transitions. [2018-06-26 18:20:54,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:20:54,667 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 18:20:54,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:54,668 INFO ]: With dead ends: 23 [2018-06-26 18:20:54,668 INFO ]: Without dead ends: 23 [2018-06-26 18:20:54,668 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:20:54,669 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 18:20:54,672 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-26 18:20:54,672 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 18:20:54,673 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2018-06-26 18:20:54,673 INFO ]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 11 [2018-06-26 18:20:54,673 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:54,673 INFO ]: Abstraction has 23 states and 40 transitions. [2018-06-26 18:20:54,673 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:20:54,673 INFO ]: Start isEmpty. Operand 23 states and 40 transitions. [2018-06-26 18:20:54,674 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:20:54,674 INFO ]: Found error trace [2018-06-26 18:20:54,674 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:54,674 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:54,675 INFO ]: Analyzing trace with hash 1050751458, now seen corresponding path program 1 times [2018-06-26 18:20:54,675 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:54,675 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:54,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:54,676 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:54,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:54,692 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:54,969 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:20:54,970 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:20:54,970 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-26 18:20:54,970 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:20:54,970 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:20:54,970 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:20:54,970 INFO ]: Start difference. First operand 23 states and 40 transitions. Second operand 7 states. [2018-06-26 18:20:55,411 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:55,412 INFO ]: Finished difference Result 49 states and 94 transitions. [2018-06-26 18:20:55,412 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:20:55,412 INFO ]: Start accepts. Automaton has 7 states. Word has length 16 [2018-06-26 18:20:55,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:55,414 INFO ]: With dead ends: 49 [2018-06-26 18:20:55,414 INFO ]: Without dead ends: 45 [2018-06-26 18:20:55,415 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:20:55,415 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-26 18:20:55,427 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-06-26 18:20:55,427 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:20:55,429 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 60 transitions. [2018-06-26 18:20:55,429 INFO ]: Start accepts. Automaton has 34 states and 60 transitions. Word has length 16 [2018-06-26 18:20:55,429 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:55,429 INFO ]: Abstraction has 34 states and 60 transitions. [2018-06-26 18:20:55,429 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:20:55,429 INFO ]: Start isEmpty. Operand 34 states and 60 transitions. [2018-06-26 18:20:55,430 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:20:55,431 INFO ]: Found error trace [2018-06-26 18:20:55,431 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:55,431 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:55,431 INFO ]: Analyzing trace with hash -1736664029, now seen corresponding path program 1 times [2018-06-26 18:20:55,431 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:55,431 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:55,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:55,432 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:55,433 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:55,451 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:55,513 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:20:55,513 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:20:55,513 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-26 18:20:55,513 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:20:55,513 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:20:55,514 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:20:55,514 INFO ]: Start difference. First operand 34 states and 60 transitions. Second operand 7 states. [2018-06-26 18:20:56,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:56,116 INFO ]: Finished difference Result 51 states and 103 transitions. [2018-06-26 18:20:56,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:20:56,116 INFO ]: Start accepts. Automaton has 7 states. Word has length 16 [2018-06-26 18:20:56,116 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:56,118 INFO ]: With dead ends: 51 [2018-06-26 18:20:56,118 INFO ]: Without dead ends: 51 [2018-06-26 18:20:56,118 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:20:56,118 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-26 18:20:56,136 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-06-26 18:20:56,136 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:20:56,138 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 60 transitions. [2018-06-26 18:20:56,138 INFO ]: Start accepts. Automaton has 34 states and 60 transitions. Word has length 16 [2018-06-26 18:20:56,138 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:56,138 INFO ]: Abstraction has 34 states and 60 transitions. [2018-06-26 18:20:56,138 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:20:56,138 INFO ]: Start isEmpty. Operand 34 states and 60 transitions. [2018-06-26 18:20:56,141 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:20:56,141 INFO ]: Found error trace [2018-06-26 18:20:56,141 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:56,141 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:56,141 INFO ]: Analyzing trace with hash -1112280787, now seen corresponding path program 1 times [2018-06-26 18:20:56,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:56,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:56,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:56,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:56,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:56,157 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:56,236 INFO ]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:20:56,236 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:56,236 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-26 18:20:56,242 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:56,279 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:56,287 INFO ]: Computing forward predicates... [2018-06-26 18:20:56,342 INFO ]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:20:56,361 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:56,361 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 18:20:56,362 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:20:56,362 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:20:56,362 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:20:56,362 INFO ]: Start difference. First operand 34 states and 60 transitions. Second operand 8 states. [2018-06-26 18:20:56,561 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-26 18:20:57,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:57,361 INFO ]: Finished difference Result 70 states and 154 transitions. [2018-06-26 18:20:57,363 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:20:57,363 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-26 18:20:57,363 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:57,365 INFO ]: With dead ends: 70 [2018-06-26 18:20:57,365 INFO ]: Without dead ends: 70 [2018-06-26 18:20:57,366 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:20:57,366 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-26 18:20:57,387 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 37. [2018-06-26 18:20:57,387 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 18:20:57,389 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2018-06-26 18:20:57,389 INFO ]: Start accepts. Automaton has 37 states and 66 transitions. Word has length 17 [2018-06-26 18:20:57,389 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:57,389 INFO ]: Abstraction has 37 states and 66 transitions. [2018-06-26 18:20:57,389 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:20:57,389 INFO ]: Start isEmpty. Operand 37 states and 66 transitions. [2018-06-26 18:20:57,390 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:20:57,391 INFO ]: Found error trace [2018-06-26 18:20:57,391 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:57,391 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:57,391 INFO ]: Analyzing trace with hash -1622814964, now seen corresponding path program 1 times [2018-06-26 18:20:57,391 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:57,391 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:57,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:57,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:57,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:57,405 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:57,492 INFO ]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:20:57,492 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:57,492 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:57,499 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:57,530 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:57,532 INFO ]: Computing forward predicates... [2018-06-26 18:20:57,673 INFO ]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:20:57,702 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:57,702 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 18:20:57,702 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:20:57,702 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:20:57,702 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:20:57,702 INFO ]: Start difference. First operand 37 states and 66 transitions. Second operand 8 states. [2018-06-26 18:20:58,018 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:58,019 INFO ]: Finished difference Result 73 states and 157 transitions. [2018-06-26 18:20:58,019 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:20:58,019 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-26 18:20:58,019 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:58,020 INFO ]: With dead ends: 73 [2018-06-26 18:20:58,020 INFO ]: Without dead ends: 73 [2018-06-26 18:20:58,021 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:20:58,021 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-26 18:20:58,028 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 29. [2018-06-26 18:20:58,029 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 18:20:58,029 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 48 transitions. [2018-06-26 18:20:58,029 INFO ]: Start accepts. Automaton has 29 states and 48 transitions. Word has length 17 [2018-06-26 18:20:58,029 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:58,029 INFO ]: Abstraction has 29 states and 48 transitions. [2018-06-26 18:20:58,029 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:20:58,029 INFO ]: Start isEmpty. Operand 29 states and 48 transitions. [2018-06-26 18:20:58,030 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 18:20:58,030 INFO ]: Found error trace [2018-06-26 18:20:58,030 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:58,030 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:58,031 INFO ]: Analyzing trace with hash -60860028, now seen corresponding path program 1 times [2018-06-26 18:20:58,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:58,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:58,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:58,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:58,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:58,046 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:58,138 INFO ]: Checked inductivity of 34 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:20:58,138 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:58,138 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-26 18:20:58,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:58,188 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:58,191 INFO ]: Computing forward predicates... [2018-06-26 18:20:58,235 INFO ]: Checked inductivity of 34 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:20:58,255 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:58,255 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 18:20:58,255 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:20:58,255 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:20:58,255 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:20:58,255 INFO ]: Start difference. First operand 29 states and 48 transitions. Second operand 9 states. [2018-06-26 18:20:58,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:58,609 INFO ]: Finished difference Result 58 states and 106 transitions. [2018-06-26 18:20:58,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:20:58,609 INFO ]: Start accepts. Automaton has 9 states. Word has length 26 [2018-06-26 18:20:58,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:58,610 INFO ]: With dead ends: 58 [2018-06-26 18:20:58,610 INFO ]: Without dead ends: 58 [2018-06-26 18:20:58,610 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:20:58,610 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-26 18:20:58,620 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 41. [2018-06-26 18:20:58,620 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 18:20:58,621 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 71 transitions. [2018-06-26 18:20:58,621 INFO ]: Start accepts. Automaton has 41 states and 71 transitions. Word has length 26 [2018-06-26 18:20:58,621 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:58,622 INFO ]: Abstraction has 41 states and 71 transitions. [2018-06-26 18:20:58,622 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:20:58,622 INFO ]: Start isEmpty. Operand 41 states and 71 transitions. [2018-06-26 18:20:58,623 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 18:20:58,623 INFO ]: Found error trace [2018-06-26 18:20:58,623 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:58,623 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:58,623 INFO ]: Analyzing trace with hash -2138069371, now seen corresponding path program 1 times [2018-06-26 18:20:58,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:58,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:58,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:58,624 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:58,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:58,638 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:58,720 INFO ]: Checked inductivity of 34 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:20:58,720 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:58,720 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-26 18:20:58,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:58,747 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:58,750 INFO ]: Computing forward predicates... [2018-06-26 18:20:58,768 INFO ]: Checked inductivity of 34 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:20:58,787 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:58,787 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 18:20:58,787 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:20:58,788 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:20:58,788 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:20:58,788 INFO ]: Start difference. First operand 41 states and 71 transitions. Second operand 9 states. [2018-06-26 18:20:59,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:59,085 INFO ]: Finished difference Result 64 states and 124 transitions. [2018-06-26 18:20:59,086 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:20:59,086 INFO ]: Start accepts. Automaton has 9 states. Word has length 26 [2018-06-26 18:20:59,086 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:59,087 INFO ]: With dead ends: 64 [2018-06-26 18:20:59,087 INFO ]: Without dead ends: 64 [2018-06-26 18:20:59,087 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:20:59,087 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-26 18:20:59,095 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 41. [2018-06-26 18:20:59,095 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 18:20:59,096 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 71 transitions. [2018-06-26 18:20:59,096 INFO ]: Start accepts. Automaton has 41 states and 71 transitions. Word has length 26 [2018-06-26 18:20:59,096 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:59,096 INFO ]: Abstraction has 41 states and 71 transitions. [2018-06-26 18:20:59,096 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:20:59,096 INFO ]: Start isEmpty. Operand 41 states and 71 transitions. [2018-06-26 18:20:59,097 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 18:20:59,097 INFO ]: Found error trace [2018-06-26 18:20:59,097 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:59,097 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:59,097 INFO ]: Analyzing trace with hash -1924155633, now seen corresponding path program 1 times [2018-06-26 18:20:59,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:59,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:59,098 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:59,098 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:59,098 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:59,112 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:59,211 INFO ]: Checked inductivity of 35 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:20:59,211 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:59,211 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-26 18:20:59,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:59,256 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:59,259 INFO ]: Computing forward predicates... [2018-06-26 18:20:59,287 INFO ]: Checked inductivity of 35 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:20:59,306 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:59,306 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 18:20:59,306 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:20:59,306 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:20:59,307 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:20:59,307 INFO ]: Start difference. First operand 41 states and 71 transitions. Second operand 10 states. [2018-06-26 18:20:59,625 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:20:59,625 INFO ]: Finished difference Result 79 states and 166 transitions. [2018-06-26 18:20:59,625 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 18:20:59,625 INFO ]: Start accepts. Automaton has 10 states. Word has length 27 [2018-06-26 18:20:59,626 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:20:59,627 INFO ]: With dead ends: 79 [2018-06-26 18:20:59,627 INFO ]: Without dead ends: 79 [2018-06-26 18:20:59,627 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:20:59,627 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-26 18:20:59,639 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 44. [2018-06-26 18:20:59,640 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 18:20:59,640 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 77 transitions. [2018-06-26 18:20:59,640 INFO ]: Start accepts. Automaton has 44 states and 77 transitions. Word has length 27 [2018-06-26 18:20:59,641 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:20:59,641 INFO ]: Abstraction has 44 states and 77 transitions. [2018-06-26 18:20:59,641 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:20:59,641 INFO ]: Start isEmpty. Operand 44 states and 77 transitions. [2018-06-26 18:20:59,642 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 18:20:59,642 INFO ]: Found error trace [2018-06-26 18:20:59,642 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:20:59,642 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:20:59,642 INFO ]: Analyzing trace with hash -1893135826, now seen corresponding path program 1 times [2018-06-26 18:20:59,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:20:59,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:20:59,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:59,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:20:59,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:20:59,655 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:59,796 INFO ]: Checked inductivity of 35 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:20:59,796 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:20:59,796 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 18:20:59,810 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:20:59,851 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:20:59,854 INFO ]: Computing forward predicates... [2018-06-26 18:20:59,900 INFO ]: Checked inductivity of 35 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:20:59,931 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:20:59,931 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 18:20:59,931 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:20:59,931 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:20:59,931 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:20:59,932 INFO ]: Start difference. First operand 44 states and 77 transitions. Second operand 10 states. [2018-06-26 18:21:00,234 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:00,234 INFO ]: Finished difference Result 82 states and 172 transitions. [2018-06-26 18:21:00,303 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 18:21:00,303 INFO ]: Start accepts. Automaton has 10 states. Word has length 27 [2018-06-26 18:21:00,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:00,305 INFO ]: With dead ends: 82 [2018-06-26 18:21:00,305 INFO ]: Without dead ends: 82 [2018-06-26 18:21:00,306 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:21:00,306 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-26 18:21:00,320 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 44. [2018-06-26 18:21:00,320 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 18:21:00,321 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 77 transitions. [2018-06-26 18:21:00,321 INFO ]: Start accepts. Automaton has 44 states and 77 transitions. Word has length 27 [2018-06-26 18:21:00,322 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:00,322 INFO ]: Abstraction has 44 states and 77 transitions. [2018-06-26 18:21:00,322 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:21:00,322 INFO ]: Start isEmpty. Operand 44 states and 77 transitions. [2018-06-26 18:21:00,323 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 18:21:00,323 INFO ]: Found error trace [2018-06-26 18:21:00,323 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:00,324 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:00,324 INFO ]: Analyzing trace with hash 443222756, now seen corresponding path program 2 times [2018-06-26 18:21:00,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:00,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:00,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:00,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:00,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:00,343 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:00,788 INFO ]: Checked inductivity of 37 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:21:00,789 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:00,789 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-26 18:21:00,795 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:21:00,836 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:21:00,836 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:00,839 INFO ]: Computing forward predicates... [2018-06-26 18:21:00,899 INFO ]: Checked inductivity of 37 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:21:00,932 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:00,932 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 18:21:00,933 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:21:00,933 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:21:00,933 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:21:00,933 INFO ]: Start difference. First operand 44 states and 77 transitions. Second operand 11 states. [2018-06-26 18:21:01,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:01,971 INFO ]: Finished difference Result 115 states and 282 transitions. [2018-06-26 18:21:01,971 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 18:21:01,972 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-26 18:21:01,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:01,974 INFO ]: With dead ends: 115 [2018-06-26 18:21:01,974 INFO ]: Without dead ends: 115 [2018-06-26 18:21:01,974 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2018-06-26 18:21:01,974 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-26 18:21:02,006 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 62. [2018-06-26 18:21:02,007 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-26 18:21:02,008 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 115 transitions. [2018-06-26 18:21:02,008 INFO ]: Start accepts. Automaton has 62 states and 115 transitions. Word has length 28 [2018-06-26 18:21:02,008 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:02,008 INFO ]: Abstraction has 62 states and 115 transitions. [2018-06-26 18:21:02,008 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:21:02,008 INFO ]: Start isEmpty. Operand 62 states and 115 transitions. [2018-06-26 18:21:02,009 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 18:21:02,010 INFO ]: Found error trace [2018-06-26 18:21:02,010 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:02,010 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:02,010 INFO ]: Analyzing trace with hash 1404836773, now seen corresponding path program 2 times [2018-06-26 18:21:02,010 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:02,010 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:02,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:02,010 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:02,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:02,023 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:02,187 INFO ]: Checked inductivity of 37 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:21:02,187 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:02,187 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-26 18:21:02,195 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:21:02,242 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:21:02,242 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:02,245 INFO ]: Computing forward predicates... [2018-06-26 18:21:02,637 INFO ]: Checked inductivity of 37 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:21:02,658 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:02,658 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 18:21:02,658 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:21:02,658 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:21:02,658 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:21:02,658 INFO ]: Start difference. First operand 62 states and 115 transitions. Second operand 11 states. [2018-06-26 18:21:03,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:03,262 INFO ]: Finished difference Result 121 states and 309 transitions. [2018-06-26 18:21:03,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 18:21:03,262 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-26 18:21:03,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:03,263 INFO ]: With dead ends: 121 [2018-06-26 18:21:03,263 INFO ]: Without dead ends: 121 [2018-06-26 18:21:03,264 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2018-06-26 18:21:03,264 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-26 18:21:03,375 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 50. [2018-06-26 18:21:03,375 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-26 18:21:03,375 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2018-06-26 18:21:03,375 INFO ]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 28 [2018-06-26 18:21:03,376 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:03,376 INFO ]: Abstraction has 50 states and 85 transitions. [2018-06-26 18:21:03,376 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:21:03,376 INFO ]: Start isEmpty. Operand 50 states and 85 transitions. [2018-06-26 18:21:03,377 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 18:21:03,377 INFO ]: Found error trace [2018-06-26 18:21:03,377 INFO ]: trace histogram [7, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:03,377 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:03,377 INFO ]: Analyzing trace with hash -713937978, now seen corresponding path program 3 times [2018-06-26 18:21:03,377 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:03,377 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:03,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:03,378 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:03,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:03,391 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:03,499 INFO ]: Checked inductivity of 78 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-26 18:21:03,499 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:03,499 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-26 18:21:03,507 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:21:03,551 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 18:21:03,551 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:03,555 INFO ]: Computing forward predicates... [2018-06-26 18:21:03,578 INFO ]: Checked inductivity of 78 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-26 18:21:03,597 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:03,598 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-26 18:21:03,598 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:21:03,598 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:21:03,598 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:21:03,598 INFO ]: Start difference. First operand 50 states and 85 transitions. Second operand 12 states. [2018-06-26 18:21:03,948 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:03,948 INFO ]: Finished difference Result 103 states and 228 transitions. [2018-06-26 18:21:03,949 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 18:21:03,949 INFO ]: Start accepts. Automaton has 12 states. Word has length 38 [2018-06-26 18:21:03,949 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:03,951 INFO ]: With dead ends: 103 [2018-06-26 18:21:03,951 INFO ]: Without dead ends: 103 [2018-06-26 18:21:03,951 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:21:03,951 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-26 18:21:03,964 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 53. [2018-06-26 18:21:03,964 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-26 18:21:03,964 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 91 transitions. [2018-06-26 18:21:03,964 INFO ]: Start accepts. Automaton has 53 states and 91 transitions. Word has length 38 [2018-06-26 18:21:03,965 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:03,965 INFO ]: Abstraction has 53 states and 91 transitions. [2018-06-26 18:21:03,965 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:21:03,965 INFO ]: Start isEmpty. Operand 53 states and 91 transitions. [2018-06-26 18:21:03,966 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 18:21:03,966 INFO ]: Found error trace [2018-06-26 18:21:03,966 INFO ]: trace histogram [7, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:03,966 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:03,966 INFO ]: Analyzing trace with hash -384172217, now seen corresponding path program 3 times [2018-06-26 18:21:03,966 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:03,966 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:03,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:03,967 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:03,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:03,983 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:04,176 INFO ]: Checked inductivity of 78 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-26 18:21:04,176 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:04,176 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-26 18:21:04,181 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:21:04,209 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 18:21:04,209 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:04,211 INFO ]: Computing forward predicates... [2018-06-26 18:21:04,249 INFO ]: Checked inductivity of 78 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-26 18:21:04,281 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:04,281 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-26 18:21:04,281 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:21:04,281 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:21:04,281 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:21:04,282 INFO ]: Start difference. First operand 53 states and 91 transitions. Second operand 12 states. [2018-06-26 18:21:04,573 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:04,573 INFO ]: Finished difference Result 106 states and 234 transitions. [2018-06-26 18:21:04,574 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 18:21:04,574 INFO ]: Start accepts. Automaton has 12 states. Word has length 38 [2018-06-26 18:21:04,574 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:04,575 INFO ]: With dead ends: 106 [2018-06-26 18:21:04,575 INFO ]: Without dead ends: 106 [2018-06-26 18:21:04,576 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:21:04,576 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-26 18:21:04,586 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 53. [2018-06-26 18:21:04,586 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-26 18:21:04,587 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 91 transitions. [2018-06-26 18:21:04,587 INFO ]: Start accepts. Automaton has 53 states and 91 transitions. Word has length 38 [2018-06-26 18:21:04,587 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:04,587 INFO ]: Abstraction has 53 states and 91 transitions. [2018-06-26 18:21:04,587 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:21:04,587 INFO ]: Start isEmpty. Operand 53 states and 91 transitions. [2018-06-26 18:21:04,589 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 18:21:04,589 INFO ]: Found error trace [2018-06-26 18:21:04,589 INFO ]: trace histogram [7, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:04,589 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:04,589 INFO ]: Analyzing trace with hash -1729916719, now seen corresponding path program 4 times [2018-06-26 18:21:04,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:04,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:04,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:04,590 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:04,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:04,604 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:04,786 INFO ]: Checked inductivity of 81 backedges. 14 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-26 18:21:04,786 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:04,786 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-26 18:21:04,795 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:21:04,823 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:21:04,823 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:04,826 INFO ]: Computing forward predicates... [2018-06-26 18:21:04,896 INFO ]: Checked inductivity of 81 backedges. 14 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-26 18:21:04,914 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:04,914 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 18:21:04,915 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:21:04,915 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:21:04,915 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:21:04,915 INFO ]: Start difference. First operand 53 states and 91 transitions. Second operand 13 states. [2018-06-26 18:21:06,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:06,242 INFO ]: Finished difference Result 151 states and 416 transitions. [2018-06-26 18:21:06,242 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 18:21:06,242 INFO ]: Start accepts. Automaton has 13 states. Word has length 39 [2018-06-26 18:21:06,242 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:06,244 INFO ]: With dead ends: 151 [2018-06-26 18:21:06,244 INFO ]: Without dead ends: 151 [2018-06-26 18:21:06,245 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 18:21:06,245 INFO ]: Start minimizeSevpa. Operand 151 states. [2018-06-26 18:21:06,274 INFO ]: Finished minimizeSevpa. Reduced states from 151 to 74. [2018-06-26 18:21:06,276 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-26 18:21:06,277 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 135 transitions. [2018-06-26 18:21:06,277 INFO ]: Start accepts. Automaton has 74 states and 135 transitions. Word has length 39 [2018-06-26 18:21:06,277 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:06,277 INFO ]: Abstraction has 74 states and 135 transitions. [2018-06-26 18:21:06,277 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:21:06,277 INFO ]: Start isEmpty. Operand 74 states and 135 transitions. [2018-06-26 18:21:06,279 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 18:21:06,279 INFO ]: Found error trace [2018-06-26 18:21:06,280 INFO ]: trace histogram [7, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:06,280 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:06,280 INFO ]: Analyzing trace with hash -97112720, now seen corresponding path program 4 times [2018-06-26 18:21:06,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:06,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:06,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:06,281 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:06,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:06,301 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:06,476 INFO ]: Checked inductivity of 81 backedges. 14 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-26 18:21:06,476 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:06,476 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-26 18:21:06,485 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:21:06,512 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:21:06,512 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:06,515 INFO ]: Computing forward predicates... [2018-06-26 18:21:06,608 INFO ]: Checked inductivity of 81 backedges. 14 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-26 18:21:06,628 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:06,628 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 18:21:06,628 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:21:06,628 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:21:06,628 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:21:06,628 INFO ]: Start difference. First operand 74 states and 135 transitions. Second operand 13 states. [2018-06-26 18:21:07,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:07,746 INFO ]: Finished difference Result 157 states and 449 transitions. [2018-06-26 18:21:07,746 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 18:21:07,746 INFO ]: Start accepts. Automaton has 13 states. Word has length 39 [2018-06-26 18:21:07,747 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:07,749 INFO ]: With dead ends: 157 [2018-06-26 18:21:07,749 INFO ]: Without dead ends: 157 [2018-06-26 18:21:07,749 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 18:21:07,750 INFO ]: Start minimizeSevpa. Operand 157 states. [2018-06-26 18:21:07,785 INFO ]: Finished minimizeSevpa. Reduced states from 157 to 59. [2018-06-26 18:21:07,785 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-26 18:21:07,786 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 99 transitions. [2018-06-26 18:21:07,786 INFO ]: Start accepts. Automaton has 59 states and 99 transitions. Word has length 39 [2018-06-26 18:21:07,786 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:07,786 INFO ]: Abstraction has 59 states and 99 transitions. [2018-06-26 18:21:07,786 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:21:07,786 INFO ]: Start isEmpty. Operand 59 states and 99 transitions. [2018-06-26 18:21:07,788 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-26 18:21:07,788 INFO ]: Found error trace [2018-06-26 18:21:07,789 INFO ]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:07,789 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:07,789 INFO ]: Analyzing trace with hash 1103032627, now seen corresponding path program 5 times [2018-06-26 18:21:07,789 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:07,789 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:07,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:07,790 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:07,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:07,805 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:08,024 INFO ]: Checked inductivity of 138 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 18:21:08,024 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:08,024 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-26 18:21:08,031 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:21:08,083 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-26 18:21:08,083 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:08,086 INFO ]: Computing forward predicates... [2018-06-26 18:21:08,123 INFO ]: Checked inductivity of 138 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 18:21:08,150 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:08,150 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-26 18:21:08,150 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:21:08,151 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:21:08,151 INFO ]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:21:08,151 INFO ]: Start difference. First operand 59 states and 99 transitions. Second operand 14 states. [2018-06-26 18:21:08,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:08,454 INFO ]: Finished difference Result 127 states and 296 transitions. [2018-06-26 18:21:08,455 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 18:21:08,455 INFO ]: Start accepts. Automaton has 14 states. Word has length 49 [2018-06-26 18:21:08,455 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:08,456 INFO ]: With dead ends: 127 [2018-06-26 18:21:08,456 INFO ]: Without dead ends: 127 [2018-06-26 18:21:08,457 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 18:21:08,457 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-26 18:21:08,468 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 62. [2018-06-26 18:21:08,468 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-26 18:21:08,469 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 105 transitions. [2018-06-26 18:21:08,469 INFO ]: Start accepts. Automaton has 62 states and 105 transitions. Word has length 49 [2018-06-26 18:21:08,469 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:08,469 INFO ]: Abstraction has 62 states and 105 transitions. [2018-06-26 18:21:08,469 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:21:08,469 INFO ]: Start isEmpty. Operand 62 states and 105 transitions. [2018-06-26 18:21:08,470 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-26 18:21:08,470 INFO ]: Found error trace [2018-06-26 18:21:08,470 INFO ]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:08,470 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:08,470 INFO ]: Analyzing trace with hash 2072613650, now seen corresponding path program 5 times [2018-06-26 18:21:08,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:08,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:08,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:08,471 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:08,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:08,483 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:08,965 INFO ]: Checked inductivity of 138 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 18:21:08,965 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:08,965 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-26 18:21:08,979 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:21:09,017 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-26 18:21:09,017 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:09,020 INFO ]: Computing forward predicates... [2018-06-26 18:21:09,059 INFO ]: Checked inductivity of 138 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 18:21:09,079 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:09,079 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-26 18:21:09,079 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:21:09,079 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:21:09,080 INFO ]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:21:09,080 INFO ]: Start difference. First operand 62 states and 105 transitions. Second operand 14 states. [2018-06-26 18:21:09,780 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:09,780 INFO ]: Finished difference Result 130 states and 302 transitions. [2018-06-26 18:21:09,780 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 18:21:09,780 INFO ]: Start accepts. Automaton has 14 states. Word has length 49 [2018-06-26 18:21:09,780 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:09,781 INFO ]: With dead ends: 130 [2018-06-26 18:21:09,781 INFO ]: Without dead ends: 130 [2018-06-26 18:21:09,782 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 18:21:09,782 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-26 18:21:09,794 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 62. [2018-06-26 18:21:09,794 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-26 18:21:09,795 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 105 transitions. [2018-06-26 18:21:09,795 INFO ]: Start accepts. Automaton has 62 states and 105 transitions. Word has length 49 [2018-06-26 18:21:09,795 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:09,795 INFO ]: Abstraction has 62 states and 105 transitions. [2018-06-26 18:21:09,795 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:21:09,795 INFO ]: Start isEmpty. Operand 62 states and 105 transitions. [2018-06-26 18:21:09,796 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 18:21:09,796 INFO ]: Found error trace [2018-06-26 18:21:09,796 INFO ]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:09,796 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:09,796 INFO ]: Analyzing trace with hash 143558472, now seen corresponding path program 6 times [2018-06-26 18:21:09,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:09,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:09,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:09,798 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:09,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:09,814 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:09,990 INFO ]: Checked inductivity of 142 backedges. 19 proven. 72 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 18:21:09,990 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:09,990 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-26 18:21:09,997 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:21:10,090 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-26 18:21:10,091 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:10,093 INFO ]: Computing forward predicates... [2018-06-26 18:21:10,174 INFO ]: Checked inductivity of 142 backedges. 19 proven. 72 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 18:21:10,193 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:10,193 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-26 18:21:10,193 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:21:10,194 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:21:10,194 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:21:10,194 INFO ]: Start difference. First operand 62 states and 105 transitions. Second operand 15 states. [2018-06-26 18:21:12,343 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:12,343 INFO ]: Finished difference Result 187 states and 574 transitions. [2018-06-26 18:21:12,343 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-26 18:21:12,343 INFO ]: Start accepts. Automaton has 15 states. Word has length 50 [2018-06-26 18:21:12,343 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:12,345 INFO ]: With dead ends: 187 [2018-06-26 18:21:12,345 INFO ]: Without dead ends: 187 [2018-06-26 18:21:12,345 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=368, Invalid=2182, Unknown=0, NotChecked=0, Total=2550 [2018-06-26 18:21:12,345 INFO ]: Start minimizeSevpa. Operand 187 states. [2018-06-26 18:21:12,389 INFO ]: Finished minimizeSevpa. Reduced states from 187 to 86. [2018-06-26 18:21:12,389 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-26 18:21:12,390 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 155 transitions. [2018-06-26 18:21:12,390 INFO ]: Start accepts. Automaton has 86 states and 155 transitions. Word has length 50 [2018-06-26 18:21:12,390 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:12,390 INFO ]: Abstraction has 86 states and 155 transitions. [2018-06-26 18:21:12,390 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:21:12,390 INFO ]: Start isEmpty. Operand 86 states and 155 transitions. [2018-06-26 18:21:12,393 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 18:21:12,393 INFO ]: Found error trace [2018-06-26 18:21:12,393 INFO ]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:12,393 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:12,393 INFO ]: Analyzing trace with hash 135799113, now seen corresponding path program 6 times [2018-06-26 18:21:12,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:12,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:12,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:12,393 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:12,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:12,407 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:13,408 INFO ]: Checked inductivity of 142 backedges. 19 proven. 72 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 18:21:13,408 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:13,408 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-26 18:21:13,415 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:21:13,456 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-26 18:21:13,456 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:13,459 INFO ]: Computing forward predicates... [2018-06-26 18:21:13,611 INFO ]: Checked inductivity of 142 backedges. 19 proven. 72 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 18:21:13,643 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:13,643 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-26 18:21:13,643 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:21:13,643 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:21:13,643 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:21:13,643 INFO ]: Start difference. First operand 86 states and 155 transitions. Second operand 15 states. [2018-06-26 18:21:15,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:15,159 INFO ]: Finished difference Result 193 states and 613 transitions. [2018-06-26 18:21:15,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-26 18:21:15,160 INFO ]: Start accepts. Automaton has 15 states. Word has length 50 [2018-06-26 18:21:15,160 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:15,163 INFO ]: With dead ends: 193 [2018-06-26 18:21:15,163 INFO ]: Without dead ends: 193 [2018-06-26 18:21:15,163 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 50 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=368, Invalid=2182, Unknown=0, NotChecked=0, Total=2550 [2018-06-26 18:21:15,164 INFO ]: Start minimizeSevpa. Operand 193 states. [2018-06-26 18:21:15,212 INFO ]: Finished minimizeSevpa. Reduced states from 193 to 68. [2018-06-26 18:21:15,212 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-26 18:21:15,213 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 113 transitions. [2018-06-26 18:21:15,213 INFO ]: Start accepts. Automaton has 68 states and 113 transitions. Word has length 50 [2018-06-26 18:21:15,213 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:15,213 INFO ]: Abstraction has 68 states and 113 transitions. [2018-06-26 18:21:15,213 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:21:15,213 INFO ]: Start isEmpty. Operand 68 states and 113 transitions. [2018-06-26 18:21:15,214 INFO ]: Finished isEmpty. Found accepting run of length 61 [2018-06-26 18:21:15,215 INFO ]: Found error trace [2018-06-26 18:21:15,215 INFO ]: trace histogram [11, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:15,215 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:15,215 INFO ]: Analyzing trace with hash -673664342, now seen corresponding path program 7 times [2018-06-26 18:21:15,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:15,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:15,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:15,215 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:15,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:15,238 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:16,104 INFO ]: Checked inductivity of 215 backedges. 122 proven. 14 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-26 18:21:16,104 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:16,104 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-26 18:21:16,109 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:16,147 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:16,150 INFO ]: Computing forward predicates... [2018-06-26 18:21:16,173 INFO ]: Checked inductivity of 215 backedges. 122 proven. 14 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-26 18:21:16,192 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:16,192 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-26 18:21:16,192 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:21:16,193 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:21:16,193 INFO ]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:21:16,193 INFO ]: Start difference. First operand 68 states and 113 transitions. Second operand 16 states. [2018-06-26 18:21:16,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:16,591 INFO ]: Finished difference Result 151 states and 370 transitions. [2018-06-26 18:21:16,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 18:21:16,591 INFO ]: Start accepts. Automaton has 16 states. Word has length 60 [2018-06-26 18:21:16,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:16,592 INFO ]: With dead ends: 151 [2018-06-26 18:21:16,592 INFO ]: Without dead ends: 151 [2018-06-26 18:21:16,593 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2018-06-26 18:21:16,593 INFO ]: Start minimizeSevpa. Operand 151 states. [2018-06-26 18:21:16,609 INFO ]: Finished minimizeSevpa. Reduced states from 151 to 71. [2018-06-26 18:21:16,609 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-26 18:21:16,609 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 119 transitions. [2018-06-26 18:21:16,609 INFO ]: Start accepts. Automaton has 71 states and 119 transitions. Word has length 60 [2018-06-26 18:21:16,610 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:16,610 INFO ]: Abstraction has 71 states and 119 transitions. [2018-06-26 18:21:16,610 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:21:16,610 INFO ]: Start isEmpty. Operand 71 states and 119 transitions. [2018-06-26 18:21:16,612 INFO ]: Finished isEmpty. Found accepting run of length 61 [2018-06-26 18:21:16,612 INFO ]: Found error trace [2018-06-26 18:21:16,612 INFO ]: trace histogram [11, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:16,612 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:16,613 INFO ]: Analyzing trace with hash -393314453, now seen corresponding path program 7 times [2018-06-26 18:21:16,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:16,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:16,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:16,613 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:16,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:16,628 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:17,486 INFO ]: Checked inductivity of 215 backedges. 122 proven. 14 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-26 18:21:17,486 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:17,486 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-26 18:21:17,492 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:17,533 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:17,537 INFO ]: Computing forward predicates... [2018-06-26 18:21:17,577 INFO ]: Checked inductivity of 215 backedges. 122 proven. 14 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-26 18:21:17,596 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:17,596 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-26 18:21:17,596 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:21:17,596 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:21:17,596 INFO ]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:21:17,596 INFO ]: Start difference. First operand 71 states and 119 transitions. Second operand 16 states. [2018-06-26 18:21:17,937 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:17,937 INFO ]: Finished difference Result 154 states and 376 transitions. [2018-06-26 18:21:17,937 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 18:21:17,937 INFO ]: Start accepts. Automaton has 16 states. Word has length 60 [2018-06-26 18:21:17,937 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:17,938 INFO ]: With dead ends: 154 [2018-06-26 18:21:17,938 INFO ]: Without dead ends: 154 [2018-06-26 18:21:17,939 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2018-06-26 18:21:17,939 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-26 18:21:17,957 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 71. [2018-06-26 18:21:17,957 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-26 18:21:17,957 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 119 transitions. [2018-06-26 18:21:17,957 INFO ]: Start accepts. Automaton has 71 states and 119 transitions. Word has length 60 [2018-06-26 18:21:17,958 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:17,958 INFO ]: Abstraction has 71 states and 119 transitions. [2018-06-26 18:21:17,959 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:21:17,959 INFO ]: Start isEmpty. Operand 71 states and 119 transitions. [2018-06-26 18:21:17,960 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-26 18:21:17,960 INFO ]: Found error trace [2018-06-26 18:21:17,960 INFO ]: trace histogram [11, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:17,960 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:17,960 INFO ]: Analyzing trace with hash -1037963915, now seen corresponding path program 8 times [2018-06-26 18:21:17,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:17,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:17,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:17,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:21:17,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:17,977 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:18,261 INFO ]: Checked inductivity of 220 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-26 18:21:18,261 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:18,261 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-26 18:21:18,266 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:21:18,310 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:21:18,310 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:18,313 INFO ]: Computing forward predicates... [2018-06-26 18:21:18,858 INFO ]: Checked inductivity of 220 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-26 18:21:18,877 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:18,878 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-26 18:21:18,878 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:21:18,878 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:21:18,878 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:21:18,878 INFO ]: Start difference. First operand 71 states and 119 transitions. Second operand 17 states. [2018-06-26 18:21:20,185 WARN ]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-26 18:21:21,564 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:21,564 INFO ]: Finished difference Result 223 states and 756 transitions. [2018-06-26 18:21:21,564 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-26 18:21:21,564 INFO ]: Start accepts. Automaton has 17 states. Word has length 61 [2018-06-26 18:21:21,565 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:21,567 INFO ]: With dead ends: 223 [2018-06-26 18:21:21,567 INFO ]: Without dead ends: 223 [2018-06-26 18:21:21,568 INFO ]: 0 DeclaredPredicates, 132 GetRequests, 61 SyntacticMatches, 12 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=499, Invalid=3161, Unknown=0, NotChecked=0, Total=3660 [2018-06-26 18:21:21,568 INFO ]: Start minimizeSevpa. Operand 223 states. [2018-06-26 18:21:21,650 INFO ]: Finished minimizeSevpa. Reduced states from 223 to 98. [2018-06-26 18:21:21,650 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-26 18:21:21,651 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 175 transitions. [2018-06-26 18:21:21,651 INFO ]: Start accepts. Automaton has 98 states and 175 transitions. Word has length 61 [2018-06-26 18:21:21,651 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:21,651 INFO ]: Abstraction has 98 states and 175 transitions. [2018-06-26 18:21:21,651 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:21:21,651 INFO ]: Start isEmpty. Operand 98 states and 175 transitions. [2018-06-26 18:21:21,653 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-26 18:21:21,653 INFO ]: Found error trace [2018-06-26 18:21:21,653 INFO ]: trace histogram [11, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:21,653 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:21,653 INFO ]: Analyzing trace with hash -937051948, now seen corresponding path program 8 times [2018-06-26 18:21:21,653 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:21,653 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:21,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:21,654 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:21,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:21,669 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:22,087 INFO ]: Checked inductivity of 220 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-26 18:21:22,088 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:22,088 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-26 18:21:22,094 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:21:22,162 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:21:22,162 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:22,166 INFO ]: Computing forward predicates... [2018-06-26 18:21:22,440 INFO ]: Checked inductivity of 220 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-26 18:21:22,473 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:22,473 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-26 18:21:22,473 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:21:22,474 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:21:22,474 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:21:22,474 INFO ]: Start difference. First operand 98 states and 175 transitions. Second operand 17 states. [2018-06-26 18:21:23,064 WARN ]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-26 18:21:23,837 WARN ]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-26 18:21:25,108 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:25,108 INFO ]: Finished difference Result 229 states and 801 transitions. [2018-06-26 18:21:25,109 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-26 18:21:25,109 INFO ]: Start accepts. Automaton has 17 states. Word has length 61 [2018-06-26 18:21:25,109 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:25,111 INFO ]: With dead ends: 229 [2018-06-26 18:21:25,111 INFO ]: Without dead ends: 229 [2018-06-26 18:21:25,112 INFO ]: 0 DeclaredPredicates, 132 GetRequests, 62 SyntacticMatches, 11 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=499, Invalid=3161, Unknown=0, NotChecked=0, Total=3660 [2018-06-26 18:21:25,112 INFO ]: Start minimizeSevpa. Operand 229 states. [2018-06-26 18:21:25,190 INFO ]: Finished minimizeSevpa. Reduced states from 229 to 77. [2018-06-26 18:21:25,191 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-26 18:21:25,191 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 127 transitions. [2018-06-26 18:21:25,191 INFO ]: Start accepts. Automaton has 77 states and 127 transitions. Word has length 61 [2018-06-26 18:21:25,191 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:25,191 INFO ]: Abstraction has 77 states and 127 transitions. [2018-06-26 18:21:25,191 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:21:25,191 INFO ]: Start isEmpty. Operand 77 states and 127 transitions. [2018-06-26 18:21:25,192 INFO ]: Finished isEmpty. Found accepting run of length 72 [2018-06-26 18:21:25,192 INFO ]: Found error trace [2018-06-26 18:21:25,192 INFO ]: trace histogram [13, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:25,192 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:25,192 INFO ]: Analyzing trace with hash -1272092585, now seen corresponding path program 9 times [2018-06-26 18:21:25,193 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:25,193 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:25,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:25,193 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:25,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:25,208 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:25,490 INFO ]: Checked inductivity of 309 backedges. 176 proven. 20 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-26 18:21:25,490 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:25,490 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-26 18:21:25,496 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:21:25,556 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-26 18:21:25,557 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:25,560 INFO ]: Computing forward predicates... [2018-06-26 18:21:25,598 INFO ]: Checked inductivity of 309 backedges. 176 proven. 20 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-26 18:21:25,631 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:25,631 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-26 18:21:25,631 INFO ]: Interpolant automaton has 18 states [2018-06-26 18:21:25,632 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 18:21:25,632 INFO ]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:21:25,632 INFO ]: Start difference. First operand 77 states and 127 transitions. Second operand 18 states. [2018-06-26 18:21:26,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:26,605 INFO ]: Finished difference Result 175 states and 450 transitions. [2018-06-26 18:21:26,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-26 18:21:26,605 INFO ]: Start accepts. Automaton has 18 states. Word has length 71 [2018-06-26 18:21:26,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:26,607 INFO ]: With dead ends: 175 [2018-06-26 18:21:26,607 INFO ]: Without dead ends: 175 [2018-06-26 18:21:26,608 INFO ]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=1946, Unknown=0, NotChecked=0, Total=2352 [2018-06-26 18:21:26,608 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-26 18:21:26,631 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 80. [2018-06-26 18:21:26,631 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-26 18:21:26,631 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 133 transitions. [2018-06-26 18:21:26,631 INFO ]: Start accepts. Automaton has 80 states and 133 transitions. Word has length 71 [2018-06-26 18:21:26,632 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:26,632 INFO ]: Abstraction has 80 states and 133 transitions. [2018-06-26 18:21:26,632 INFO ]: Interpolant automaton has 18 states. [2018-06-26 18:21:26,632 INFO ]: Start isEmpty. Operand 80 states and 133 transitions. [2018-06-26 18:21:26,633 INFO ]: Finished isEmpty. Found accepting run of length 72 [2018-06-26 18:21:26,633 INFO ]: Found error trace [2018-06-26 18:21:26,633 INFO ]: trace histogram [13, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:26,633 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:26,634 INFO ]: Analyzing trace with hash -317863690, now seen corresponding path program 9 times [2018-06-26 18:21:26,634 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:26,634 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:26,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:26,634 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:26,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:26,650 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:27,135 INFO ]: Checked inductivity of 309 backedges. 176 proven. 20 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-26 18:21:27,135 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:27,135 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-26 18:21:27,143 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:21:27,204 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-26 18:21:27,204 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:27,207 INFO ]: Computing forward predicates... [2018-06-26 18:21:27,250 INFO ]: Checked inductivity of 309 backedges. 176 proven. 20 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-26 18:21:27,281 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:27,281 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-26 18:21:27,281 INFO ]: Interpolant automaton has 18 states [2018-06-26 18:21:27,281 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 18:21:27,281 INFO ]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:21:27,281 INFO ]: Start difference. First operand 80 states and 133 transitions. Second operand 18 states. [2018-06-26 18:21:28,067 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:28,068 INFO ]: Finished difference Result 178 states and 456 transitions. [2018-06-26 18:21:28,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-26 18:21:28,068 INFO ]: Start accepts. Automaton has 18 states. Word has length 71 [2018-06-26 18:21:28,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:28,069 INFO ]: With dead ends: 178 [2018-06-26 18:21:28,069 INFO ]: Without dead ends: 178 [2018-06-26 18:21:28,070 INFO ]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=1946, Unknown=0, NotChecked=0, Total=2352 [2018-06-26 18:21:28,071 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-26 18:21:28,093 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 80. [2018-06-26 18:21:28,093 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-26 18:21:28,093 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 133 transitions. [2018-06-26 18:21:28,093 INFO ]: Start accepts. Automaton has 80 states and 133 transitions. Word has length 71 [2018-06-26 18:21:28,094 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:28,094 INFO ]: Abstraction has 80 states and 133 transitions. [2018-06-26 18:21:28,094 INFO ]: Interpolant automaton has 18 states. [2018-06-26 18:21:28,094 INFO ]: Start isEmpty. Operand 80 states and 133 transitions. [2018-06-26 18:21:28,095 INFO ]: Finished isEmpty. Found accepting run of length 73 [2018-06-26 18:21:28,095 INFO ]: Found error trace [2018-06-26 18:21:28,095 INFO ]: trace histogram [13, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:28,095 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:28,095 INFO ]: Analyzing trace with hash 194646188, now seen corresponding path program 10 times [2018-06-26 18:21:28,095 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:28,095 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:28,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:28,096 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:28,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:28,114 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:28,358 INFO ]: Checked inductivity of 315 backedges. 29 proven. 173 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-26 18:21:28,358 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:28,358 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-26 18:21:28,363 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:21:28,421 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:21:28,421 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:28,425 INFO ]: Computing forward predicates... [2018-06-26 18:21:28,571 INFO ]: Checked inductivity of 315 backedges. 29 proven. 173 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-26 18:21:28,589 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:28,590 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-26 18:21:28,590 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:21:28,590 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:21:28,590 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:21:28,590 INFO ]: Start difference. First operand 80 states and 133 transitions. Second operand 19 states. [2018-06-26 18:21:32,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:32,609 INFO ]: Finished difference Result 259 states and 962 transitions. [2018-06-26 18:21:32,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-26 18:21:32,609 INFO ]: Start accepts. Automaton has 19 states. Word has length 72 [2018-06-26 18:21:32,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:32,613 INFO ]: With dead ends: 259 [2018-06-26 18:21:32,613 INFO ]: Without dead ends: 259 [2018-06-26 18:21:32,614 INFO ]: 0 DeclaredPredicates, 156 GetRequests, 73 SyntacticMatches, 14 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=649, Invalid=4321, Unknown=0, NotChecked=0, Total=4970 [2018-06-26 18:21:32,614 INFO ]: Start minimizeSevpa. Operand 259 states. [2018-06-26 18:21:32,762 INFO ]: Finished minimizeSevpa. Reduced states from 259 to 110. [2018-06-26 18:21:32,762 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-26 18:21:32,764 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 195 transitions. [2018-06-26 18:21:32,764 INFO ]: Start accepts. Automaton has 110 states and 195 transitions. Word has length 72 [2018-06-26 18:21:32,764 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:32,764 INFO ]: Abstraction has 110 states and 195 transitions. [2018-06-26 18:21:32,764 INFO ]: Interpolant automaton has 19 states. [2018-06-26 18:21:32,764 INFO ]: Start isEmpty. Operand 110 states and 195 transitions. [2018-06-26 18:21:32,766 INFO ]: Finished isEmpty. Found accepting run of length 73 [2018-06-26 18:21:32,766 INFO ]: Found error trace [2018-06-26 18:21:32,766 INFO ]: trace histogram [13, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:32,766 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:32,766 INFO ]: Analyzing trace with hash -289029139, now seen corresponding path program 10 times [2018-06-26 18:21:32,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:32,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:32,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:32,767 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:32,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:32,784 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:33,170 INFO ]: Checked inductivity of 315 backedges. 29 proven. 173 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-26 18:21:33,170 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:33,170 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-26 18:21:33,178 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:21:33,225 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:21:33,225 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:33,229 INFO ]: Computing forward predicates... [2018-06-26 18:21:33,352 INFO ]: Checked inductivity of 315 backedges. 29 proven. 173 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-26 18:21:33,371 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:33,371 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-26 18:21:33,372 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:21:33,372 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:21:33,372 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:21:33,372 INFO ]: Start difference. First operand 110 states and 195 transitions. Second operand 19 states. [2018-06-26 18:21:36,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:36,428 INFO ]: Finished difference Result 265 states and 1013 transitions. [2018-06-26 18:21:36,428 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-26 18:21:36,428 INFO ]: Start accepts. Automaton has 19 states. Word has length 72 [2018-06-26 18:21:36,428 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:36,431 INFO ]: With dead ends: 265 [2018-06-26 18:21:36,431 INFO ]: Without dead ends: 265 [2018-06-26 18:21:36,433 INFO ]: 0 DeclaredPredicates, 156 GetRequests, 74 SyntacticMatches, 13 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=649, Invalid=4321, Unknown=0, NotChecked=0, Total=4970 [2018-06-26 18:21:36,434 INFO ]: Start minimizeSevpa. Operand 265 states. [2018-06-26 18:21:36,555 INFO ]: Finished minimizeSevpa. Reduced states from 265 to 86. [2018-06-26 18:21:36,555 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-26 18:21:36,556 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 141 transitions. [2018-06-26 18:21:36,556 INFO ]: Start accepts. Automaton has 86 states and 141 transitions. Word has length 72 [2018-06-26 18:21:36,556 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:36,556 INFO ]: Abstraction has 86 states and 141 transitions. [2018-06-26 18:21:36,556 INFO ]: Interpolant automaton has 19 states. [2018-06-26 18:21:36,556 INFO ]: Start isEmpty. Operand 86 states and 141 transitions. [2018-06-26 18:21:36,558 INFO ]: Finished isEmpty. Found accepting run of length 83 [2018-06-26 18:21:36,558 INFO ]: Found error trace [2018-06-26 18:21:36,558 INFO ]: trace histogram [15, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:36,558 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:36,558 INFO ]: Analyzing trace with hash -1910258034, now seen corresponding path program 11 times [2018-06-26 18:21:36,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:36,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:36,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:36,559 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:36,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:36,581 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:37,157 INFO ]: Checked inductivity of 420 backedges. 240 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-26 18:21:37,157 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:37,157 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:21:37,163 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:21:37,234 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-06-26 18:21:37,234 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:37,238 INFO ]: Computing forward predicates... [2018-06-26 18:21:37,328 INFO ]: Checked inductivity of 420 backedges. 240 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-26 18:21:37,360 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:37,360 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-26 18:21:37,360 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:21:37,360 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:21:37,360 INFO ]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:21:37,360 INFO ]: Start difference. First operand 86 states and 141 transitions. Second operand 20 states. [2018-06-26 18:21:38,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:38,161 INFO ]: Finished difference Result 199 states and 536 transitions. [2018-06-26 18:21:38,161 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-26 18:21:38,161 INFO ]: Start accepts. Automaton has 20 states. Word has length 82 [2018-06-26 18:21:38,161 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:38,162 INFO ]: With dead ends: 199 [2018-06-26 18:21:38,162 INFO ]: Without dead ends: 199 [2018-06-26 18:21:38,163 INFO ]: 0 DeclaredPredicates, 154 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=520, Invalid=2560, Unknown=0, NotChecked=0, Total=3080 [2018-06-26 18:21:38,164 INFO ]: Start minimizeSevpa. Operand 199 states. [2018-06-26 18:21:38,181 INFO ]: Finished minimizeSevpa. Reduced states from 199 to 89. [2018-06-26 18:21:38,181 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-26 18:21:38,182 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 147 transitions. [2018-06-26 18:21:38,182 INFO ]: Start accepts. Automaton has 89 states and 147 transitions. Word has length 82 [2018-06-26 18:21:38,182 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:38,182 INFO ]: Abstraction has 89 states and 147 transitions. [2018-06-26 18:21:38,182 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:21:38,182 INFO ]: Start isEmpty. Operand 89 states and 147 transitions. [2018-06-26 18:21:38,184 INFO ]: Finished isEmpty. Found accepting run of length 83 [2018-06-26 18:21:38,184 INFO ]: Found error trace [2018-06-26 18:21:38,184 INFO ]: trace histogram [15, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:38,184 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:38,184 INFO ]: Analyzing trace with hash 1855790223, now seen corresponding path program 11 times [2018-06-26 18:21:38,184 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:38,184 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:38,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:38,184 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:38,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:38,202 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:38,595 INFO ]: Checked inductivity of 420 backedges. 240 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-26 18:21:38,595 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:38,595 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:21:38,601 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:21:38,668 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-06-26 18:21:38,668 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:38,672 INFO ]: Computing forward predicates... [2018-06-26 18:21:38,702 INFO ]: Checked inductivity of 420 backedges. 240 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-26 18:21:38,721 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:38,721 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-26 18:21:38,721 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:21:38,721 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:21:38,721 INFO ]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:21:38,721 INFO ]: Start difference. First operand 89 states and 147 transitions. Second operand 20 states. [2018-06-26 18:21:39,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:39,266 INFO ]: Finished difference Result 202 states and 542 transitions. [2018-06-26 18:21:39,266 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-26 18:21:39,266 INFO ]: Start accepts. Automaton has 20 states. Word has length 82 [2018-06-26 18:21:39,266 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:39,268 INFO ]: With dead ends: 202 [2018-06-26 18:21:39,268 INFO ]: Without dead ends: 202 [2018-06-26 18:21:39,269 INFO ]: 0 DeclaredPredicates, 154 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=520, Invalid=2560, Unknown=0, NotChecked=0, Total=3080 [2018-06-26 18:21:39,269 INFO ]: Start minimizeSevpa. Operand 202 states. [2018-06-26 18:21:39,299 INFO ]: Finished minimizeSevpa. Reduced states from 202 to 89. [2018-06-26 18:21:39,299 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-26 18:21:39,300 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 147 transitions. [2018-06-26 18:21:39,300 INFO ]: Start accepts. Automaton has 89 states and 147 transitions. Word has length 82 [2018-06-26 18:21:39,300 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:39,300 INFO ]: Abstraction has 89 states and 147 transitions. [2018-06-26 18:21:39,300 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:21:39,300 INFO ]: Start isEmpty. Operand 89 states and 147 transitions. [2018-06-26 18:21:39,302 INFO ]: Finished isEmpty. Found accepting run of length 84 [2018-06-26 18:21:39,302 INFO ]: Found error trace [2018-06-26 18:21:39,302 INFO ]: trace histogram [15, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:39,302 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:39,302 INFO ]: Analyzing trace with hash -1111881959, now seen corresponding path program 12 times [2018-06-26 18:21:39,302 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:39,302 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:39,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:39,303 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:39,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:39,323 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:39,739 INFO ]: Checked inductivity of 427 backedges. 34 proven. 240 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-26 18:21:39,739 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:39,739 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:21:39,745 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:21:39,813 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-26 18:21:39,813 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:39,819 INFO ]: Computing forward predicates... [2018-06-26 18:21:40,024 INFO ]: Checked inductivity of 427 backedges. 34 proven. 240 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-26 18:21:40,043 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:40,043 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-26 18:21:40,043 INFO ]: Interpolant automaton has 21 states [2018-06-26 18:21:40,043 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 18:21:40,043 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:21:40,043 INFO ]: Start difference. First operand 89 states and 147 transitions. Second operand 21 states. [2018-06-26 18:21:44,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:21:44,097 INFO ]: Finished difference Result 295 states and 1192 transitions. [2018-06-26 18:21:44,097 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-26 18:21:44,097 INFO ]: Start accepts. Automaton has 21 states. Word has length 83 [2018-06-26 18:21:44,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:21:44,100 INFO ]: With dead ends: 295 [2018-06-26 18:21:44,100 INFO ]: Without dead ends: 295 [2018-06-26 18:21:44,102 INFO ]: 0 DeclaredPredicates, 180 GetRequests, 85 SyntacticMatches, 16 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=818, Invalid=5662, Unknown=0, NotChecked=0, Total=6480 [2018-06-26 18:21:44,102 INFO ]: Start minimizeSevpa. Operand 295 states. [2018-06-26 18:21:44,254 INFO ]: Finished minimizeSevpa. Reduced states from 295 to 122. [2018-06-26 18:21:44,254 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-26 18:21:44,255 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 215 transitions. [2018-06-26 18:21:44,255 INFO ]: Start accepts. Automaton has 122 states and 215 transitions. Word has length 83 [2018-06-26 18:21:44,255 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:21:44,255 INFO ]: Abstraction has 122 states and 215 transitions. [2018-06-26 18:21:44,255 INFO ]: Interpolant automaton has 21 states. [2018-06-26 18:21:44,255 INFO ]: Start isEmpty. Operand 122 states and 215 transitions. [2018-06-26 18:21:44,259 INFO ]: Finished isEmpty. Found accepting run of length 84 [2018-06-26 18:21:44,259 INFO ]: Found error trace [2018-06-26 18:21:44,259 INFO ]: trace histogram [15, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2018-06-26 18:21:44,259 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:21:44,259 INFO ]: Analyzing trace with hash -328502984, now seen corresponding path program 12 times [2018-06-26 18:21:44,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:21:44,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:21:44,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:44,260 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:21:44,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:21:44,278 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:45,233 INFO ]: Checked inductivity of 427 backedges. 34 proven. 240 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-26 18:21:45,233 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:21:45,233 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:21:45,239 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:21:45,308 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-26 18:21:45,308 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:21:45,313 INFO ]: Computing forward predicates... [2018-06-26 18:21:45,572 INFO ]: Checked inductivity of 427 backedges. 34 proven. 240 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-26 18:21:45,591 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:21:45,591 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-26 18:21:45,591 INFO ]: Interpolant automaton has 21 states [2018-06-26 18:21:45,591 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 18:21:45,591 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:21:45,592 INFO ]: Start difference. First operand 122 states and 215 transitions. Second operand 21 states. Received shutdown request... [2018-06-26 18:21:48,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-26 18:21:48,939 WARN ]: Verification canceled [2018-06-26 18:21:48,942 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:21:48,943 WARN ]: Timeout [2018-06-26 18:21:48,943 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:21:48 BasicIcfg [2018-06-26 18:21:48,943 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:21:48,943 INFO ]: Toolchain (without parser) took 56025.32 ms. Allocated memory was 302.0 MB in the beginning and 843.6 MB in the end (delta: 541.6 MB). Free memory was 254.5 MB in the beginning and 548.2 MB in the end (delta: -293.7 MB). Peak memory consumption was 247.9 MB. Max. memory is 3.6 GB. [2018-06-26 18:21:48,944 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 302.0 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:21:48,944 INFO ]: ChcToBoogie took 63.38 ms. Allocated memory is still 302.0 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:21:48,945 INFO ]: Boogie Preprocessor took 44.71 ms. Allocated memory is still 302.0 MB. Free memory was 252.5 MB in the beginning and 251.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 18:21:48,945 INFO ]: RCFGBuilder took 390.43 ms. Allocated memory is still 302.0 MB. Free memory was 250.5 MB in the beginning and 241.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:21:48,945 INFO ]: BlockEncodingV2 took 133.72 ms. Allocated memory is still 302.0 MB. Free memory was 241.4 MB in the beginning and 236.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:21:48,945 INFO ]: TraceAbstraction took 55383.63 ms. Allocated memory was 302.0 MB in the beginning and 843.6 MB in the end (delta: 541.6 MB). Free memory was 235.4 MB in the beginning and 548.2 MB in the end (delta: -312.7 MB). Peak memory consumption was 228.9 MB. Max. memory is 3.6 GB. [2018-06-26 18:21:48,948 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 20 locations, 28 edges - StatisticsResult: Encoded RCFG 11 locations, 19 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 302.0 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.38 ms. Allocated memory is still 302.0 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.71 ms. Allocated memory is still 302.0 MB. Free memory was 252.5 MB in the beginning and 251.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 390.43 ms. Allocated memory is still 302.0 MB. Free memory was 250.5 MB in the beginning and 241.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 133.72 ms. Allocated memory is still 302.0 MB. Free memory was 241.4 MB in the beginning and 236.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55383.63 ms. Allocated memory was 302.0 MB in the beginning and 843.6 MB in the end (delta: 541.6 MB). Free memory was 235.4 MB in the beginning and 548.2 MB in the end (delta: -312.7 MB). Peak memory consumption was 228.9 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 (122states) and interpolant automaton (currently 66 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (301 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 11 locations, 1 error locations. TIMEOUT Result, 55.3s OverallTime, 34 OverallIterations, 15 TraceHistogramMax, 37.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4093 SDtfs, 4132 SDslu, 23284 SDs, 0 SdLazy, 28106 SolverSat, 5481 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2850 GetRequests, 1545 SyntacticMatches, 133 SemanticMatches, 1172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14456 ImplicationChecksByTransitivity, 25.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=33, 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: 1.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 2356 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 2872 NumberOfCodeBlocks, 2866 NumberOfCodeBlocksAsserted, 178 NumberOfCheckSat, 2810 ConstructedInterpolants, 0 QuantifiedInterpolants, 682777 SizeOfPredicates, 398 NumberOfNonLiveVariables, 9722 ConjunctsInSsa, 1524 ConjunctsInUnsatCore, 62 InterpolantComputations, 6 PerfectInterpolantSequences, 6921/9865 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/enc-zip_unzip.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-21-48-957.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_unzip.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-21-48-957.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_unzip.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-21-48-957.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_unzip.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-21-48-957.csv Completed graceful shutdown