java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/013-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:04:44,436 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:04:44,438 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:04:44,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:04:44,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:04:44,452 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:04:44,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:04:44,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:04:44,457 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:04:44,458 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:04:44,459 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:04:44,459 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:04:44,460 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:04:44,461 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:04:44,462 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:04:44,463 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:04:44,465 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:04:44,467 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:04:44,468 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:04:44,469 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:04:44,470 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:04:44,473 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:04:44,473 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:04:44,473 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:04:44,474 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:04:44,475 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:04:44,476 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:04:44,476 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:04:44,477 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:04:44,478 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:04:44,478 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:04:44,479 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:04:44,479 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:04:44,480 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:04:44,481 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:04:44,481 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:04:44,501 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:04:44,501 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:04:44,501 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:04:44,502 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:04:44,502 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:04:44,503 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:04:44,503 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:04:44,503 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:04:44,503 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:04:44,503 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:04:44,504 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:04:44,504 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:04:44,504 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:04:44,504 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:04:44,504 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:04:44,505 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:04:44,505 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:04:44,505 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:04:44,505 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:04:44,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:04:44,505 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:04:44,508 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:04:44,509 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:04:44,549 INFO ]: Repository-Root is: /tmp [2018-06-24 21:04:44,570 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:04:44,578 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:04:44,579 INFO ]: Initializing SmtParser... [2018-06-24 21:04:44,580 INFO ]: SmtParser initialized [2018-06-24 21:04:44,580 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/013-horn.smt2 [2018-06-24 21:04:44,581 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:04:44,676 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/013-horn.smt2 unknown [2018-06-24 21:04:44,907 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/013-horn.smt2 [2018-06-24 21:04:44,912 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:04:44,916 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:04:44,917 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:04:44,917 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:04:44,917 INFO ]: ChcToBoogie initialized [2018-06-24 21:04:44,919 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:04:44" (1/1) ... [2018-06-24 21:04:44,976 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:44 Unit [2018-06-24 21:04:44,976 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:04:44,977 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:04:44,977 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:04:44,977 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:04:44,999 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:44" (1/1) ... [2018-06-24 21:04:44,999 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:44" (1/1) ... [2018-06-24 21:04:45,005 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:44" (1/1) ... [2018-06-24 21:04:45,005 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:44" (1/1) ... [2018-06-24 21:04:45,010 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:44" (1/1) ... [2018-06-24 21:04:45,020 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:44" (1/1) ... [2018-06-24 21:04:45,021 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:44" (1/1) ... [2018-06-24 21:04:45,023 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:04:45,024 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:04:45,024 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:04:45,024 INFO ]: RCFGBuilder initialized [2018-06-24 21:04:45,030 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:44" (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:04:45,047 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:04:45,047 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:04:45,047 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:04:45,047 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:04:45,047 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:04:45,047 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:04:45,390 INFO ]: Using library mode [2018-06-24 21:04:45,391 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:04:45 BoogieIcfgContainer [2018-06-24 21:04:45,391 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:04:45,391 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:04:45,391 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:04:45,392 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:04:45,393 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:04:45" (1/1) ... [2018-06-24 21:04:45,409 INFO ]: Initial Icfg 12 locations, 24 edges [2018-06-24 21:04:45,410 INFO ]: Using Remove infeasible edges [2018-06-24 21:04:45,410 INFO ]: Using Maximize final states [2018-06-24 21:04:45,411 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:04:45,411 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:04:45,413 INFO ]: Using Remove sink states [2018-06-24 21:04:45,413 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:04:45,413 INFO ]: Using Use SBE [2018-06-24 21:04:45,418 INFO ]: SBE split 0 edges [2018-06-24 21:04:45,424 INFO ]: Removed 6 edges and 2 locations because of local infeasibility [2018-06-24 21:04:45,425 INFO ]: 0 new accepting states [2018-06-24 21:04:45,489 INFO ]: Removed 9 edges and 2 locations by large block encoding [2018-06-24 21:04:45,491 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:04:45,492 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:04:45,492 INFO ]: 0 new accepting states [2018-06-24 21:04:45,492 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:04:45,492 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:04:45,493 INFO ]: Encoded RCFG 8 locations, 16 edges [2018-06-24 21:04:45,493 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:04:45 BasicIcfg [2018-06-24 21:04:45,493 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:04:45,495 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:04:45,496 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:04:45,498 INFO ]: TraceAbstraction initialized [2018-06-24 21:04:45,498 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:04:44" (1/4) ... [2018-06-24 21:04:45,499 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b91480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:04:45, skipping insertion in model container [2018-06-24 21:04:45,499 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:04:44" (2/4) ... [2018-06-24 21:04:45,500 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b91480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:04:45, skipping insertion in model container [2018-06-24 21:04:45,500 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:04:45" (3/4) ... [2018-06-24 21:04:45,500 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b91480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:04:45, skipping insertion in model container [2018-06-24 21:04:45,500 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:04:45" (4/4) ... [2018-06-24 21:04:45,502 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:04:45,512 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:04:45,522 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:04:45,564 INFO ]: Using default assertion order modulation [2018-06-24 21:04:45,565 INFO ]: Interprodecural is true [2018-06-24 21:04:45,565 INFO ]: Hoare is false [2018-06-24 21:04:45,565 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:04:45,565 INFO ]: Backedges is TWOTRACK [2018-06-24 21:04:45,565 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:04:45,565 INFO ]: Difference is false [2018-06-24 21:04:45,565 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:04:45,565 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:04:45,573 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 21:04:45,581 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:04:45,581 INFO ]: Found error trace [2018-06-24 21:04:45,582 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:04:45,582 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:45,587 INFO ]: Analyzing trace with hash 44148105, now seen corresponding path program 1 times [2018-06-24 21:04:45,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:45,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:45,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:45,618 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:45,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:45,657 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:45,719 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:04:45,721 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:45,721 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:04:45,722 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:04:45,734 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:04:45,734 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:04:45,737 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-24 21:04:45,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:45,783 INFO ]: Finished difference Result 9 states and 14 transitions. [2018-06-24 21:04:45,785 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:45,786 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:04:45,786 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:45,793 INFO ]: With dead ends: 9 [2018-06-24 21:04:45,793 INFO ]: Without dead ends: 9 [2018-06-24 21:04:45,795 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:04:45,808 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:04:45,826 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-24 21:04:45,827 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:04:45,828 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-24 21:04:45,829 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-06-24 21:04:45,829 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:45,830 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-24 21:04:45,830 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:04:45,832 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-24 21:04:45,832 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:04:45,832 INFO ]: Found error trace [2018-06-24 21:04:45,832 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:04:45,832 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:45,833 INFO ]: Analyzing trace with hash 44150027, now seen corresponding path program 1 times [2018-06-24 21:04:45,833 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:45,833 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:45,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:45,833 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:45,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:45,846 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:45,995 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:04:45,995 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:45,995 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:04:45,996 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:04:45,996 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:04:45,996 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:04:45,997 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 3 states. [2018-06-24 21:04:46,119 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:46,119 INFO ]: Finished difference Result 10 states and 17 transitions. [2018-06-24 21:04:46,120 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:46,120 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:04:46,120 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:46,121 INFO ]: With dead ends: 10 [2018-06-24 21:04:46,121 INFO ]: Without dead ends: 10 [2018-06-24 21:04:46,122 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:04:46,122 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:04:46,127 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-24 21:04:46,127 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:04:46,127 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-24 21:04:46,127 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 5 [2018-06-24 21:04:46,127 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:46,127 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-24 21:04:46,127 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:04:46,128 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-24 21:04:46,128 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:04:46,128 INFO ]: Found error trace [2018-06-24 21:04:46,128 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:04:46,128 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:46,128 INFO ]: Analyzing trace with hash 44178857, now seen corresponding path program 1 times [2018-06-24 21:04:46,128 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:46,128 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:46,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:46,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:46,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:46,137 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:46,215 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:04:46,215 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:46,215 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:04:46,215 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:04:46,215 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:04:46,215 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:04:46,216 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 3 states. [2018-06-24 21:04:46,285 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:46,285 INFO ]: Finished difference Result 9 states and 15 transitions. [2018-06-24 21:04:46,286 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:46,286 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:04:46,286 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:46,287 INFO ]: With dead ends: 9 [2018-06-24 21:04:46,287 INFO ]: Without dead ends: 9 [2018-06-24 21:04:46,287 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:04:46,287 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:04:46,288 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 21:04:46,288 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:04:46,289 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-06-24 21:04:46,289 INFO ]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 5 [2018-06-24 21:04:46,289 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:46,289 INFO ]: Abstraction has 9 states and 15 transitions. [2018-06-24 21:04:46,289 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:04:46,289 INFO ]: Start isEmpty. Operand 9 states and 15 transitions. [2018-06-24 21:04:46,289 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:04:46,289 INFO ]: Found error trace [2018-06-24 21:04:46,289 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:04:46,289 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:46,290 INFO ]: Analyzing trace with hash 1367882360, now seen corresponding path program 1 times [2018-06-24 21:04:46,290 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:46,290 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:46,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:46,290 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:46,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:46,312 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:46,369 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:04:46,369 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:46,369 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:04:46,369 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:04:46,369 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:04:46,369 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:04:46,370 INFO ]: Start difference. First operand 9 states and 15 transitions. Second operand 4 states. [2018-06-24 21:04:46,515 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-24 21:04:46,550 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:46,550 INFO ]: Finished difference Result 12 states and 19 transitions. [2018-06-24 21:04:46,550 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:04:46,550 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:04:46,550 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:46,551 INFO ]: With dead ends: 12 [2018-06-24 21:04:46,551 INFO ]: Without dead ends: 12 [2018-06-24 21:04:46,551 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:04:46,551 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:04:46,553 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-24 21:04:46,553 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:04:46,553 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-06-24 21:04:46,553 INFO ]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 6 [2018-06-24 21:04:46,553 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:46,553 INFO ]: Abstraction has 9 states and 15 transitions. [2018-06-24 21:04:46,553 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:04:46,553 INFO ]: Start isEmpty. Operand 9 states and 15 transitions. [2018-06-24 21:04:46,554 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:04:46,554 INFO ]: Found error trace [2018-06-24 21:04:46,554 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:04:46,554 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:46,554 INFO ]: Analyzing trace with hash 1367913112, now seen corresponding path program 1 times [2018-06-24 21:04:46,554 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:46,554 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:46,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:46,555 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:46,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:46,565 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:46,776 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:46,777 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:46,777 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:04:46,784 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:46,820 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:46,829 INFO ]: Computing forward predicates... [2018-06-24 21:04:46,872 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:04:46,894 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:04:46,894 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-24 21:04:46,894 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:04:46,894 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:04:46,894 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:04:46,894 INFO ]: Start difference. First operand 9 states and 15 transitions. Second operand 5 states. [2018-06-24 21:04:46,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:46,958 INFO ]: Finished difference Result 12 states and 16 transitions. [2018-06-24 21:04:46,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:46,959 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 21:04:46,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:46,960 INFO ]: With dead ends: 12 [2018-06-24 21:04:46,960 INFO ]: Without dead ends: 12 [2018-06-24 21:04:46,960 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:04:46,960 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:04:46,961 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-24 21:04:46,961 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:04:46,962 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-06-24 21:04:46,962 INFO ]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 6 [2018-06-24 21:04:46,962 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:46,962 INFO ]: Abstraction has 9 states and 12 transitions. [2018-06-24 21:04:46,962 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:04:46,962 INFO ]: Start isEmpty. Operand 9 states and 12 transitions. [2018-06-24 21:04:46,962 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:04:46,962 INFO ]: Found error trace [2018-06-24 21:04:46,962 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:04:46,962 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:46,963 INFO ]: Analyzing trace with hash 1369014418, now seen corresponding path program 1 times [2018-06-24 21:04:46,963 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:46,963 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:46,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:46,965 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:46,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:46,973 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:47,042 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:47,042 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:47,043 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:04:47,043 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:04:47,043 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:04:47,043 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:04:47,043 INFO ]: Start difference. First operand 9 states and 12 transitions. Second operand 3 states. [2018-06-24 21:04:47,084 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:47,084 INFO ]: Finished difference Result 10 states and 12 transitions. [2018-06-24 21:04:47,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:04:47,085 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:04:47,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:47,085 INFO ]: With dead ends: 10 [2018-06-24 21:04:47,085 INFO ]: Without dead ends: 9 [2018-06-24 21:04:47,086 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:04:47,086 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:04:47,087 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 21:04:47,087 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:04:47,087 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-24 21:04:47,087 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2018-06-24 21:04:47,087 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:47,087 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-24 21:04:47,087 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:04:47,087 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-24 21:04:47,087 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:04:47,087 INFO ]: Found error trace [2018-06-24 21:04:47,088 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:47,088 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:47,088 INFO ]: Analyzing trace with hash -545849949, now seen corresponding path program 1 times [2018-06-24 21:04:47,088 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:47,088 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:47,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:47,089 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:47,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:47,103 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:47,130 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:47,130 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:04:47,130 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:04:47,130 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:04:47,130 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:04:47,130 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:04:47,130 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2018-06-24 21:04:47,156 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:47,156 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-24 21:04:47,157 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:04:47,157 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 21:04:47,157 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:47,157 INFO ]: With dead ends: 9 [2018-06-24 21:04:47,157 INFO ]: Without dead ends: 8 [2018-06-24 21:04:47,157 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:04:47,158 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 21:04:47,158 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 21:04:47,158 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:04:47,159 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-06-24 21:04:47,159 INFO ]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2018-06-24 21:04:47,159 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:47,159 INFO ]: Abstraction has 8 states and 8 transitions. [2018-06-24 21:04:47,159 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:04:47,159 INFO ]: Start isEmpty. Operand 8 states and 8 transitions. [2018-06-24 21:04:47,159 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:04:47,159 INFO ]: Found error trace [2018-06-24 21:04:47,159 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:04:47,159 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:04:47,160 INFO ]: Analyzing trace with hash -545134965, now seen corresponding path program 1 times [2018-06-24 21:04:47,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:04:47,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:04:47,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:47,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:47,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:04:47,172 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:47,437 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:47,437 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:04:47,437 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:04:47,446 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:04:47,473 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:04:47,475 INFO ]: Computing forward predicates... [2018-06-24 21:04:47,750 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:04:47,782 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:04:47,782 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:04:47,783 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:04:47,783 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:04:47,783 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:04:47,783 INFO ]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-06-24 21:04:47,954 WARN ]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-24 21:04:47,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:04:47,955 INFO ]: Finished difference Result 5 states and 5 transitions. [2018-06-24 21:04:47,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:04:47,955 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 21:04:47,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:04:47,955 INFO ]: With dead ends: 5 [2018-06-24 21:04:47,955 INFO ]: Without dead ends: 0 [2018-06-24 21:04:47,955 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:04:47,955 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:04:47,955 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:04:47,955 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:04:47,956 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:04:47,956 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-24 21:04:47,956 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:04:47,956 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:04:47,956 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:04:47,956 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:04:47,956 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:04:47,963 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:04:47,965 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:04:47 BasicIcfg [2018-06-24 21:04:47,965 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:04:47,966 INFO ]: Toolchain (without parser) took 3053.19 ms. Allocated memory was 303.0 MB in the beginning and 323.5 MB in the end (delta: 20.4 MB). Free memory was 257.4 MB in the beginning and 275.2 MB in the end (delta: -17.8 MB). Peak memory consumption was 2.6 MB. Max. memory is 3.6 GB. [2018-06-24 21:04:47,967 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 303.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:04:47,967 INFO ]: ChcToBoogie took 59.51 ms. Allocated memory is still 303.0 MB. Free memory was 257.4 MB in the beginning and 255.4 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:04:47,967 INFO ]: Boogie Preprocessor took 46.69 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 253.4 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:04:47,968 INFO ]: RCFGBuilder took 367.25 ms. Allocated memory is still 303.0 MB. Free memory was 253.4 MB in the beginning and 243.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:04:47,968 INFO ]: BlockEncodingV2 took 101.80 ms. Allocated memory is still 303.0 MB. Free memory was 243.3 MB in the beginning and 239.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:04:47,970 INFO ]: TraceAbstraction took 2469.28 ms. Allocated memory was 303.0 MB in the beginning and 323.5 MB in the end (delta: 20.4 MB). Free memory was 239.3 MB in the beginning and 275.2 MB in the end (delta: -35.9 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:04:47,978 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 24 edges - StatisticsResult: Encoded RCFG 8 locations, 16 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 303.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.51 ms. Allocated memory is still 303.0 MB. Free memory was 257.4 MB in the beginning and 255.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.69 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 367.25 ms. Allocated memory is still 303.0 MB. Free memory was 253.4 MB in the beginning and 243.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 101.80 ms. Allocated memory is still 303.0 MB. Free memory was 243.3 MB in the beginning and 239.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2469.28 ms. Allocated memory was 303.0 MB in the beginning and 323.5 MB in the end (delta: 20.4 MB). Free memory was 239.3 MB in the beginning and 275.2 MB in the end (delta: -35.9 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 26 SDslu, 65 SDs, 0 SdLazy, 45 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 50 ConstructedInterpolants, 1 QuantifiedInterpolants, 1337 SizeOfPredicates, 10 NumberOfNonLiveVariables, 132 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/013-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-04-48-004.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/013-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-04-48-004.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/013-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-04-48-004.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/013-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-04-48-004.csv Received shutdown request...