java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.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/018-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:13:16,841 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:13:16,842 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:13:16,856 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:13:16,856 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:13:16,857 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:13:16,861 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:13:16,863 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:13:16,864 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:13:16,865 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:13:16,867 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:13:16,867 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:13:16,868 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:13:16,869 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:13:16,869 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:13:16,870 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:13:16,872 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:13:16,874 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:13:16,875 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:13:16,876 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:13:16,877 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:13:16,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:13:16,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:13:16,880 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:13:16,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:13:16,881 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:13:16,882 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:13:16,882 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:13:16,884 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:13:16,884 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:13:16,884 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:13:16,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:13:16,885 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:13:16,886 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:13:16,886 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:13:16,887 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:13:16,908 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:13:16,909 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:13:16,909 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:13:16,909 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:13:16,910 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:13:16,910 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:13:16,910 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:13:16,911 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:13:16,911 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:13:16,911 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:13:16,911 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:13:16,911 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:13:16,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:13:16,912 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:13:16,912 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:13:16,912 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:13:16,912 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:13:16,913 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:13:16,913 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:13:16,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:13:16,913 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:13:16,915 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:13:16,916 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:13:16,960 INFO ]: Repository-Root is: /tmp [2018-06-25 09:13:16,973 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:13:16,976 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:13:16,978 INFO ]: Initializing SmtParser... [2018-06-25 09:13:16,978 INFO ]: SmtParser initialized [2018-06-25 09:13:16,979 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/018-horn.smt2 [2018-06-25 09:13:16,980 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-25 09:13:17,065 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/018-horn.smt2 unknown [2018-06-25 09:13:17,353 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/018-horn.smt2 [2018-06-25 09:13:17,357 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:13:17,362 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:13:17,363 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:13:17,363 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:13:17,363 INFO ]: ChcToBoogie initialized [2018-06-25 09:13:17,367 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:13:17" (1/1) ... [2018-06-25 09:13:17,431 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:17 Unit [2018-06-25 09:13:17,432 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:13:17,432 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:13:17,432 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:13:17,432 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:13:17,452 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:17" (1/1) ... [2018-06-25 09:13:17,452 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:17" (1/1) ... [2018-06-25 09:13:17,459 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:17" (1/1) ... [2018-06-25 09:13:17,460 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:17" (1/1) ... [2018-06-25 09:13:17,476 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:17" (1/1) ... [2018-06-25 09:13:17,478 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:17" (1/1) ... [2018-06-25 09:13:17,488 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:17" (1/1) ... [2018-06-25 09:13:17,490 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:13:17,491 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:13:17,491 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:13:17,491 INFO ]: RCFGBuilder initialized [2018-06-25 09:13:17,492 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:17" (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-25 09:13:17,509 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:13:17,509 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:13:17,509 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:13:17,509 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:13:17,509 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:13:17,510 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-25 09:13:17,945 INFO ]: Using library mode [2018-06-25 09:13:17,946 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:13:17 BoogieIcfgContainer [2018-06-25 09:13:17,946 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:13:17,949 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:13:17,949 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:13:17,952 INFO ]: TraceAbstraction initialized [2018-06-25 09:13:17,952 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:13:17" (1/3) ... [2018-06-25 09:13:17,953 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e55cf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:13:17, skipping insertion in model container [2018-06-25 09:13:17,953 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:17" (2/3) ... [2018-06-25 09:13:17,954 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e55cf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:13:17, skipping insertion in model container [2018-06-25 09:13:17,954 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:13:17" (3/3) ... [2018-06-25 09:13:17,956 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:13:17,964 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:13:17,970 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:13:18,005 INFO ]: Using default assertion order modulation [2018-06-25 09:13:18,005 INFO ]: Interprodecural is true [2018-06-25 09:13:18,005 INFO ]: Hoare is false [2018-06-25 09:13:18,005 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:13:18,005 INFO ]: Backedges is TWOTRACK [2018-06-25 09:13:18,006 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:13:18,006 INFO ]: Difference is false [2018-06-25 09:13:18,006 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:13:18,006 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:13:18,018 INFO ]: Start isEmpty. Operand 13 states. [2018-06-25 09:13:18,029 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:13:18,032 INFO ]: Found error trace [2018-06-25 09:13:18,033 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:18,033 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:18,037 INFO ]: Analyzing trace with hash 2110665552, now seen corresponding path program 1 times [2018-06-25 09:13:18,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:18,039 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:18,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:18,072 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:18,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:18,096 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:18,126 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:18,129 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:18,129 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-25 09:13:18,130 INFO ]: Interpolant automaton has 2 states [2018-06-25 09:13:18,143 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-25 09:13:18,143 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:13:18,145 INFO ]: Start difference. First operand 13 states. Second operand 2 states. [2018-06-25 09:13:18,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:18,162 INFO ]: Finished difference Result 9 states and 15 transitions. [2018-06-25 09:13:18,162 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-25 09:13:18,163 INFO ]: Start accepts. Automaton has 2 states. Word has length 7 [2018-06-25 09:13:18,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:18,169 INFO ]: With dead ends: 9 [2018-06-25 09:13:18,169 INFO ]: Without dead ends: 9 [2018-06-25 09:13:18,170 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:13:18,185 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:13:18,197 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:13:18,198 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:13:18,198 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-06-25 09:13:18,200 INFO ]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 7 [2018-06-25 09:13:18,200 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:18,200 INFO ]: Abstraction has 9 states and 15 transitions. [2018-06-25 09:13:18,200 INFO ]: Interpolant automaton has 2 states. [2018-06-25 09:13:18,200 INFO ]: Start isEmpty. Operand 9 states and 15 transitions. [2018-06-25 09:13:18,200 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:13:18,200 INFO ]: Found error trace [2018-06-25 09:13:18,200 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:18,200 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:18,201 INFO ]: Analyzing trace with hash 2114449009, now seen corresponding path program 1 times [2018-06-25 09:13:18,201 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:18,201 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:18,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:18,203 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:18,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:18,220 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:18,297 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:18,297 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:18,297 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:13:18,299 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:13:18,299 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:13:18,299 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:18,299 INFO ]: Start difference. First operand 9 states and 15 transitions. Second operand 3 states. [2018-06-25 09:13:18,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:18,352 INFO ]: Finished difference Result 10 states and 18 transitions. [2018-06-25 09:13:18,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:13:18,353 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:13:18,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:18,353 INFO ]: With dead ends: 10 [2018-06-25 09:13:18,353 INFO ]: Without dead ends: 10 [2018-06-25 09:13:18,354 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-25 09:13:18,354 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:13:18,356 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:13:18,356 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:13:18,357 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-06-25 09:13:18,357 INFO ]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 7 [2018-06-25 09:13:18,357 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:18,357 INFO ]: Abstraction has 10 states and 18 transitions. [2018-06-25 09:13:18,357 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:13:18,357 INFO ]: Start isEmpty. Operand 10 states and 18 transitions. [2018-06-25 09:13:18,357 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:13:18,357 INFO ]: Found error trace [2018-06-25 09:13:18,357 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:18,358 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:18,358 INFO ]: Analyzing trace with hash 2118649540, now seen corresponding path program 1 times [2018-06-25 09:13:18,358 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:18,358 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:18,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:18,359 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:18,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:18,370 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:18,392 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:18,392 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:18,392 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:13:18,392 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:13:18,392 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:13:18,392 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:18,392 INFO ]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2018-06-25 09:13:18,464 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:18,464 INFO ]: Finished difference Result 11 states and 21 transitions. [2018-06-25 09:13:18,466 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:13:18,466 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:13:18,466 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:18,466 INFO ]: With dead ends: 11 [2018-06-25 09:13:18,466 INFO ]: Without dead ends: 11 [2018-06-25 09:13:18,467 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-25 09:13:18,467 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:13:18,468 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:13:18,468 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:13:18,469 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2018-06-25 09:13:18,469 INFO ]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 7 [2018-06-25 09:13:18,469 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:18,469 INFO ]: Abstraction has 11 states and 21 transitions. [2018-06-25 09:13:18,469 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:13:18,469 INFO ]: Start isEmpty. Operand 11 states and 21 transitions. [2018-06-25 09:13:18,469 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:13:18,470 INFO ]: Found error trace [2018-06-25 09:13:18,470 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:18,470 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:18,470 INFO ]: Analyzing trace with hash 1125072563, now seen corresponding path program 1 times [2018-06-25 09:13:18,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:18,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:18,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:18,471 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:18,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:18,515 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:18,833 WARN ]: Spent 220.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-06-25 09:13:18,878 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:18,878 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:13:18,878 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-25 09:13:18,885 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:18,922 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:18,930 INFO ]: Computing forward predicates... [2018-06-25 09:13:19,059 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:19,091 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:13:19,092 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 09:13:19,092 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:13:19,092 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:13:19,092 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:13:19,092 INFO ]: Start difference. First operand 11 states and 21 transitions. Second operand 6 states. [2018-06-25 09:13:19,398 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:19,398 INFO ]: Finished difference Result 17 states and 36 transitions. [2018-06-25 09:13:19,399 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:13:19,399 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-25 09:13:19,399 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:19,401 INFO ]: With dead ends: 17 [2018-06-25 09:13:19,401 INFO ]: Without dead ends: 17 [2018-06-25 09:13:19,401 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:13:19,401 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:13:19,404 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-25 09:13:19,404 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:13:19,404 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2018-06-25 09:13:19,405 INFO ]: Start accepts. Automaton has 14 states and 31 transitions. Word has length 8 [2018-06-25 09:13:19,405 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:19,405 INFO ]: Abstraction has 14 states and 31 transitions. [2018-06-25 09:13:19,405 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:13:19,405 INFO ]: Start isEmpty. Operand 14 states and 31 transitions. [2018-06-25 09:13:19,405 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:13:19,405 INFO ]: Found error trace [2018-06-25 09:13:19,405 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:19,405 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:19,405 INFO ]: Analyzing trace with hash 1130613689, now seen corresponding path program 1 times [2018-06-25 09:13:19,405 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:19,405 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:19,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:19,406 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:19,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:19,429 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:19,462 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:19,462 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:13:19,462 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-25 09:13:19,487 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:19,511 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:19,512 INFO ]: Computing forward predicates... [2018-06-25 09:13:19,619 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:19,642 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:13:19,642 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 09:13:19,642 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:13:19,642 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:13:19,643 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:13:19,643 INFO ]: Start difference. First operand 14 states and 31 transitions. Second operand 5 states. [2018-06-25 09:13:19,743 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:19,743 INFO ]: Finished difference Result 18 states and 38 transitions. [2018-06-25 09:13:19,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:13:19,743 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:13:19,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:19,744 INFO ]: With dead ends: 18 [2018-06-25 09:13:19,744 INFO ]: Without dead ends: 18 [2018-06-25 09:13:19,744 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:13:19,744 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:13:19,747 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 09:13:19,747 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:13:19,747 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions. [2018-06-25 09:13:19,748 INFO ]: Start accepts. Automaton has 18 states and 38 transitions. Word has length 8 [2018-06-25 09:13:19,748 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:19,748 INFO ]: Abstraction has 18 states and 38 transitions. [2018-06-25 09:13:19,748 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:13:19,748 INFO ]: Start isEmpty. Operand 18 states and 38 transitions. [2018-06-25 09:13:19,748 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:13:19,748 INFO ]: Found error trace [2018-06-25 09:13:19,748 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:19,748 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:19,748 INFO ]: Analyzing trace with hash 1255795471, now seen corresponding path program 1 times [2018-06-25 09:13:19,748 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:19,748 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:19,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:19,749 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:19,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:19,762 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:19,798 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:19,798 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:19,798 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:13:19,799 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:13:19,799 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:13:19,799 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:19,799 INFO ]: Start difference. First operand 18 states and 38 transitions. Second operand 3 states. [2018-06-25 09:13:19,883 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:19,884 INFO ]: Finished difference Result 20 states and 42 transitions. [2018-06-25 09:13:19,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:13:19,884 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:13:19,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:19,884 INFO ]: With dead ends: 20 [2018-06-25 09:13:19,884 INFO ]: Without dead ends: 18 [2018-06-25 09:13:19,885 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-25 09:13:19,885 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:13:19,887 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 09:13:19,887 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:13:19,887 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. [2018-06-25 09:13:19,887 INFO ]: Start accepts. Automaton has 18 states and 34 transitions. Word has length 8 [2018-06-25 09:13:19,888 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:19,888 INFO ]: Abstraction has 18 states and 34 transitions. [2018-06-25 09:13:19,888 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:13:19,888 INFO ]: Start isEmpty. Operand 18 states and 34 transitions. [2018-06-25 09:13:19,888 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:13:19,888 INFO ]: Found error trace [2018-06-25 09:13:19,888 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:19,888 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:19,888 INFO ]: Analyzing trace with hash 1257642513, now seen corresponding path program 1 times [2018-06-25 09:13:19,888 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:19,888 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:19,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:19,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:19,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:19,910 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:20,028 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:20,028 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:13:20,028 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) [2018-06-25 09:13:20,047 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:13:20,074 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:20,076 INFO ]: Computing forward predicates... [2018-06-25 09:13:20,122 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:20,143 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:13:20,143 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 09:13:20,143 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:13:20,144 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:13:20,144 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:13:20,144 INFO ]: Start difference. First operand 18 states and 34 transitions. Second operand 5 states. [2018-06-25 09:13:20,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:20,161 INFO ]: Finished difference Result 21 states and 37 transitions. [2018-06-25 09:13:20,162 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:13:20,162 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:13:20,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:20,163 INFO ]: With dead ends: 21 [2018-06-25 09:13:20,163 INFO ]: Without dead ends: 21 [2018-06-25 09:13:20,163 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:13:20,163 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:13:20,165 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-25 09:13:20,165 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:13:20,165 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-06-25 09:13:20,166 INFO ]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 8 [2018-06-25 09:13:20,166 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:20,166 INFO ]: Abstraction has 19 states and 35 transitions. [2018-06-25 09:13:20,166 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:13:20,166 INFO ]: Start isEmpty. Operand 19 states and 35 transitions. [2018-06-25 09:13:20,166 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:13:20,166 INFO ]: Found error trace [2018-06-25 09:13:20,166 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:20,166 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:20,166 INFO ]: Analyzing trace with hash 519173809, now seen corresponding path program 2 times [2018-06-25 09:13:20,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:20,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:20,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:20,168 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:20,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:20,180 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:20,224 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:20,224 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:20,224 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:13:20,224 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:13:20,224 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:13:20,225 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:13:20,225 INFO ]: Start difference. First operand 19 states and 35 transitions. Second operand 4 states. [2018-06-25 09:13:20,274 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:20,274 INFO ]: Finished difference Result 21 states and 35 transitions. [2018-06-25 09:13:20,275 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:13:20,275 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:13:20,275 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:20,275 INFO ]: With dead ends: 21 [2018-06-25 09:13:20,275 INFO ]: Without dead ends: 19 [2018-06-25 09:13:20,275 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:13:20,276 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:13:20,277 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-25 09:13:20,277 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:13:20,278 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-25 09:13:20,278 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2018-06-25 09:13:20,278 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:20,278 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-25 09:13:20,278 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:13:20,278 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-25 09:13:20,278 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:13:20,278 INFO ]: Found error trace [2018-06-25 09:13:20,278 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:20,278 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:20,278 INFO ]: Analyzing trace with hash 336228452, now seen corresponding path program 2 times [2018-06-25 09:13:20,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:20,279 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:20,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:20,279 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:13:20,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:20,291 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:20,326 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:20,326 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:20,326 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:13:20,326 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:13:20,327 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:13:20,327 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:13:20,327 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 4 states. [2018-06-25 09:13:20,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:20,333 INFO ]: Finished difference Result 15 states and 21 transitions. [2018-06-25 09:13:20,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:13:20,333 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:13:20,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:20,334 INFO ]: With dead ends: 15 [2018-06-25 09:13:20,334 INFO ]: Without dead ends: 12 [2018-06-25 09:13:20,334 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:13:20,334 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:13:20,335 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:13:20,335 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:13:20,336 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-25 09:13:20,336 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 9 [2018-06-25 09:13:20,336 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:20,336 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-25 09:13:20,336 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:13:20,336 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-25 09:13:20,336 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:13:20,336 INFO ]: Found error trace [2018-06-25 09:13:20,336 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:20,336 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:20,336 INFO ]: Analyzing trace with hash 346167725, now seen corresponding path program 1 times [2018-06-25 09:13:20,336 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:20,336 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:20,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:20,337 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:13:20,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:20,361 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:20,519 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:20,519 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:20,519 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:13:20,519 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:13:20,519 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:13:20,520 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:13:20,520 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 5 states. [2018-06-25 09:13:20,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:20,533 INFO ]: Finished difference Result 13 states and 23 transitions. [2018-06-25 09:13:20,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:13:20,533 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-25 09:13:20,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:20,533 INFO ]: With dead ends: 13 [2018-06-25 09:13:20,533 INFO ]: Without dead ends: 0 [2018-06-25 09:13:20,533 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:13:20,533 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 09:13:20,533 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 09:13:20,533 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 09:13:20,533 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 09:13:20,534 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-06-25 09:13:20,534 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:20,534 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 09:13:20,534 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:13:20,534 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 09:13:20,534 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 09:13:20,538 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:13:20 BoogieIcfgContainer [2018-06-25 09:13:20,538 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:13:20,538 INFO ]: Toolchain (without parser) took 3180.83 ms. Allocated memory was 306.7 MB in the beginning and 326.1 MB in the end (delta: 19.4 MB). Free memory was 258.2 MB in the beginning and 246.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 3.6 GB. [2018-06-25 09:13:20,540 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:13:20,540 INFO ]: ChcToBoogie took 69.02 ms. Allocated memory is still 306.7 MB. Free memory was 258.2 MB in the beginning and 255.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:13:20,541 INFO ]: Boogie Preprocessor took 58.12 ms. Allocated memory is still 306.7 MB. Free memory was 255.3 MB in the beginning and 254.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 09:13:20,541 INFO ]: RCFGBuilder took 454.97 ms. Allocated memory is still 306.7 MB. Free memory was 254.3 MB in the beginning and 237.3 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:13:20,542 INFO ]: TraceAbstraction took 2588.41 ms. Allocated memory was 306.7 MB in the beginning and 326.1 MB in the end (delta: 19.4 MB). Free memory was 237.3 MB in the beginning and 246.2 MB in the end (delta: -9.0 MB). Peak memory consumption was 10.4 MB. Max. memory is 3.6 GB. [2018-06-25 09:13:20,545 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 69.02 ms. Allocated memory is still 306.7 MB. Free memory was 258.2 MB in the beginning and 255.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 58.12 ms. Allocated memory is still 306.7 MB. Free memory was 255.3 MB in the beginning and 254.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 454.97 ms. Allocated memory is still 306.7 MB. Free memory was 254.3 MB in the beginning and 237.3 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2588.41 ms. Allocated memory was 306.7 MB in the beginning and 326.1 MB in the end (delta: 19.4 MB). Free memory was 237.3 MB in the beginning and 246.2 MB in the end (delta: -9.0 MB). Peak memory consumption was 10.4 MB. 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, 13 locations, 1 error locations. SAFE Result, 2.5s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 5 SDslu, 166 SDs, 0 SdLazy, 106 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=7, 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, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 1650 SizeOfPredicates, 8 NumberOfNonLiveVariables, 236 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 17/23 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/018-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-13-20-563.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/018-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-13-20-563.csv Received shutdown request...