java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i '/storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:38:19,875 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:38:19,877 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:38:19,892 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:38:19,892 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:38:19,893 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:38:19,894 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:38:19,898 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:38:19,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:38:19,901 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:38:19,902 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:38:19,902 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:38:19,903 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:38:19,904 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:38:19,906 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:38:19,907 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:38:19,908 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:38:19,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:38:19,920 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:38:19,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:38:19,922 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:38:19,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:38:19,928 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:38:19,928 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:38:19,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:38:19,929 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:38:19,932 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:38:19,933 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:38:19,934 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:38:19,934 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:38:19,935 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:38:19,935 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:38:19,935 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:38:19,939 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:38:19,939 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:38:19,940 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:38:19,960 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:38:19,960 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:38:19,961 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:38:19,961 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:38:19,962 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:38:19,962 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:38:19,962 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:38:19,963 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:38:19,963 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:38:19,963 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:38:19,963 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:38:19,963 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:38:19,963 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:38:19,965 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:38:19,965 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:38:19,965 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:38:19,965 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:38:19,966 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:38:19,966 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:38:19,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:38:19,966 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:38:19,967 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:38:19,968 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:38:20,009 INFO ]: Repository-Root is: /tmp [2018-06-24 21:38:20,025 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:38:20,032 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:38:20,033 INFO ]: Initializing SmtParser... [2018-06-24 21:38:20,033 INFO ]: SmtParser initialized [2018-06-24 21:38:20,034 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2 [2018-06-24 21:38:20,035 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:38:20,125 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@594f916b [2018-06-24 21:38:20,376 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2 [2018-06-24 21:38:20,380 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:38:20,387 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:38:20,387 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:38:20,387 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:38:20,388 INFO ]: ChcToBoogie initialized [2018-06-24 21:38:20,391 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:38:20" (1/1) ... [2018-06-24 21:38:20,458 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:20 Unit [2018-06-24 21:38:20,458 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:38:20,459 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:38:20,459 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:38:20,459 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:38:20,479 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:20" (1/1) ... [2018-06-24 21:38:20,479 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:20" (1/1) ... [2018-06-24 21:38:20,487 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:20" (1/1) ... [2018-06-24 21:38:20,487 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:20" (1/1) ... [2018-06-24 21:38:20,497 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:20" (1/1) ... [2018-06-24 21:38:20,500 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:20" (1/1) ... [2018-06-24 21:38:20,502 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:20" (1/1) ... [2018-06-24 21:38:20,505 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:38:20,505 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:38:20,505 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:38:20,505 INFO ]: RCFGBuilder initialized [2018-06-24 21:38:20,506 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:20" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:38:20,527 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:38:20,527 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:38:20,527 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:38:20,527 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:38:20,527 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:38:20,527 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:38:21,197 INFO ]: Using library mode [2018-06-24 21:38:21,197 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:38:21 BoogieIcfgContainer [2018-06-24 21:38:21,197 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:38:21,203 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:38:21,203 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:38:21,204 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:38:21,205 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:38:21" (1/1) ... [2018-06-24 21:38:21,227 INFO ]: Initial Icfg 33 locations, 69 edges [2018-06-24 21:38:21,229 INFO ]: Using Remove infeasible edges [2018-06-24 21:38:21,229 INFO ]: Using Maximize final states [2018-06-24 21:38:21,232 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:38:21,232 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:38:21,234 INFO ]: Using Remove sink states [2018-06-24 21:38:21,235 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:38:21,235 INFO ]: Using Use SBE [2018-06-24 21:38:21,249 INFO ]: SBE split 0 edges [2018-06-24 21:38:21,261 INFO ]: Removed 6 edges and 2 locations because of local infeasibility [2018-06-24 21:38:21,262 INFO ]: 0 new accepting states [2018-06-24 21:38:21,353 INFO ]: Removed 22 edges and 6 locations by large block encoding [2018-06-24 21:38:21,355 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:38:21,356 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:38:21,356 INFO ]: 0 new accepting states [2018-06-24 21:38:21,357 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:38:21,357 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:38:21,358 INFO ]: Encoded RCFG 25 locations, 57 edges [2018-06-24 21:38:21,358 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:38:21 BasicIcfg [2018-06-24 21:38:21,358 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:38:21,360 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:38:21,360 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:38:21,363 INFO ]: TraceAbstraction initialized [2018-06-24 21:38:21,364 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:38:20" (1/4) ... [2018-06-24 21:38:21,364 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ab2430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:38:21, skipping insertion in model container [2018-06-24 21:38:21,364 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:20" (2/4) ... [2018-06-24 21:38:21,365 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ab2430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:38:21, skipping insertion in model container [2018-06-24 21:38:21,365 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:38:21" (3/4) ... [2018-06-24 21:38:21,365 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ab2430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:38:21, skipping insertion in model container [2018-06-24 21:38:21,365 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:38:21" (4/4) ... [2018-06-24 21:38:21,367 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:38:21,377 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:38:21,387 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:38:21,433 INFO ]: Using default assertion order modulation [2018-06-24 21:38:21,434 INFO ]: Interprodecural is true [2018-06-24 21:38:21,434 INFO ]: Hoare is false [2018-06-24 21:38:21,434 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:38:21,434 INFO ]: Backedges is TWOTRACK [2018-06-24 21:38:21,434 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:38:21,434 INFO ]: Difference is false [2018-06-24 21:38:21,434 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:38:21,434 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:38:21,447 INFO ]: Start isEmpty. Operand 25 states. [2018-06-24 21:38:21,464 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:38:21,464 INFO ]: Found error trace [2018-06-24 21:38:21,465 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:38:21,465 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:21,469 INFO ]: Analyzing trace with hash 40114148, now seen corresponding path program 1 times [2018-06-24 21:38:21,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:21,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:21,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:21,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:21,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:21,541 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:21,671 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:21,673 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:21,673 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:21,674 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:21,685 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:21,685 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:21,687 INFO ]: Start difference. First operand 25 states. Second operand 3 states. [2018-06-24 21:38:22,024 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:22,024 INFO ]: Finished difference Result 47 states and 110 transitions. [2018-06-24 21:38:22,025 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:22,026 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:38:22,026 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:22,036 INFO ]: With dead ends: 47 [2018-06-24 21:38:22,036 INFO ]: Without dead ends: 47 [2018-06-24 21:38:22,037 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:22,051 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-24 21:38:22,095 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-24 21:38:22,097 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-24 21:38:22,104 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 110 transitions. [2018-06-24 21:38:22,105 INFO ]: Start accepts. Automaton has 47 states and 110 transitions. Word has length 5 [2018-06-24 21:38:22,106 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:22,106 INFO ]: Abstraction has 47 states and 110 transitions. [2018-06-24 21:38:22,106 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:22,106 INFO ]: Start isEmpty. Operand 47 states and 110 transitions. [2018-06-24 21:38:22,113 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:38:22,113 INFO ]: Found error trace [2018-06-24 21:38:22,114 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:38:22,118 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:22,118 INFO ]: Analyzing trace with hash 1248942594, now seen corresponding path program 1 times [2018-06-24 21:38:22,118 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:22,118 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:22,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:22,119 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:22,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:22,136 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:22,211 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:22,211 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:22,211 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:22,213 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:22,213 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:22,213 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:22,213 INFO ]: Start difference. First operand 47 states and 110 transitions. Second operand 3 states. [2018-06-24 21:38:22,304 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:22,305 INFO ]: Finished difference Result 59 states and 151 transitions. [2018-06-24 21:38:22,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:22,307 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:38:22,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:22,315 INFO ]: With dead ends: 59 [2018-06-24 21:38:22,315 INFO ]: Without dead ends: 59 [2018-06-24 21:38:22,315 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:22,316 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-24 21:38:22,338 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-06-24 21:38:22,338 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 21:38:22,341 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 112 transitions. [2018-06-24 21:38:22,342 INFO ]: Start accepts. Automaton has 49 states and 112 transitions. Word has length 6 [2018-06-24 21:38:22,342 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:22,342 INFO ]: Abstraction has 49 states and 112 transitions. [2018-06-24 21:38:22,342 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:22,342 INFO ]: Start isEmpty. Operand 49 states and 112 transitions. [2018-06-24 21:38:22,345 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:38:22,345 INFO ]: Found error trace [2018-06-24 21:38:22,345 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:38:22,345 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:22,345 INFO ]: Analyzing trace with hash 1249988162, now seen corresponding path program 1 times [2018-06-24 21:38:22,345 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:22,345 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:22,346 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:22,346 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:22,346 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:22,355 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:22,391 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:22,391 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:22,391 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:22,391 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:22,391 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:22,391 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:22,391 INFO ]: Start difference. First operand 49 states and 112 transitions. Second operand 3 states. [2018-06-24 21:38:22,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:22,538 INFO ]: Finished difference Result 61 states and 147 transitions. [2018-06-24 21:38:22,539 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:22,539 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:38:22,540 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:22,543 INFO ]: With dead ends: 61 [2018-06-24 21:38:22,543 INFO ]: Without dead ends: 61 [2018-06-24 21:38:22,547 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:22,547 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 21:38:22,570 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 51. [2018-06-24 21:38:22,570 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-24 21:38:22,572 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 114 transitions. [2018-06-24 21:38:22,572 INFO ]: Start accepts. Automaton has 51 states and 114 transitions. Word has length 6 [2018-06-24 21:38:22,572 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:22,572 INFO ]: Abstraction has 51 states and 114 transitions. [2018-06-24 21:38:22,572 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:22,572 INFO ]: Start isEmpty. Operand 51 states and 114 transitions. [2018-06-24 21:38:22,577 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:38:22,577 INFO ]: Found error trace [2018-06-24 21:38:22,577 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:38:22,577 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:22,577 INFO ]: Analyzing trace with hash 1250789636, now seen corresponding path program 1 times [2018-06-24 21:38:22,577 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:22,577 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:22,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:22,578 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:22,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:22,595 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:22,648 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:22,648 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:22,648 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:22,649 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:22,649 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:22,649 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:22,649 INFO ]: Start difference. First operand 51 states and 114 transitions. Second operand 3 states. [2018-06-24 21:38:22,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:22,671 INFO ]: Finished difference Result 62 states and 153 transitions. [2018-06-24 21:38:22,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:22,671 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:38:22,671 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:22,675 INFO ]: With dead ends: 62 [2018-06-24 21:38:22,675 INFO ]: Without dead ends: 62 [2018-06-24 21:38:22,676 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:22,676 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-24 21:38:22,690 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-06-24 21:38:22,690 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-24 21:38:22,691 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 112 transitions. [2018-06-24 21:38:22,691 INFO ]: Start accepts. Automaton has 50 states and 112 transitions. Word has length 6 [2018-06-24 21:38:22,691 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:22,691 INFO ]: Abstraction has 50 states and 112 transitions. [2018-06-24 21:38:22,692 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:22,692 INFO ]: Start isEmpty. Operand 50 states and 112 transitions. [2018-06-24 21:38:22,693 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:38:22,693 INFO ]: Found error trace [2018-06-24 21:38:22,693 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:38:22,693 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:22,693 INFO ]: Analyzing trace with hash 1252488684, now seen corresponding path program 1 times [2018-06-24 21:38:22,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:22,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:22,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:22,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:22,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:22,731 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:22,753 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:22,754 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:22,754 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:22,754 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:22,754 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:22,754 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:22,754 INFO ]: Start difference. First operand 50 states and 112 transitions. Second operand 3 states. [2018-06-24 21:38:22,899 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:22,899 INFO ]: Finished difference Result 73 states and 177 transitions. [2018-06-24 21:38:22,899 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:22,899 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:38:22,899 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:22,901 INFO ]: With dead ends: 73 [2018-06-24 21:38:22,901 INFO ]: Without dead ends: 73 [2018-06-24 21:38:22,902 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:22,902 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-24 21:38:22,911 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-06-24 21:38:22,911 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-24 21:38:22,913 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 116 transitions. [2018-06-24 21:38:22,913 INFO ]: Start accepts. Automaton has 51 states and 116 transitions. Word has length 6 [2018-06-24 21:38:22,913 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:22,913 INFO ]: Abstraction has 51 states and 116 transitions. [2018-06-24 21:38:22,913 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:22,913 INFO ]: Start isEmpty. Operand 51 states and 116 transitions. [2018-06-24 21:38:22,914 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:38:22,914 INFO ]: Found error trace [2018-06-24 21:38:22,914 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:38:22,914 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:22,914 INFO ]: Analyzing trace with hash 1252518475, now seen corresponding path program 1 times [2018-06-24 21:38:22,914 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:22,914 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:22,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:22,915 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:22,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:22,925 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:23,002 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:23,002 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:23,002 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:38:23,002 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:38:23,002 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:38:23,002 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:38:23,002 INFO ]: Start difference. First operand 51 states and 116 transitions. Second operand 4 states. [2018-06-24 21:38:23,250 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:23,250 INFO ]: Finished difference Result 75 states and 179 transitions. [2018-06-24 21:38:23,250 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:38:23,250 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:38:23,250 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:23,252 INFO ]: With dead ends: 75 [2018-06-24 21:38:23,252 INFO ]: Without dead ends: 73 [2018-06-24 21:38:23,252 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:38:23,252 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-24 21:38:23,261 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-06-24 21:38:23,261 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-24 21:38:23,262 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 114 transitions. [2018-06-24 21:38:23,262 INFO ]: Start accepts. Automaton has 51 states and 114 transitions. Word has length 6 [2018-06-24 21:38:23,262 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:23,262 INFO ]: Abstraction has 51 states and 114 transitions. [2018-06-24 21:38:23,262 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:38:23,262 INFO ]: Start isEmpty. Operand 51 states and 114 transitions. [2018-06-24 21:38:23,264 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:38:23,264 INFO ]: Found error trace [2018-06-24 21:38:23,264 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:38:23,264 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:23,264 INFO ]: Analyzing trace with hash 1247871079, now seen corresponding path program 1 times [2018-06-24 21:38:23,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:23,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:23,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:23,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:23,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:23,270 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:23,331 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:23,331 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:23,331 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:23,331 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:23,331 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:23,331 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:23,331 INFO ]: Start difference. First operand 51 states and 114 transitions. Second operand 3 states. [2018-06-24 21:38:23,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:23,641 INFO ]: Finished difference Result 74 states and 165 transitions. [2018-06-24 21:38:23,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:23,642 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:38:23,642 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:23,643 INFO ]: With dead ends: 74 [2018-06-24 21:38:23,643 INFO ]: Without dead ends: 74 [2018-06-24 21:38:23,643 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:23,644 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-24 21:38:23,652 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-24 21:38:23,652 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-24 21:38:23,653 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 165 transitions. [2018-06-24 21:38:23,653 INFO ]: Start accepts. Automaton has 74 states and 165 transitions. Word has length 6 [2018-06-24 21:38:23,653 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:23,653 INFO ]: Abstraction has 74 states and 165 transitions. [2018-06-24 21:38:23,653 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:23,653 INFO ]: Start isEmpty. Operand 74 states and 165 transitions. [2018-06-24 21:38:23,656 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:38:23,656 INFO ]: Found error trace [2018-06-24 21:38:23,656 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:38:23,656 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:23,656 INFO ]: Analyzing trace with hash -496856474, now seen corresponding path program 1 times [2018-06-24 21:38:23,656 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:23,656 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:23,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:23,657 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:23,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:23,665 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:23,700 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:38:23,700 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:23,700 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:23,700 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:23,700 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:23,700 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:23,701 INFO ]: Start difference. First operand 74 states and 165 transitions. Second operand 3 states. [2018-06-24 21:38:23,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:23,806 INFO ]: Finished difference Result 97 states and 209 transitions. [2018-06-24 21:38:23,807 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:23,807 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 21:38:23,807 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:23,808 INFO ]: With dead ends: 97 [2018-06-24 21:38:23,808 INFO ]: Without dead ends: 97 [2018-06-24 21:38:23,808 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:23,808 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-24 21:38:23,817 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-06-24 21:38:23,817 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-24 21:38:23,819 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 209 transitions. [2018-06-24 21:38:23,819 INFO ]: Start accepts. Automaton has 97 states and 209 transitions. Word has length 11 [2018-06-24 21:38:23,819 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:23,819 INFO ]: Abstraction has 97 states and 209 transitions. [2018-06-24 21:38:23,819 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:23,819 INFO ]: Start isEmpty. Operand 97 states and 209 transitions. [2018-06-24 21:38:23,822 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:38:23,822 INFO ]: Found error trace [2018-06-24 21:38:23,822 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:38:23,822 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:23,822 INFO ]: Analyzing trace with hash 1276118764, now seen corresponding path program 1 times [2018-06-24 21:38:23,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:23,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:23,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:23,823 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:23,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:23,832 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:23,893 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:38:23,893 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:23,893 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:23,893 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:23,893 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:23,893 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:23,893 INFO ]: Start difference. First operand 97 states and 209 transitions. Second operand 3 states. [2018-06-24 21:38:24,097 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:24,097 INFO ]: Finished difference Result 120 states and 257 transitions. [2018-06-24 21:38:24,097 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:24,097 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 21:38:24,098 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:24,099 INFO ]: With dead ends: 120 [2018-06-24 21:38:24,099 INFO ]: Without dead ends: 120 [2018-06-24 21:38:24,099 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:24,100 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-24 21:38:24,109 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-06-24 21:38:24,109 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-24 21:38:24,111 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 257 transitions. [2018-06-24 21:38:24,111 INFO ]: Start accepts. Automaton has 120 states and 257 transitions. Word has length 12 [2018-06-24 21:38:24,111 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:24,111 INFO ]: Abstraction has 120 states and 257 transitions. [2018-06-24 21:38:24,111 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:24,111 INFO ]: Start isEmpty. Operand 120 states and 257 transitions. [2018-06-24 21:38:24,115 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:38:24,115 INFO ]: Found error trace [2018-06-24 21:38:24,115 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:38:24,115 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:24,115 INFO ]: Analyzing trace with hash -616973078, now seen corresponding path program 1 times [2018-06-24 21:38:24,115 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:24,115 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:24,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:24,116 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:24,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:24,125 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:24,209 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:38:24,209 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:24,209 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:38:24,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:24,246 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:24,254 INFO ]: Computing forward predicates... [2018-06-24 21:38:24,293 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:38:24,325 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:24,326 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 21:38:24,326 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:38:24,326 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:38:24,326 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:38:24,326 INFO ]: Start difference. First operand 120 states and 257 transitions. Second operand 5 states. [2018-06-24 21:38:24,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:24,758 INFO ]: Finished difference Result 181 states and 507 transitions. [2018-06-24 21:38:24,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:38:24,758 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-24 21:38:24,759 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:24,762 INFO ]: With dead ends: 181 [2018-06-24 21:38:24,762 INFO ]: Without dead ends: 162 [2018-06-24 21:38:24,762 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:38:24,762 INFO ]: Start minimizeSevpa. Operand 162 states. [2018-06-24 21:38:24,794 INFO ]: Finished minimizeSevpa. Reduced states from 162 to 135. [2018-06-24 21:38:24,794 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-24 21:38:24,796 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 302 transitions. [2018-06-24 21:38:24,796 INFO ]: Start accepts. Automaton has 135 states and 302 transitions. Word has length 12 [2018-06-24 21:38:24,796 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:24,796 INFO ]: Abstraction has 135 states and 302 transitions. [2018-06-24 21:38:24,796 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:38:24,796 INFO ]: Start isEmpty. Operand 135 states and 302 transitions. [2018-06-24 21:38:24,801 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:38:24,801 INFO ]: Found error trace [2018-06-24 21:38:24,801 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:38:24,801 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:24,801 INFO ]: Analyzing trace with hash -301680236, now seen corresponding path program 1 times [2018-06-24 21:38:24,801 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:24,801 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:24,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:24,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:24,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:24,811 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:24,932 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:38:24,932 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:24,953 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:38:24,963 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:24,994 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:24,996 INFO ]: Computing forward predicates... [2018-06-24 21:38:25,019 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:38:25,049 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:25,050 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 21:38:25,050 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:38:25,050 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:38:25,050 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:38:25,050 INFO ]: Start difference. First operand 135 states and 302 transitions. Second operand 5 states. [2018-06-24 21:38:25,230 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:25,230 INFO ]: Finished difference Result 170 states and 425 transitions. [2018-06-24 21:38:25,233 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:38:25,233 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-24 21:38:25,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:25,235 INFO ]: With dead ends: 170 [2018-06-24 21:38:25,235 INFO ]: Without dead ends: 170 [2018-06-24 21:38:25,235 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:38:25,235 INFO ]: Start minimizeSevpa. Operand 170 states. [2018-06-24 21:38:25,254 INFO ]: Finished minimizeSevpa. Reduced states from 170 to 146. [2018-06-24 21:38:25,254 INFO ]: Start removeUnreachable. Operand 146 states. [2018-06-24 21:38:25,256 INFO ]: Finished removeUnreachable. Reduced from 146 states to 146 states and 330 transitions. [2018-06-24 21:38:25,257 INFO ]: Start accepts. Automaton has 146 states and 330 transitions. Word has length 12 [2018-06-24 21:38:25,257 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:25,257 INFO ]: Abstraction has 146 states and 330 transitions. [2018-06-24 21:38:25,257 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:38:25,257 INFO ]: Start isEmpty. Operand 146 states and 330 transitions. [2018-06-24 21:38:25,261 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:38:25,261 INFO ]: Found error trace [2018-06-24 21:38:25,261 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:38:25,261 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:25,262 INFO ]: Analyzing trace with hash 585823445, now seen corresponding path program 1 times [2018-06-24 21:38:25,262 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:25,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:25,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:25,262 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:25,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:25,270 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:25,329 INFO ]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:38:25,330 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:25,330 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:38:25,330 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:38:25,330 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:38:25,330 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:38:25,330 INFO ]: Start difference. First operand 146 states and 330 transitions. Second operand 5 states. [2018-06-24 21:38:25,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:25,510 INFO ]: Finished difference Result 171 states and 436 transitions. [2018-06-24 21:38:25,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:38:25,511 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-24 21:38:25,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:25,513 INFO ]: With dead ends: 171 [2018-06-24 21:38:25,513 INFO ]: Without dead ends: 168 [2018-06-24 21:38:25,513 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:38:25,513 INFO ]: Start minimizeSevpa. Operand 168 states. [2018-06-24 21:38:25,531 INFO ]: Finished minimizeSevpa. Reduced states from 168 to 146. [2018-06-24 21:38:25,531 INFO ]: Start removeUnreachable. Operand 146 states. [2018-06-24 21:38:25,533 INFO ]: Finished removeUnreachable. Reduced from 146 states to 146 states and 329 transitions. [2018-06-24 21:38:25,533 INFO ]: Start accepts. Automaton has 146 states and 329 transitions. Word has length 12 [2018-06-24 21:38:25,533 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:25,533 INFO ]: Abstraction has 146 states and 329 transitions. [2018-06-24 21:38:25,534 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:38:25,534 INFO ]: Start isEmpty. Operand 146 states and 329 transitions. [2018-06-24 21:38:25,538 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:38:25,538 INFO ]: Found error trace [2018-06-24 21:38:25,538 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:38:25,538 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:25,538 INFO ]: Analyzing trace with hash 1473327126, now seen corresponding path program 1 times [2018-06-24 21:38:25,538 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:25,538 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:25,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:25,539 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:25,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:25,546 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:25,605 INFO ]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:38:25,605 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:25,605 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:25,606 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:25,606 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:25,606 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:25,606 INFO ]: Start difference. First operand 146 states and 329 transitions. Second operand 3 states. [2018-06-24 21:38:25,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:25,636 INFO ]: Finished difference Result 164 states and 407 transitions. [2018-06-24 21:38:25,638 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:25,638 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 21:38:25,638 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:25,640 INFO ]: With dead ends: 164 [2018-06-24 21:38:25,640 INFO ]: Without dead ends: 164 [2018-06-24 21:38:25,640 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:25,641 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-24 21:38:25,655 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 152. [2018-06-24 21:38:25,655 INFO ]: Start removeUnreachable. Operand 152 states. [2018-06-24 21:38:25,657 INFO ]: Finished removeUnreachable. Reduced from 152 states to 152 states and 341 transitions. [2018-06-24 21:38:25,657 INFO ]: Start accepts. Automaton has 152 states and 341 transitions. Word has length 12 [2018-06-24 21:38:25,658 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:25,658 INFO ]: Abstraction has 152 states and 341 transitions. [2018-06-24 21:38:25,658 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:25,658 INFO ]: Start isEmpty. Operand 152 states and 341 transitions. [2018-06-24 21:38:25,662 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:38:25,662 INFO ]: Found error trace [2018-06-24 21:38:25,662 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:38:25,662 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:25,662 INFO ]: Analyzing trace with hash 84091500, now seen corresponding path program 1 times [2018-06-24 21:38:25,662 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:25,662 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:25,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:25,663 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:25,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:25,669 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:25,799 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:38:25,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:25,799 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:38:25,811 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:25,833 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:25,835 INFO ]: Computing forward predicates... [2018-06-24 21:38:25,840 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:38:25,876 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:25,876 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 21:38:25,876 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:38:25,876 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:38:25,876 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:38:25,876 INFO ]: Start difference. First operand 152 states and 341 transitions. Second operand 4 states. [2018-06-24 21:38:25,947 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:25,947 INFO ]: Finished difference Result 178 states and 498 transitions. [2018-06-24 21:38:25,948 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:38:25,949 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-24 21:38:25,949 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:25,950 INFO ]: With dead ends: 178 [2018-06-24 21:38:25,950 INFO ]: Without dead ends: 178 [2018-06-24 21:38:25,950 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:38:25,950 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-24 21:38:25,966 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 162. [2018-06-24 21:38:25,966 INFO ]: Start removeUnreachable. Operand 162 states. [2018-06-24 21:38:25,968 INFO ]: Finished removeUnreachable. Reduced from 162 states to 162 states and 371 transitions. [2018-06-24 21:38:25,968 INFO ]: Start accepts. Automaton has 162 states and 371 transitions. Word has length 12 [2018-06-24 21:38:25,968 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:25,968 INFO ]: Abstraction has 162 states and 371 transitions. [2018-06-24 21:38:25,968 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:38:25,968 INFO ]: Start isEmpty. Operand 162 states and 371 transitions. [2018-06-24 21:38:25,973 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:38:25,973 INFO ]: Found error trace [2018-06-24 21:38:25,973 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:38:25,973 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:25,973 INFO ]: Analyzing trace with hash 84093422, now seen corresponding path program 1 times [2018-06-24 21:38:25,973 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:25,973 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:25,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:25,974 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:25,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:25,980 INFO ]: Conjunction of SSA is sat [2018-06-24 21:38:25,982 INFO ]: Counterexample might be feasible [2018-06-24 21:38:25,995 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:38:25,996 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:38:25 BasicIcfg [2018-06-24 21:38:25,996 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:38:25,997 INFO ]: Toolchain (without parser) took 5616.00 ms. Allocated memory was 301.5 MB in the beginning and 341.8 MB in the end (delta: 40.4 MB). Free memory was 253.8 MB in the beginning and 251.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 42.7 MB. Max. memory is 3.6 GB. [2018-06-24 21:38:25,998 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 301.5 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:38:25,998 INFO ]: ChcToBoogie took 70.92 ms. Allocated memory is still 301.5 MB. Free memory was 253.8 MB in the beginning and 251.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:38:25,999 INFO ]: Boogie Preprocessor took 45.91 ms. Allocated memory is still 301.5 MB. Free memory was 251.9 MB in the beginning and 249.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:38:25,999 INFO ]: RCFGBuilder took 692.29 ms. Allocated memory is still 301.5 MB. Free memory was 249.9 MB in the beginning and 229.9 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:38:26,000 INFO ]: BlockEncodingV2 took 155.53 ms. Allocated memory is still 301.5 MB. Free memory was 229.9 MB in the beginning and 223.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:38:26,000 INFO ]: TraceAbstraction took 4636.07 ms. Allocated memory was 301.5 MB in the beginning and 341.8 MB in the end (delta: 40.4 MB). Free memory was 223.9 MB in the beginning and 251.5 MB in the end (delta: -27.6 MB). Peak memory consumption was 12.7 MB. Max. memory is 3.6 GB. [2018-06-24 21:38:26,004 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 33 locations, 69 edges - StatisticsResult: Encoded RCFG 25 locations, 57 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 301.5 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 70.92 ms. Allocated memory is still 301.5 MB. Free memory was 253.8 MB in the beginning and 251.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 45.91 ms. Allocated memory is still 301.5 MB. Free memory was 251.9 MB in the beginning and 249.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 692.29 ms. Allocated memory is still 301.5 MB. Free memory was 249.9 MB in the beginning and 229.9 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 155.53 ms. Allocated memory is still 301.5 MB. Free memory was 229.9 MB in the beginning and 223.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4636.07 ms. Allocated memory was 301.5 MB in the beginning and 341.8 MB in the end (delta: 40.4 MB). Free memory was 223.9 MB in the beginning and 251.5 MB in the end (delta: -27.6 MB). Peak memory consumption was 12.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0, 0); [L0] assume (((!(hbv_False_5_Int == hbv_False_4_Int) && hbv_False_2_Int == 2) && hbv_False_3_Int == hbv_False_4_Int) && !(hbv_False_1_Int == 0)) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int, hhv_INV_REC_f__1_2_Int := hbv_False_1_Int - 1, hbv_False_3_Int + 1, hbv_False_5_Int; [L0] havoc hbv_False_5_Int, hbv_False_1_Int, hbv_False_2_Int, hbv_False_4_Int, hbv_False_3_Int; [L0] assume !(hhv_INV_REC_f__1_0_Int == 0); [L0] CALL call gotoProc(3, hhv_INV_REC_f__1_0_Int - 1, hhv_INV_REC_f__1_1_Int + 1, hhv_INV_REC_f__1_2_Int, 0, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int, hhv_INV_REC_f__1_2_Int := gpav_0_Int, gpav_1_Int, gpav_2_Int; [L0] assume hhv_INV_REC_f__1_0_Int == 0 && hhv_INV_REC_f__1_2_Int == hhv_INV_REC_f__1_1_Int; [L0] hhv_INV_REC_f__1_PRE_0_Int, hhv_INV_REC_f__1_PRE_1_Int := hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f__1_0_Int - 1, hhv_INV_REC_f__1_1_Int + 1, hhv_INV_REC_f__1_2_Int, 0, 0, 0); [L0] hhv_INV_REC_f__1_PRE_0_Int, hhv_INV_REC_f__1_PRE_1_Int := hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. UNSAFE Result, 4.5s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1022 SDtfs, 354 SDslu, 1168 SDs, 0 SdLazy, 487 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 177 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 2609 SizeOfPredicates, 8 NumberOfNonLiveVariables, 308 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 30/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__add-horn!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-38-26-015.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__add-horn!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-38-26-015.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__add-horn!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-38-26-015.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__add-horn!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-38-26-015.csv Received shutdown request...