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/vmt-chc-benchmarks/cav12/s3_clnt_1.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:38:01,929 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:38:01,933 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:38:01,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:38:01,944 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:38:01,945 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:38:01,946 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:38:01,948 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:38:01,950 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:38:01,951 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:38:01,952 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:38:01,952 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:38:01,953 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:38:01,953 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:38:01,954 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:38:01,955 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:38:01,956 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:38:01,958 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:38:01,959 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:38:01,961 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:38:01,962 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:38:01,963 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:38:01,966 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:38:01,966 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:38:01,966 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:38:01,967 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:38:01,968 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:38:01,969 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:38:01,969 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:38:01,975 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:38:01,975 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:38:01,975 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:38:01,976 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:38:01,976 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:38:01,977 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:38:01,977 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:38:01,978 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 20:38:01,995 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:38:01,995 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:38:01,995 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:38:01,996 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:38:01,997 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:38:01,997 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:38:01,997 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:38:01,997 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:38:01,997 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:38:01,998 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:38:01,998 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:38:01,998 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:38:01,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:38:01,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:38:01,999 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:38:01,999 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:38:01,999 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:38:01,999 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:38:01,999 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:38:01,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:38:02,000 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:38:02,004 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:38:02,004 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:38:02,047 INFO ]: Repository-Root is: /tmp [2018-06-26 20:38:02,064 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:38:02,069 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:38:02,072 INFO ]: Initializing SmtParser... [2018-06-26 20:38:02,073 INFO ]: SmtParser initialized [2018-06-26 20:38:02,073 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_1.cil.smt2 [2018-06-26 20:38:02,074 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 20:38:02,172 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_1.cil.smt2 unknown [2018-06-26 20:38:02,687 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_1.cil.smt2 [2018-06-26 20:38:02,691 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:38:02,696 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:38:02,697 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:38:02,697 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:38:02,697 INFO ]: ChcToBoogie initialized [2018-06-26 20:38:02,708 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:38:02" (1/1) ... [2018-06-26 20:38:02,833 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:38:02 Unit [2018-06-26 20:38:02,833 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:38:02,834 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:38:02,834 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:38:02,834 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:38:02,865 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:38:02" (1/1) ... [2018-06-26 20:38:02,865 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:38:02" (1/1) ... [2018-06-26 20:38:02,876 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:38:02" (1/1) ... [2018-06-26 20:38:02,876 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:38:02" (1/1) ... [2018-06-26 20:38:02,894 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:38:02" (1/1) ... [2018-06-26 20:38:02,900 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:38:02" (1/1) ... [2018-06-26 20:38:02,903 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:38:02" (1/1) ... [2018-06-26 20:38:02,914 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:38:02,915 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:38:02,915 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:38:02,915 INFO ]: RCFGBuilder initialized [2018-06-26 20:38:02,916 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:38:02" (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 20:38:02,933 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:38:02,933 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:38:02,933 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:38:02,933 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:38:02,933 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:38:02,933 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 20:38:03,341 INFO ]: Using library mode [2018-06-26 20:38:03,344 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:38:03 BoogieIcfgContainer [2018-06-26 20:38:03,344 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:38:03,345 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:38:03,345 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:38:03,346 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:38:03,346 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:38:03" (1/1) ... [2018-06-26 20:38:03,366 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:38:03,368 INFO ]: Using Remove infeasible edges [2018-06-26 20:38:03,369 INFO ]: Using Maximize final states [2018-06-26 20:38:03,369 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:38:03,369 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:38:03,373 INFO ]: Using Remove sink states [2018-06-26 20:38:03,374 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:38:03,374 INFO ]: Using Use SBE [2018-06-26 20:38:04,231 INFO ]: SBE split 1 edges [2018-06-26 20:38:04,285 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:38:04,287 INFO ]: 0 new accepting states [2018-06-26 20:38:04,337 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:38:04,339 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:38:04,408 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:38:04,409 INFO ]: 0 new accepting states [2018-06-26 20:38:04,409 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:38:04,409 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:38:04,474 INFO ]: Encoded RCFG 6 locations, 540 edges [2018-06-26 20:38:04,474 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:38:04 BasicIcfg [2018-06-26 20:38:04,475 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:38:04,476 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:38:04,476 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:38:04,487 INFO ]: TraceAbstraction initialized [2018-06-26 20:38:04,487 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:38:02" (1/4) ... [2018-06-26 20:38:04,490 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45753d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:38:04, skipping insertion in model container [2018-06-26 20:38:04,490 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:38:02" (2/4) ... [2018-06-26 20:38:04,490 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45753d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:38:04, skipping insertion in model container [2018-06-26 20:38:04,490 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:38:03" (3/4) ... [2018-06-26 20:38:04,490 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45753d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:38:04, skipping insertion in model container [2018-06-26 20:38:04,490 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:38:04" (4/4) ... [2018-06-26 20:38:04,492 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:38:04,504 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:38:04,513 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:38:04,553 INFO ]: Using default assertion order modulation [2018-06-26 20:38:04,553 INFO ]: Interprodecural is true [2018-06-26 20:38:04,553 INFO ]: Hoare is false [2018-06-26 20:38:04,553 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:38:04,553 INFO ]: Backedges is TWOTRACK [2018-06-26 20:38:04,553 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:38:04,553 INFO ]: Difference is false [2018-06-26 20:38:04,554 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:38:04,554 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:38:04,566 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:38:04,580 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:38:04,580 INFO ]: Found error trace [2018-06-26 20:38:04,581 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:38:04,581 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:04,586 INFO ]: Analyzing trace with hash 51854882, now seen corresponding path program 1 times [2018-06-26 20:38:04,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:04,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:04,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:04,625 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:04,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:04,685 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:04,825 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:38:04,829 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:04,829 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:04,831 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:04,843 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:04,843 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:04,846 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:38:09,079 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:09,079 INFO ]: Finished difference Result 7 states and 406 transitions. [2018-06-26 20:38:09,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:09,080 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:38:09,081 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:09,090 INFO ]: With dead ends: 7 [2018-06-26 20:38:09,091 INFO ]: Without dead ends: 7 [2018-06-26 20:38:09,092 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 20:38:09,109 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:38:09,132 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:38:09,133 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:38:09,135 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 406 transitions. [2018-06-26 20:38:09,136 INFO ]: Start accepts. Automaton has 7 states and 406 transitions. Word has length 5 [2018-06-26 20:38:09,136 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:09,136 INFO ]: Abstraction has 7 states and 406 transitions. [2018-06-26 20:38:09,137 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:09,137 INFO ]: Start isEmpty. Operand 7 states and 406 transitions. [2018-06-26 20:38:09,137 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:38:09,137 INFO ]: Found error trace [2018-06-26 20:38:09,137 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:38:09,137 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:09,138 INFO ]: Analyzing trace with hash 1606945082, now seen corresponding path program 1 times [2018-06-26 20:38:09,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:09,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:09,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:09,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:09,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:09,166 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:09,242 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:38:09,242 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:09,242 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:09,243 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:09,243 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:09,243 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:09,243 INFO ]: Start difference. First operand 7 states and 406 transitions. Second operand 3 states. [2018-06-26 20:38:11,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:11,828 INFO ]: Finished difference Result 8 states and 408 transitions. [2018-06-26 20:38:11,829 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:11,829 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:38:11,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:11,830 INFO ]: With dead ends: 8 [2018-06-26 20:38:11,830 INFO ]: Without dead ends: 8 [2018-06-26 20:38:11,830 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 20:38:11,830 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 20:38:11,836 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 20:38:11,836 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 20:38:11,837 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 408 transitions. [2018-06-26 20:38:11,837 INFO ]: Start accepts. Automaton has 8 states and 408 transitions. Word has length 6 [2018-06-26 20:38:11,837 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:11,837 INFO ]: Abstraction has 8 states and 408 transitions. [2018-06-26 20:38:11,837 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:11,837 INFO ]: Start isEmpty. Operand 8 states and 408 transitions. [2018-06-26 20:38:11,837 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:38:11,837 INFO ]: Found error trace [2018-06-26 20:38:11,837 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:11,837 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:11,838 INFO ]: Analyzing trace with hash -1734756882, now seen corresponding path program 1 times [2018-06-26 20:38:11,838 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:11,838 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:11,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:11,839 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:11,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:11,892 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:11,954 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:38:11,954 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:11,954 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:11,954 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:11,954 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:11,954 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:11,954 INFO ]: Start difference. First operand 8 states and 408 transitions. Second operand 3 states. [2018-06-26 20:38:13,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:13,666 INFO ]: Finished difference Result 9 states and 803 transitions. [2018-06-26 20:38:13,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:13,667 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:38:13,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:13,668 INFO ]: With dead ends: 9 [2018-06-26 20:38:13,668 INFO ]: Without dead ends: 9 [2018-06-26 20:38:13,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 20:38:13,668 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:38:13,673 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:38:13,673 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:38:13,675 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 803 transitions. [2018-06-26 20:38:13,675 INFO ]: Start accepts. Automaton has 9 states and 803 transitions. Word has length 7 [2018-06-26 20:38:13,677 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:13,677 INFO ]: Abstraction has 9 states and 803 transitions. [2018-06-26 20:38:13,677 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:13,677 INFO ]: Start isEmpty. Operand 9 states and 803 transitions. [2018-06-26 20:38:13,677 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:38:13,677 INFO ]: Found error trace [2018-06-26 20:38:13,678 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:13,678 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:13,678 INFO ]: Analyzing trace with hash 2042106611, now seen corresponding path program 1 times [2018-06-26 20:38:13,678 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:13,678 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:13,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:13,679 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:13,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:13,733 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:13,794 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:38:13,794 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:13,794 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:13,794 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:13,794 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:13,794 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:13,794 INFO ]: Start difference. First operand 9 states and 803 transitions. Second operand 3 states. [2018-06-26 20:38:15,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:15,950 INFO ]: Finished difference Result 10 states and 1195 transitions. [2018-06-26 20:38:15,950 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:15,950 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:38:15,950 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:15,951 INFO ]: With dead ends: 10 [2018-06-26 20:38:15,951 INFO ]: Without dead ends: 10 [2018-06-26 20:38:15,952 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 20:38:15,952 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 20:38:15,956 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 20:38:15,956 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 20:38:15,958 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1195 transitions. [2018-06-26 20:38:15,958 INFO ]: Start accepts. Automaton has 10 states and 1195 transitions. Word has length 8 [2018-06-26 20:38:15,958 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:15,958 INFO ]: Abstraction has 10 states and 1195 transitions. [2018-06-26 20:38:15,958 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:15,959 INFO ]: Start isEmpty. Operand 10 states and 1195 transitions. [2018-06-26 20:38:15,959 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:38:15,959 INFO ]: Found error trace [2018-06-26 20:38:15,959 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:15,959 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:15,959 INFO ]: Analyzing trace with hash -1084339260, now seen corresponding path program 1 times [2018-06-26 20:38:15,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:15,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:15,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:15,960 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:15,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:15,996 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:16,040 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:38:16,040 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:16,040 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:16,040 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:16,040 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:16,040 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:16,040 INFO ]: Start difference. First operand 10 states and 1195 transitions. Second operand 3 states. [2018-06-26 20:38:17,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:17,827 INFO ]: Finished difference Result 11 states and 1467 transitions. [2018-06-26 20:38:17,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:17,828 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:38:17,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:17,830 INFO ]: With dead ends: 11 [2018-06-26 20:38:17,830 INFO ]: Without dead ends: 11 [2018-06-26 20:38:17,830 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 20:38:17,831 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 20:38:17,837 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 20:38:17,837 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 20:38:17,840 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1467 transitions. [2018-06-26 20:38:17,840 INFO ]: Start accepts. Automaton has 11 states and 1467 transitions. Word has length 9 [2018-06-26 20:38:17,840 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:17,840 INFO ]: Abstraction has 11 states and 1467 transitions. [2018-06-26 20:38:17,840 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:17,840 INFO ]: Start isEmpty. Operand 11 states and 1467 transitions. [2018-06-26 20:38:17,841 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:38:17,841 INFO ]: Found error trace [2018-06-26 20:38:17,841 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:17,841 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:17,841 INFO ]: Analyzing trace with hash -794516758, now seen corresponding path program 1 times [2018-06-26 20:38:17,841 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:17,841 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:17,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:17,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:17,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:17,890 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:17,980 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:38:17,980 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:17,980 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:17,980 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:17,980 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:17,980 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:17,981 INFO ]: Start difference. First operand 11 states and 1467 transitions. Second operand 3 states. [2018-06-26 20:38:20,019 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:20,019 INFO ]: Finished difference Result 14 states and 2343 transitions. [2018-06-26 20:38:20,019 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:20,019 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:38:20,019 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:20,022 INFO ]: With dead ends: 14 [2018-06-26 20:38:20,022 INFO ]: Without dead ends: 14 [2018-06-26 20:38:20,023 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 20:38:20,023 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 20:38:20,031 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-26 20:38:20,031 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:38:20,036 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2071 transitions. [2018-06-26 20:38:20,036 INFO ]: Start accepts. Automaton has 13 states and 2071 transitions. Word has length 10 [2018-06-26 20:38:20,036 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:20,036 INFO ]: Abstraction has 13 states and 2071 transitions. [2018-06-26 20:38:20,036 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:20,036 INFO ]: Start isEmpty. Operand 13 states and 2071 transitions. [2018-06-26 20:38:20,037 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:38:20,037 INFO ]: Found error trace [2018-06-26 20:38:20,037 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:20,037 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:20,037 INFO ]: Analyzing trace with hash -1692255819, now seen corresponding path program 1 times [2018-06-26 20:38:20,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:20,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:20,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:20,039 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:20,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:20,086 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:20,182 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:38:20,182 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:20,182 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:20,182 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:20,182 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:20,182 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:20,182 INFO ]: Start difference. First operand 13 states and 2071 transitions. Second operand 3 states. [2018-06-26 20:38:21,953 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:21,953 INFO ]: Finished difference Result 15 states and 2555 transitions. [2018-06-26 20:38:21,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:21,954 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:38:21,954 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:21,959 INFO ]: With dead ends: 15 [2018-06-26 20:38:21,959 INFO ]: Without dead ends: 15 [2018-06-26 20:38:21,959 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 20:38:21,959 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 20:38:21,978 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 20:38:21,979 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 20:38:21,980 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2555 transitions. [2018-06-26 20:38:21,980 INFO ]: Start accepts. Automaton has 15 states and 2555 transitions. Word has length 11 [2018-06-26 20:38:21,981 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:21,981 INFO ]: Abstraction has 15 states and 2555 transitions. [2018-06-26 20:38:21,981 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:21,982 INFO ]: Start isEmpty. Operand 15 states and 2555 transitions. [2018-06-26 20:38:21,983 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:38:21,983 INFO ]: Found error trace [2018-06-26 20:38:21,984 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:21,984 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:21,984 INFO ]: Analyzing trace with hash 621726209, now seen corresponding path program 1 times [2018-06-26 20:38:21,984 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:21,984 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:21,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:21,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:21,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:22,022 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:22,109 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:38:22,109 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:22,109 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:22,109 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:22,109 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:22,109 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:22,109 INFO ]: Start difference. First operand 15 states and 2555 transitions. Second operand 3 states. [2018-06-26 20:38:23,594 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:23,594 INFO ]: Finished difference Result 17 states and 2559 transitions. [2018-06-26 20:38:23,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:23,594 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:38:23,594 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:23,597 INFO ]: With dead ends: 17 [2018-06-26 20:38:23,598 INFO ]: Without dead ends: 17 [2018-06-26 20:38:23,598 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 20:38:23,598 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 20:38:23,612 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 20:38:23,612 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 20:38:23,614 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2559 transitions. [2018-06-26 20:38:23,614 INFO ]: Start accepts. Automaton has 17 states and 2559 transitions. Word has length 11 [2018-06-26 20:38:23,614 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:23,614 INFO ]: Abstraction has 17 states and 2559 transitions. [2018-06-26 20:38:23,614 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:23,614 INFO ]: Start isEmpty. Operand 17 states and 2559 transitions. [2018-06-26 20:38:23,616 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:38:23,616 INFO ]: Found error trace [2018-06-26 20:38:23,616 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:23,616 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:23,616 INFO ]: Analyzing trace with hash 1981842949, now seen corresponding path program 1 times [2018-06-26 20:38:23,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:23,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:23,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:23,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:23,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:23,647 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:23,724 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:38:23,725 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:23,725 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:23,725 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:23,725 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:23,725 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:23,725 INFO ]: Start difference. First operand 17 states and 2559 transitions. Second operand 3 states. [2018-06-26 20:38:25,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:25,260 INFO ]: Finished difference Result 19 states and 2839 transitions. [2018-06-26 20:38:25,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:25,261 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:38:25,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:25,263 INFO ]: With dead ends: 19 [2018-06-26 20:38:25,263 INFO ]: Without dead ends: 19 [2018-06-26 20:38:25,263 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 20:38:25,263 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 20:38:25,278 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-26 20:38:25,278 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 20:38:25,280 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2559 transitions. [2018-06-26 20:38:25,280 INFO ]: Start accepts. Automaton has 17 states and 2559 transitions. Word has length 11 [2018-06-26 20:38:25,280 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:25,280 INFO ]: Abstraction has 17 states and 2559 transitions. [2018-06-26 20:38:25,280 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:25,280 INFO ]: Start isEmpty. Operand 17 states and 2559 transitions. [2018-06-26 20:38:25,283 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:38:25,283 INFO ]: Found error trace [2018-06-26 20:38:25,283 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:25,283 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:25,283 INFO ]: Analyzing trace with hash 1923122681, now seen corresponding path program 1 times [2018-06-26 20:38:25,283 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:25,283 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:25,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:25,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:25,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:25,315 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:25,393 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 20:38:25,393 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:25,393 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:25,393 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:25,393 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:25,393 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:25,394 INFO ]: Start difference. First operand 17 states and 2559 transitions. Second operand 3 states. [2018-06-26 20:38:26,883 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:26,883 INFO ]: Finished difference Result 19 states and 2051 transitions. [2018-06-26 20:38:26,883 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:26,883 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:38:26,883 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:26,885 INFO ]: With dead ends: 19 [2018-06-26 20:38:26,885 INFO ]: Without dead ends: 19 [2018-06-26 20:38:26,886 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 20:38:26,886 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 20:38:26,891 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-26 20:38:26,891 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 20:38:26,894 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2051 transitions. [2018-06-26 20:38:26,894 INFO ]: Start accepts. Automaton has 19 states and 2051 transitions. Word has length 12 [2018-06-26 20:38:26,894 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:26,894 INFO ]: Abstraction has 19 states and 2051 transitions. [2018-06-26 20:38:26,894 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:26,894 INFO ]: Start isEmpty. Operand 19 states and 2051 transitions. [2018-06-26 20:38:26,895 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 20:38:26,895 INFO ]: Found error trace [2018-06-26 20:38:26,895 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:26,895 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:26,895 INFO ]: Analyzing trace with hash -1676680784, now seen corresponding path program 1 times [2018-06-26 20:38:26,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:26,895 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:26,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:26,896 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:26,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:26,939 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:27,033 INFO ]: Checked inductivity of 45 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-26 20:38:27,033 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:27,076 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:27,076 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:27,076 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:27,076 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:27,076 INFO ]: Start difference. First operand 19 states and 2051 transitions. Second operand 3 states. [2018-06-26 20:38:29,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:29,118 INFO ]: Finished difference Result 21 states and 2235 transitions. [2018-06-26 20:38:29,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:29,118 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 20:38:29,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:29,121 INFO ]: With dead ends: 21 [2018-06-26 20:38:29,121 INFO ]: Without dead ends: 21 [2018-06-26 20:38:29,121 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 20:38:29,122 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 20:38:29,127 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 20:38:29,127 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 20:38:29,129 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2235 transitions. [2018-06-26 20:38:29,129 INFO ]: Start accepts. Automaton has 21 states and 2235 transitions. Word has length 14 [2018-06-26 20:38:29,129 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:29,129 INFO ]: Abstraction has 21 states and 2235 transitions. [2018-06-26 20:38:29,129 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:29,129 INFO ]: Start isEmpty. Operand 21 states and 2235 transitions. [2018-06-26 20:38:29,130 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 20:38:29,130 INFO ]: Found error trace [2018-06-26 20:38:29,130 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:29,130 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:29,130 INFO ]: Analyzing trace with hash 4048682, now seen corresponding path program 1 times [2018-06-26 20:38:29,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:29,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:29,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:29,130 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:29,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:29,167 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:29,342 INFO ]: Checked inductivity of 45 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 20:38:29,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:38:29,342 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 20:38:29,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:29,671 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:29,694 INFO ]: Computing forward predicates... [2018-06-26 20:38:29,735 INFO ]: Checked inductivity of 45 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 20:38:29,771 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:38:29,771 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 20:38:29,771 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:38:29,771 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:38:29,771 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:38:29,771 INFO ]: Start difference. First operand 21 states and 2235 transitions. Second operand 6 states. [2018-06-26 20:38:35,387 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:35,387 INFO ]: Finished difference Result 59 states and 6645 transitions. [2018-06-26 20:38:35,387 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 20:38:35,387 INFO ]: Start accepts. Automaton has 6 states. Word has length 14 [2018-06-26 20:38:35,387 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:35,401 INFO ]: With dead ends: 59 [2018-06-26 20:38:35,401 INFO ]: Without dead ends: 59 [2018-06-26 20:38:35,402 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-26 20:38:35,402 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-26 20:38:35,430 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 38. [2018-06-26 20:38:35,430 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 20:38:35,434 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 4470 transitions. [2018-06-26 20:38:35,434 INFO ]: Start accepts. Automaton has 38 states and 4470 transitions. Word has length 14 [2018-06-26 20:38:35,435 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:35,435 INFO ]: Abstraction has 38 states and 4470 transitions. [2018-06-26 20:38:35,435 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:38:35,435 INFO ]: Start isEmpty. Operand 38 states and 4470 transitions. [2018-06-26 20:38:35,436 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 20:38:35,436 INFO ]: Found error trace [2018-06-26 20:38:35,436 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:35,436 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:35,436 INFO ]: Analyzing trace with hash 327751608, now seen corresponding path program 1 times [2018-06-26 20:38:35,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:35,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:35,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:35,438 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:35,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:35,478 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:35,586 INFO ]: Checked inductivity of 45 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-26 20:38:35,587 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:35,587 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:35,587 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:35,587 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:35,587 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:35,587 INFO ]: Start difference. First operand 38 states and 4470 transitions. Second operand 3 states. [2018-06-26 20:38:37,618 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:37,618 INFO ]: Finished difference Result 68 states and 5160 transitions. [2018-06-26 20:38:37,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:37,621 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 20:38:37,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:37,627 INFO ]: With dead ends: 68 [2018-06-26 20:38:37,627 INFO ]: Without dead ends: 68 [2018-06-26 20:38:37,627 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 20:38:37,627 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-26 20:38:37,645 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-06-26 20:38:37,646 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-26 20:38:37,651 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 5160 transitions. [2018-06-26 20:38:37,651 INFO ]: Start accepts. Automaton has 68 states and 5160 transitions. Word has length 14 [2018-06-26 20:38:37,651 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:37,651 INFO ]: Abstraction has 68 states and 5160 transitions. [2018-06-26 20:38:37,651 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:37,651 INFO ]: Start isEmpty. Operand 68 states and 5160 transitions. [2018-06-26 20:38:37,652 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 20:38:37,652 INFO ]: Found error trace [2018-06-26 20:38:37,652 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:37,652 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:37,652 INFO ]: Analyzing trace with hash 498590983, now seen corresponding path program 1 times [2018-06-26 20:38:37,652 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:37,652 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:37,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:37,656 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:37,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:37,689 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:37,856 INFO ]: Checked inductivity of 45 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 20:38:37,856 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:38:37,856 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 20:38:37,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:38:38,105 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:38,115 INFO ]: Computing forward predicates... [2018-06-26 20:38:38,322 INFO ]: Checked inductivity of 45 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 20:38:38,356 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:38:38,356 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 20:38:38,356 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:38:38,356 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:38:38,356 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:38:38,356 INFO ]: Start difference. First operand 68 states and 5160 transitions. Second operand 6 states. [2018-06-26 20:38:42,900 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:42,901 INFO ]: Finished difference Result 128 states and 9388 transitions. [2018-06-26 20:38:42,901 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 20:38:42,901 INFO ]: Start accepts. Automaton has 6 states. Word has length 14 [2018-06-26 20:38:42,901 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:42,906 INFO ]: With dead ends: 128 [2018-06-26 20:38:42,906 INFO ]: Without dead ends: 128 [2018-06-26 20:38:42,907 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-26 20:38:42,907 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-26 20:38:42,932 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 99. [2018-06-26 20:38:42,933 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-26 20:38:42,939 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 8169 transitions. [2018-06-26 20:38:42,939 INFO ]: Start accepts. Automaton has 99 states and 8169 transitions. Word has length 14 [2018-06-26 20:38:42,939 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:42,939 INFO ]: Abstraction has 99 states and 8169 transitions. [2018-06-26 20:38:42,939 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:38:42,939 INFO ]: Start isEmpty. Operand 99 states and 8169 transitions. [2018-06-26 20:38:42,942 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 20:38:42,942 INFO ]: Found error trace [2018-06-26 20:38:42,942 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:42,942 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:42,942 INFO ]: Analyzing trace with hash -1176610070, now seen corresponding path program 1 times [2018-06-26 20:38:42,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:42,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:42,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:42,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:42,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:43,004 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:43,077 INFO ]: Checked inductivity of 45 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-26 20:38:43,077 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:43,077 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:43,077 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:43,078 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:43,078 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:43,078 INFO ]: Start difference. First operand 99 states and 8169 transitions. Second operand 3 states. [2018-06-26 20:38:44,465 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:44,465 INFO ]: Finished difference Result 113 states and 8439 transitions. [2018-06-26 20:38:44,483 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:44,483 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 20:38:44,483 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:44,488 INFO ]: With dead ends: 113 [2018-06-26 20:38:44,488 INFO ]: Without dead ends: 113 [2018-06-26 20:38:44,488 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 20:38:44,488 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-26 20:38:44,517 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 103. [2018-06-26 20:38:44,517 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-26 20:38:44,526 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 8289 transitions. [2018-06-26 20:38:44,526 INFO ]: Start accepts. Automaton has 103 states and 8289 transitions. Word has length 14 [2018-06-26 20:38:44,526 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:44,526 INFO ]: Abstraction has 103 states and 8289 transitions. [2018-06-26 20:38:44,526 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:44,526 INFO ]: Start isEmpty. Operand 103 states and 8289 transitions. [2018-06-26 20:38:44,529 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 20:38:44,530 INFO ]: Found error trace [2018-06-26 20:38:44,530 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:44,530 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:44,530 INFO ]: Analyzing trace with hash 59130588, now seen corresponding path program 1 times [2018-06-26 20:38:44,530 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:44,530 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:44,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:44,530 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:44,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:44,551 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:44,643 INFO ]: Checked inductivity of 45 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-26 20:38:44,644 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:44,644 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:44,644 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:44,644 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:44,644 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:44,644 INFO ]: Start difference. First operand 103 states and 8289 transitions. Second operand 3 states. [2018-06-26 20:38:46,059 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:46,059 INFO ]: Finished difference Result 117 states and 8765 transitions. [2018-06-26 20:38:46,059 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:46,059 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 20:38:46,060 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:46,065 INFO ]: With dead ends: 117 [2018-06-26 20:38:46,065 INFO ]: Without dead ends: 117 [2018-06-26 20:38:46,065 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 20:38:46,066 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-26 20:38:46,084 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-06-26 20:38:46,084 INFO ]: Start removeUnreachable. Operand 117 states. [2018-06-26 20:38:46,088 INFO ]: Finished removeUnreachable. Reduced from 117 states to 117 states and 8765 transitions. [2018-06-26 20:38:46,088 INFO ]: Start accepts. Automaton has 117 states and 8765 transitions. Word has length 14 [2018-06-26 20:38:46,088 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:46,088 INFO ]: Abstraction has 117 states and 8765 transitions. [2018-06-26 20:38:46,088 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:46,088 INFO ]: Start isEmpty. Operand 117 states and 8765 transitions. [2018-06-26 20:38:46,091 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 20:38:46,091 INFO ]: Found error trace [2018-06-26 20:38:46,091 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:46,091 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:46,091 INFO ]: Analyzing trace with hash 1109239584, now seen corresponding path program 1 times [2018-06-26 20:38:46,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:46,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:46,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:46,092 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:46,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:46,118 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:46,217 INFO ]: Checked inductivity of 55 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-26 20:38:46,217 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:46,217 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:46,217 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:46,217 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:46,217 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:46,217 INFO ]: Start difference. First operand 117 states and 8765 transitions. Second operand 3 states. [2018-06-26 20:38:47,816 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:47,816 INFO ]: Finished difference Result 131 states and 9341 transitions. [2018-06-26 20:38:47,816 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:47,816 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-26 20:38:47,816 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:47,830 INFO ]: With dead ends: 131 [2018-06-26 20:38:47,830 INFO ]: Without dead ends: 131 [2018-06-26 20:38:47,831 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 20:38:47,831 INFO ]: Start minimizeSevpa. Operand 131 states. [2018-06-26 20:38:47,856 INFO ]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-06-26 20:38:47,856 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-26 20:38:47,861 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 9341 transitions. [2018-06-26 20:38:47,861 INFO ]: Start accepts. Automaton has 131 states and 9341 transitions. Word has length 15 [2018-06-26 20:38:47,861 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:47,861 INFO ]: Abstraction has 131 states and 9341 transitions. [2018-06-26 20:38:47,861 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:47,861 INFO ]: Start isEmpty. Operand 131 states and 9341 transitions. [2018-06-26 20:38:47,863 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 20:38:47,863 INFO ]: Found error trace [2018-06-26 20:38:47,863 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:47,863 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:47,863 INFO ]: Analyzing trace with hash 1840869221, now seen corresponding path program 1 times [2018-06-26 20:38:47,863 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:47,863 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:47,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:47,864 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:47,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:47,889 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:47,976 INFO ]: Checked inductivity of 66 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-26 20:38:47,976 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:47,976 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:47,976 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:47,976 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:47,976 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:47,977 INFO ]: Start difference. First operand 131 states and 9341 transitions. Second operand 3 states. [2018-06-26 20:38:49,651 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:49,651 INFO ]: Finished difference Result 254 states and 15636 transitions. [2018-06-26 20:38:49,651 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:49,651 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-26 20:38:49,651 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:49,662 INFO ]: With dead ends: 254 [2018-06-26 20:38:49,662 INFO ]: Without dead ends: 254 [2018-06-26 20:38:49,662 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 20:38:49,662 INFO ]: Start minimizeSevpa. Operand 254 states. [2018-06-26 20:38:49,691 INFO ]: Finished minimizeSevpa. Reduced states from 254 to 233. [2018-06-26 20:38:49,691 INFO ]: Start removeUnreachable. Operand 233 states. [2018-06-26 20:38:49,701 INFO ]: Finished removeUnreachable. Reduced from 233 states to 233 states and 14291 transitions. [2018-06-26 20:38:49,701 INFO ]: Start accepts. Automaton has 233 states and 14291 transitions. Word has length 16 [2018-06-26 20:38:49,701 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:49,701 INFO ]: Abstraction has 233 states and 14291 transitions. [2018-06-26 20:38:49,701 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:49,701 INFO ]: Start isEmpty. Operand 233 states and 14291 transitions. [2018-06-26 20:38:49,705 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 20:38:49,705 INFO ]: Found error trace [2018-06-26 20:38:49,705 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:49,706 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:49,707 INFO ]: Analyzing trace with hash -1313232621, now seen corresponding path program 1 times [2018-06-26 20:38:49,707 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:49,707 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:49,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:49,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:49,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:49,734 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:49,811 INFO ]: Checked inductivity of 66 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-26 20:38:49,811 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:49,811 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:49,811 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:49,811 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:49,811 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:49,811 INFO ]: Start difference. First operand 233 states and 14291 transitions. Second operand 3 states. [2018-06-26 20:38:52,513 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:52,513 INFO ]: Finished difference Result 259 states and 15295 transitions. [2018-06-26 20:38:52,513 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:52,513 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-26 20:38:52,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:52,519 INFO ]: With dead ends: 259 [2018-06-26 20:38:52,519 INFO ]: Without dead ends: 259 [2018-06-26 20:38:52,519 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 20:38:52,519 INFO ]: Start minimizeSevpa. Operand 259 states. [2018-06-26 20:38:52,544 INFO ]: Finished minimizeSevpa. Reduced states from 259 to 251. [2018-06-26 20:38:52,544 INFO ]: Start removeUnreachable. Operand 251 states. [2018-06-26 20:38:52,554 INFO ]: Finished removeUnreachable. Reduced from 251 states to 251 states and 15007 transitions. [2018-06-26 20:38:52,555 INFO ]: Start accepts. Automaton has 251 states and 15007 transitions. Word has length 16 [2018-06-26 20:38:52,555 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:52,555 INFO ]: Abstraction has 251 states and 15007 transitions. [2018-06-26 20:38:52,555 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:52,555 INFO ]: Start isEmpty. Operand 251 states and 15007 transitions. [2018-06-26 20:38:52,559 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:38:52,559 INFO ]: Found error trace [2018-06-26 20:38:52,560 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:52,560 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:52,560 INFO ]: Analyzing trace with hash 354922970, now seen corresponding path program 1 times [2018-06-26 20:38:52,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:52,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:52,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:52,560 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:52,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:52,587 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:52,662 INFO ]: Checked inductivity of 78 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-26 20:38:52,663 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:52,663 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:52,663 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:52,663 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:52,663 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:52,663 INFO ]: Start difference. First operand 251 states and 15007 transitions. Second operand 3 states. [2018-06-26 20:38:54,206 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:54,206 INFO ]: Finished difference Result 277 states and 15075 transitions. [2018-06-26 20:38:54,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:54,207 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:38:54,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:54,213 INFO ]: With dead ends: 277 [2018-06-26 20:38:54,213 INFO ]: Without dead ends: 277 [2018-06-26 20:38:54,213 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 20:38:54,213 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-26 20:38:54,240 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 251. [2018-06-26 20:38:54,240 INFO ]: Start removeUnreachable. Operand 251 states. [2018-06-26 20:38:54,248 INFO ]: Finished removeUnreachable. Reduced from 251 states to 251 states and 14323 transitions. [2018-06-26 20:38:54,248 INFO ]: Start accepts. Automaton has 251 states and 14323 transitions. Word has length 17 [2018-06-26 20:38:54,249 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:54,249 INFO ]: Abstraction has 251 states and 14323 transitions. [2018-06-26 20:38:54,249 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:54,249 INFO ]: Start isEmpty. Operand 251 states and 14323 transitions. [2018-06-26 20:38:54,253 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:38:54,253 INFO ]: Found error trace [2018-06-26 20:38:54,253 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:54,253 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:54,253 INFO ]: Analyzing trace with hash -518876858, now seen corresponding path program 1 times [2018-06-26 20:38:54,254 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:54,254 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:54,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:54,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:54,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:54,275 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:54,353 INFO ]: Checked inductivity of 78 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-26 20:38:54,354 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:54,354 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:54,354 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:54,354 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:54,354 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:54,354 INFO ]: Start difference. First operand 251 states and 14323 transitions. Second operand 3 states. [2018-06-26 20:38:56,302 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:56,302 INFO ]: Finished difference Result 384 states and 14323 transitions. [2018-06-26 20:38:56,303 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:56,303 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:38:56,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:56,312 INFO ]: With dead ends: 384 [2018-06-26 20:38:56,312 INFO ]: Without dead ends: 251 [2018-06-26 20:38:56,312 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 20:38:56,312 INFO ]: Start minimizeSevpa. Operand 251 states. [2018-06-26 20:38:56,342 INFO ]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-06-26 20:38:56,342 INFO ]: Start removeUnreachable. Operand 251 states. [2018-06-26 20:38:56,351 INFO ]: Finished removeUnreachable. Reduced from 251 states to 251 states and 12015 transitions. [2018-06-26 20:38:56,351 INFO ]: Start accepts. Automaton has 251 states and 12015 transitions. Word has length 17 [2018-06-26 20:38:56,351 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:56,351 INFO ]: Abstraction has 251 states and 12015 transitions. [2018-06-26 20:38:56,351 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:56,351 INFO ]: Start isEmpty. Operand 251 states and 12015 transitions. [2018-06-26 20:38:56,358 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:38:56,358 INFO ]: Found error trace [2018-06-26 20:38:56,358 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:56,358 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:56,358 INFO ]: Analyzing trace with hash 1344621230, now seen corresponding path program 1 times [2018-06-26 20:38:56,358 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:56,358 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:56,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:56,359 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:56,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:56,384 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:56,463 INFO ]: Checked inductivity of 78 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-26 20:38:56,464 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:56,464 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:56,464 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:56,464 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:56,464 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:56,464 INFO ]: Start difference. First operand 251 states and 12015 transitions. Second operand 3 states. [2018-06-26 20:38:58,110 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:58,110 INFO ]: Finished difference Result 277 states and 12519 transitions. [2018-06-26 20:38:58,111 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:58,111 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:38:58,111 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:58,116 INFO ]: With dead ends: 277 [2018-06-26 20:38:58,116 INFO ]: Without dead ends: 277 [2018-06-26 20:38:58,116 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 20:38:58,116 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-26 20:38:58,138 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 251. [2018-06-26 20:38:58,139 INFO ]: Start removeUnreachable. Operand 251 states. [2018-06-26 20:38:58,147 INFO ]: Finished removeUnreachable. Reduced from 251 states to 251 states and 11879 transitions. [2018-06-26 20:38:58,147 INFO ]: Start accepts. Automaton has 251 states and 11879 transitions. Word has length 17 [2018-06-26 20:38:58,147 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:58,147 INFO ]: Abstraction has 251 states and 11879 transitions. [2018-06-26 20:38:58,147 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:58,147 INFO ]: Start isEmpty. Operand 251 states and 11879 transitions. [2018-06-26 20:38:58,153 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:38:58,153 INFO ]: Found error trace [2018-06-26 20:38:58,153 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:58,153 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:58,153 INFO ]: Analyzing trace with hash 1884553933, now seen corresponding path program 1 times [2018-06-26 20:38:58,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:58,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:58,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:58,154 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:58,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:58,216 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:58,287 INFO ]: Checked inductivity of 91 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-26 20:38:58,287 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:58,287 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:58,287 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:58,287 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:58,287 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:58,287 INFO ]: Start difference. First operand 251 states and 11879 transitions. Second operand 3 states. [2018-06-26 20:38:59,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:38:59,817 INFO ]: Finished difference Result 277 states and 11153 transitions. [2018-06-26 20:38:59,817 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:38:59,817 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 20:38:59,817 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:38:59,821 INFO ]: With dead ends: 277 [2018-06-26 20:38:59,821 INFO ]: Without dead ends: 277 [2018-06-26 20:38:59,821 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 20:38:59,821 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-26 20:38:59,841 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 251. [2018-06-26 20:38:59,841 INFO ]: Start removeUnreachable. Operand 251 states. [2018-06-26 20:38:59,848 INFO ]: Finished removeUnreachable. Reduced from 251 states to 251 states and 10803 transitions. [2018-06-26 20:38:59,848 INFO ]: Start accepts. Automaton has 251 states and 10803 transitions. Word has length 18 [2018-06-26 20:38:59,848 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:38:59,848 INFO ]: Abstraction has 251 states and 10803 transitions. [2018-06-26 20:38:59,848 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:38:59,849 INFO ]: Start isEmpty. Operand 251 states and 10803 transitions. [2018-06-26 20:38:59,851 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:38:59,851 INFO ]: Found error trace [2018-06-26 20:38:59,851 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:38:59,851 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:38:59,852 INFO ]: Analyzing trace with hash 1353150054, now seen corresponding path program 1 times [2018-06-26 20:38:59,852 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:38:59,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:38:59,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:59,853 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:38:59,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:38:59,877 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:38:59,963 INFO ]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 20:38:59,964 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:38:59,964 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:38:59,964 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:38:59,964 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:38:59,964 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:38:59,964 INFO ]: Start difference. First operand 251 states and 10803 transitions. Second operand 3 states. [2018-06-26 20:39:01,229 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:39:01,229 INFO ]: Finished difference Result 277 states and 11153 transitions. [2018-06-26 20:39:01,229 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:39:01,229 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 20:39:01,229 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:39:01,234 INFO ]: With dead ends: 277 [2018-06-26 20:39:01,234 INFO ]: Without dead ends: 277 [2018-06-26 20:39:01,234 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 20:39:01,234 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-26 20:39:01,254 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 251. [2018-06-26 20:39:01,254 INFO ]: Start removeUnreachable. Operand 251 states. [2018-06-26 20:39:01,261 INFO ]: Finished removeUnreachable. Reduced from 251 states to 251 states and 10803 transitions. [2018-06-26 20:39:01,261 INFO ]: Start accepts. Automaton has 251 states and 10803 transitions. Word has length 18 [2018-06-26 20:39:01,261 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:39:01,261 INFO ]: Abstraction has 251 states and 10803 transitions. [2018-06-26 20:39:01,261 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:39:01,261 INFO ]: Start isEmpty. Operand 251 states and 10803 transitions. [2018-06-26 20:39:01,263 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:39:01,263 INFO ]: Found error trace [2018-06-26 20:39:01,264 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:39:01,264 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:39:01,264 INFO ]: Analyzing trace with hash 1287292364, now seen corresponding path program 1 times [2018-06-26 20:39:01,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:39:01,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:39:01,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:39:01,264 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:39:01,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:39:01,294 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:39:01,376 INFO ]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 20:39:01,376 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:39:01,376 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:39:01,376 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:39:01,376 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:39:01,376 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:39:01,376 INFO ]: Start difference. First operand 251 states and 10803 transitions. Second operand 3 states. [2018-06-26 20:39:02,836 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:39:02,836 INFO ]: Finished difference Result 259 states and 10767 transitions. [2018-06-26 20:39:02,836 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:39:02,836 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 20:39:02,836 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:39:02,840 INFO ]: With dead ends: 259 [2018-06-26 20:39:02,840 INFO ]: Without dead ends: 259 [2018-06-26 20:39:02,840 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 20:39:02,840 INFO ]: Start minimizeSevpa. Operand 259 states. [2018-06-26 20:39:02,858 INFO ]: Finished minimizeSevpa. Reduced states from 259 to 251. [2018-06-26 20:39:02,858 INFO ]: Start removeUnreachable. Operand 251 states. [2018-06-26 20:39:02,865 INFO ]: Finished removeUnreachable. Reduced from 251 states to 251 states and 10667 transitions. [2018-06-26 20:39:02,865 INFO ]: Start accepts. Automaton has 251 states and 10667 transitions. Word has length 18 [2018-06-26 20:39:02,865 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:39:02,865 INFO ]: Abstraction has 251 states and 10667 transitions. [2018-06-26 20:39:02,865 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:39:02,865 INFO ]: Start isEmpty. Operand 251 states and 10667 transitions. [2018-06-26 20:39:02,868 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:39:02,868 INFO ]: Found error trace [2018-06-26 20:39:02,868 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:39:02,868 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:39:02,868 INFO ]: Analyzing trace with hash 1060707500, now seen corresponding path program 1 times [2018-06-26 20:39:02,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:39:02,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:39:02,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:39:02,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:39:02,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:39:02,894 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:39:02,973 INFO ]: Checked inductivity of 91 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-26 20:39:02,973 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:39:02,973 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:39:02,973 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:39:02,973 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:39:02,973 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:39:02,973 INFO ]: Start difference. First operand 251 states and 10667 transitions. Second operand 3 states. [2018-06-26 20:39:04,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:39:04,361 INFO ]: Finished difference Result 494 states and 17768 transitions. [2018-06-26 20:39:04,362 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:39:04,362 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 20:39:04,362 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:39:04,367 INFO ]: With dead ends: 494 [2018-06-26 20:39:04,368 INFO ]: Without dead ends: 494 [2018-06-26 20:39:04,368 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:39:04,368 INFO ]: Start minimizeSevpa. Operand 494 states. [2018-06-26 20:39:04,392 INFO ]: Finished minimizeSevpa. Reduced states from 494 to 384. [2018-06-26 20:39:04,392 INFO ]: Start removeUnreachable. Operand 384 states. [2018-06-26 20:39:04,399 INFO ]: Finished removeUnreachable. Reduced from 384 states to 384 states and 16000 transitions. [2018-06-26 20:39:04,399 INFO ]: Start accepts. Automaton has 384 states and 16000 transitions. Word has length 18 [2018-06-26 20:39:04,399 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:39:04,399 INFO ]: Abstraction has 384 states and 16000 transitions. [2018-06-26 20:39:04,399 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:39:04,399 INFO ]: Start isEmpty. Operand 384 states and 16000 transitions. [2018-06-26 20:39:04,404 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:39:04,404 INFO ]: Found error trace [2018-06-26 20:39:04,404 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:39:04,404 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:39:04,404 INFO ]: Analyzing trace with hash -1705290036, now seen corresponding path program 1 times [2018-06-26 20:39:04,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:39:04,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:39:04,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:39:04,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:39:04,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:39:04,433 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:39:04,536 INFO ]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-26 20:39:04,537 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:39:04,537 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:39:04,537 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:39:04,537 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:39:04,537 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:39:04,537 INFO ]: Start difference. First operand 384 states and 16000 transitions. Second operand 3 states. Received shutdown request... [2018-06-26 20:39:06,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:39:06,323 WARN ]: Verification canceled [2018-06-26 20:39:06,326 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:39:06,326 WARN ]: Timeout [2018-06-26 20:39:06,327 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:39:06 BasicIcfg [2018-06-26 20:39:06,327 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:39:06,327 INFO ]: Toolchain (without parser) took 63635.85 ms. Allocated memory was 309.3 MB in the beginning and 1.2 GB in the end (delta: 907.0 MB). Free memory was 247.7 MB in the beginning and 1.1 GB in the end (delta: -851.9 MB). Peak memory consumption was 55.1 MB. Max. memory is 3.6 GB. [2018-06-26 20:39:06,328 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:39:06,329 INFO ]: ChcToBoogie took 136.60 ms. Allocated memory is still 309.3 MB. Free memory was 247.7 MB in the beginning and 244.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:39:06,329 INFO ]: Boogie Preprocessor took 80.73 ms. Allocated memory is still 309.3 MB. Free memory was 244.7 MB in the beginning and 242.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-26 20:39:06,329 INFO ]: RCFGBuilder took 429.16 ms. Allocated memory is still 309.3 MB. Free memory was 242.7 MB in the beginning and 215.3 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 3.6 GB. [2018-06-26 20:39:06,330 INFO ]: BlockEncodingV2 took 1129.83 ms. Allocated memory was 309.3 MB in the beginning and 391.1 MB in the end (delta: 81.8 MB). Free memory was 215.3 MB in the beginning and 281.5 MB in the end (delta: -66.2 MB). Peak memory consumption was 63.4 MB. Max. memory is 3.6 GB. [2018-06-26 20:39:06,330 INFO ]: TraceAbstraction took 61850.34 ms. Allocated memory was 391.1 MB in the beginning and 1.2 GB in the end (delta: 825.2 MB). Free memory was 281.5 MB in the beginning and 1.1 GB in the end (delta: -818.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 3.6 GB. [2018-06-26 20:39:06,334 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 540 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 136.60 ms. Allocated memory is still 309.3 MB. Free memory was 247.7 MB in the beginning and 244.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 80.73 ms. Allocated memory is still 309.3 MB. Free memory was 244.7 MB in the beginning and 242.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 429.16 ms. Allocated memory is still 309.3 MB. Free memory was 242.7 MB in the beginning and 215.3 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1129.83 ms. Allocated memory was 309.3 MB in the beginning and 391.1 MB in the end (delta: 81.8 MB). Free memory was 215.3 MB in the beginning and 281.5 MB in the end (delta: -66.2 MB). Peak memory consumption was 63.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 61850.34 ms. Allocated memory was 391.1 MB in the beginning and 1.2 GB in the end (delta: 825.2 MB). Free memory was 281.5 MB in the beginning and 1.1 GB in the end (delta: -818.1 MB). Peak memory consumption was 7.1 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 (384states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (287 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 61.7s OverallTime, 27 OverallIterations, 2 TraceHistogramMax, 56.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 133 SDtfs, 0 SDslu, 119 SDs, 0 SdLazy, 17483 SolverSat, 18451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 314 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 5920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3450 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 29 InterpolantComputations, 25 PerfectInterpolantSequences, 1358/1362 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/s3_clnt_1.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-39-06-352.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_1.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-39-06-352.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_1.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-39-06-352.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_1.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-39-06-352.csv Completed graceful shutdown