java -Xss1g -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_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.14.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:32:35,378 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:32:35,382 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:32:35,397 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:32:35,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:32:35,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:32:35,401 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:32:35,403 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:32:35,404 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:32:35,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:32:35,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:32:35,408 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:32:35,408 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:32:35,409 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:32:35,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:32:35,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:32:35,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:32:35,427 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:32:35,428 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:32:35,429 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:32:35,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:32:35,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:32:35,438 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:32:35,438 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:32:35,439 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:32:35,440 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:32:35,440 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:32:35,441 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:32:35,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:32:35,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:32:35,447 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:32:35,449 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:32:35,449 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:32:35,450 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:32:35,451 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:32:35,451 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 10:32:35,473 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:32:35,473 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:32:35,474 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:32:35,474 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:32:35,475 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:32:35,475 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:32:35,475 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:32:35,475 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:32:35,476 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:32:35,476 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:32:35,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:32:35,476 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:32:35,476 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:32:35,476 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:32:35,477 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:32:35,478 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:32:35,478 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:32:35,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:32:35,478 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:32:35,480 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:32:35,480 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:32:35,525 INFO ]: Repository-Root is: /tmp [2018-06-22 10:32:35,545 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:32:35,551 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:32:35,553 INFO ]: Initializing SmtParser... [2018-06-22 10:32:35,553 INFO ]: SmtParser initialized [2018-06-22 10:32:35,554 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.14.smt2 [2018-06-22 10:32:35,555 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-22 10:32:35,649 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.14.smt2 unknown [2018-06-22 10:32:36,544 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.14.smt2 [2018-06-22 10:32:36,557 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:32:36,572 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:32:36,572 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:32:36,572 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:32:36,572 INFO ]: ChcToBoogie initialized [2018-06-22 10:32:36,575 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:32:36" (1/1) ... [2018-06-22 10:32:36,688 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:32:36 Unit [2018-06-22 10:32:36,688 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:32:36,689 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:32:36,689 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:32:36,689 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:32:36,712 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:32:36" (1/1) ... [2018-06-22 10:32:36,712 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:32:36" (1/1) ... [2018-06-22 10:32:36,747 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:32:36" (1/1) ... [2018-06-22 10:32:36,747 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:32:36" (1/1) ... [2018-06-22 10:32:36,784 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:32:36" (1/1) ... [2018-06-22 10:32:36,811 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:32:36" (1/1) ... [2018-06-22 10:32:36,819 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:32:36" (1/1) ... [2018-06-22 10:32:36,824 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:32:36,825 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:32:36,825 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:32:36,825 INFO ]: RCFGBuilder initialized [2018-06-22 10:32:36,826 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:32:36" (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-22 10:32:36,841 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:32:36,841 INFO ]: Found specification of procedure False [2018-06-22 10:32:36,841 INFO ]: Found implementation of procedure False [2018-06-22 10:32:36,841 INFO ]: Specification and implementation of procedure combined_lturn__bar given in one single declaration [2018-06-22 10:32:36,841 INFO ]: Found specification of procedure combined_lturn__bar [2018-06-22 10:32:36,841 INFO ]: Found implementation of procedure combined_lturn__bar [2018-06-22 10:32:36,841 INFO ]: Specification and implementation of procedure lturn__bar given in one single declaration [2018-06-22 10:32:36,841 INFO ]: Found specification of procedure lturn__bar [2018-06-22 10:32:36,841 INFO ]: Found implementation of procedure lturn__bar [2018-06-22 10:32:36,841 INFO ]: Specification and implementation of procedure step_lturn given in one single declaration [2018-06-22 10:32:36,841 INFO ]: Found specification of procedure step_lturn [2018-06-22 10:32:36,841 INFO ]: Found implementation of procedure step_lturn [2018-06-22 10:32:36,841 INFO ]: Specification and implementation of procedure combined_lturn given in one single declaration [2018-06-22 10:32:36,841 INFO ]: Found specification of procedure combined_lturn [2018-06-22 10:32:36,841 INFO ]: Found implementation of procedure combined_lturn [2018-06-22 10:32:36,841 INFO ]: Specification and implementation of procedure lturn given in one single declaration [2018-06-22 10:32:36,841 INFO ]: Found specification of procedure lturn [2018-06-22 10:32:36,841 INFO ]: Found implementation of procedure lturn [2018-06-22 10:32:36,841 INFO ]: Specification and implementation of procedure step_lturn__bar given in one single declaration [2018-06-22 10:32:36,841 INFO ]: Found specification of procedure step_lturn__bar [2018-06-22 10:32:36,841 INFO ]: Found implementation of procedure step_lturn__bar [2018-06-22 10:32:36,841 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:32:36,841 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:32:36,841 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-22 10:32:38,725 INFO ]: Using library mode [2018-06-22 10:32:38,725 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:32:38 BoogieIcfgContainer [2018-06-22 10:32:38,725 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:32:38,729 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:32:38,729 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:32:38,734 INFO ]: TraceAbstraction initialized [2018-06-22 10:32:38,734 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:32:36" (1/3) ... [2018-06-22 10:32:38,735 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f4a08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:32:38, skipping insertion in model container [2018-06-22 10:32:38,735 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:32:36" (2/3) ... [2018-06-22 10:32:38,735 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f4a08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:32:38, skipping insertion in model container [2018-06-22 10:32:38,735 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:32:38" (3/3) ... [2018-06-22 10:32:38,738 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:32:38,747 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:32:38,758 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:32:38,805 INFO ]: Using default assertion order modulation [2018-06-22 10:32:38,806 INFO ]: Interprodecural is true [2018-06-22 10:32:38,806 INFO ]: Hoare is false [2018-06-22 10:32:38,806 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:32:38,806 INFO ]: Backedges is TWOTRACK [2018-06-22 10:32:38,806 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:32:38,806 INFO ]: Difference is false [2018-06-22 10:32:38,806 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:32:38,806 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:32:38,837 INFO ]: Start isEmpty. Operand 162 states. [2018-06-22 10:32:38,873 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:32:38,874 INFO ]: Found error trace [2018-06-22 10:32:38,875 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:32:38,875 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:32:38,880 INFO ]: Analyzing trace with hash -1832476971, now seen corresponding path program 1 times [2018-06-22 10:32:38,882 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:32:38,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:32:38,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:38,919 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:32:38,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:39,242 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:39,818 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:32:39,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:32:39,821 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:32:39,823 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:32:39,838 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:32:39,839 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:32:39,841 INFO ]: Start difference. First operand 162 states. Second operand 6 states. [2018-06-22 10:32:42,015 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:32:42,015 INFO ]: Finished difference Result 204 states and 528 transitions. [2018-06-22 10:32:42,015 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:32:42,016 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:32:42,016 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:32:42,040 INFO ]: With dead ends: 204 [2018-06-22 10:32:42,040 INFO ]: Without dead ends: 202 [2018-06-22 10:32:42,042 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:32:42,058 INFO ]: Start minimizeSevpa. Operand 202 states. [2018-06-22 10:32:42,197 INFO ]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-06-22 10:32:42,198 INFO ]: Start removeUnreachable. Operand 200 states. [2018-06-22 10:32:42,206 INFO ]: Finished removeUnreachable. Reduced from 200 states to 200 states and 524 transitions. [2018-06-22 10:32:42,207 INFO ]: Start accepts. Automaton has 200 states and 524 transitions. Word has length 17 [2018-06-22 10:32:42,208 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:32:42,208 INFO ]: Abstraction has 200 states and 524 transitions. [2018-06-22 10:32:42,208 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:32:42,208 INFO ]: Start isEmpty. Operand 200 states and 524 transitions. [2018-06-22 10:32:42,218 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:32:42,218 INFO ]: Found error trace [2018-06-22 10:32:42,218 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:32:42,219 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:32:42,219 INFO ]: Analyzing trace with hash -904184435, now seen corresponding path program 1 times [2018-06-22 10:32:42,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:32:42,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:32:42,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:42,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:32:42,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:42,262 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:42,695 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:32:42,695 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:32:42,695 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:32:42,696 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:32:42,696 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:32:42,696 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:32:42,697 INFO ]: Start difference. First operand 200 states and 524 transitions. Second operand 6 states. [2018-06-22 10:32:44,202 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:32:44,202 INFO ]: Finished difference Result 268 states and 976 transitions. [2018-06-22 10:32:44,202 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:32:44,202 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:32:44,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:32:44,213 INFO ]: With dead ends: 268 [2018-06-22 10:32:44,213 INFO ]: Without dead ends: 267 [2018-06-22 10:32:44,213 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:32:44,214 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-22 10:32:44,317 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-06-22 10:32:44,317 INFO ]: Start removeUnreachable. Operand 265 states. [2018-06-22 10:32:44,323 INFO ]: Finished removeUnreachable. Reduced from 265 states to 265 states and 972 transitions. [2018-06-22 10:32:44,323 INFO ]: Start accepts. Automaton has 265 states and 972 transitions. Word has length 17 [2018-06-22 10:32:44,323 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:32:44,323 INFO ]: Abstraction has 265 states and 972 transitions. [2018-06-22 10:32:44,323 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:32:44,323 INFO ]: Start isEmpty. Operand 265 states and 972 transitions. [2018-06-22 10:32:44,328 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:32:44,328 INFO ]: Found error trace [2018-06-22 10:32:44,329 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:32:44,329 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:32:44,329 INFO ]: Analyzing trace with hash -1336008639, now seen corresponding path program 1 times [2018-06-22 10:32:44,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:32:44,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:32:44,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:44,329 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:32:44,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:44,397 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:44,496 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:32:44,496 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:32:44,496 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:32:44,497 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:32:44,497 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:32:44,497 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:32:44,497 INFO ]: Start difference. First operand 265 states and 972 transitions. Second operand 6 states. [2018-06-22 10:32:45,773 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:32:45,773 INFO ]: Finished difference Result 333 states and 1489 transitions. [2018-06-22 10:32:45,773 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:32:45,774 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:32:45,774 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:32:45,786 INFO ]: With dead ends: 333 [2018-06-22 10:32:45,786 INFO ]: Without dead ends: 333 [2018-06-22 10:32:45,786 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:32:45,787 INFO ]: Start minimizeSevpa. Operand 333 states. [2018-06-22 10:32:45,937 INFO ]: Finished minimizeSevpa. Reduced states from 333 to 331. [2018-06-22 10:32:45,937 INFO ]: Start removeUnreachable. Operand 331 states. [2018-06-22 10:32:45,944 INFO ]: Finished removeUnreachable. Reduced from 331 states to 331 states and 1487 transitions. [2018-06-22 10:32:45,944 INFO ]: Start accepts. Automaton has 331 states and 1487 transitions. Word has length 17 [2018-06-22 10:32:45,944 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:32:45,944 INFO ]: Abstraction has 331 states and 1487 transitions. [2018-06-22 10:32:45,944 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:32:45,944 INFO ]: Start isEmpty. Operand 331 states and 1487 transitions. [2018-06-22 10:32:45,949 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:32:45,949 INFO ]: Found error trace [2018-06-22 10:32:45,950 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:32:45,950 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:32:45,950 INFO ]: Analyzing trace with hash -701204723, now seen corresponding path program 1 times [2018-06-22 10:32:45,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:32:45,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:32:45,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:45,951 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:32:45,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:45,997 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:46,222 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:32:46,222 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:32:46,222 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:32:46,223 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:32:46,223 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:32:46,223 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:32:46,223 INFO ]: Start difference. First operand 331 states and 1487 transitions. Second operand 6 states. [2018-06-22 10:32:48,100 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:32:48,100 INFO ]: Finished difference Result 393 states and 2052 transitions. [2018-06-22 10:32:48,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:32:48,101 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 10:32:48,102 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:32:48,151 INFO ]: With dead ends: 393 [2018-06-22 10:32:48,151 INFO ]: Without dead ends: 393 [2018-06-22 10:32:48,151 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:32:48,151 INFO ]: Start minimizeSevpa. Operand 393 states. [2018-06-22 10:32:48,371 INFO ]: Finished minimizeSevpa. Reduced states from 393 to 387. [2018-06-22 10:32:48,371 INFO ]: Start removeUnreachable. Operand 387 states. [2018-06-22 10:32:48,379 INFO ]: Finished removeUnreachable. Reduced from 387 states to 387 states and 2035 transitions. [2018-06-22 10:32:48,379 INFO ]: Start accepts. Automaton has 387 states and 2035 transitions. Word has length 21 [2018-06-22 10:32:48,380 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:32:48,380 INFO ]: Abstraction has 387 states and 2035 transitions. [2018-06-22 10:32:48,380 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:32:48,380 INFO ]: Start isEmpty. Operand 387 states and 2035 transitions. [2018-06-22 10:32:48,386 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:32:48,386 INFO ]: Found error trace [2018-06-22 10:32:48,386 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:32:48,387 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:32:48,388 INFO ]: Analyzing trace with hash 2071865083, now seen corresponding path program 1 times [2018-06-22 10:32:48,388 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:32:48,388 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:32:48,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:48,388 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:32:48,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:48,433 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:48,628 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:32:48,628 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:32:48,628 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:32:48,628 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:32:48,628 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:32:48,628 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:32:48,628 INFO ]: Start difference. First operand 387 states and 2035 transitions. Second operand 7 states. [2018-06-22 10:32:50,760 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:32:50,760 INFO ]: Finished difference Result 696 states and 5538 transitions. [2018-06-22 10:32:50,760 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:32:50,760 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 10:32:50,760 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:32:50,796 INFO ]: With dead ends: 696 [2018-06-22 10:32:50,796 INFO ]: Without dead ends: 696 [2018-06-22 10:32:50,797 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:32:50,797 INFO ]: Start minimizeSevpa. Operand 696 states. [2018-06-22 10:32:51,552 INFO ]: Finished minimizeSevpa. Reduced states from 696 to 680. [2018-06-22 10:32:51,552 INFO ]: Start removeUnreachable. Operand 680 states. [2018-06-22 10:32:51,577 INFO ]: Finished removeUnreachable. Reduced from 680 states to 680 states and 5477 transitions. [2018-06-22 10:32:51,577 INFO ]: Start accepts. Automaton has 680 states and 5477 transitions. Word has length 25 [2018-06-22 10:32:51,578 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:32:51,578 INFO ]: Abstraction has 680 states and 5477 transitions. [2018-06-22 10:32:51,578 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:32:51,578 INFO ]: Start isEmpty. Operand 680 states and 5477 transitions. [2018-06-22 10:32:51,587 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:32:51,587 INFO ]: Found error trace [2018-06-22 10:32:51,587 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:32:51,587 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:32:51,588 INFO ]: Analyzing trace with hash -594305015, now seen corresponding path program 1 times [2018-06-22 10:32:51,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:32:51,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:32:51,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:51,588 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:32:51,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:51,625 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:51,878 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:32:51,878 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:32:51,878 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:32:51,878 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:32:51,878 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:32:51,878 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:32:51,878 INFO ]: Start difference. First operand 680 states and 5477 transitions. Second operand 6 states. [2018-06-22 10:32:53,074 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:32:53,074 INFO ]: Finished difference Result 1088 states and 11272 transitions. [2018-06-22 10:32:53,075 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:32:53,075 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 10:32:53,075 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:32:53,137 INFO ]: With dead ends: 1088 [2018-06-22 10:32:53,137 INFO ]: Without dead ends: 1088 [2018-06-22 10:32:53,138 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:32:53,138 INFO ]: Start minimizeSevpa. Operand 1088 states. [2018-06-22 10:32:54,345 INFO ]: Finished minimizeSevpa. Reduced states from 1088 to 1063. [2018-06-22 10:32:54,345 INFO ]: Start removeUnreachable. Operand 1063 states. [2018-06-22 10:32:54,400 INFO ]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 11060 transitions. [2018-06-22 10:32:54,400 INFO ]: Start accepts. Automaton has 1063 states and 11060 transitions. Word has length 21 [2018-06-22 10:32:54,400 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:32:54,400 INFO ]: Abstraction has 1063 states and 11060 transitions. [2018-06-22 10:32:54,400 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:32:54,400 INFO ]: Start isEmpty. Operand 1063 states and 11060 transitions. [2018-06-22 10:32:54,412 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:32:54,412 INFO ]: Found error trace [2018-06-22 10:32:54,412 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:32:54,412 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:32:54,412 INFO ]: Analyzing trace with hash 1282135746, now seen corresponding path program 1 times [2018-06-22 10:32:54,412 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:32:54,412 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:32:54,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:54,413 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:32:54,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:54,448 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:54,773 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:32:54,773 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:32:54,773 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-22 10:32:54,780 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:32:54,886 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:54,906 INFO ]: Computing forward predicates... [2018-06-22 10:32:55,337 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 10:32:55,370 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:32:55,370 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-22 10:32:55,371 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:32:55,371 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:32:55,371 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:32:55,371 INFO ]: Start difference. First operand 1063 states and 11060 transitions. Second operand 13 states. [2018-06-22 10:33:03,205 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:33:03,205 INFO ]: Finished difference Result 1621 states and 25011 transitions. [2018-06-22 10:33:03,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:33:03,205 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 10:33:03,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:33:03,529 INFO ]: With dead ends: 1621 [2018-06-22 10:33:03,529 INFO ]: Without dead ends: 1620 [2018-06-22 10:33:03,529 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:33:03,530 INFO ]: Start minimizeSevpa. Operand 1620 states. [2018-06-22 10:33:06,595 INFO ]: Finished minimizeSevpa. Reduced states from 1620 to 1537. [2018-06-22 10:33:06,595 INFO ]: Start removeUnreachable. Operand 1537 states. [2018-06-22 10:33:06,738 INFO ]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 23433 transitions. [2018-06-22 10:33:06,738 INFO ]: Start accepts. Automaton has 1537 states and 23433 transitions. Word has length 25 [2018-06-22 10:33:06,738 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:33:06,738 INFO ]: Abstraction has 1537 states and 23433 transitions. [2018-06-22 10:33:06,738 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:33:06,738 INFO ]: Start isEmpty. Operand 1537 states and 23433 transitions. [2018-06-22 10:33:06,757 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:33:06,757 INFO ]: Found error trace [2018-06-22 10:33:06,758 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:33:06,758 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:33:06,758 INFO ]: Analyzing trace with hash -872842553, now seen corresponding path program 1 times [2018-06-22 10:33:06,758 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:33:06,758 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:33:06,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:06,759 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:33:06,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:06,818 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:33:07,196 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:33:07,197 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:33:07,197 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:33:07,197 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:33:07,197 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:33:07,197 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:33:07,197 INFO ]: Start difference. First operand 1537 states and 23433 transitions. Second operand 7 states. [2018-06-22 10:33:09,139 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:33:09,139 INFO ]: Finished difference Result 1578 states and 24094 transitions. [2018-06-22 10:33:09,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:33:09,140 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 10:33:09,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:33:09,280 INFO ]: With dead ends: 1578 [2018-06-22 10:33:09,280 INFO ]: Without dead ends: 1578 [2018-06-22 10:33:09,280 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:33:09,281 INFO ]: Start minimizeSevpa. Operand 1578 states. [2018-06-22 10:33:11,616 INFO ]: Finished minimizeSevpa. Reduced states from 1578 to 1492. [2018-06-22 10:33:11,617 INFO ]: Start removeUnreachable. Operand 1492 states. [2018-06-22 10:33:11,741 INFO ]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 22472 transitions. [2018-06-22 10:33:11,741 INFO ]: Start accepts. Automaton has 1492 states and 22472 transitions. Word has length 21 [2018-06-22 10:33:11,741 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:33:11,741 INFO ]: Abstraction has 1492 states and 22472 transitions. [2018-06-22 10:33:11,741 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:33:11,741 INFO ]: Start isEmpty. Operand 1492 states and 22472 transitions. [2018-06-22 10:33:11,752 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:33:11,752 INFO ]: Found error trace [2018-06-22 10:33:11,752 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:33:11,752 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:33:11,753 INFO ]: Analyzing trace with hash 760355529, now seen corresponding path program 1 times [2018-06-22 10:33:11,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:33:11,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:33:11,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:11,754 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:33:11,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:11,791 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:33:11,985 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:33:11,985 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:33:11,985 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:33:11,986 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:33:11,986 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:33:11,986 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:33:11,986 INFO ]: Start difference. First operand 1492 states and 22472 transitions. Second operand 7 states. [2018-06-22 10:33:13,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:33:13,161 INFO ]: Finished difference Result 1503 states and 22584 transitions. [2018-06-22 10:33:13,161 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:33:13,161 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 10:33:13,161 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:33:13,294 INFO ]: With dead ends: 1503 [2018-06-22 10:33:13,294 INFO ]: Without dead ends: 1503 [2018-06-22 10:33:13,294 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:33:13,296 INFO ]: Start minimizeSevpa. Operand 1503 states. [2018-06-22 10:33:16,003 INFO ]: Finished minimizeSevpa. Reduced states from 1503 to 1492. [2018-06-22 10:33:16,003 INFO ]: Start removeUnreachable. Operand 1492 states. [2018-06-22 10:33:16,110 INFO ]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 22376 transitions. [2018-06-22 10:33:16,110 INFO ]: Start accepts. Automaton has 1492 states and 22376 transitions. Word has length 21 [2018-06-22 10:33:16,110 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:33:16,110 INFO ]: Abstraction has 1492 states and 22376 transitions. [2018-06-22 10:33:16,110 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:33:16,110 INFO ]: Start isEmpty. Operand 1492 states and 22376 transitions. [2018-06-22 10:33:16,123 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:33:16,123 INFO ]: Found error trace [2018-06-22 10:33:16,123 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:33:16,123 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:33:16,126 INFO ]: Analyzing trace with hash 1192179733, now seen corresponding path program 1 times [2018-06-22 10:33:16,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:33:16,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:33:16,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:16,127 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:33:16,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:16,167 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:33:16,368 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:33:16,368 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:33:16,368 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:33:16,368 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:33:16,368 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:33:16,368 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:33:16,368 INFO ]: Start difference. First operand 1492 states and 22376 transitions. Second operand 7 states. [2018-06-22 10:33:17,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:33:17,672 INFO ]: Finished difference Result 1643 states and 26021 transitions. [2018-06-22 10:33:17,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:33:17,672 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 10:33:17,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:33:17,848 INFO ]: With dead ends: 1643 [2018-06-22 10:33:17,848 INFO ]: Without dead ends: 1643 [2018-06-22 10:33:17,848 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:33:17,849 INFO ]: Start minimizeSevpa. Operand 1643 states. [2018-06-22 10:33:20,112 INFO ]: Finished minimizeSevpa. Reduced states from 1643 to 1576. [2018-06-22 10:33:20,112 INFO ]: Start removeUnreachable. Operand 1576 states. [2018-06-22 10:33:20,210 INFO ]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 24907 transitions. [2018-06-22 10:33:20,210 INFO ]: Start accepts. Automaton has 1576 states and 24907 transitions. Word has length 21 [2018-06-22 10:33:20,210 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:33:20,210 INFO ]: Abstraction has 1576 states and 24907 transitions. [2018-06-22 10:33:20,210 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:33:20,210 INFO ]: Start isEmpty. Operand 1576 states and 24907 transitions. [2018-06-22 10:33:20,219 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:33:20,219 INFO ]: Found error trace [2018-06-22 10:33:20,219 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:33:20,219 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:33:20,220 INFO ]: Analyzing trace with hash -1947603573, now seen corresponding path program 1 times [2018-06-22 10:33:20,220 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:33:20,220 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:33:20,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:20,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:33:20,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:20,254 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:33:20,502 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:33:20,502 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:33:20,502 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:33:20,502 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:33:20,502 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:33:20,502 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:33:20,503 INFO ]: Start difference. First operand 1576 states and 24907 transitions. Second operand 7 states. [2018-06-22 10:33:21,646 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:33:21,646 INFO ]: Finished difference Result 2064 states and 47517 transitions. [2018-06-22 10:33:21,647 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:33:21,647 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 10:33:21,647 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:33:21,967 INFO ]: With dead ends: 2064 [2018-06-22 10:33:21,967 INFO ]: Without dead ends: 2064 [2018-06-22 10:33:21,967 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:33:21,969 INFO ]: Start minimizeSevpa. Operand 2064 states. [2018-06-22 10:33:26,660 INFO ]: Finished minimizeSevpa. Reduced states from 2064 to 1862. [2018-06-22 10:33:26,660 INFO ]: Start removeUnreachable. Operand 1862 states. [2018-06-22 10:33:26,792 INFO ]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 38323 transitions. [2018-06-22 10:33:26,792 INFO ]: Start accepts. Automaton has 1862 states and 38323 transitions. Word has length 25 [2018-06-22 10:33:26,793 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:33:26,793 INFO ]: Abstraction has 1862 states and 38323 transitions. [2018-06-22 10:33:26,793 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:33:26,793 INFO ]: Start isEmpty. Operand 1862 states and 38323 transitions. [2018-06-22 10:33:26,802 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:33:26,802 INFO ]: Found error trace [2018-06-22 10:33:26,802 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:33:26,802 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:33:26,802 INFO ]: Analyzing trace with hash -869901293, now seen corresponding path program 1 times [2018-06-22 10:33:26,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:33:26,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:33:26,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:26,803 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:33:26,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:26,839 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:33:27,092 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:33:27,092 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:33:27,092 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:33:27,092 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:33:27,092 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:33:27,092 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:33:27,092 INFO ]: Start difference. First operand 1862 states and 38323 transitions. Second operand 7 states. [2018-06-22 10:33:28,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:33:28,233 INFO ]: Finished difference Result 2035 states and 46377 transitions. [2018-06-22 10:33:28,233 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:33:28,233 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 10:33:28,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:33:28,470 INFO ]: With dead ends: 2035 [2018-06-22 10:33:28,470 INFO ]: Without dead ends: 2035 [2018-06-22 10:33:28,470 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:33:28,471 INFO ]: Start minimizeSevpa. Operand 2035 states. [2018-06-22 10:33:33,744 INFO ]: Finished minimizeSevpa. Reduced states from 2035 to 1862. [2018-06-22 10:33:33,744 INFO ]: Start removeUnreachable. Operand 1862 states. [2018-06-22 10:33:33,877 INFO ]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 38318 transitions. [2018-06-22 10:33:33,877 INFO ]: Start accepts. Automaton has 1862 states and 38318 transitions. Word has length 29 [2018-06-22 10:33:33,877 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:33:33,877 INFO ]: Abstraction has 1862 states and 38318 transitions. [2018-06-22 10:33:33,877 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:33:33,877 INFO ]: Start isEmpty. Operand 1862 states and 38318 transitions. [2018-06-22 10:33:33,881 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:33:33,881 INFO ]: Found error trace [2018-06-22 10:33:33,882 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:33:33,882 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:33:33,882 INFO ]: Analyzing trace with hash 121669812, now seen corresponding path program 1 times [2018-06-22 10:33:33,882 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:33:33,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:33:33,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:33,883 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:33:33,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:33,941 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:33:34,210 INFO ]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 10:33:34,210 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:33:34,210 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-22 10:33:34,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:33:34,289 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:33:34,295 INFO ]: Computing forward predicates... [2018-06-22 10:33:34,472 INFO ]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 10:33:34,503 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:33:34,503 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-06-22 10:33:34,503 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:33:34,503 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:33:34,503 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:33:34,503 INFO ]: Start difference. First operand 1862 states and 38318 transitions. Second operand 14 states. Received shutdown request... [2018-06-22 10:33:35,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 10:33:35,048 WARN ]: Verification canceled [2018-06-22 10:33:35,053 WARN ]: Timeout [2018-06-22 10:33:35,054 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:33:35 BoogieIcfgContainer [2018-06-22 10:33:35,054 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:33:35,055 INFO ]: Toolchain (without parser) took 58497.12 ms. Allocated memory was 304.1 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 203.7 MB in the beginning and 1.0 GB in the end (delta: -799.6 MB). Peak memory consumption was 586.6 MB. Max. memory is 3.6 GB. [2018-06-22 10:33:35,056 INFO ]: SmtParser took 0.53 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:33:35,056 INFO ]: ChcToBoogie took 116.36 ms. Allocated memory is still 304.1 MB. Free memory was 203.7 MB in the beginning and 198.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:33:35,057 INFO ]: Boogie Preprocessor took 135.65 ms. Allocated memory is still 304.1 MB. Free memory was 198.7 MB in the beginning and 195.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:33:35,062 INFO ]: RCFGBuilder took 1900.39 ms. Allocated memory was 304.1 MB in the beginning and 321.9 MB in the end (delta: 17.8 MB). Free memory was 195.7 MB in the beginning and 183.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 3.6 GB. [2018-06-22 10:33:35,063 INFO ]: TraceAbstraction took 56324.66 ms. Allocated memory was 321.9 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 181.6 MB in the beginning and 1.0 GB in the end (delta: -821.7 MB). Peak memory consumption was 546.7 MB. Max. memory is 3.6 GB. [2018-06-22 10:33:35,065 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.53 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 116.36 ms. Allocated memory is still 304.1 MB. Free memory was 203.7 MB in the beginning and 198.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 135.65 ms. Allocated memory is still 304.1 MB. Free memory was 198.7 MB in the beginning and 195.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1900.39 ms. Allocated memory was 304.1 MB in the beginning and 321.9 MB in the end (delta: 17.8 MB). Free memory was 195.7 MB in the beginning and 183.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56324.66 ms. Allocated memory was 321.9 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 181.6 MB in the beginning and 1.0 GB in the end (delta: -821.7 MB). Peak memory consumption was 546.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (1862states) and interpolant automaton (currently 10 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (130 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 162 locations, 1 error locations. TIMEOUT Result, 56.2s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 26.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4459 SDtfs, 157 SDslu, 21011 SDs, 0 SdLazy, 18169 SolverSat, 704 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1862occurred in iteration=11, 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: 23.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 675 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 19240 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1591 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 39/57 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.14.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-33-35-079.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.14.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-33-35-079.csv Completed graceful shutdown