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.12.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:31:32,791 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:31:32,794 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:31:32,807 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:31:32,807 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:31:32,808 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:31:32,809 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:31:32,814 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:31:32,816 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:31:32,819 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:31:32,819 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:31:32,820 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:31:32,821 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:31:32,825 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:31:32,826 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:31:32,826 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:31:32,830 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:31:32,832 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:31:32,834 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:31:32,835 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:31:32,842 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:31:32,845 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:31:32,845 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:31:32,845 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:31:32,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:31:32,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:31:32,850 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:31:32,850 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:31:32,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:31:32,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:31:32,852 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:31:32,853 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:31:32,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:31:32,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:31:32,854 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:31:32,855 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:31:32,868 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:31:32,868 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:31:32,869 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:31:32,869 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:31:32,870 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:31:32,870 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:31:32,870 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:31:32,871 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:31:32,871 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:31:32,871 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:31:32,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:31:32,871 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:31:32,871 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:31:32,872 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:31:32,872 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:31:32,872 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:31:32,872 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:31:32,872 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:31:32,872 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:31:32,874 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:31:32,874 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:31:32,925 INFO ]: Repository-Root is: /tmp [2018-06-22 10:31:32,945 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:31:32,953 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:31:32,955 INFO ]: Initializing SmtParser... [2018-06-22 10:31:32,955 INFO ]: SmtParser initialized [2018-06-22 10:31:32,956 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.12.smt2 [2018-06-22 10:31:32,958 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:31:33,057 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.12.smt2 unknown [2018-06-22 10:31:34,108 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.12.smt2 [2018-06-22 10:31:34,113 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:31:34,132 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:31:34,132 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:31:34,132 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:31:34,133 INFO ]: ChcToBoogie initialized [2018-06-22 10:31:34,136 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:31:34" (1/1) ... [2018-06-22 10:31:34,280 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:31:34 Unit [2018-06-22 10:31:34,280 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:31:34,281 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:31:34,281 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:31:34,281 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:31:34,303 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:31:34" (1/1) ... [2018-06-22 10:31:34,303 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:31:34" (1/1) ... [2018-06-22 10:31:34,347 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:31:34" (1/1) ... [2018-06-22 10:31:34,347 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:31:34" (1/1) ... [2018-06-22 10:31:34,373 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:31:34" (1/1) ... [2018-06-22 10:31:34,403 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:31:34" (1/1) ... [2018-06-22 10:31:34,409 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:31:34" (1/1) ... [2018-06-22 10:31:34,417 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:31:34,418 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:31:34,418 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:31:34,418 INFO ]: RCFGBuilder initialized [2018-06-22 10:31:34,419 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:31:34" (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:31:34,432 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:31:34,432 INFO ]: Found specification of procedure False [2018-06-22 10:31:34,432 INFO ]: Found implementation of procedure False [2018-06-22 10:31:34,432 INFO ]: Specification and implementation of procedure step_lturn__bar given in one single declaration [2018-06-22 10:31:34,432 INFO ]: Found specification of procedure step_lturn__bar [2018-06-22 10:31:34,432 INFO ]: Found implementation of procedure step_lturn__bar [2018-06-22 10:31:34,432 INFO ]: Specification and implementation of procedure combined_lturn__bar given in one single declaration [2018-06-22 10:31:34,432 INFO ]: Found specification of procedure combined_lturn__bar [2018-06-22 10:31:34,432 INFO ]: Found implementation of procedure combined_lturn__bar [2018-06-22 10:31:34,432 INFO ]: Specification and implementation of procedure lturn__bar given in one single declaration [2018-06-22 10:31:34,432 INFO ]: Found specification of procedure lturn__bar [2018-06-22 10:31:34,432 INFO ]: Found implementation of procedure lturn__bar [2018-06-22 10:31:34,432 INFO ]: Specification and implementation of procedure combined_lturn given in one single declaration [2018-06-22 10:31:34,432 INFO ]: Found specification of procedure combined_lturn [2018-06-22 10:31:34,433 INFO ]: Found implementation of procedure combined_lturn [2018-06-22 10:31:34,433 INFO ]: Specification and implementation of procedure lturn given in one single declaration [2018-06-22 10:31:34,433 INFO ]: Found specification of procedure lturn [2018-06-22 10:31:34,433 INFO ]: Found implementation of procedure lturn [2018-06-22 10:31:34,433 INFO ]: Specification and implementation of procedure step_lturn given in one single declaration [2018-06-22 10:31:34,433 INFO ]: Found specification of procedure step_lturn [2018-06-22 10:31:34,433 INFO ]: Found implementation of procedure step_lturn [2018-06-22 10:31:34,433 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:31:34,433 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:31:34,433 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:31:36,154 INFO ]: Using library mode [2018-06-22 10:31:36,155 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:31:36 BoogieIcfgContainer [2018-06-22 10:31:36,155 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:31:36,156 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:31:36,156 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:31:36,162 INFO ]: TraceAbstraction initialized [2018-06-22 10:31:36,162 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:31:34" (1/3) ... [2018-06-22 10:31:36,163 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cae1ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:31:36, skipping insertion in model container [2018-06-22 10:31:36,163 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:31:34" (2/3) ... [2018-06-22 10:31:36,163 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cae1ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:31:36, skipping insertion in model container [2018-06-22 10:31:36,163 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:31:36" (3/3) ... [2018-06-22 10:31:36,165 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:31:36,175 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:31:36,188 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:31:36,227 INFO ]: Using default assertion order modulation [2018-06-22 10:31:36,228 INFO ]: Interprodecural is true [2018-06-22 10:31:36,228 INFO ]: Hoare is false [2018-06-22 10:31:36,228 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:31:36,228 INFO ]: Backedges is TWOTRACK [2018-06-22 10:31:36,228 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:31:36,228 INFO ]: Difference is false [2018-06-22 10:31:36,228 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:31:36,228 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:31:36,248 INFO ]: Start isEmpty. Operand 162 states. [2018-06-22 10:31:36,292 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:31:36,298 INFO ]: Found error trace [2018-06-22 10:31:36,302 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:31:36,303 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:31:36,307 INFO ]: Analyzing trace with hash 1521153341, now seen corresponding path program 1 times [2018-06-22 10:31:36,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:31:36,308 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:31:36,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:36,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:31:36,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:36,576 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:31:37,245 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:31:37,248 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:31:37,248 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:31:37,250 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:31:37,265 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:31:37,266 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:31:37,268 INFO ]: Start difference. First operand 162 states. Second operand 6 states. [2018-06-22 10:31:39,810 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:31:39,810 INFO ]: Finished difference Result 204 states and 536 transitions. [2018-06-22 10:31:39,810 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:31:39,811 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:31:39,811 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:31:39,836 INFO ]: With dead ends: 204 [2018-06-22 10:31:39,836 INFO ]: Without dead ends: 201 [2018-06-22 10:31:39,838 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:31:39,856 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-22 10:31:39,982 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-06-22 10:31:39,984 INFO ]: Start removeUnreachable. Operand 199 states. [2018-06-22 10:31:39,991 INFO ]: Finished removeUnreachable. Reduced from 199 states to 199 states and 530 transitions. [2018-06-22 10:31:40,002 INFO ]: Start accepts. Automaton has 199 states and 530 transitions. Word has length 17 [2018-06-22 10:31:40,003 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:31:40,003 INFO ]: Abstraction has 199 states and 530 transitions. [2018-06-22 10:31:40,003 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:31:40,003 INFO ]: Start isEmpty. Operand 199 states and 530 transitions. [2018-06-22 10:31:40,011 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:31:40,011 INFO ]: Found error trace [2018-06-22 10:31:40,011 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:31:40,012 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:31:40,012 INFO ]: Analyzing trace with hash -469891160, now seen corresponding path program 1 times [2018-06-22 10:31:40,012 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:31:40,012 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:31:40,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:40,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:31:40,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:40,059 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:31:40,262 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:31:40,262 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:31:40,262 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:31:40,264 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:31:40,264 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:31:40,264 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:31:40,264 INFO ]: Start difference. First operand 199 states and 530 transitions. Second operand 6 states. [2018-06-22 10:31:41,916 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:31:41,916 INFO ]: Finished difference Result 245 states and 786 transitions. [2018-06-22 10:31:41,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:31:41,916 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:31:41,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:31:41,927 INFO ]: With dead ends: 245 [2018-06-22 10:31:41,927 INFO ]: Without dead ends: 244 [2018-06-22 10:31:41,927 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:31:41,928 INFO ]: Start minimizeSevpa. Operand 244 states. [2018-06-22 10:31:41,986 INFO ]: Finished minimizeSevpa. Reduced states from 244 to 199. [2018-06-22 10:31:41,986 INFO ]: Start removeUnreachable. Operand 199 states. [2018-06-22 10:31:41,989 INFO ]: Finished removeUnreachable. Reduced from 199 states to 199 states and 530 transitions. [2018-06-22 10:31:41,989 INFO ]: Start accepts. Automaton has 199 states and 530 transitions. Word has length 17 [2018-06-22 10:31:41,989 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:31:41,989 INFO ]: Abstraction has 199 states and 530 transitions. [2018-06-22 10:31:41,990 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:31:41,990 INFO ]: Start isEmpty. Operand 199 states and 530 transitions. [2018-06-22 10:31:41,993 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:31:41,993 INFO ]: Found error trace [2018-06-22 10:31:41,993 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:31:41,993 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:31:41,993 INFO ]: Analyzing trace with hash 1526324514, now seen corresponding path program 1 times [2018-06-22 10:31:41,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:31:41,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:31:41,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:41,994 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:31:41,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:42,033 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:31:42,524 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:31:42,524 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:31:42,524 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:31:42,525 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:31:42,525 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:31:42,525 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:31:42,525 INFO ]: Start difference. First operand 199 states and 530 transitions. Second operand 6 states. [2018-06-22 10:31:43,898 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:31:43,898 INFO ]: Finished difference Result 267 states and 975 transitions. [2018-06-22 10:31:43,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:31:43,898 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:31:43,898 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:31:43,905 INFO ]: With dead ends: 267 [2018-06-22 10:31:43,905 INFO ]: Without dead ends: 267 [2018-06-22 10:31:43,906 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:31:43,906 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-22 10:31:43,980 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-06-22 10:31:43,980 INFO ]: Start removeUnreachable. Operand 265 states. [2018-06-22 10:31:43,985 INFO ]: Finished removeUnreachable. Reduced from 265 states to 265 states and 973 transitions. [2018-06-22 10:31:43,985 INFO ]: Start accepts. Automaton has 265 states and 973 transitions. Word has length 17 [2018-06-22 10:31:43,985 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:31:43,985 INFO ]: Abstraction has 265 states and 973 transitions. [2018-06-22 10:31:43,985 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:31:43,985 INFO ]: Start isEmpty. Operand 265 states and 973 transitions. [2018-06-22 10:31:43,990 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:31:43,991 INFO ]: Found error trace [2018-06-22 10:31:43,991 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:31:43,991 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:31:43,991 INFO ]: Analyzing trace with hash 1233665089, now seen corresponding path program 1 times [2018-06-22 10:31:43,991 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:31:43,991 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:31:43,992 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:43,992 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:31:43,992 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:44,062 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:31:44,203 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:31:44,204 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:31:44,204 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:31:44,204 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:31:44,204 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:31:44,204 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:31:44,204 INFO ]: Start difference. First operand 265 states and 973 transitions. Second operand 6 states. [2018-06-22 10:31:47,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:31:47,480 INFO ]: Finished difference Result 323 states and 1418 transitions. [2018-06-22 10:31:47,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:31:47,480 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 10:31:47,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:31:47,492 INFO ]: With dead ends: 323 [2018-06-22 10:31:47,492 INFO ]: Without dead ends: 323 [2018-06-22 10:31:47,494 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:31:47,494 INFO ]: Start minimizeSevpa. Operand 323 states. [2018-06-22 10:31:47,674 INFO ]: Finished minimizeSevpa. Reduced states from 323 to 319. [2018-06-22 10:31:47,691 INFO ]: Start removeUnreachable. Operand 319 states. [2018-06-22 10:31:47,699 INFO ]: Finished removeUnreachable. Reduced from 319 states to 319 states and 1413 transitions. [2018-06-22 10:31:47,699 INFO ]: Start accepts. Automaton has 319 states and 1413 transitions. Word has length 21 [2018-06-22 10:31:47,699 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:31:47,699 INFO ]: Abstraction has 319 states and 1413 transitions. [2018-06-22 10:31:47,699 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:31:47,699 INFO ]: Start isEmpty. Operand 319 states and 1413 transitions. [2018-06-22 10:31:47,706 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:31:47,706 INFO ]: Found error trace [2018-06-22 10:31:47,706 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:31:47,706 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:31:47,706 INFO ]: Analyzing trace with hash 809905556, now seen corresponding path program 1 times [2018-06-22 10:31:47,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:31:47,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:31:47,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:47,709 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:31:47,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:47,768 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:31:47,935 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:31:47,935 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:31:47,935 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:31:47,935 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:31:47,936 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:31:47,936 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:31:47,936 INFO ]: Start difference. First operand 319 states and 1413 transitions. Second operand 6 states. [2018-06-22 10:31:48,897 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:31:48,897 INFO ]: Finished difference Result 467 states and 2908 transitions. [2018-06-22 10:31:48,897 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:31:48,897 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 10:31:48,898 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:31:48,919 INFO ]: With dead ends: 467 [2018-06-22 10:31:48,994 INFO ]: Without dead ends: 467 [2018-06-22 10:31:48,994 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:31:48,995 INFO ]: Start minimizeSevpa. Operand 467 states. [2018-06-22 10:31:49,260 INFO ]: Finished minimizeSevpa. Reduced states from 467 to 458. [2018-06-22 10:31:49,260 INFO ]: Start removeUnreachable. Operand 458 states. [2018-06-22 10:31:49,273 INFO ]: Finished removeUnreachable. Reduced from 458 states to 458 states and 2877 transitions. [2018-06-22 10:31:49,274 INFO ]: Start accepts. Automaton has 458 states and 2877 transitions. Word has length 21 [2018-06-22 10:31:49,274 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:31:49,274 INFO ]: Abstraction has 458 states and 2877 transitions. [2018-06-22 10:31:49,274 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:31:49,274 INFO ]: Start isEmpty. Operand 458 states and 2877 transitions. [2018-06-22 10:31:49,281 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:31:49,281 INFO ]: Found error trace [2018-06-22 10:31:49,281 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:31:49,281 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:31:49,281 INFO ]: Analyzing trace with hash -1587534696, now seen corresponding path program 1 times [2018-06-22 10:31:49,281 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:31:49,281 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:31:49,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:49,282 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:31:49,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:49,325 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:31:49,662 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:31:49,662 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:31:49,662 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:31:49,662 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:31:49,662 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:31:49,662 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:31:49,662 INFO ]: Start difference. First operand 458 states and 2877 transitions. Second operand 7 states. [2018-06-22 10:31:51,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:31:51,840 INFO ]: Finished difference Result 827 states and 6782 transitions. [2018-06-22 10:31:51,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:31:51,840 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 10:31:51,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:31:51,885 INFO ]: With dead ends: 827 [2018-06-22 10:31:51,885 INFO ]: Without dead ends: 827 [2018-06-22 10:31:51,885 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:31:51,886 INFO ]: Start minimizeSevpa. Operand 827 states. [2018-06-22 10:31:52,643 INFO ]: Finished minimizeSevpa. Reduced states from 827 to 804. [2018-06-22 10:31:52,643 INFO ]: Start removeUnreachable. Operand 804 states. [2018-06-22 10:31:52,674 INFO ]: Finished removeUnreachable. Reduced from 804 states to 804 states and 6647 transitions. [2018-06-22 10:31:52,674 INFO ]: Start accepts. Automaton has 804 states and 6647 transitions. Word has length 25 [2018-06-22 10:31:52,675 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:31:52,675 INFO ]: Abstraction has 804 states and 6647 transitions. [2018-06-22 10:31:52,675 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:31:52,675 INFO ]: Start isEmpty. Operand 804 states and 6647 transitions. [2018-06-22 10:31:52,684 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:31:52,684 INFO ]: Found error trace [2018-06-22 10:31:52,684 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:31:52,684 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:31:52,685 INFO ]: Analyzing trace with hash -1429334490, now seen corresponding path program 1 times [2018-06-22 10:31:52,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:31:52,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:31:52,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:52,685 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:31:52,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:52,728 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:31:52,924 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:31:53,634 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:31:53,634 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:31:53,635 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:31:53,635 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:31:53,635 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:31:53,635 INFO ]: Start difference. First operand 804 states and 6647 transitions. Second operand 7 states. [2018-06-22 10:31:55,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:31:55,358 INFO ]: Finished difference Result 831 states and 7010 transitions. [2018-06-22 10:31:55,359 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:31:55,359 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 10:31:55,359 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:31:55,393 INFO ]: With dead ends: 831 [2018-06-22 10:31:55,393 INFO ]: Without dead ends: 831 [2018-06-22 10:31:55,394 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 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:31:55,394 INFO ]: Start minimizeSevpa. Operand 831 states. [2018-06-22 10:31:56,021 INFO ]: Finished minimizeSevpa. Reduced states from 831 to 822. [2018-06-22 10:31:56,021 INFO ]: Start removeUnreachable. Operand 822 states. [2018-06-22 10:31:56,060 INFO ]: Finished removeUnreachable. Reduced from 822 states to 822 states and 6947 transitions. [2018-06-22 10:31:56,061 INFO ]: Start accepts. Automaton has 822 states and 6947 transitions. Word has length 21 [2018-06-22 10:31:56,065 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:31:56,065 INFO ]: Abstraction has 822 states and 6947 transitions. [2018-06-22 10:31:56,065 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:31:56,065 INFO ]: Start isEmpty. Operand 822 states and 6947 transitions. [2018-06-22 10:31:56,074 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:31:56,074 INFO ]: Found error trace [2018-06-22 10:31:56,074 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:31:56,074 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:31:56,075 INFO ]: Analyzing trace with hash -1434505663, now seen corresponding path program 1 times [2018-06-22 10:31:56,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:31:56,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:31:56,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:56,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:31:56,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:56,117 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:31:56,303 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:31:56,376 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:31:56,376 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:31:56,376 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:31:56,377 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:31:56,377 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:31:56,377 INFO ]: Start difference. First operand 822 states and 6947 transitions. Second operand 7 states. [2018-06-22 10:31:58,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:31:58,162 INFO ]: Finished difference Result 1108 states and 13107 transitions. [2018-06-22 10:31:58,162 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:31:58,162 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 10:31:58,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:31:58,209 INFO ]: With dead ends: 1108 [2018-06-22 10:31:58,209 INFO ]: Without dead ends: 1108 [2018-06-22 10:31:58,210 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 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:31:58,210 INFO ]: Start minimizeSevpa. Operand 1108 states. [2018-06-22 10:31:59,711 INFO ]: Finished minimizeSevpa. Reduced states from 1108 to 1059. [2018-06-22 10:31:59,711 INFO ]: Start removeUnreachable. Operand 1059 states. [2018-06-22 10:31:59,761 INFO ]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 12421 transitions. [2018-06-22 10:31:59,761 INFO ]: Start accepts. Automaton has 1059 states and 12421 transitions. Word has length 21 [2018-06-22 10:31:59,761 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:31:59,761 INFO ]: Abstraction has 1059 states and 12421 transitions. [2018-06-22 10:31:59,761 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:31:59,761 INFO ]: Start isEmpty. Operand 1059 states and 12421 transitions. [2018-06-22 10:31:59,771 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:31:59,771 INFO ]: Found error trace [2018-06-22 10:31:59,771 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:31:59,771 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:31:59,772 INFO ]: Analyzing trace with hash -574850034, now seen corresponding path program 1 times [2018-06-22 10:31:59,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:31:59,772 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:31:59,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:59,773 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:31:59,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:31:59,807 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:00,114 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:32:00,114 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:32:00,114 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:00,121 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:32:00,233 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:00,246 INFO ]: Computing forward predicates... [2018-06-22 10:32:00,297 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:32:00,338 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:32:00,338 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 10:32:00,338 INFO ]: Interpolant automaton has 9 states [2018-06-22 10:32:00,338 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 10:32:00,338 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:32:00,338 INFO ]: Start difference. First operand 1059 states and 12421 transitions. Second operand 9 states. [2018-06-22 10:32:05,112 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:32:05,112 INFO ]: Finished difference Result 1471 states and 20675 transitions. [2018-06-22 10:32:05,112 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:32:05,112 INFO ]: Start accepts. Automaton has 9 states. Word has length 29 [2018-06-22 10:32:05,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:32:05,271 INFO ]: With dead ends: 1471 [2018-06-22 10:32:05,271 INFO ]: Without dead ends: 1470 [2018-06-22 10:32:05,272 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:32:05,272 INFO ]: Start minimizeSevpa. Operand 1470 states. [2018-06-22 10:32:07,413 INFO ]: Finished minimizeSevpa. Reduced states from 1470 to 1360. [2018-06-22 10:32:07,413 INFO ]: Start removeUnreachable. Operand 1360 states. [2018-06-22 10:32:07,500 INFO ]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 18874 transitions. [2018-06-22 10:32:07,500 INFO ]: Start accepts. Automaton has 1360 states and 18874 transitions. Word has length 29 [2018-06-22 10:32:07,500 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:32:07,500 INFO ]: Abstraction has 1360 states and 18874 transitions. [2018-06-22 10:32:07,500 INFO ]: Interpolant automaton has 9 states. [2018-06-22 10:32:07,500 INFO ]: Start isEmpty. Operand 1360 states and 18874 transitions. [2018-06-22 10:32:07,511 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:32:07,511 INFO ]: Found error trace [2018-06-22 10:32:07,514 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:32:07,514 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:32:07,514 INFO ]: Analyzing trace with hash 1514172468, now seen corresponding path program 1 times [2018-06-22 10:32:07,514 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:32:07,514 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:32:07,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:07,515 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:32:07,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:07,553 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:08,432 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:32:08,432 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:32:08,432 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:32:08,438 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:32:08,537 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:08,544 INFO ]: Computing forward predicates... [2018-06-22 10:32:08,570 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:32:08,600 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:32:08,600 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 10:32:08,600 INFO ]: Interpolant automaton has 9 states [2018-06-22 10:32:08,600 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 10:32:08,600 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:32:08,600 INFO ]: Start difference. First operand 1360 states and 18874 transitions. Second operand 9 states. [2018-06-22 10:32:10,715 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:32:10,715 INFO ]: Finished difference Result 2232 states and 48380 transitions. [2018-06-22 10:32:10,715 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 10:32:10,715 INFO ]: Start accepts. Automaton has 9 states. Word has length 29 [2018-06-22 10:32:10,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:32:10,950 INFO ]: With dead ends: 2232 [2018-06-22 10:32:10,950 INFO ]: Without dead ends: 2231 [2018-06-22 10:32:10,951 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:32:10,955 INFO ]: Start minimizeSevpa. Operand 2231 states. [2018-06-22 10:32:15,966 INFO ]: Finished minimizeSevpa. Reduced states from 2231 to 2099. [2018-06-22 10:32:15,966 INFO ]: Start removeUnreachable. Operand 2099 states. [2018-06-22 10:32:16,190 INFO ]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 44890 transitions. [2018-06-22 10:32:16,190 INFO ]: Start accepts. Automaton has 2099 states and 44890 transitions. Word has length 29 [2018-06-22 10:32:16,190 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:32:16,190 INFO ]: Abstraction has 2099 states and 44890 transitions. [2018-06-22 10:32:16,190 INFO ]: Interpolant automaton has 9 states. [2018-06-22 10:32:16,190 INFO ]: Start isEmpty. Operand 2099 states and 44890 transitions. [2018-06-22 10:32:16,205 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:32:16,206 INFO ]: Found error trace [2018-06-22 10:32:16,206 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:32:16,206 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:32:16,207 INFO ]: Analyzing trace with hash -713658634, now seen corresponding path program 1 times [2018-06-22 10:32:16,207 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:32:16,207 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:32:16,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:16,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:32:16,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:16,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:16,795 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:16,795 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:32:16,796 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:32:16,796 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:32:16,796 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:32:16,796 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:32:16,796 INFO ]: Start difference. First operand 2099 states and 44890 transitions. Second operand 7 states. [2018-06-22 10:32:18,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:32:18,010 INFO ]: Finished difference Result 2180 states and 46797 transitions. [2018-06-22 10:32:18,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:32:18,010 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 10:32:18,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:32:18,260 INFO ]: With dead ends: 2180 [2018-06-22 10:32:18,260 INFO ]: Without dead ends: 2180 [2018-06-22 10:32:18,260 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:32:18,261 INFO ]: Start minimizeSevpa. Operand 2180 states. [2018-06-22 10:32:23,641 INFO ]: Finished minimizeSevpa. Reduced states from 2180 to 1713. [2018-06-22 10:32:23,641 INFO ]: Start removeUnreachable. Operand 1713 states. [2018-06-22 10:32:23,745 INFO ]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 28063 transitions. [2018-06-22 10:32:23,754 INFO ]: Start accepts. Automaton has 1713 states and 28063 transitions. Word has length 21 [2018-06-22 10:32:23,754 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:32:23,754 INFO ]: Abstraction has 1713 states and 28063 transitions. [2018-06-22 10:32:23,754 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:32:23,754 INFO ]: Start isEmpty. Operand 1713 states and 28063 transitions. [2018-06-22 10:32:23,776 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:32:23,776 INFO ]: Found error trace [2018-06-22 10:32:23,776 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:32:23,777 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:32:23,777 INFO ]: Analyzing trace with hash 1468988238, now seen corresponding path program 2 times [2018-06-22 10:32:23,777 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:32:23,777 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:32:23,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:23,778 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:32:23,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:23,819 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:24,022 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:32:24,023 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:32:24,023 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:32:24,028 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:32:24,121 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:32:24,121 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:24,125 INFO ]: Computing forward predicates... [2018-06-22 10:32:24,142 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:32:24,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:32:24,163 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 10:32:24,163 INFO ]: Interpolant automaton has 9 states [2018-06-22 10:32:24,163 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 10:32:24,163 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:32:24,163 INFO ]: Start difference. First operand 1713 states and 28063 transitions. Second operand 9 states. [2018-06-22 10:32:26,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:32:26,508 INFO ]: Finished difference Result 2184 states and 39558 transitions. [2018-06-22 10:32:26,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:32:26,508 INFO ]: Start accepts. Automaton has 9 states. Word has length 29 [2018-06-22 10:32:26,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:32:26,694 INFO ]: With dead ends: 2184 [2018-06-22 10:32:26,814 INFO ]: Without dead ends: 2184 [2018-06-22 10:32:26,814 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:32:26,815 INFO ]: Start minimizeSevpa. Operand 2184 states. [2018-06-22 10:32:30,520 INFO ]: Finished minimizeSevpa. Reduced states from 2184 to 2104. [2018-06-22 10:32:30,520 INFO ]: Start removeUnreachable. Operand 2104 states. [2018-06-22 10:32:30,640 INFO ]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 37991 transitions. [2018-06-22 10:32:30,640 INFO ]: Start accepts. Automaton has 2104 states and 37991 transitions. Word has length 29 [2018-06-22 10:32:30,640 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:32:30,640 INFO ]: Abstraction has 2104 states and 37991 transitions. [2018-06-22 10:32:30,640 INFO ]: Interpolant automaton has 9 states. [2018-06-22 10:32:30,640 INFO ]: Start isEmpty. Operand 2104 states and 37991 transitions. [2018-06-22 10:32:30,659 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:32:30,659 INFO ]: Found error trace [2018-06-22 10:32:30,659 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:30,659 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:32:30,660 INFO ]: Analyzing trace with hash -704977884, now seen corresponding path program 1 times [2018-06-22 10:32:30,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:32:30,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:32:30,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:30,661 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:32:30,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:32:30,696 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:32:30,949 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:30,949 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:32:30,949 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:32:30,949 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:32:30,949 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:32:30,949 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:32:30,949 INFO ]: Start difference. First operand 2104 states and 37991 transitions. Second operand 6 states. [2018-06-22 10:32:31,269 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:32:31,269 INFO ]: Finished difference Result 2109 states and 38043 transitions. [2018-06-22 10:32:31,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:32:31,270 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 10:32:31,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:32:31,462 INFO ]: With dead ends: 2109 [2018-06-22 10:32:31,462 INFO ]: Without dead ends: 2108 [2018-06-22 10:32:31,463 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:31,464 INFO ]: Start minimizeSevpa. Operand 2108 states. Received shutdown request... [2018-06-22 10:32:32,176 WARN ]: Verification canceled [2018-06-22 10:32:32,179 WARN ]: Timeout [2018-06-22 10:32:32,179 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:32:32 BoogieIcfgContainer [2018-06-22 10:32:32,179 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:32:32,180 INFO ]: Toolchain (without parser) took 58066.61 ms. Allocated memory was 309.3 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 192.0 MB in the beginning and 679.0 MB in the end (delta: -486.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-22 10:32:32,181 INFO ]: SmtParser took 0.60 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:32:32,182 INFO ]: ChcToBoogie took 147.66 ms. Allocated memory was 309.3 MB in the beginning and 322.4 MB in the end (delta: 13.1 MB). Free memory was 192.0 MB in the beginning and 290.8 MB in the end (delta: -98.8 MB). Peak memory consumption was 5.5 MB. Max. memory is 3.6 GB. [2018-06-22 10:32:32,185 INFO ]: Boogie Preprocessor took 136.79 ms. Allocated memory is still 322.4 MB. Free memory was 290.8 MB in the beginning and 287.8 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:32:32,186 INFO ]: RCFGBuilder took 1736.97 ms. Allocated memory was 322.4 MB in the beginning and 359.1 MB in the end (delta: 36.7 MB). Free memory was 287.8 MB in the beginning and 273.4 MB in the end (delta: 14.4 MB). Peak memory consumption was 116.4 MB. Max. memory is 3.6 GB. [2018-06-22 10:32:32,186 INFO ]: TraceAbstraction took 56022.99 ms. Allocated memory was 359.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 273.4 MB in the beginning and 679.0 MB in the end (delta: -405.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 3.6 GB. [2018-06-22 10:32:32,188 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.60 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 147.66 ms. Allocated memory was 309.3 MB in the beginning and 322.4 MB in the end (delta: 13.1 MB). Free memory was 192.0 MB in the beginning and 290.8 MB in the end (delta: -98.8 MB). Peak memory consumption was 5.5 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 136.79 ms. Allocated memory is still 322.4 MB. Free memory was 290.8 MB in the beginning and 287.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1736.97 ms. Allocated memory was 322.4 MB in the beginning and 359.1 MB in the end (delta: 36.7 MB). Free memory was 287.8 MB in the beginning and 273.4 MB in the end (delta: 14.4 MB). Peak memory consumption was 116.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56022.99 ms. Allocated memory was 359.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 273.4 MB in the beginning and 679.0 MB in the end (delta: -405.5 MB). Peak memory consumption was 1.4 GB. 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 executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 162 locations, 1 error locations. TIMEOUT Result, 55.9s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 27.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4965 SDtfs, 191 SDslu, 22177 SDs, 0 SdLazy, 16718 SolverSat, 714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2104occurred in iteration=12, 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: 21.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 932 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 18072 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2967 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 38/78 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.12.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-32-32-196.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.12.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-32-32-196.csv Completed graceful shutdown